{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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":"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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"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":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"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":"SchematicCanvas.SchematicCanvas (cyclomatic 213): SchematicCanvas.SchematicCanvas has cyclomatic complexity 213 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 181 belong to 41 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f2f5901a3512a167f4bd3df5ad8b2f40e126d3ed312fe687c184ea986fed1f"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewportContent.ViewportContent (cyclomatic 199): ViewportContent.ViewportContent has cyclomatic complexity 199 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 160 belong to 45 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3def55dfcdfa98fde06790271e77c365183ea65f61707dff87966ddb92dc68a5"}},{"ruleId":"D1","level":"warning","message":{"text":"document-store.useDocumentStore (cyclomatic 181): document-store.useDocumentStore has cyclomatic complexity 181 (threshold 15). Most of this is not in the body itself: 1 of the 181 points is its own statement and the rest belongs to 53 function literals inside it that branch (lines 1656, 1263, 1142, \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae13befad8de7d152508b57c19e011be43b9baf50fc57d3cad9f8164e2db4845"}},{"ruleId":"D1","level":"warning","message":{"text":"useKeyboardShortcuts.useKeyboardShortcuts (cyclomatic 163): useKeyboardShortcuts.useKeyboardShortcuts has cyclomatic complexity 163 (threshold 15). Most of this is not in the body itself: 1 of the 163 points is its own statement and the rest belongs to one function literal inside it that branches (line 17). 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":"packages/app/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b96f84a7ed749a32d1ead0daca39a33d4bc65a7d66484921c47b13fd453ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.routeNets (cyclomatic 161): ecad.routeNets has cyclomatic complexity 161 (threshold 15). Of this number, 141 points are the body\u0027s own statements and 20 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"576c8cdcef9a372f690415c48f7b77fb86d1d5c031c63ead4e2437868a91358a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::brep_boolean (cyclomatic 144): vcad_kernel_booleans::pipeline::brep_boolean has cyclomatic complexity 144 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c2d360a4eb8da09807299a0c6b9388291fe4f909726e0849e855b8154c1603"}},{"ruleId":"D1","level":"warning","message":{"text":"DrawingView.DrawingView (cyclomatic 122): DrawingView.DrawingView has cyclomatic complexity 122 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 86 belong to 38 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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30934b76d8a0cd504c282e2f759afd39cea65a609eda487302dd7d94432a594"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.addMotorWinding (cyclomatic 120): ecad.addMotorWinding has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent 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 (ecad.addMotorWinding::feedClear) 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63e9506bbd0c88401c74bb4e7a022e29582f41af4b6a3af6b0a799cf7b69d49"}},{"ruleId":"D1","level":"warning","message":{"text":"server.createServer (cyclomatic 115): server.createServer has cyclomatic complexity 115 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 95 belong to 15 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":"packages/mcp/src/server.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26ab900fc0bef3a08d32449614671a1167ea74ac28e98c8d0c5748bf68cc3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::complete::route_window_complete_islands (cyclomatic 112): vcad_ecad_pcb::router::complete::route_window_complete_islands has cyclomatic complexity 112 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"678bf465ada34bb90bfc9ff1b97fabe2217975142e549b4fe5c75693ca09d0c8"}},{"ruleId":"D1","level":"warning","message":{"text":"useToolDefinitions.useToolDefinitions.byTab (cyclomatic 106): useToolDefinitions.useToolDefinitions.byTab has cyclomatic complexity 106 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 31 belong to 15 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f067ab8de706ea07069d07a8609d31cbd26197574ce784f1ae86a2e86237852"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::cavity_extract::extract_cavity (cyclomatic 105): vcad_eval::cavity_extract::extract_cavity has cyclomatic complexity 105 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aa8bf85e577cdb3796c6adb67e38de3bd2e6ea6d50bfbc97976f78a4ee3bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.fixDrc (cyclomatic 105): ecad.fixDrc has cyclomatic complexity 105 (threshold 15). Of this number, 82 points are the body\u0027s own statements and 23 belong to 14 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":15028}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48244b99c05a0186cfe93b1193bc17eb71c457bda32888f19c02f4f4dff5b6"}},{"ruleId":"D1","level":"warning","message":{"text":"render.renderView (cyclomatic 105): render.renderView has cyclomatic complexity 105 (threshold 15). Of this number, 103 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"095a3d6508a96c4349664ca3c15198aaff5433737d24320f806e9a9771d86973"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::classify::face_sample_point (cyclomatic 101): vcad_kernel_booleans::classify::face_sample_point has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fca15e41ac517d8857e6bee0b8fd268672ec55c8d0be89008e0ca9b72d4888f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::evaluate::evaluate_op_timed (cyclomatic 100): vcad_eval::evaluate::evaluate_op_timed has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e08b308e83e3bb8398eed1b1b1632b12b1dc274ba0899a76279ce4a1b5ca91"}},{"ruleId":"D1","level":"warning","message":{"text":"SceneMesh.SceneMesh (cyclomatic 100): SceneMesh.SceneMesh has cyclomatic complexity 100 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 60 belong to 20 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6514511fa685f5282bcb451bb8064bb9caab250dedd91d108c947e47e4633bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::input::handle_key (cyclomatic 98): vcad::input::handle_key has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/input.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a9d22112da7a45ef64080c95e0caaab9351b16d6ab6ba8e32a0987057ca141"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel::turning_profile::turning_profile (cyclomatic 95): vcad_kernel::turning_profile::turning_profile has cyclomatic complexity 95 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/turning_profile.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d657eb47055183d4d50b2662b05f7515d6e9b0b62bd768b92b85c9b7ffa62141"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::realize::realize_wires (cyclomatic 93): vcad_ecad_pcb::router::flow::realize::realize_wires has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7725c08b10d666c80b58459ffc15c8d89c606067d94112b6915f8389a4150a35"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::drafting::compose (cyclomatic 93): vcad_ffi::drafting::compose has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f53a7033a75e25a6f994ecf298a397a977fdc9b8163c87bfb1f7ea75db01a6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::evaluate::evaluate_inner (cyclomatic 90): vcad_eval::evaluate::evaluate_inner has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"20065059952f8f6bb4344da86e23e9a466e295fe17d42d40ab7af42a6e154b2c"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.placeComponents (cyclomatic 90): ecad.placeComponents has cyclomatic complexity 90 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 34 belong to 10 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3acc5a03dc2bb19f511894dc82c888773a2199698b0dd2706457bdf5f93df1"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::route_all_once (cyclomatic 89): vcad_ecad_pcb::router::auto::route_all_once has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a85526e8f73d345d942fb664f8a3a0567d040b9dd067eedf6760b95ae1f00fd"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::maze::route_net_maze3d (cyclomatic 89): vcad_ecad_pcb::router::maze::route_net_maze3d has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c8f22565da93a6f611e1efb9ef2c7c3cb3791f71648e9e34be55c7d81a417e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::resolve::apply_to_op (cyclomatic 89): vcad_ir::resolve::apply_to_op has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/resolve.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d48fe11dd4e3325ba1b6817da04687ce1ce12af348932da391206e74500df0"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App (cyclomatic 88): App.App has cyclomatic complexity 88 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 64 belong to 13 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":"packages/app/src/App.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc029a7a987324e450eee78643b013af595c854d2f230e2c5aa1df338250450"}},{"ruleId":"D1","level":"warning","message":{"text":"startHeroEngine (cyclomatic 87): startHeroEngine has cyclomatic complexity 87 (threshold 15). Most of this is not in the body itself: 2 of the 87 points are its own statements and the rest belongs to 42 function items inside it that branch (extractEdges, a function literal at line 383, meshBounds, \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":"www/src/hero-engine.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64ca1518073c768e77fb34d0ad46a4291c9abedd86cf68bb40211a7c36bf08"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::footprint::match_family (cyclomatic 83): vcad_ecad_symbols::footprint::match_family has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0448e169613fcd18dcc674c575c4f839b1a4d61eb28f7fad42925dbefe19ea"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasedOverlayView.viewport (cyclomatic 83): ReleasedOverlayView.viewport has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ecb71f31fbc530543d3591b2afbd6ad7960551d05d5cbf9f23dd01d20a8848"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::pcb::render_pcb_svg_opts (cyclomatic 82): vcad_render::pcb::render_pcb_svg_opts has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/pcb.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"a494044261b3d1853e6fcc21e870578285465a5b322e533e46f6c6ef72e06eec"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::trim::point_in_face_inner (cyclomatic 81): vcad_kernel_booleans::trim::point_in_face_inner has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"298e0624d64f9a506248621ee6dbcca11b3a9f62934c08db08eb10f4644b30a5"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureInput::to_crdt_params (cyclomatic 80): FeatureInput::to_crdt_params has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/feature.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"564500b435ae8cebac2c90160dc47cf8c2dfbead7d742a29fd57d654411d11e5"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_thermal::solve::build (cyclomatic 76): vcad_kernel_thermal::solve::build 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a770a89d943af682e80000ec30488d0443161cbdefe4f3f30fcc8d1a8cf0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"annotate.generateSyntheticDescription (cyclomatic 76): annotate.generateSyntheticDescription 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":"packages/training/src/annotate.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"261f00c45c60bbc6de5d85ff1c052a6421d476676946ed4d12339140ead95c05"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate.evaluateOp (cyclomatic 75): evaluate.evaluateOp has cyclomatic complexity 75 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/evaluate.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4e3269f8486dd717992683c1b964e545a4f772ee9a7ae5b48c5d76efc75608"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_trimmed_region (cyclomatic 74): vcad_kernel_tessellate::tessellate_trimmed_region has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb88655918b0ad5995e9bba8a9617efbbf0773cb6cb5713fd70fcd54406ede3"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::buckling::buckling_on_mesh (cyclomatic 71): vcad_kernel_fea::buckling::buckling_on_mesh has cyclomatic complexity 71 (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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"90733a9bec629f3faafbe87ab7504e2e4e0ed58e5033c38cb1fe4a5ccb3f521f"}},{"ruleId":"D1","level":"warning","message":{"text":"PcbScene.PcbScene (cyclomatic 71): PcbScene.PcbScene has cyclomatic complexity 71 (threshold 15). Most of this is not in the body itself: 12 of the 71 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 84, 272, 250, \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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6026b26e83aaf37a800ac59f35640066bed70314f7cbb20090e429b4d8cf8f05"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::antenna_extract::extract_antenna_spec (cyclomatic 70): vcad_eval::antenna_extract::extract_antenna_spec has cyclomatic complexity 70 (threshold 15). Of this number, 69 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":"crates/vcad-eval/src/antenna_extract.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de4215143ca750359f89a6f693e556f261eac272228895c938f7d79ccebbc50"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_cam::turning::verify::parse (cyclomatic 70): vcad_kernel_cam::turning::verify::parse has cyclomatic complexity 70 (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":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a98b793861fd731386164cf23bdde7b5d47b6f926489f25d2f3578e87d6e5b6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::render_svg_impl (cyclomatic 70): vcad_render::render_svg_impl has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/lib.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"962a88da8d3b92ed0c0823a715f7cbb8687172a35297f979c2bb2c2bfcd1f68b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::to_loon::op_to_loon (cyclomatic 69): vcad_ir::to_loon::op_to_loon has cyclomatic complexity 69 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/to_loon.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee0aed7dd28c3b685b6cfa9c0395f59bc2088be70d4823531a5c1751b7a0613"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::migrate::migrate_node (cyclomatic 67): vcad_app::migrate::migrate_node has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f14ca571c3ca6f4dc93178ad596585c082cbdb6de22ca6a41828c4f2cee520a"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsCanvas.body (cyclomatic 66): ElectronicsCanvas.body has cyclomatic complexity 66 (threshold 15). Of this number, 65 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"548db529359ba8d2c66d5584db3c730143103c323416b9c3df0f2c75fd095f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::try_route_pair_reason (cyclomatic 65): vcad_ecad_pcb::router::pair::try_route_pair_reason has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc96548069d9403d74351065b2d35dfe61ccec37b95d73ed60b8f99ad7da296"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_flow::solve::solve_steady (cyclomatic 64): vcad_kernel_flow::solve::solve_steady 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":"crates/vcad-kernel-flow/src/solve.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e4b674b89371079f2ee2929c58018a23bb2f54250ce80846fa26a8797345df"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol-2026.handleModernRequest (cyclomatic 64): protocol-2026.handleModernRequest has cyclomatic complexity 64 (threshold 15). Of this number, 56 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"022895a0a432a56dd7715e8b54e92f231a5607053c4594fd1488aeb2ca23e8ce"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::descent::descend_board_inner (cyclomatic 63): vcad_ecad_pcb::router::descent::descend_board_inner 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37a3fa9b7a7e8a5b7789046148078d0ce4ff798bdd7c5542fd7c297476dbf50"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasedARView.rebuild (cyclomatic 63): ReleasedARView.rebuild has cyclomatic complexity 63 (threshold 15). Of this number, 62 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5f1c0f16177957b35804adf6830c56e20a4f82532064d52612c07062969689"}},{"ruleId":"D1","level":"warning","message":{"text":"ConvertCtx::convert_solid (cyclomatic 62): ConvertCtx::convert_solid 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d3bd16ec3f64d43110140042d1b68318ac41147a563c38c5ac88751f10bf46"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.layoutLint (cyclomatic 62): ecad.layoutLint has cyclomatic complexity 62 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f384849f7ffe91b2ddee40e63dd4ba617d2d44902db02dd0c6d1d06d57ca65ad"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::vcode::parse_geometry_opcode (cyclomatic 61): vcad_ir::vcode::parse_geometry_opcode 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"c530a7ef5b019b6372444e262ef7ae01e08706b32d30b033ca8b633fea7982af"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_cylindrical_face (cyclomatic 61): vcad_kernel_tessellate::tessellate_cylindrical_face 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5e7095a2cfd88a59f202929f6e4f80fbe5cd78b2ba6a39e3b39cb10aa3e71c"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureTree.TreeNode (cyclomatic 61): FeatureTree.TreeNode has cyclomatic complexity 61 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 22 belong to 7 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"376b95158b9bdebf43a1c91d3c205ccfd614206f15a5b4ee3b7ac48981df14ca"}},{"ruleId":"D1","level":"warning","message":{"text":"animate.exportVideo (cyclomatic 61): animate.exportVideo has cyclomatic complexity 61 (threshold 15). Of this number, 60 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e117cf81094d4b5bc3fb59deebbc657dd7f42d502012a8af5c3e6e0bda758dc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_cam::turning::rotary::verify_rotary_gcode (cyclomatic 60): vcad_kernel_cam::turning::rotary::verify_rotary_gcode 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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"06677b233ccd20f1ae305deb40eeee6dc02f62995eed115c765448927c11b212"}},{"ruleId":"D1","level":"warning","message":{"text":"Repl::execute (cyclomatic 59): Repl::execute has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/repl.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c2e08fbcabc1ea8670f523c0fe2d69fa3b046369870d8c83de000ba9a07848"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::route_file (cyclomatic 59): vcad::route_file has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"681ac4a945bf2a518770d8f15eb2b08142d93f5329dc0b95593e3d334b6a8e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.addCoil (cyclomatic 59): ecad.addCoil has cyclomatic complexity 59 (threshold 15). Of this number, 58 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7744}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3e8f10f2d99b97a066b1a530581d75af603a783b3e36b98a01538c7d113f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sheet::poly2d::boolean (cyclomatic 58): vcad_kernel_sheet::poly2d::boolean has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c3c0323ef12f378876a0615f47df290c43f3f38e02675425455881a4973a3f"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasedOverlayView.tapSelect (cyclomatic 58): ReleasedOverlayView.tapSelect has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"438eee8940be29bd7e0e542abe550224bab8ddf82055fed39d19eb479a913a1a"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandPalette.CommandPalette (cyclomatic 58): CommandPalette.CommandPalette has cyclomatic complexity 58 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 31 belong to 14 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e765de9473ab8ef2c22b6b2447ff53bc940e9c180bca5e7c63a8537f4e5c7ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"useCameraControls.useCameraControls (cyclomatic 58): useCameraControls.useCameraControls has cyclomatic complexity 58 (threshold 15). Most of this is not in the body itself: 1 of the 58 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 14, 64, 244, \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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"133ad9fcefd3b8ae8b31d23067f55cba38cdbf1c85bc20f0ef4df24bd5b3217e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_wasm.__wbg_get_imports (cyclomatic 58): vcad_kernel_wasm.__wbg_get_imports has cyclomatic complexity 58 (threshold 15). Most of this is not in the body itself: 1 of the 58 points is its own statement and the rest belongs to 48 function literals inside it that branch (lines 9377, 9371, 9430, \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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":9345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f259d479ed8001db564650d16aa78592bafab7b03fec08debd35bd176e8cf82d"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.buildSheetBody (cyclomatic 58): ecad.buildSheetBody has cyclomatic complexity 58 (threshold 15). Most of this is not in the body itself: 15 of the 58 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 2177, a function literal at line 2146, a function literal at line 2227, \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee49a34b0947011fcb147b52b13f93558fc1ee2e7fcbbf8b8e67b9d3c51ddf9"}},{"ruleId":"D1","level":"warning","message":{"text":"AssemblyReader::read_structure (cyclomatic 57): AssemblyReader::read_structure has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a91acb3ec7c2c90a54b83f41478e22b3efc2c1a52b716353881b0be4d9a061"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::fill_closed_boundary_loops (cyclomatic 57): vcad_kernel_tessellate::fill_closed_boundary_loops has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b972fc63daf4e1dfdcd0ce82d8d9c4e7529bb82d4cc330063d14f21a255c47d9"}},{"ruleId":"D1","level":"warning","message":{"text":"order.quoteManufacturing (cyclomatic 57): order.quoteManufacturing has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/order.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5ce0d12bf09ad6ed83497dfd2d83df46bf2b06dbb5abd16e3b193ba8922eb3"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_face_by_curve (cyclomatic 56): vcad_kernel_booleans::split::split_face_by_curve has cyclomatic complexity 56 (threshold 15). Of this number, 54 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d076375a3a2f05b5dddcfe88057f5518b2e1850ece067c89bd52104cce3f8"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCOverlay.swift.syncCNCOverlay (cyclomatic 56): CNCOverlay.swift.syncCNCOverlay 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":"apple/VcadApp/Sources/VcadApp/CNCOverlay.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"41223e0ac6488654a2e078b771b4ef693674d4a20796354e40314f7cc97ad583"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::route_flow (cyclomatic 55): vcad_ecad_pcb::router::flow::route::route_flow 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcb31ba75c0cc12838a4c2f8d8833d2640d211db3cad249df287c6d455e370e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_photon_dose::transport::run (cyclomatic 55): vcad_kernel_photon_dose::transport::run 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":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e89b295107fecfdc20bf1acdefb6080f96a8727ad9e4808ac685cc4393c143f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::materializer::materialize_doc_extras (cyclomatic 54): vcad_app::materializer::materialize_doc_extras 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eca4e843e4522053532d56f938b658a40d6d2cbab21f61231256c6ca8db9514"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.calcMotor (cyclomatic 54): ecad.calcMotor has cyclomatic complexity 54 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12513}}}],"partialFingerprints":{"codehealthFindingId/v1":"26481ff2d05a46c834cf062f33223e698e790b4107cd96d6172dc4a2a8183772"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentTools.call (cyclomatic 53): AgentTools.call has cyclomatic complexity 53 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 4 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":"apple/VcadApp/Sources/VcadApp/AgentBridge.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44bc0445ac11a0c70a54fa8c1b0a979e99f0186a0f75d2d987886e8baf158da"}},{"ruleId":"D1","level":"warning","message":{"text":"scrub-input.ScrubInput (cyclomatic 53): scrub-input.ScrubInput has cyclomatic complexity 53 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 25 belong to 10 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":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba13e46d94ddfa78bb75c45ec850ea763220eac58835365b7651b5ea7c525743"}},{"ruleId":"D1","level":"warning","message":{"text":"index.parseGeometryOpcode (cyclomatic 53): index.parseGeometryOpcode 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":"packages/ir/src/index.ts"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3624ad6345ca1f79ad97e473bbdf93f9c74645001d95ff92136d4dc0213f14d5"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_flow::adjoint::pressure_drop_gradient (cyclomatic 52): vcad_kernel_flow::adjoint::pressure_drop_gradient 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41faee1df719e90a109a7bdc251fe8d1e79864425137e5bcf9ea59003bb951f"}},{"ruleId":"D1","level":"warning","message":{"text":"RayTracedViewport.RayTracedViewportOverlay (cyclomatic 52): RayTracedViewport.RayTracedViewportOverlay has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 2 of the 52 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 731, 497, 608, \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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a124bf9012bac3f8e018df19ad11db2ee142e255a7eb973853d050389045fb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_export::gerber::write_gerber_layer (cyclomatic 51): vcad_ecad_export::gerber::write_gerber_layer 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"009da400ae69499337e71e3eb6d5f275b6fb9817c3294f16ae5c17ca452c53b3"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_cam::turning::verify::verify_gcode (cyclomatic 51): vcad_kernel_cam::turning::verify::verify_gcode has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49bb702a02431a9d64f00767d6ff24eaf77e3bc095992adadfc29aa852042d0"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentGraph.paramSummary (cyclomatic 51): DocumentGraph.paramSummary has cyclomatic complexity 51 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 5 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"125b0d2ce20471821761ad616536091fe08dd9abbd03a8262ff9207e8ee7a502"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentGraph.paramSummary (cyclomatic 51): DocumentGraph.paramSummary has cyclomatic complexity 51 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 5 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":"apple/VcadVision/Sources/VcadVision/Shared/Document.swift"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10ebf0c1ff91cc5aceff7fb551460fffb1943ec36ac4c1bd99295ca26d75517"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::apply_splits_to_solid (cyclomatic 50): vcad_kernel_booleans::pipeline::apply_splits_to_solid has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cc896341ffc6c1bfe37d74684802548efa8a7d0ed56d5e9825b10f0bfdeac3"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::clip_spherical_face_by_circle (cyclomatic 50): vcad_kernel_booleans::split::clip_spherical_face_by_circle has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0133dbc1c999fea1a463ed1d4cb969e3e14315b4ca90f13e28f5a902292975"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentGraph.parse (cyclomatic 50): DocumentGraph.parse has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"88510675c5332f4df1171fb24f08e8f78e5bda50d4b6db609abb50e7bd465bea"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentGraph.parse (cyclomatic 50): DocumentGraph.parse has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Document.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7e11e5f9464b14ad23303bee64b1f61c0c8e1a9bbc11f956dc7e45375902cc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::materializer::materialize_feature (cyclomatic 49): vcad_app::materializer::materialize_feature 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a8347c4e9f3f6349208a30db2892009d1456bb7f8d03c9b5a30847b05e893c"}},{"ruleId":"D1","level":"warning","message":{"text":"Embedding::route (cyclomatic 49): Embedding::route 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":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed9a1155630d915cc42a860451539c772d895705bc3ae4b74b514c72a9cb0ad"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::api::boolean_op_reported_untimed (cyclomatic 49): vcad_kernel_booleans::api::boolean_op_reported_untimed 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a051757e7a5dfbf878e3b5f2323edd51fa0affafd87746ac65b7c0f3e7216c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"StepReader::read_solid (cyclomatic 49): StepReader::read_solid 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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e46416a86564298f3c55b50a96aae2651529a56886e1bd679a2a18d4704e37"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::torus_two_chain_rotated (cyclomatic 49): vcad_kernel_tessellate::torus_two_chain_rotated 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d65cccd8bf4ee2661f157db5521f4e95f231b4a2d35a927bcb25e8f9c73808"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_wasm::evaluate_node (cyclomatic 49): vcad_kernel_wasm::evaluate_node 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":4823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a667e08890c51cb05bea42b8ca94f77d978709ad6ca1ddea831e972a3eca285c"}},{"ruleId":"D1","level":"warning","message":{"text":"usePcbCamera.usePcbCamera (cyclomatic 49): usePcbCamera.usePcbCamera has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to 12 function literals inside it that branch (lines 46, 277, 212, \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":"packages/app/src/components/electronics/pcb3d/usePcbCamera.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d6e49e747bc194df007631c3e28de92423b8e71d2e7822fbd3bdaa7cea490a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::process_command (cyclomatic 48): App::process_command 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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c27a268f83a8d193c2960002bc45464800f59f68d8a95a988dd0dcfa4ff131c"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::altium::build_pcb (cyclomatic 48): vcad_ecad_symbols::altium::build_pcb 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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceaddbafc87a279f0959843fd3f483126c2234edcad435598ca72ed29f78d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"clearance.checkClearance (cyclomatic 48): clearance.checkClearance has cyclomatic complexity 48 (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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2ecc16b0da54df09f5334f703eb00a458d75eaebd912dbeb54d9cc56ad12cb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::escape::plan_field_escapes_toward (cyclomatic 47): vcad_ecad_pcb::router::escape::plan_field_escapes_toward 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":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"930d83a7ee0b3e5fff434a0bfe7b7b8bd48ce8d7bf2ffeecd235382262cc9474"}},{"ruleId":"D1","level":"warning","message":{"text":"PlanarMagnetostatics::build_system (cyclomatic 47): PlanarMagnetostatics::build_system 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":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"54309257cda95e1216a36031aa0c1e1af4b4cf87e47afa392c6a0223ce87a60a"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.verifyReceipt (cyclomatic 47): ecad.verifyReceipt has cyclomatic complexity 47 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14693}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb808d60d4cdc590d2b85271107ecb6e381ceaa8230f6a73c17a6009266f5515"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_by_circle (cyclomatic 46): vcad_kernel_booleans::split::split_planar_face_by_circle 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68adc6b7ba9b1b32cafdd6c9b22c54ec4fdb2229696701132000230f4ebfa91"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::revolved::extract_profile (cyclomatic 46): vcad_kernel_fillet::revolved::extract_profile 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecc4ef601d48b2c688682f72c3f2a43d0d722108293a112e985755459c3a37d"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_ruled_two_chain (cyclomatic 46): vcad_kernel_tessellate::tessellate_ruled_two_chain has cyclomatic complexity 46 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"df59df5fd26ef706e69cae8610543ce8ee45ec254de195c75c81e5949cceffc6"}},{"ruleId":"D1","level":"warning","message":{"text":"RayTracedViewport.RayTracedViewportSync (cyclomatic 46): RayTracedViewport.RayTracedViewportSync has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 91, 317, 143, \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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8b687db003bf450a42ade1cbb87912e602a24f8b79abbfc251e18763ecdc8d"}},{"ruleId":"D1","level":"warning","message":{"text":"useCanvasRecorder.useCanvasRecorder (cyclomatic 46): useCanvasRecorder.useCanvasRecorder has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 103, 261, 305, \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":"packages/app/src/hooks/useCanvasRecorder.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3b1ad6f6ca180d305bba34782ca2a48b4afe5e8f5656aa658c1a57f63dc228"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_acoustics::helmholtz::solve_driven (cyclomatic 45): vcad_kernel_acoustics::helmholtz::solve_driven 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":"crates/vcad-kernel-acoustics/src/helmholtz.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f316d902a38cec8d9b659850a2094eecd036c5026ccf875102f8ca25953e22"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_export::build_glb (cyclomatic 45): vcad_kernel_export::build_glb 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":"crates/vcad-kernel-export/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"028be4a61d5e3777bb8d68c2d3a94afe41ba074008cef382a05bf35927814268"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCController.simulateCommand (cyclomatic 45): CNCController.simulateCommand 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a0b3eea6fa4c24ef3fab90e9851b325b511f5d8e76c79d374e1ea13a4a94b9"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeElectronicsView.inspector (cyclomatic 45): NativeElectronicsView.inspector 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55c211fc648fbd28836a3dd4d684870b1f9ff00c20538f92870c9d449aa4b23"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessMarket::build (cyclomatic 44): AccessMarket::build 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":"crates/vcad-ecad-pcb/src/router/flow/access.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ee47b755fdff4f81b043cf4f4ba4f32355f9c6a8c27e99290dccf21d8285ed"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::route_pass (cyclomatic 44): vcad_ecad_pcb::router::auto::route_pass 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57246428abed77083b191419707a1e3c3d6e796db1c02ac2a5e13fb148e3016"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::handle_modern (cyclomatic 44): Server::handle_modern 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3add9a7afe63d620c485d2080de46bec547da9e890299f89b60aadfe6f4011"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCImport.parse (cyclomatic 44): CNCImport.parse 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":"apple/VcadApp/Sources/VcadApp/CNCImport.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"088df968a8d17095db79e5106f75e8f7ba87fe287fec87f00c12282e48716932"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsCanvas.installMonitor (cyclomatic 44): ElectronicsCanvas.installMonitor 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"12471ade330c858a3a81acd097185072ff3bf4fb60622a93d37cfe8d6f020a75"}},{"ruleId":"D1","level":"warning","message":{"text":"GizmoView.swift.buildGizmo (cyclomatic 44): GizmoView.swift.buildGizmo has cyclomatic complexity 44 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 4 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":"apple/VcadApp/Sources/VcadApp/GizmoView.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e1d4dafbe00226927590d049a114c9474a5705b3138cf288682aa8fb50ea6f"}},{"ruleId":"D1","level":"warning","message":{"text":"XRGestures.XRGestures (cyclomatic 44): XRGestures.XRGestures has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 199, 255, 258, \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":"packages/app/src/components/xr/XRGestures.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea20ed7fdf60d82bfa0ccd0eb6f930b83c090b93118057553f2d0e0bd845fb8a"}},{"ruleId":"D1","level":"warning","message":{"text":"carry-electronics.carryElectronics (cyclomatic 44): carry-electronics.carryElectronics has cyclomatic complexity 44 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 10 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":"packages/mcp/src/tools/carry-electronics.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5bafe2898d17ad740a289f5c9f687f22dd811421b08e7e13d1e5ef30c5f914"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::realize_legs (cyclomatic 43): vcad_ecad_pcb::router::pair::realize_legs 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adf3661ebcfd02ce9f0e9ef04d73ed56ef7328e36cab50e4e68e8105bc4b84d"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::vcode::format_op (cyclomatic 43): vcad_ir::vcode::format_op 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae55b3c38471872d79274f9055f6f67a6589dba6ce9a5eb28616df46a97d2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::trim::trim_curve_to_face (cyclomatic 43): vcad_kernel_booleans::trim::trim_curve_to_face 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e14d10165cf263aae95fa61b23fd882c1461645d481497edd423852265a2523"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::detect_bend (cyclomatic 43): vcad_kernel_sheet::flatten::detect_bend 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"2077843ada6e46a7b6f1241b5a3ec88570e0edfd354f7884c15cad0530c04070"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::heal_t_junctions_pass (cyclomatic 43): vcad_kernel_tessellate::heal_t_junctions_pass 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61ed5b3b8edd3c2ae889337f12a31f25af786c1d50199a469d237c2759f7f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchSession.loopRegions (cyclomatic 43): SketchSession.loopRegions has cyclomatic complexity 43 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 10 belong to 4 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c2afc5d716c91e02c52d8435f560b7266c6f54edb8c8ff49bf6fb0ddbce728"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolPalette.ToolPalette (cyclomatic 43): ToolPalette.ToolPalette has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 5 of the 43 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 132, a function literal at line 102, a function literal at line 217, \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":"packages/app/src/components/ToolPalette.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfc9d139f4decc929c99a8788e58af80ef5e317ec18b341350c61273120cde1"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::doc_edits::lower (cyclomatic 42): vcad_app::doc_edits::lower 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":"crates/vcad-app/src/doc_edits.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2dc195ddcb9c1606eebb8b6d0d474ada73154a632d0e2b4c802882659a4601"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_step::reconstruct::plan_edge_merges (cyclomatic 42): vcad_kernel_step::reconstruct::plan_edge_merges has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e6ff5f25a68f76239276b760cd92a7beac2c362087ba85788d8de01a85a091"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_slicer_gcode::lint::lint (cyclomatic 42): vcad_slicer_gcode::lint::lint has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/lint.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c0d025f293d1607ee07c3156fb40f28b4b8a42fae83dad661f90a03a3590f1"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyPanel.PropertyPanel (cyclomatic 42): PropertyPanel.PropertyPanel has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 3 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"9320e7dc60f3b2c4cd7318b139206cffb6301f928a52b3fef9eb70a3a17b6cd9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::cam_job::job (cyclomatic 41): vcad_ffi::cam_job::job 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":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9989c28d8eeb1786b3b44d215a61f94c48067aad42e18522ac5c5830133772ad"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::vcode::format_scene_settings (cyclomatic 41): vcad_ir::vcode::format_scene_settings 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2390c7033bb8ae96cedd0ac666ffab93936fa8b40071277113e8429141db15d0"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_conical_face_by_ruling (cyclomatic 41): vcad_kernel_booleans::split::split_conical_face_by_ruling 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4795}}}],"partialFingerprints":{"codehealthFindingId/v1":"41410b5b81e49f959ac59496ed441b006ef4000872717db8d937e3773ac55240"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_flow::adjoint::forward (cyclomatic 41): vcad_kernel_flow::adjoint::forward 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3b1e00cc7559a20b3861457baa138099d347ec9e03c7996ce8be4f18cf0655"}},{"ruleId":"D1","level":"warning","message":{"text":"matrix-cli.main (cyclomatic 41): matrix-cli.main has cyclomatic complexity 41 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 13 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":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f461a4f81341651807da983a00834d7d8ae50564a9d3484e45578cbef79573"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.sizeImpedance (cyclomatic 41): ecad.sizeImpedance has cyclomatic complexity 41 (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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7129}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab29472df2270ccea879fcb4bfc71113472fcf680b503face8c8262f4775e73"}},{"ruleId":"D1","level":"warning","message":{"text":"record.recordSimulation (cyclomatic 41): record.recordSimulation 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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0f6f8c251a4d643f6764ee50b9b813afc2521dc40ee735691228e0b85e97c7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::blend_loft::loft_blend_edge_keyed (cyclomatic 40): vcad_kernel_fillet::blend_loft::loft_blend_edge_keyed 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":"crates/vcad-kernel-fillet/src/blend_loft.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e793abed64b0ed5be66a6e00ce1a75379f26ca806e8cb5ed04e037cc73deb093"}},{"ruleId":"D1","level":"warning","message":{"text":"distill_lambda.distill (cyclomatic 40): distill_lambda.distill 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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"de627938ab97845c81e1d76cc14f66d4a6c1f62061ff3cb46a9ad7152df5f491"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintPanel.PrintPanel (cyclomatic 40): PrintPanel.PrintPanel has cyclomatic complexity 40 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 22 belong to 7 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa2cbf4c4f215649eca5ced73fc9cbe2c0cc7bae8a2ebd51b4c3d44ce23143d"}},{"ruleId":"D1","level":"warning","message":{"text":"parameters.setParameters (cyclomatic 40): parameters.setParameters has cyclomatic complexity 40 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 7 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":"packages/mcp/src/tools/parameters.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcde11a455c78d6dbaafa300779882ae78e6fb7ad7be296a72d084c4dc6d08a4"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.deriveNets (cyclomatic 40): ecad.deriveNets has cyclomatic complexity 40 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0665d39a0b4531acc6dcd3a24457ad458e9375f2652489b2c24ea249e4aa9f"}},{"ruleId":"D1","level":"warning","message":{"text":"source-parser.parseRustSourceContentWithInference (cyclomatic 40): source-parser.parseRustSourceContentWithInference 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ffddca653a5fd4e69f22dacb81143a99875cfc3e6c55219ae8dd178a9be027"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_fabprep::run_fab_prep (cyclomatic 39): vcad_ecad_fabprep::run_fab_prep 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":"crates/vcad-ecad-fabprep/src/lib.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a9b3df0b4411e3e767cdf691447fdbbcaf546d69109d0b2a66b803cd3f42c6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::realize (cyclomatic 39): vcad_ecad_pcb::router::flow::route::realize 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6ad96dee4ddcffbc416d1520ce86d964d10c974c56daa5029d9eab5d23c7a6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::polish_pairs (cyclomatic 39): vcad_ecad_pcb::router::pair::polish_pairs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e67273ae0762750aaf36504d9b6c0a92e985bf048e699e98d8be324f9a59e4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_constraints::residual::compute_constraint_residuals (cyclomatic 39): vcad_kernel_constraints::residual::compute_constraint_residuals 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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f19de2886925c31b55d895623fbfc826027ec1baafee258709b1ea0e7f17571"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowModel::validate (cyclomatic 39): FlowModel::validate 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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"738020ca1093af5dc82b9afaf6d2d23ea2b52a875f56e9e9a43d7cd68fdd75d2"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_particle::bem::solve (cyclomatic 39): vcad_kernel_particle::bem::solve has cyclomatic complexity 39 (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":"crates/vcad-kernel-particle/src/bem.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"06de55e06759e1a7022de212e01fb4ec0e823188d14c8af8d414bc5a32e8c549"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentCore.answer (cyclomatic 39): AgentCore.answer has cyclomatic complexity 39 (threshold 15). Of this number, 38 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":"apple/VcadApp/Sources/VcadApp/AgentCore.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6971a3bf8fd59bae5cd2c6c0c581457e2bcc44efa0c6658b1196f2c4fb71cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"clearance.computeInterferenceAudit (cyclomatic 39): clearance.computeInterferenceAudit has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f55e04f81545fed1e85c747bfbbd08f59df0d5d2fe00b9b9552edc91478f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractiveRouter::shortest_path (cyclomatic 38): InteractiveRouter::shortest_path 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc75fe1ffbb377ba83bd7c1cde20370275e40865c7ae6b5aa4a86147b4763977"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::optimize::optimize_document (cyclomatic 38): vcad_eval::optimize::optimize_document 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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea2cf2797264e4d206a93e93a2ac4e4df345caf4a6b5c77c7b37704dea5888e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::split_cylindrical_face_by_patch (cyclomatic 38): vcad_kernel_booleans::cyl_band::split_cylindrical_face_by_patch has cyclomatic complexity 38 (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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a35f6fea75a3aa6073965cd35ef585bef656409ae13293d58e11dfe0f54c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::prune_redundant_patches (cyclomatic 38): vcad_kernel_tessellate::prune_redundant_patches 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"0200472310bf09855f054673131c7666a097b09ecef69775dfcd84b32638bd13"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchSession.ink (cyclomatic 38): SketchSession.ink 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b040d563996dad9d3c2d0d45ee5b119d4a966a4570314cf0090e8561763586"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbroideryPanel.EmbroideryPanel (cyclomatic 38): EmbroideryPanel.EmbroideryPanel has cyclomatic complexity 38 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 15 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9632150888c777363823e1ea697000b8922af67277aa1aa1c1f96ee62406bfc1"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.addViaArray (cyclomatic 38): ecad.addViaArray 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2555ab4e723b7aa85f87c0e6f6514753f9ee2a8098005fa6ba9d30757c5584e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.buildReceipt (cyclomatic 38): ecad.buildReceipt 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71764d45a402462e1f66c81330cabf9c7efc8ddf71e2af594645eb746c6290f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::run_command (cyclomatic 37): vcad::run_command 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8941514838fb27d30dba8d4e2a19e4fbf6b4c8602bb880acb9cbc83e2c33ec"}},{"ruleId":"D1","level":"warning","message":{"text":"ResidualSystem::solve_lm (cyclomatic 37): ResidualSystem::solve_lm 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7ea903d658e89cd2379fa030a9377e03cefc8aa9ebd1655701b5568899d0e4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::sim_extract::em::extract_axisym_mag_spec_from_scene (cyclomatic 37): vcad_eval::sim_extract::em::extract_axisym_mag_spec_from_scene 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":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9146415d465da44ab7dad22f94857248cc51a40d35a96f882b9a05cc1b25e6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_neutronics::transport::run (cyclomatic 37): vcad_kernel_neutronics::transport::run 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":"crates/vcad-kernel-neutronics/src/transport.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd403cd44b67f355c25f85ab63fcaef19bb97541e232560db7b9a395ad62becb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_shell::shell_brep_open (cyclomatic 37): vcad_kernel_shell::shell_brep_open 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce10c62d6a2234912cafc3ee36f475086b089ac921feaf003270e6c0688c1fc"}},{"ruleId":"D1","level":"warning","message":{"text":"KernelMesh.creasedNormals (cyclomatic 37): KernelMesh.creasedNormals has cyclomatic complexity 37 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 9 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28f8f6a0f2e726e30a9171fa42f97b59be727a40b38d5c9b7cd7d06665e850a"}},{"ruleId":"D1","level":"warning","message":{"text":"KernelMesh.creasedNormals (cyclomatic 37): KernelMesh.creasedNormals has cyclomatic complexity 37 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 9 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":"apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"65237008e6e4a75d54ca314862249fff8a3096638af501ba072161e3e857f84e"}},{"ruleId":"D1","level":"warning","message":{"text":"integrity.computeIntegrity (cyclomatic 37): integrity.computeIntegrity 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":"packages/mcp/src/tools/integrity.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca955ed51934b3c4bb9ad8ee3f1faabd69eea94afd6745d04ccca05ee1ca5e16"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::ui::chat::draw_chat (cyclomatic 36): vcad::ui::chat::draw_chat 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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"89201fce06de49cae85f4b4d5012d607fad1e7b6e10f5d41b9018956714fe49e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_by_arc (cyclomatic 36): vcad_kernel_booleans::split::split_planar_face_by_arc has cyclomatic complexity 36 (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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1e4c84abe3c83d951ba3df29172a523dc17010b57313520f2fe1496463513d"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_by_multi_arc (cyclomatic 36): vcad_kernel_booleans::split::split_planar_face_by_multi_arc 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3188}}}],"partialFingerprints":{"codehealthFindingId/v1":"71100a4c88635f8a09c7a5f99bd8b365500d5e61226a1f4e8249d1ca5f483d01"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::raster::rasterize (cyclomatic 36): vcad_render::raster::rasterize 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. This is NOT this file\u0027s highest cyclomatic complexity: vcad_render::raster::glyph5x7 (cyclomatic 47) 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0db5b69b5a608c331c57e78ef93e5a2b7d5ca0b98a7f3c94f83093ba61471a"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCController.ingest (cyclomatic 36): CNCController.ingest 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada5b93bc6d16d11bcb655c16ece0c3d4d32253a4d547b030025f3ff3c2a0496"}},{"ruleId":"D1","level":"warning","message":{"text":"PcbFootprintGroup.PcbFootprintGroup (cyclomatic 36): PcbFootprintGroup.PcbFootprintGroup has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 7 of the 36 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 57, a function literal at line 159, isNetHighlighted, \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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"15481c2e54b8be29b511139524e937f005cfb689afecc6b5041dca392879110a"}},{"ruleId":"D1","level":"warning","message":{"text":"useAppCommands.useAppCommands (cyclomatic 36): useAppCommands.useAppCommands has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 20 function literals inside it that branch (lines 75, 265, 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":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"217c4ace5c485da08e901f47aa199dee29d15a95269312790726618759c3ca95"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.sizePdn (cyclomatic 36): ecad.sizePdn has cyclomatic complexity 36 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 12 belong to 6 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7281}}}],"partialFingerprints":{"codehealthFindingId/v1":"342fe093e7c16048a152b958bf4d98d1d0a4c069f8c66a296a5dae85b156ffc8"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.getCopper (cyclomatic 36): ecad.getCopper has cyclomatic complexity 36 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 18 belong to 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10395}}}],"partialFingerprints":{"codehealthFindingId/v1":"12794dd626527830036bfcea66b4c276dbd636b9d395916b5c75fbff04265a71"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::evaluate::evaluate_node (cyclomatic 35): vcad_app::evaluate::evaluate_node 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":"crates/vcad-app/src/evaluate.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cde3a48bdef473b04d453e5ef3910429398823d0bcfb20390bbff74766dd7e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::input::handle_mouse (cyclomatic 35): vcad::input::handle_mouse 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d9efe1559b37aeeb95e5906af1f0bcfa7a5875b62bf49047e0101109952132"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::try_parse_two_chain (cyclomatic 35): vcad_kernel_booleans::cyl_band::try_parse_two_chain 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"293a98d6d824a5c387c712516d94b6324b6215fea148d0392792246ce1d741b7"}},{"ruleId":"D1","level":"warning","message":{"text":"AxisymMagnetostatics::build_system (cyclomatic 35): AxisymMagnetostatics::build_system 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd1ff647b5f66731af4d98d0699e794caec62403e028aae6180dbbbbcf61651"}},{"ruleId":"D1","level":"warning","message":{"text":"Device3d::validate (cyclomatic 35): Device3d::validate 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":"crates/vcad-kernel-particle/src/wire3d.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fb5e8fca986d3ba7ffcb14acad522550f9709e331e5c29b91104e69f6ae9c2"}},{"ruleId":"D1","level":"warning","message":{"text":"HaloInput.handle (cyclomatic 35): HaloInput.handle 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":"apple/VcadApp/Sources/VcadApp/NavigationViews.swift"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"986981ca807a2f6791a538d787b1d3c4ab8d4d93ac60920e641c4e0a17930d52"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchInference.infer (cyclomatic 35): SketchInference.infer 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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e14df6dde61f8bfe7736889b2fd81c3da953f489fba222c82d8375787f46d0"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchViews.swift.buildSketchRoot (cyclomatic 35): SketchViews.swift.buildSketchRoot has cyclomatic complexity 35 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 10 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":"apple/VcadApp/Sources/VcadApp/SketchViews.swift"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3e0120a0d901f18683225b93ca9f69c4f1eed39488115a5ebe019c1bfe75e1"}},{"ruleId":"D1","level":"warning","message":{"text":"commands.createCommandRegistry (cyclomatic 35): commands.createCommandRegistry has cyclomatic complexity 35 (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":"packages/core/src/commands.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3c2f7d4fdedfcded5cc66105c68668f6056f1ce0f49a3e2430c478357c2581"}},{"ruleId":"D1","level":"warning","message":{"text":"PartStockClient.check (cyclomatic 35): PartStockClient.check has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fb8d1fc5f1d2b1572f3c82a5a408882fb2f56e27718ffcdcb79ee98bb1a287"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordReader::next_record (cyclomatic 34): RecordReader::next_record 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":"crates/vcad-gdsii/src/record.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b0e7b5f78bd2b6e7c4b9441f9d53850705949cbfe3d44b3a76b6d587a59b26"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_thermal::adjoint::smooth_max_gradient (cyclomatic 34): vcad_kernel_thermal::adjoint::smooth_max_gradient 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":"crates/vcad-kernel-thermal/src/adjoint.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c86df7fbc0e5a90fc7db572b8f92b5fd6ec1ee5f283e5df823ed93c592d50"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_printcheck::checks::check_columns (cyclomatic 34): vcad_printcheck::checks::check_columns 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":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e94f784506460e9b3d9f716aafead7d08e5b220d17afe3f02c17c7d81dd194"}},{"ruleId":"D1","level":"warning","message":{"text":"useEngine.useEngine (cyclomatic 34): useEngine.useEngine has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 12 function literals inside it that branch (lines 35, 86, 157, \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":"packages/app/src/hooks/useEngine.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f115cf4747e0d928e9027e3bbdabf4439875ef13caa7998b26ccb9e66ae7f1a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.fromVCode (cyclomatic 34): index.fromVCode 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":"packages/ir/src/index.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba194924588735afde664ecd6541291235a7a80e0a3c4e39fa55d4732be65b7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::migrate::migrate_assembly (cyclomatic 33): vcad_app::migrate::migrate_assembly 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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"322e79a0a6150504af6e5b46fbdefa84b181f577ba06bba7283998bfbaa67e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowGraph::build (cyclomatic 33): FlowGraph::build 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bb6c87bd485ab3c241419e78ccf3b0752d7259d87f911cc8a18874b22e4616"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::legalize::merge_same_net_vias (cyclomatic 33): vcad_ecad_pcb::router::legalize::merge_same_net_vias has cyclomatic complexity 33 (threshold 15). Of this number, 31 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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cec999fdcfbaf11228915d816896c0e40209a88e741b0b50a9771720546c6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::eagle_brd::parse_eagle_brd (cyclomatic 33): vcad_ecad_symbols::eagle_brd::parse_eagle_brd 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":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba21b6445de79bac53b310f44f74e499faf57e925c5d6432d38f8df7245bacd1"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::footprint::match_power_family (cyclomatic 33): vcad_ecad_symbols::footprint::match_power_family has cyclomatic complexity 33 (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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"52835657d679cf690f8300d6e8020eeb5a0f36b30a5554ddde8541211c91c7d4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_diff::lift::lift_surface_second (cyclomatic 33): vcad_kernel_diff::lift::lift_surface_second 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":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8949cb3fa7788d76f643955a7519bed0db1a09bec8259cc9ec767a438f2fc0fd"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_flow::solve::finish (cyclomatic 33): vcad_kernel_flow::solve::finish 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":"crates/vcad-kernel-flow/src/solve.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"112498d2722d09e0ec1cc03cb2be5c5ff3a410c8035d9125d5b58723cd86fd19"}},{"ruleId":"D1","level":"warning","message":{"text":"PhysicsWorld::from_document_with_colliders (cyclomatic 33): PhysicsWorld::from_document_with_colliders 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df77c29e50162a3297ee5133c3709eb832192f6923be7b8504ae1c4395a9770"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::split_top_level (cyclomatic 33): vcad_loon::split_top_level 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":"crates/vcad-loon/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18061b12c8656a5f58c34cedf101ae68357817a5b5bd3bc955642fce049cab9"}},{"ruleId":"D1","level":"warning","message":{"text":"StatusBar.StatusBar (cyclomatic 33): StatusBar.StatusBar has cyclomatic complexity 33 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 10 belong to 4 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b76d683ac459654f891955901916561259abb4d377a9807ca9df37d85e4b47a"}},{"ruleId":"D1","level":"warning","message":{"text":"expression-input.ExpressionInput (cyclomatic 33): expression-input.ExpressionInput has cyclomatic complexity 33 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 12 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":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d93c7488ee5820c7fa3f264175dab9d3a1b0c216f1429008ecf1e85c565ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::gpu_bridge::gpu_search_batch_inner (cyclomatic 32): vcad_ecad_pcb::router::gpu_bridge::gpu_search_batch_inner 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":"crates/vcad-ecad-pcb/src/router/gpu_bridge.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7d72192d7f98370cb57d1778454abf6cba8ef92cdaf1b8f23d0ee3b2a807fc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_sim::circuit::transient_adjoint::transient_sensitivities (cyclomatic 32): vcad_ecad_sim::circuit::transient_adjoint::transient_sensitivities 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":"crates/vcad-ecad-sim/src/circuit/transient_adjoint.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37aab39d9570c32fcf29236f348c1e2adb349a9303f9f94256627043ebe5b49"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::pcb_preview::pcb_preview_meshes (cyclomatic 32): vcad_eval::pcb_preview::pcb_preview_meshes 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":"crates/vcad-eval/src/pcb_preview.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"092f0d58224221704ef557a78e8ab2d69812e04dcd8fdf091785e842d69a8f17"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::thermal_extract::extract_thermal_spec_from_scene (cyclomatic 32): vcad_eval::thermal_extract::extract_thermal_spec_from_scene 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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f8166c90e8badd6cf86f39c7cdda3bfdd2a6e822b07dc6e636d009f3189735"}},{"ruleId":"D1","level":"warning","message":{"text":"QuadricCtx::project_point (cyclomatic 32): QuadricCtx::project_point 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"32659f75211f2121936206003b217ab44284d840d6ed71456766d00408310899"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_cam::turning::rotary::plan_rotary (cyclomatic 32): vcad_kernel_cam::turning::rotary::plan_rotary 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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea04d2d935dcd11a86b795d0ac2104584e46041add4ed80b3135dfaac6f8d36"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_shell::shell_brep_analytical (cyclomatic 32): vcad_kernel_shell::shell_brep_analytical 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e250928581a2339be8587c80814a801d7bc25cfd3a5746530d0e585bbb683e09"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_spherical_region (cyclomatic 32): vcad_kernel_tessellate::tessellate_spherical_region 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41df9dc0b4bc0205f6b6f615767f7e463b9dbd958b58de545a564995f7684e5"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.finishSketch (cyclomatic 32): EditorModel.finishSketch 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2446266bea12c4dd7b2ca31709168ab509a766eb5b854cc58423c2b7249f72b"}},{"ruleId":"D1","level":"warning","message":{"text":"PathTracer.step (cyclomatic 32): PathTracer.step 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":"apple/VcadApp/Sources/VcadApp/PathTracer.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed1c4f1011a188a0eab05f5a2ef592865b04d5ede8b768502faa095f596d7b9"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.finishSketch (cyclomatic 32): EditorModel.finishSketch 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e14a29f52d394457ce5408f376e52b4260b56ab14110ce8450ce9f1a0a4121"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.stitchTJunctions (cyclomatic 32): launch.stitchTJunctions has cyclomatic complexity 32 (threshold 15). Of this number, 31 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":"packages/app/public/launch/launch.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"251c75d7257682efa44c123cf7b0b773a11081cbc813eed05ca5ba367f97369a"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentPicker.DocumentPicker (cyclomatic 32): DocumentPicker.DocumentPicker has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 13 of the 32 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 311, 346, 255, \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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2417e6e5293777f5896dea512cfe41c5747f5f4fab96786cfe2bb145cfea14d"}},{"ruleId":"D1","level":"warning","message":{"text":"electronics-store.useElectronicsStore (cyclomatic 32): electronics-store.useElectronicsStore has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 635, 392, 443, \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":"packages/app/src/stores/electronics-store.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"91183a8b0bee2bffbe59c9511c33f15d8d851702dafa7d0c8dce959692a0ee04"}},{"ruleId":"D1","level":"warning","message":{"text":"index.formatSceneSettings (cyclomatic 32): index.formatSceneSettings 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":"packages/ir/src/index.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73ac7b4ba3eb3622e799da817d901a522b0d207e168ae3e78e43d4c36011054"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.stitchTJunctions (cyclomatic 32): gallery.stitchTJunctions has cyclomatic complexity 32 (threshold 15). Of this number, 31 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":"www/public/kit/gallery.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fa086ccf33bc7051809655a386aa75aa47c21dda35b9c2c3a8a459e1e414bd"}},{"ruleId":"D1","level":"warning","message":{"text":"hero-app.init (cyclomatic 32): hero-app.init has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to 15 function items inside it that branch (play, setReceipt, el, \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":"www/src/hero-app.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68fbd92e2d5b06ca636a73b83bde0e031172b6d6e5415ad2c4f02a641b11d28"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_design_constraints::lower::run (cyclomatic 31): vcad_design_constraints::lower::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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf139dcdac9fca070c7e3b4171e30a96763e1805eefd6ef3dc60e80d556db01"}},{"ruleId":"D1","level":"warning","message":{"text":"LayerCdt::build (cyclomatic 31): LayerCdt::build 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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b130f487bde844d98cc552a0be96f3578b5c796726d82895ad90bfb38264ec"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowGraph::shortest (cyclomatic 31): FlowGraph::shortest 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc99cd0e3a3daa763af836c1434d201b9f8197e3a11dd884ab119ca669ad9fe"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_sim::circuit::netlist::circuit_from_netlist (cyclomatic 31): vcad_ecad_sim::circuit::netlist::circuit_from_netlist has cyclomatic complexity 31 (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":"crates/vcad-ecad-sim/src/circuit/netlist.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b58b105d7aa98748e04f7dc07fd3feb2d848038ba5f3f5d22ec20cc4638ad7"}},{"ruleId":"D1","level":"warning","message":{"text":"Problem::sample (cyclomatic 31): Problem::sample 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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3eb94111d587e7ba662e466859d9bcb19a43a73c33b6d4dc69d0dd1e15f62b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::ssi::intersect_surfaces (cyclomatic 31): vcad_kernel_booleans::ssi::intersect_surfaces 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":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6206ef835ef4e3eaba5bb49d27fca7aec19b4aa70b91389c1c55068ff35c3d"}},{"ruleId":"D1","level":"warning","message":{"text":"LinuxCncPost::segment (cyclomatic 31): LinuxCncPost::segment 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":"crates/vcad-kernel-cam/src/post/linuxcnc.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26af26777187663db146d2112a1ac0f3fab3b1ca4b74693a81c0c618cf6c1c5"}},{"ruleId":"D1","level":"warning","message":{"text":"FeSystem::build (cyclomatic 31): FeSystem::build has cyclomatic complexity 31 (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":"crates/vcad-kernel-topopt/src/fea.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d22e62268205b01526fe1283b66e5313b06d370d658ea11662935f1ae64be54"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentTools.setPose (cyclomatic 31): AgentTools.setPose has cyclomatic complexity 31 (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":"apple/VcadApp/Sources/VcadApp/AgentBridge.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6644e78a4094a99ebf21092473eb3a1ebcd18045da0eba7166b88e607a68db"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureOpSheet.apply (cyclomatic 31): FeatureOpSheet.apply 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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9909e40c54cf9d22ba95d1d549971a17167c9a05fbf0686266887058724f51"}},{"ruleId":"D1","level":"warning","message":{"text":"NavigationScheme.action (cyclomatic 31): NavigationScheme.action 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":"apple/VcadApp/Sources/VcadApp/NavigationScheme.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac00bc0594218a77e7a406f9b7e1b987b7891fb67362b41f5b0d1f83a19f80e4"}},{"ruleId":"D1","level":"warning","message":{"text":"pass_k.failureReason (cyclomatic 31): pass_k.failureReason 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":"mecheval/harness/src/pass_k.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5624d30914d61dfe8ef6b6183df4d7b4727c08ce2e559197fd1bc30a0e19a6"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchPropertyPanel.SketchPropertyPanel (cyclomatic 31): SketchPropertyPanel.SketchPropertyPanel has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 8 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 469, 439, 467). 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b929cc7ae9b58a1a2588edb840cc815b32d36abf4bb0fed3895d3cc5b2b8ef62"}},{"ruleId":"D1","level":"warning","message":{"text":"index.toVCode (cyclomatic 31): index.toVCode 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":"packages/ir/src/index.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fbd9f67f03856a6a85bb6560f789ed2c68d28760a518f12240f5c8966db04d"}},{"ruleId":"D1","level":"warning","message":{"text":"next-actions.suggestNextActions (cyclomatic 31): next-actions.suggestNextActions 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"722b2fdbf5d0a8dd47bfd5129cf605fad79ff85cebd844ad0e9f17a2370ea80f"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.setPlacement (cyclomatic 31): ecad.setPlacement 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d597d2388a40d2014b4e689340c4e00f6a1095625bff8c61a04e3249b8e596c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Envelope::new (cyclomatic 30): Envelope::new 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":"crates/vcad-kernel-cam/src/turning/envelope.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a037ee4ea74f21e540e7c8552c923f2450961dc06a56698dbbe7049718ccdd"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::frozen::capture_plan (cyclomatic 30): vcad_kernel_tessellate::frozen::capture_plan 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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdafaeaeb8dd886b648459763156a0ecc69e8366042c2acc5f398d4e9336940"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchSession.constrainSelectionNow (cyclomatic 30): SketchSession.constrainSelectionNow 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0085695f0b7d1ec6fb27d60f85b429ba38399adc2a34cd3b35391d803474afd"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchPlane3D.SketchGeometry3D (cyclomatic 30): SketchPlane3D.SketchGeometry3D has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 378, 288, 348, \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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8fd7e736024a6de32d3979d3b10cea3b7a34041abfcb4d264543671554292c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.formatOp (cyclomatic 30): index.formatOp 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":"packages/ir/src/index.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3541e018b58a09d52fccbb307f6c81013d5ae5824b6852d0b7b540a80a84dd"}},{"ruleId":"D1","level":"warning","message":{"text":"bom.buildLine (cyclomatic 30): bom.buildLine 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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"af58ed6c8dd72d9f1928acd878a74fb17cf98bdd1be3dc96f536cc5ac66ee139"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.deleteNetTie (cyclomatic 30): ecad.deleteNetTie has cyclomatic complexity 30 (threshold 15). Of this number, 22 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8499028ebadb0f293a17d43e0f27df88b43ee815e21759a7511093626b659d76"}},{"ruleId":"D1","level":"warning","message":{"text":"ResidualSystem::solve_sqp (cyclomatic 29): ResidualSystem::solve_sqp 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"49df0b56f5ae38da2efb231a93cd04ec0b39a1b5fbc60e8c92ac57bd6fb21e61"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_adjoint::couple::solve_coupled (cyclomatic 29): vcad_kernel_adjoint::couple::solve_coupled 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":"crates/vcad-kernel-adjoint/src/couple.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ec63544c5048c9f4dd52e0d2a12413c004a97c5960fef0edb0240cd2b300c5"}},{"ruleId":"D1","level":"warning","message":{"text":"GrblPost::segment (cyclomatic 29): GrblPost::segment 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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb78c91396928529bc689c4644173d077a296b86701ba959f653111110a84f0"}},{"ruleId":"D1","level":"warning","message":{"text":"Tracer::trace_impl (cyclomatic 29): Tracer::trace_impl 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":"crates/vcad-kernel-particle/src/trace.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2b08b721392e4c614fd92b21d73558a4dac3c11e9ea1e8a9384a923546b424"}},{"ruleId":"D1","level":"warning","message":{"text":"GpuScene::from_brep (cyclomatic 29): GpuScene::from_brep 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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39fa8e121f3b70f1f01565f5e3f45029f8744d39efb90ba5159d037793d6094"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::manifold::clean_pass (cyclomatic 29): vcad_kernel_tessellate::manifold::clean_pass 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":"crates/vcad-kernel-tessellate/src/manifold.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb699ec6a5b6c1df9b1559baaddb0da17bf48c5153479af7b1c10fdf14a185f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ConvertCtx::material_physics (cyclomatic 29): ConvertCtx::material_physics 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e151d7f919468406be85f7b3f1b5b2567568b7c59cf78b3f4a7db513e11c5997"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_mcp::tools::loon_carry::carry_electronics (cyclomatic 29): vcad_mcp::tools::loon_carry::carry_electronics 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":"crates/vcad-mcp/src/tools/loon_carry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1de303428d49d667c30f934400aa39af494798f1f7582ea19f02aeb4166a02"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsWorkspace.tidySchematic (cyclomatic 29): ElectronicsWorkspace.tidySchematic has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed68793043d80eb7b78ddc26518a8d8dba694fce7c984d769c314a1340b513"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureOpSheet.fields (cyclomatic 29): FeatureOpSheet.fields 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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8734985fff8b517ee0f389dcdb403353883655a6e41a34ddc3d73c832dcf05e8"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformGizmo.TransformGizmo (cyclomatic 29): TransformGizmo.TransformGizmo has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 105, 187, 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":"packages/app/src/components/TransformGizmo.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d072a833304d29c3c65fecdfaabebfc602893d176dec5fce46ef309de8d3dfd"}},{"ruleId":"D1","level":"warning","message":{"text":"claims-ledger.importMeasurement (cyclomatic 29): claims-ledger.importMeasurement 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"3941f22e41002308733921f0f55c559593490a42857f3466cdce352b60c255d9"}},{"ruleId":"D1","level":"warning","message":{"text":"mech-parts.searchMechCatalog (cyclomatic 29): mech-parts.searchMechCatalog has cyclomatic complexity 29 (threshold 15). Of this number, 28 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":"packages/mcp/src/tools/mech-parts.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff07c91c07f4b624933598ad1c8a438a0c5b829f07f57f0c7c6b6582057fb94"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.addZone (cyclomatic 29): ecad.addZone 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9951}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b059eaa3c6580b3ce9e1f56d6d80c0968b6ff980bbbf3a6b856a4a5be525eb"}},{"ruleId":"D1","level":"warning","message":{"text":"main.handleToolResult (cyclomatic 29): main.handleToolResult 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"08215d9c62523a7d2a453001c3fd87564f0c15f03001d3e96b899591c8dbeab1"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_design_constraints::lower::write_back_group (cyclomatic 28): vcad_design_constraints::lower::write_back_group 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"8280f1755921da360d67ecddae7faa44f828aef40f8628f7d9ec53497907cb00"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowGraph::negotiate (cyclomatic 28): FlowGraph::negotiate 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"852e9e54b877d5b48e4541f726a38bb2035144b4825ccbe1a92cbcce24ab4a94"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::joint_window_repair (cyclomatic 28): vcad_ecad_pcb::router::auto::joint_window_repair 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"797943d951345cb0e78225de7b03425a07661a42b837f393c560d95140829925"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::topology::analyze (cyclomatic 28): vcad_ffi::topology::analyze 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":"crates/vcad-ffi/src/topology.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1669899db04268371f7027efe03d076d0d478734539ba088af63dd51addb02a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r7_threads_and_gears (cyclomatic 28): vcad_kernel_dfm::rules::hobby_mill::r7_threads_and_gears 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3e2b9030f229876931b36c64063f2acff7417541ff8f289ad2d4442e486f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_drafting::features::detect_circles (cyclomatic 28): vcad_kernel_drafting::features::detect_circles 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":"crates/vcad-kernel-drafting/src/features.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14f06f5916b24b72a803945bab0d024af5f72383a00e2281df12a550b268550"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::adjoint::shape_gradient (cyclomatic 28): vcad_kernel_fea::adjoint::shape_gradient 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":"crates/vcad-kernel-fea/src/adjoint.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cfa074329adbedb6c9dcdac446b8a0d58f41dfbab6f35bbdfecf266ebbde3c"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_curved::plan_convex_junction_blends (cyclomatic 28): vcad_kernel_fillet::fillet_curved::plan_convex_junction_blends 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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3047a3211a16e72887623e28c4d0a7269d1054d4fc10c3428dfd9ba57caed5a"}},{"ruleId":"D1","level":"warning","message":{"text":"Simulation::step_tm (cyclomatic 28): Simulation::step_tm 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4096e32583079bfd2bd620657986b927d393d4f01d620f880d8dec58ce0bf4ef"}},{"ruleId":"D1","level":"warning","message":{"text":"PeriodicTrim::build (cyclomatic 28): PeriodicTrim::build 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":"crates/vcad-kernel-raytrace/src/trim.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"185c269b416958a07a2dba28c8bdf5b0579aaabaee257208ed648be8942bddeb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::flatten_solid (cyclomatic 28): vcad_kernel_sheet::flatten::flatten_solid 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dc3e290a5b0ccbdbd69d5311778e6eb66d15ccec8b4c7c8d691a36ca3e9380"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_step::entities::surfaces::parse_bspline_surface (cyclomatic 28): vcad_kernel_step::entities::surfaces::parse_bspline_surface 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":"crates/vcad-kernel-step/src/entities/surfaces.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e69cc2c15c7621d42eb120126791210513f8f43dfc2a647cfb81b00fd87ab9e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::fill_tiny_boundary_loops (cyclomatic 28): vcad_kernel_tessellate::fill_tiny_boundary_loops 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"75319137fab6e4f861daa4a548ee3f0b18d15569441dd13f9ab02c5878a0a8ae"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::triangulate_circular_cap_with_holes (cyclomatic 28): vcad_kernel_tessellate::triangulate_circular_cap_with_holes 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"020af173da6f2cd990ed6e93bfb1859b3070ead16f40139eca79705057e040ce"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::collapse_short_defective_edges (cyclomatic 28): vcad_kernel_tessellate::collapse_short_defective_edges 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8773}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cb1e722857872e6270c42f803e868f25d9d8414a22c7e0e345b5add63c747d"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_wasm::photonics_simulate (cyclomatic 28): vcad_kernel_wasm::photonics_simulate has cyclomatic complexity 28 (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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10925}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a672ffc99ecf956509de66e6a4c71b762557287fc10cfde4360aee5f34e52"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::raytrace::rasterize_rt_scene (cyclomatic 28): vcad_render::raytrace::rasterize_rt_scene 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 is NOT this file\u0027s highest cyclomatic complexity: vcad_render::raster::glyph5x7 (cyclomatic 47) 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a640fd26117725d86b0ef1eb1dec00d2003773fce6937f5ef004e4e6d9ffdd2"}},{"ruleId":"D1","level":"warning","message":{"text":"mecheval_grader::suite_c::solve_ik (cyclomatic 28): mecheval_grader::suite_c::solve_ik 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":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc8721b76b7b1321a60f8cb4eb9f0845b09dbe2af04ee0bfdafcbbdda7377a6"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.startBackgroundEvaluation (cyclomatic 28): EditorModel.startBackgroundEvaluation 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ddff9f2b45f9a3a83ecb4a8d1003ac7bed42bcc805e62464fb19821e0bc80c"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisSmoke.swift.analysisSmoke (cyclomatic 28): AnalysisSmoke.swift.analysisSmoke has cyclomatic complexity 28 (threshold 15). Of this number, 25 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":"apple/VcadApp/Sources/VcadApp/AnalysisSmoke.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9d15e5bec372878b509081f2a76b990aa35ad04eca8ce25a8d1698f14f365c"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.startBackgroundEvaluation (cyclomatic 28): EditorModel.startBackgroundEvaluation 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe2b827c15695c97139f72b83891f367757cabfff23310d83916bc7be7179db"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchPlane3D.SketchPlane3D (cyclomatic 28): SketchPlane3D.SketchPlane3D has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 773, 905, 951, \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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f3c3338fb119533bd22a8fadff42898b65a96eeb23edd12752855e906a7caa"}},{"ruleId":"D1","level":"warning","message":{"text":"CamPanel.CamPanel (cyclomatic 28): CamPanel.CamPanel has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 59, 237). 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe930d100593975b3ddd343dae3c66a169824bedc4de573cfb4685c61f72cc0"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsPanelHeader.BoardSizeControl (cyclomatic 28): ElectronicsPanelHeader.BoardSizeControl has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 6 function items inside it that branch (fitToEnclosure, commit, a function literal at line 85, \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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5006825a14a41c37e6e704124f82fe18948f6ec7ba10347fa674451e75896881"}},{"ruleId":"D1","level":"warning","message":{"text":"enclosure.sealedWallOpenings (cyclomatic 28): enclosure.sealedWallOpenings 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":"packages/mcp/src/tools/enclosure.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a1ee154d72a32e5e9b816e4798892770353ab665c9f1b7d76e779d04f7ba6e"}},{"ruleId":"D1","level":"warning","message":{"text":"source-parser.parseRustSourceContent (cyclomatic 28): source-parser.parseRustSourceContent 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d9cc2734c2e7158bd85f8b086fdbe6e7cf602adc3a03ca1417f59c976d69c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctx::elaborate (cyclomatic 27): Ctx::elaborate 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":"crates/vcad-ecad-schematic/src/hierarchy.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee020ff751159562503e0b26e8cb8ce04d7a782b8329a85f0d61a6c3f94bc1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_schematic::generate_netlist (cyclomatic 27): vcad_ecad_schematic::generate_netlist 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":"crates/vcad-ecad-schematic/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"945a63ab91d1926dc333fc86f77922deb268d07426984ee2a7a083ea5f9ff6b9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_acoustics::instrument::tune_bar (cyclomatic 27): vcad_kernel_acoustics::instrument::tune_bar 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0def5c962ac022829267614314fc35b6a7d44130c0c6e1b858a92d4b1abb3cba"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_dense_conical_band_by_circle (cyclomatic 27): vcad_kernel_booleans::split::split_dense_conical_band_by_circle has cyclomatic complexity 27 (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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5142}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d8a9b385c0564f8cf88b9b2f0345a88b2e267e41ef78b74433d944ca09b1e0"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_calibration::build_calibration_report (cyclomatic 27): vcad_kernel_calibration::build_calibration_report 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":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5f84722d0fb6ac02fa7bea572d6a3b0a1c801645d7100cd047b23ab4f07b82"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_diff::lift::lift_surface (cyclomatic 27): vcad_kernel_diff::lift::lift_surface 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":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3e36452d93139f3167a1cf959b1bbaf34ee66f517b795a3d7fdda104115853"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::modal::brick_matrices (cyclomatic 27): vcad_kernel_fea::modal::brick_matrices 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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5fccbe2fb9dba5867c18635525a5e193bae88d5e3be7aa1e9ae4fd629fd9aa"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_thermal::graph::assemble (cyclomatic 27): vcad_kernel_thermal::graph::assemble 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":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"528e2cbea3e7dbe74ec51daf86eeb23f35c95ec8459542e8295e0d3cb478c83e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::convert::value_to_document_in (cyclomatic 27): vcad_loon::convert::value_to_document_in 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"946d30df765fe01bd45ba3ea4847794e28fc309991bc7c26031473a8ca2dca3a"}},{"ruleId":"D1","level":"warning","message":{"text":"make_figures.figA (cyclomatic 27): make_figures.figA 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":"docs/compression-math-survey/launch-figures/make_figures.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8b4d91b3da38e4f24d5656d600bc1b425ba458bbb2204591f86bc0ab09655"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCController.connect (cyclomatic 27): CNCController.connect 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf380180b1efc9bc27706186167a5c83811b95cb8756d769d9c02304ca2122b4"}},{"ruleId":"D1","level":"warning","message":{"text":"DocEdit.patternInstancing (cyclomatic 27): DocEdit.patternInstancing has cyclomatic complexity 27 (threshold 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, 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: DocumentGraph.symbol (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad3d0db31e2c7e6bdfb0c2193b6e2d4dcd0c6a6bce4fd3584a87af135d80406"}},{"ruleId":"D1","level":"warning","message":{"text":"NavSmoke.swift.navSmoke (cyclomatic 27): NavSmoke.swift.navSmoke has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 12 of the 27 points are its own statements and the rest belongs to 3 function items inside it that branch (drag, send, check). 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":"apple/VcadApp/Sources/VcadApp/NavSmoke.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6a86423c67dd6b90c0b90660e31b41cdb785f278ddfef58d3f07a98ae6bf6b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocEdit.patternInstancing (cyclomatic 27): DocEdit.patternInstancing has cyclomatic complexity 27 (threshold 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, 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: DocumentGraph.symbol (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Document.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"9922f0047ce239621d4f373eeb27843a058548480bcbc11be30929eb2dd46199"}},{"ruleId":"D1","level":"warning","message":{"text":"build.modelIdentity (cyclomatic 27): build.modelIdentity 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa338201e1f1e6888bddb95ac0d27de5d122dd5c04f1562006be0190f0ceedf"}},{"ruleId":"D1","level":"warning","message":{"text":"circuit-build.buildCircuitSpec (cyclomatic 27): circuit-build.buildCircuitSpec has cyclomatic complexity 27 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 11 belong to 4 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":"packages/app/src/lib/circuit-build.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ae9aa7528383af1ba4b71d09422a3a35acafb130afc61ec1e3a00855e13c85"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-store.useAnalyzeStore (cyclomatic 27): analyze-store.useAnalyzeStore has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 261, 392, 376, \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":"packages/app/src/stores/analyze-store.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc37106ba6578d753cc86da71fb29c296ad9f5dee8bc25349dfc3e908feb506"}},{"ruleId":"D1","level":"warning","message":{"text":"registry-dispatch.runMutationViaEngine (cyclomatic 27): registry-dispatch.runMutationViaEngine 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cfa488f7770273bdc8e53673123efab68be6270258d6483edab5628f290d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"joint-range.checkJointRange (cyclomatic 27): joint-range.checkJointRange has cyclomatic complexity 27 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 10 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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c79beb358d1768c468c20fef77073b92cdfe32f6e0f2e06c6e63e36fa2d114"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.applyDesignRuleArgs (cyclomatic 27): ecad.applyDesignRuleArgs has cyclomatic complexity 27 (threshold 15). Of this number, 24 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f39a9a151d96fd23a7407055e20e7f1078aba9343a2d5046d75ae550d668ea"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.runErc (cyclomatic 27): ecad.runErc has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8744a5d53d6d2436622e83f92719fa8351489e0c4802ad2a485b4558c593fb6b"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.windingLayout (cyclomatic 27): ecad.windingLayout has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8268}}}],"partialFingerprints":{"codehealthFindingId/v1":"503325c0a51b24218df3d33af2aed948047151a0977d9434f05b94ca4c6eb6bd"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.describePcb (cyclomatic 27): ecad.describePcb has cyclomatic complexity 27 (threshold 15). 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: 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31380c3a2beb3443f3d39a315ff05af801a2e6be9ff81237ac3147edc8125e4"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.boardFromSolid (cyclomatic 27): ecad.boardFromSolid has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 5 belong to 5 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13677}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f4310241042feeb79f498ba21429014da95fe09964f742a72e0f3fcef11b09"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::pour_synth::decide_pours (cyclomatic 26): vcad_ecad_pcb::pour_synth::decide_pours 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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a234cc11c08bfa37446f4094a63c7b337b1ff4a3386d161f5323350093f21fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::build (cyclomatic 26): Builder::build 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":"crates/vcad-ffi/src/features.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b5397261fb5d8bec294c329cf224e927a72b1a798bf784f1e8f2658a4075c5"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::cam::generate (cyclomatic 26): vcad_ffi::cam::generate 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":"crates/vcad-ffi/src/cam.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bde8ebe49fcaaa72a50589c1b32b22ef23d28d9aaa8eb03796aa4309808d807"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::expr_parser::call_builtin (cyclomatic 26): vcad_ir::expr_parser::call_builtin 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":"crates/vcad-ir/src/expr_parser.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b62e119196d7c7121b114c6b72d4c58ab985207f5379a79f75c8b8a0f11cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel::hull::convex_hull (cyclomatic 26): vcad_kernel::hull::convex_hull 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":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2844d423aac4601cc3f6abeb3c0c76970b69fc62e078e1f82a2bb3bfd3e4f9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::freeze::rechain_rim (cyclomatic 26): vcad_kernel_booleans::freeze::rechain_rim has cyclomatic complexity 26 (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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"369ae65ad0610a62ddf79daad1d9f9d0c490b477feea626d17e3b94c669b1e14"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_drafting::dxf::sheet_to_dxf (cyclomatic 26): vcad_kernel_drafting::dxf::sheet_to_dxf 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":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"152cfa1e9cb19730a0810907757e37083cc7b8d979c2f9f767320ee690da2ada"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_cone_sector_two_chain (cyclomatic 26): vcad_kernel_tessellate::tessellate_cone_sector_two_chain has cyclomatic complexity 26 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eefcd681fc580d3a3950b08d9d1605b67838601b9d84b65ea729b1cd88a6e9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::frozen::evaluate_plan_impl (cyclomatic 26): vcad_kernel_tessellate::frozen::evaluate_plan_impl 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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aa67ea0f3e339607d8299ded636376f07e75cf2848a406f2ac323a9e78913b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::convert::convert_ecad_value (cyclomatic 26): vcad_loon::convert::convert_ecad_value 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068cabea8d15bdb9c8f2c1209dbd10ebde934e0275bc1e9a909c943e2c40f89"}},{"ruleId":"D1","level":"warning","message":{"text":"Proxy::spawn (cyclomatic 26): Proxy::spawn 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":"crates/vcad-mcp/src/proxy.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed8d3790a8c99c11c71febe3abb54cea99b01a3fd3aa3ef6b952904b6f88522"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::build_artifacts (cyclomatic 26): vcad_render::build_artifacts 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. This is NOT this file\u0027s highest cyclomatic complexity: vcad_render::raster::glyph5x7 (cyclomatic 47) 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f21ff5ed7fce480bc0a0487c3cbb91a4e14e37dc866948eb6121a17bd6978f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::callouts::detect (cyclomatic 26): vcad_render::callouts::detect 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":"crates/vcad-render/src/callouts.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93f8d13666b48fec43c1a3da1949850efad642c1b558ede269c53029b720f2"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::raster::draw_annotations (cyclomatic 26): vcad_render::raster::draw_annotations 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. This is NOT this file\u0027s highest cyclomatic complexity: vcad_render::raster::glyph5x7 (cyclomatic 47) 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4809}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01db08df07f0fc3aa64ea520770e60252840fe1c3df113ee78536abcd3a454e"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.paletteCommands (cyclomatic 26): EditorModel.paletteCommands 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":"apple/VcadApp/Sources/VcadApp/FeatureOpsPalette.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2359d5af99fbe2ea5fbf7ed6b2d8396791acb59eeaa0ddf5d5262bc807b8d99f"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchSession.tapNow (cyclomatic 26): SketchSession.tapNow 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5fc7bccdf4728e2d145d1a81bc1744320367c7ea6ce8f4781a40f0172304ee"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisOverlay.swift.syncAnalysisOverlay (cyclomatic 26): AnalysisOverlay.swift.syncAnalysisOverlay 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":"apple/VcadApp/Sources/VcadApp/AnalysisOverlay.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6089d881d7f0401c6d4a6c7679467317cf0807c046fc535ee925d422f5490117"}},{"ruleId":"D1","level":"warning","message":{"text":"SoundPanel.swift.syncSoundOverlay (cyclomatic 26): SoundPanel.swift.syncSoundOverlay has cyclomatic complexity 26 (threshold 15). Of this number, 18 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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aaf29ef7017ace45cfdb5ae7922b444eaedfc73ce16bca707e840412995c70"}},{"ruleId":"D1","level":"warning","message":{"text":"launch-animatic.html.chrome (cyclomatic 26): launch-animatic.html.chrome has cyclomatic complexity 26 (threshold 15). Of this number, 16 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":"docs/launch/launch-animatic.html"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bce913836bb1b0680ccb1771a78165e7ed4fee44775ab9a1426fd12523f59aa"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.hero (cyclomatic 26): launch.hero has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 566, colorize, a function literal at line 537, \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":"packages/app/public/launch/launch.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"782c43fdeae57412fae74b4fc284b9bec3be1be2ff866b23ad2e36326389f035"}},{"ruleId":"D1","level":"warning","message":{"text":"CircuitTabTools.PcbConstrainControls (cyclomatic 26): CircuitTabTools.PcbConstrainControls has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 384, 421, 475, \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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb863d42e7601ffa4ebf86837b171872d40214caee3f7b4bdfbf1c51f5c0ae9c"}},{"ruleId":"D1","level":"warning","message":{"text":"usePhysicsSimulation.usePhysicsSimulation (cyclomatic 26): usePhysicsSimulation.usePhysicsSimulation has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 213, 73, 59, \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":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c932663971c0184e5d7cad898ab733d452d743500a99e32174ec3c6186896976"}},{"ruleId":"D1","level":"warning","message":{"text":"build.normalizeGlue (cyclomatic 26): build.normalizeGlue 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":"packages/kernel-wasm/scripts/build.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6286013800cb2f0a74a4e32bb18e4f8cb8cb507344148ce0bd7f6a3593a3234"}},{"ruleId":"D1","level":"warning","message":{"text":"claims-ledger.ledgerReceiptClaim (cyclomatic 26): claims-ledger.ledgerReceiptClaim 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2970a6a78e6c1a1af2217ae32518fbee716151c7737e1e359fa9f1b27be9a923"}},{"ruleId":"D1","level":"warning","message":{"text":"assemble.assembleInto (cyclomatic 26): assemble.assembleInto has cyclomatic complexity 26 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 10 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":"packages/mcp/src/tools/assemble.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"703047141b55ad3483b84dd839a21a4f4902eef364d484999b05cf0e79cefc58"}},{"ruleId":"D1","level":"warning","message":{"text":"schematic-hierarchy.flattenSchematic::elaborate (cyclomatic 26): schematic-hierarchy.flattenSchematic::elaborate 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":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"881c89257e03941a74d9eace2c45288b27aa543ca73a157cf927a31bb1a9a7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.solidFromBoard (cyclomatic 26): ecad.solidFromBoard has cyclomatic complexity 26 (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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e156e43dae303d0d1ca11caef4fbf49827824e4025733760e5a7eebf80793caa"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::slice_file (cyclomatic 25): vcad::slice_file 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ed28bee6bfbfcfc3204fa41df95f3108f5e95214feb67bf8cdf34254c117d9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_keepout (cyclomatic 25): vcad_ecad_pcb::drc::check_keepout 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac835d51cbbb079bb29fd397fd1eefe2d57f34f2d2840019aa2419f5be0399ce"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::ring_escape (cyclomatic 25): vcad_ecad_pcb::router::auto::ring_escape 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14df2e031e9d06ab7b10c8cb23771a88401c7017833ea11a0486cda8119205f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::sco::qp_l1 (cyclomatic 25): vcad_ecad_pcb::router::sco::qp_l1 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"d140b3b4e51fe068192e3cb835fafcfbda78e3ccfff6d3c439e5af60df6c04fe"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_sim::circuit::adjoint::ac_sensitivities (cyclomatic 25): vcad_ecad_sim::circuit::adjoint::ac_sensitivities 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":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc40b63eb0c247e21697e86f6fdafc117828c4486eef0421451618646bc945e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::write_library_body (cyclomatic 25): vcad_ecad_symbols::kicad_write::write_library_body has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d032ec166118dc6e3c3319b7938fcd5e8bade21a24a3a470babe2cefed672fb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::auto_layout (cyclomatic 25): vcad_ecad_symbols::kicad_write::auto_layout 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bbf19947e7af4e6bf9ca54184ddf02f89409fa99beb81c42c321cfcbc7becc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_embroidery_dst::reader::decode_record (cyclomatic 25): vcad_embroidery_dst::reader::decode_record 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":"crates/vcad-embroidery-dst/src/reader.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bcc6c3998e01021702d12c24d9f20333035914bc851fafa47bd78f35d74013"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_embroidery_dst::writer::encode_record (cyclomatic 25): vcad_embroidery_dst::writer::encode_record 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":"crates/vcad-embroidery-dst/src/writer.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade8b2b35a05940f647a07ce7aaa7107c16e56571f35b59a184b7b86b1cffc9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::vcode::from_vcode (cyclomatic 25): vcad_ir::vcode::from_vcode 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb2ccfe144ac58f218dacbff88a1c2dd91c16fa9c7f9942c6acf2aa69320fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::bbox::face_aabb (cyclomatic 25): vcad_kernel_booleans::bbox::face_aabb 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":"crates/vcad-kernel-booleans/src/bbox.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ff4e59c1994875f69b115bcc4827da2e8d08a7a797ee10be80d0008f134b32"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::repair::split_edges_at_interior_vertices_impl (cyclomatic 25): vcad_kernel_booleans::repair::split_edges_at_interior_vertices_impl 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":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bec55eaf332ad4030d3fa2f1846acfa2f28aa99e2982f7543ce5e6c01f8e341"}},{"ruleId":"D1","level":"warning","message":{"text":"LinearDimension::render (cyclomatic 25): LinearDimension::render 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":"crates/vcad-kernel-drafting/src/dimension/linear.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d14310d1eef0ab89a69fd8b5dc8e05bf98659343d045fc96905df815b6b71c1"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_thermal::transient::solve_transient_schedule (cyclomatic 25): vcad_kernel_thermal::transient::solve_transient_schedule 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":"crates/vcad-kernel-thermal/src/transient.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59f78958f7478138282da2cfbaecaf439315d045e50ae60f372500c3d1222ed"}},{"ruleId":"D1","level":"warning","message":{"text":"make_figures.figB (cyclomatic 25): make_figures.figB 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":"docs/compression-math-survey/launch-figures/make_figures.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e23a06713b77b6575b045fbafac11d91166bf345b1c78e9efa8dae7b8aedde6"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsCanvas.copperAt (cyclomatic 25): ElectronicsCanvas.copperAt 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"608aff829476ab354e1a2662a58ba17c67216064a2b6d3f3159e06f3fb5f0cd2"}},{"ruleId":"D1","level":"warning","message":{"text":"build.toolSummary (cyclomatic 25): build.toolSummary has cyclomatic complexity 25 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eaf0ae5aad04b8204ddc1442851be0558098f7c7704cc2b9556135249d5980"}},{"ruleId":"D1","level":"warning","message":{"text":"DfmDrawer.DfmDrawer (cyclomatic 25): DfmDrawer.DfmDrawer has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to 7 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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e3a492044a055e1145527eef4a6b401f0a16c30f1413443b4de993fa4bccd9"}},{"ruleId":"D1","level":"warning","message":{"text":"DocTitle.DocTitle (cyclomatic 25): DocTitle.DocTitle has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to 5 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdad8a9f491d2463f688b9228299c7e3db95f27553ad97d18801a81b38153611"}},{"ruleId":"D1","level":"warning","message":{"text":"part-summary.getPartSummary (cyclomatic 25): part-summary.getPartSummary 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":"packages/app/src/components/tree/part-summary.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbf9818f20961b419a39b90f3b31a9ef74544e51565852bd54378763abbc6c7"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureTree.SketchTreeSection (cyclomatic 25): FeatureTree.SketchTreeSection has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5e5a6a651c248acde653718b32cdb5578da8d692f7b16aff1c801c00460bc2"}},{"ruleId":"D1","level":"warning","message":{"text":"ParametersPanel.ParameterRow (cyclomatic 25): ParametersPanel.ParameterRow has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (commitValue, commitName, a function literal at line 229, \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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dc41095a9525cd419f9bf620e3f87137ff71e76a90ae5bb7e76c494b70da22"}},{"ruleId":"D1","level":"warning","message":{"text":"PcbKernelBoard.PcbKernelBoard (cyclomatic 25): PcbKernelBoard.PcbKernelBoard 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 6 function literals inside it that branch (lines 216, 146, 261, \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":"packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0704342e7abe5939dc14c9d87466252f4911504ba1f2f6afd20a23296c7b9d13"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewport.Viewport (cyclomatic 25): Viewport.Viewport has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 386, 353, 274, \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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"473b5ace2f0aaf48a69a8f468bff7936d5ba5249680d3778125cbd08f1c91417"}},{"ruleId":"D1","level":"warning","message":{"text":"EcadFeatureInspector.ComponentFootprintPanel (cyclomatic 25): EcadFeatureInspector.ComponentFootprintPanel has cyclomatic complexity 25 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 10 belong to 3 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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a63da7313805ecb1b70530fe0d0d054ec3b1eccdeea7b92a7a6beeb3af79d53"}},{"ruleId":"D1","level":"warning","message":{"text":"claims-ledger.extractClaims::visit (cyclomatic 25): claims-ledger.extractClaims::visit 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c9f3268e6dfe08ed497229047f2fd0652bce0ad4767994ed0d12ca9dcf0b9b"}},{"ruleId":"D1","level":"warning","message":{"text":"claims-ledger.attachClaims (cyclomatic 25): claims-ledger.attachClaims 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f572c1db200a90555cada3dd21c94008e642e419116d7b5909e174374de591ac"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.addCoilArray (cyclomatic 25): ecad.addCoilArray has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8098}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d3d0099121de8e2c1fcee885e606119fc9af023a89ab41f5a654e057c210fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.setBoardOutline (cyclomatic 25): ecad.setBoardOutline has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8457}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b49d6897f7487f3a4a78890019784f9282d572f6aedec24de9593bd7d21d95"}},{"ruleId":"D1","level":"warning","message":{"text":"animate.buildSequenceGlb (cyclomatic 25): animate.buildSequenceGlb has cyclomatic complexity 25 (threshold 15). Of this number, 24 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f366306fb076984474038ff2057af2cd379add49dfea6827418c7f7f5f11ca"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.analyzeRustSource (cyclomatic 25): cli.analyzeRustSource has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef16f1ae1a8e89a6a9da162979d31ca5093036cc264190432bd0ba7950818776"}},{"ruleId":"D1","level":"warning","message":{"text":"receipt-art.init (cyclomatic 25): receipt-art.init has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 8 function items inside it that branch (play, el, drawPart, \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":"www/src/receipt-art.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48cab777d24545fe492dfce6415e7189c06d24bd572dc4000f83c0d7bb395fe"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::materializer::materialize (cyclomatic 24): vcad_app::materializer::materialize 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"452f9d52e9cb9c1e04a1dc892edb95d1ee88cb286de6081b471ee3a7ce433670"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::tools::lower_update (cyclomatic 24): vcad_app::tools::lower_update 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":"crates/vcad-app/src/tools.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d410298c12e6bb83c51fef7a868f2ee979ae447effcc48666b604651cdb49c5b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::ui::command::render_palette (cyclomatic 24): vcad::ui::command::render_palette 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":"crates/vcad-cli/src/ui/command.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c13800f109494f028047d14e68fa22c283978d40f2e37a1cbc25031ea3171"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_clearance (cyclomatic 24): vcad_ecad_pcb::drc::check_clearance 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eca71c3b3c3b52350aee26ac2d45295f20f27240f27d877b32ed97d9d3e69e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::compensate_run (cyclomatic 24): vcad_ecad_pcb::router::compensate_run 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":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1420caddc5ce8c1a4f71fecad316b3c05ce5fe4457e43bb5887fbd2923ef8000"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::recon::program_document (cyclomatic 24): vcad_ffi::recon::program_document 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":"crates/vcad-ffi/src/recon.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f98994e4df862e75f599b96951be0db1406bfff3b3df3ed986784721dbb7286"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::vcode::to_vcode (cyclomatic 24): vcad_ir::vcode::to_vcode 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f673b586489e8066a3eb7024dc13f016cc5178c2feb1ca2a0a97a11df5910f30"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::classify::find_coincident_classification (cyclomatic 24): vcad_kernel_booleans::classify::find_coincident_classification 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"151f3a4f08a9d2cb8144d4edfc43da52c7407664b154c30ed87016ef94d5edb7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::merge_crossed_hole (cyclomatic 24): vcad_kernel_booleans::split::merge_crossed_hole 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa55aad4c0d08caeb71986c2f4782aca69c8e285fd65c6d6f7d7f379a5d0ad3e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::merge_circle_with_crossing_hole (cyclomatic 24): vcad_kernel_booleans::split::merge_circle_with_crossing_hole 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5079fd9ffae21309188368fd2c71b726d83eda6a22de59c62bf3d7ec370e140e"}},{"ruleId":"D1","level":"warning","message":{"text":"Regions::new (cyclomatic 24): Regions::new has cyclomatic complexity 24 (threshold 15). Of this number, 23 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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb148b089120367cecb4055beb73bcb11a071da51adfd7a4fce782031236c05"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_particle::chain::trace_ion (cyclomatic 24): vcad_kernel_particle::chain::trace_ion 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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c6a34ecb51bf69b637cd7b16e0a2a521afcd3756983bdc3cc1ecf84b8a4e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_shell::logical_faces (cyclomatic 24): vcad_kernel_shell::logical_faces has cyclomatic complexity 24 (threshold 15). Of this number, 22 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"549ca62534d7da66da719f6aede7bf9bd691403f621bf6a4369222e5813f4e51"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_step::pmi::extract_pmi (cyclomatic 24): vcad_kernel_step::pmi::extract_pmi 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":"crates/vcad-kernel-step/src/pmi.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"930bf879866f28c24782dc8da3ff0afe82c31aa314fb6fd50098548aedd35951"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::refill_defective_neighborhoods (cyclomatic 24): vcad_kernel_tessellate::refill_defective_neighborhoods 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"1742ad6cf13fa1a6b17dc6d037702e872005a3478c598ee1dcf756112114d7dc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_wasm::em_simulate (cyclomatic 24): vcad_kernel_wasm::em_simulate 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"261d1fa703d04b245f329eda878ff3aa99c200372b632e7837bac962a30c9b75"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::convert::convert_assembly (cyclomatic 24): vcad_loon::convert::convert_assembly 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a1f4e622852398d43e6056f3e46249b48d5713fe9d49a258aa3c49e8d8fed5"}},{"ruleId":"D1","level":"warning","message":{"text":"mecheval_grader::anti_cheese::enforce (cyclomatic 24): mecheval_grader::anti_cheese::enforce 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":"mecheval/graders/src/anti_cheese.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cca527cde463eeba6f23260ad6fc1c255fd5607e235c288ed80b1edfc9e1143"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCStatus.ingest (cyclomatic 24): CNCStatus.ingest 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"973cefcbd96fed085008fb73fb4868ca509c348ce4da468fe808a86f9e6d62af"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCController.setOverride (cyclomatic 24): CNCController.setOverride 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b82576bc3e9b8d8e385b570b9421c21e216a5ade42d04bf53e1834015ab141a"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.documentScene (cyclomatic 24): EditorModel.documentScene 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bf6642798c888620068c885aace63df93be073c975affe28a148ec20dbea35"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.promoteSandboxToDocument (cyclomatic 24): EditorModel.promoteSandboxToDocument 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6da70bf61488d1911ab8483634532ec4ebd15cf44aab16ea59f0c0abe838d0"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeElectronicsView.navigator (cyclomatic 24): NativeElectronicsView.navigator 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3849463c003bc2a838f7ca2f796d55f7c3dba16406e287d9b548eb68f1b384c"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingMesh.update (cyclomatic 24): StreamingMesh.update 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fff23c9cb41584279944050e8cb4e623b617f861786dadcb1b41a8ec06461a"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasedOverlayView.marqueeOrOrbitGesture (cyclomatic 24): ReleasedOverlayView.marqueeOrOrbitGesture 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0f2f42f864554556076c6999e81f24ddb30eb886b6073319fb273df9b6b41f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCommands.body (cyclomatic 24): DocumentCommands.body 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece7fa57997fd043a51e05ebf0d39b00455528fd8f53214d94acc00d587a4ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.documentScene (cyclomatic 24): EditorModel.documentScene 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"36da54c98392faaa9669ea61fdff509a5121608769d94dff58126a1ecc591df4"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingMesh.update (cyclomatic 24): StreamingMesh.update 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":"apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"399dd5b510f3b57a43aea8ad062e0e794ba81deb26337d0e3d44ef3285f3cb81"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCommands.body (cyclomatic 24): DocumentCommands.body 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":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c703825e36404cb95d3fab7ff60d10090352b918e2e07f98671afb439580416d"}},{"ruleId":"D1","level":"warning","message":{"text":"build.taskPage (cyclomatic 24): build.taskPage has cyclomatic complexity 24 (threshold 15). Of this number, 21 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b66f3d8d8fd781e75e34c6ee05f6ed7ec3c1b1235de986222746bf64f46a9f5"}},{"ruleId":"D1","level":"warning","message":{"text":"DrawingToolbar.DrawingToolbar (cyclomatic 24): DrawingToolbar.DrawingToolbar has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"40385d952b2666527d585f278ddd68af674af48e28b1666f231ef0054fc1be41"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchPlane3D.SketchCursor3D (cyclomatic 24): SketchPlane3D.SketchCursor3D has cyclomatic complexity 24 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 7 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"84df2c38cf08063a76333ae9a403f3bbc3bcca09808c6aeb81e9326ecaabdcee"}},{"ruleId":"D1","level":"warning","message":{"text":"CircuitAnalysisPanel.CircuitAnalysisPanel (cyclomatic 24): CircuitAnalysisPanel.CircuitAnalysisPanel has cyclomatic complexity 24 (threshold 15). Of this number, 18 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54680066242282d1aec27f569c066eb997b93fb915f41b6485cba18e62a9d32"}},{"ruleId":"D1","level":"warning","message":{"text":"sketch-math.computeSketchBounds (cyclomatic 24): sketch-math.computeSketchBounds has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 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":"packages/core/src/sketch-math.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"01da1f6643f7654cc010c1572227ea28241dba5e8c6bf1e426931b9709cbdd25"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.detectStaleNets (cyclomatic 24): ecad.detectStaleNets has cyclomatic complexity 24 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 10 belong to 6 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"02165dd7542f3c86fedb9216aec90fbd17a35abe052bbd7d55f37f381a21b5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.exportKicad (cyclomatic 24): ecad.exportKicad 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2016b1ec3fdb8df584412325129e5f123fdaf0a62e839f8432e180782ee82192"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.deletePcbElement (cyclomatic 24): ecad.deletePcbElement has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10117}}}],"partialFingerprints":{"codehealthFindingId/v1":"80300468f316adf932d6479459ba036abff54075df52148b09738a36d8410426"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.addMotorWinding::feedClear (cyclomatic 24): ecad.addMotorWinding::feedClear 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. This shape REPEATS in the file: one other method here (ecad.addMotorWinding) 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12102}}}],"partialFingerprints":{"codehealthFindingId/v1":"198315402559ce494f0e00ced38a1fceafffbf5032e9e55b965de7baa508f94f"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.findCavity (cyclomatic 24): ecad.findCavity has cyclomatic complexity 24 (threshold 15). Of this number, 23 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13350}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eca1bd297fb63676c6047ace5d0bec608011004b596317e91eda32257a7965"}},{"ruleId":"D1","level":"warning","message":{"text":"flat-pattern.flatPatternFromSolid (cyclomatic 24): flat-pattern.flatPatternFromSolid 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/flat-pattern.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d64aa0fb546ba0a1575e153c375fde50f44dd0712bd6407a1e09b8813addae4"}},{"ruleId":"D1","level":"warning","message":{"text":"infer.validateVCode (cyclomatic 24): infer.validateVCode 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/training/src/infer.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ea96cbfc3a58e4093031cb3abfb73fd2edf6b8911b53d1ddbe22b59466cc4f"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.program.command(\u0022infer\u0022).description(\u0022Generate VCode from a text prompt\u0022).requiredOption(\u0022-p, --prompt \u003Cprompt\u003E\u0022,\u0022Text d (cyclomatic 24): cli.program.command(\u0022infer\u0022).description(\u0022Generate VCode from a text prompt\u0022).requiredOption(\u0022-p, --prompt \u003Cprompt\u003E\u0022,\u0022Text d 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":"packages/training/src/cli.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"246455377fd83e405c20e4867d8994552fa45327622edf9d796be7689335590b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::migrate::migrate_v1_mapped (cyclomatic 23): vcad_app::migrate::migrate_v1_mapped 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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61adb78934061a3be067da00d291eaf6532f58a8647370b5496a0a6c8e6865f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::app::run_loop (cyclomatic 23): vcad::app::run_loop 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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c6ad3061210521c788f97a9ddca253b136e1740f23fb3a269ee28be396ab5d"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::ui::tree::render_sidebar (cyclomatic 23): vcad::ui::tree::render_sidebar 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":"crates/vcad-cli/src/ui/tree.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b301206ed17e3f1ce2875fdc293e77f8a973ecc59de6d7c84439321aad77b3d0"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseDiff::inner (cyclomatic 23): SparseDiff::inner 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":"crates/vcad-ecad-pcb/src/router/claims_ir.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee19a01139666eadbd2b51a17619fdc0c7fd66329322ec7e96220f488941ef"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::validate_and_commit (cyclomatic 23): vcad_ecad_pcb::router::auto::validate_and_commit 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaada3b0ecea88e1e99c95c0449c5199fc20bcb7b525d4f30f8378e51163713"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::flow::choose_sites (cyclomatic 23): vcad_ecad_pcb::router::flow::flow::choose_sites 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b816d77ad6136add29ba58ad1b03a3882c30745c49c8f02f014b7cd4ba2ee6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_sim::circuit::ac::build_and_solve (cyclomatic 23): vcad_ecad_sim::circuit::ac::build_and_solve 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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5945e682f550ecabf6b6d871be89b44221b5237fe3e7427d71ae03cbc4e82810"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::split_band_by_profile (cyclomatic 23): vcad_kernel_booleans::cyl_band::split_band_by_profile 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac610d8f9cb130dc767280dce0ff14920c0ddfbd2ea905fd40add4a4d331668a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::extract_regions (cyclomatic 23): vcad_kernel_booleans::cyl_band::extract_regions 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"127462cc62e4d5898a8d7ca48817068cbf0e08baacb01a09c06b09bc6a08ee56"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::freeze::freeze_circle_loops (cyclomatic 23): vcad_kernel_booleans::freeze::freeze_circle_loops 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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"553b3031233ce153a4a73515c9dab3771f1d5c943b431508a54c08758f901167"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::mesh::hex_fill_conforming (cyclomatic 23): vcad_kernel_fea::mesh::hex_fill_conforming 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891094a25447632daad866002d4850133f1bb8f46903b6cd4d9fc9986f0d4df"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_subset::is_plane_plane_chain_set (cyclomatic 23): vcad_kernel_fillet::fillet_subset::is_plane_plane_chain_set 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":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8db05fb65f1cf42f61f3f202bea304450e9c0bb488c581701a9bcd426e68fa"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_particle::electrode_opt::optimize_electrodes (cyclomatic 23): vcad_kernel_particle::electrode_opt::optimize_electrodes 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":"crates/vcad-kernel-particle/src/electrode_opt.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e4343d5ba32dd53f2944c930770195246d6ceacb15066bec10b697c3492dba"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_particle::poisson::solve_with_chamber (cyclomatic 23): vcad_kernel_particle::poisson::solve_with_chamber 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":"crates/vcad-kernel-particle/src/poisson.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4142968738f16b85ae41ad01d9a52a93527a4efc3ee487ad78aba119407590df"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sketch::revolve::revolve (cyclomatic 23): vcad_kernel_sketch::revolve::revolve 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":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48156176c86c14459c99bb46c87eff8b42f9879e44bebd0b4c6b25e63dd1bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_conical_face (cyclomatic 23): vcad_kernel_tessellate::tessellate_conical_face 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99c58e8fd0701ff781482ba90f8a3c2f65a0b68dfe08c12dddcc4186b533982"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::fastener::plan (cyclomatic 23): vcad_loon::fastener::plan 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":"crates/vcad-loon/src/fastener.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03ec0ff67dec78cb77cb9f3601446cf914be54bfba7464ea719887912453cd6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_printcheck::checks::check_walls (cyclomatic 23): vcad_printcheck::checks::check_walls 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":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b774df1d3bb14ca18458473df217461841c47c20e1f4dc19b154a4a307a539a6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_slicer::analyze::analyze_for_printing (cyclomatic 23): vcad_slicer::analyze::analyze_for_printing 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":"crates/vcad-slicer/src/analyze.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3585ebeadb4b121028e702b13e40d3727cd0990d67374796e1053cc53f4009"}},{"ruleId":"D1","level":"warning","message":{"text":"CNCOutline.parseDXF (cyclomatic 23): CNCOutline.parseDXF has cyclomatic complexity 23 (threshold 15). Of this number, 22 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":"apple/VcadApp/Sources/VcadApp/CNCOutline.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c0f5e73749af5eb62e6f65ae81119e1ef279133b57a95bb78478c5bca5b0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.navCommand (cyclomatic 23): EditorModel.navCommand 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":"apple/VcadApp/Sources/VcadApp/NavigationViews.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"095c40064cc7329e14e19f6d68fc1bb32e9c954aae265e37308697fb48210f2c"}},{"ruleId":"D1","level":"warning","message":{"text":"DockTools.design (cyclomatic 23): DockTools.design 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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2d29463b770cdfde43bee28da0998d5a9f9efadf5329cbb6865cef6f05fb45"}},{"ruleId":"D1","level":"warning","message":{"text":"print-flow-mockup.html.document.addEventListener(\u0022click\u0022) (cyclomatic 23): print-flow-mockup.html.document.addEventListener(\u0022click\u0022) 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, 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: print-flow-mockup.html.render (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/design/print-flow-mockup.html"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f99652ea47616e6634ca098b5d168fc855bbc08f45ae39c3d82a755affe4bd"}},{"ruleId":"D1","level":"warning","message":{"text":"build.paretoScatter (cyclomatic 23): build.paretoScatter has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1605, a function literal at line 1653, a function literal at line 1565, \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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"055fab187c6ace0a568483d3031cc29e963b0818ee7ff40f8e316ed5f62503f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewport.BoxSelectHandler (cyclomatic 23): Viewport.BoxSelectHandler 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 6 function literals inside it that branch (lines 155, 125, 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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb909f4c85d736478c70e68d80119accf7f4747a1c4f2a4969420affca0d0c6"}},{"ruleId":"D1","level":"warning","message":{"text":"RaytraceChip.RaytraceChip (cyclomatic 23): RaytraceChip.RaytraceChip has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 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":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"57379a4b2dfc8f0a3f8d77426dc2199bcbbc732d80bb1860c9da33f6c99e2b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"PrinterSelect.PrinterSelect (cyclomatic 23): PrinterSelect.PrinterSelect has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c16a674f2e58f3bc5e2e23c27e373354fa4f61f896d429edb6d87cb5135af3d"}},{"ruleId":"D1","level":"warning","message":{"text":"save-load.parseJsonVcadFile (cyclomatic 23): save-load.parseJsonVcadFile 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":"packages/core/src/utils/save-load.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea7018f4cfddda2a9448651eb7b0a71f3239311f50adff911f20ffe40815aea"}},{"ruleId":"D1","level":"warning","message":{"text":"pose.applyJointState (cyclomatic 23): pose.applyJointState 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/pose.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c0ffb0239f91d8ecfe04c8f572be41b1fe097df388fde1610febaaef9d1b61"}},{"ruleId":"D1","level":"warning","message":{"text":"measure.measureSweepResult (cyclomatic 23): measure.measureSweepResult has cyclomatic complexity 23 (threshold 15). Of this number, 20 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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c0bee9dc2c5db23261389b7b74898400e48d53d2cdbb00f4b77273a9579a5a"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.componentKeepouts (cyclomatic 23): ecad.componentKeepouts 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14008}}}],"partialFingerprints":{"codehealthFindingId/v1":"160c2edbccfb284cc6ff0201ea40cf0ac278bf5474814ae2029a35f190b3b0df"}},{"ruleId":"D1","level":"warning","message":{"text":"render.renderPcb (cyclomatic 23): render.renderPcb has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba21571b617ae01a76e6bc90c788657c73ab7550231df218bc4d296bcc58e04"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::input::handle_tool_input_key (cyclomatic 22): vcad::input::handle_tool_input_key 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fa614c1e466a69abb768455dfb3537ad7df8f6ce1dd315e5ab01016a2edd89"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::anchor_track_ends (cyclomatic 22): vcad::anchor_track_ends 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d0208cb2af1b3092198092e9c7d88aef0e8c803ca409c74bf8231574aa3c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::stitch_to_planes (cyclomatic 22): vcad::stitch_to_planes 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c293538ece71073d252a575316f00f9ea20cc8a8e8d13a05c39f8a41eb313b5"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::pour_synth::synthesize_outlines (cyclomatic 22): vcad_ecad_pcb::pour_synth::synthesize_outlines 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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"041694b7b957ec78186b44470f5433c26184483e6289dc959e2dea9ac6884164"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::route_batch (cyclomatic 22): vcad_ecad_pcb::router::auto::route_batch 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3284d1e62b79b703051f6055c04ffd89dfac534aed0721e3468ad4da4effbe"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_cylindrical_face_by_line (cyclomatic 22): vcad_kernel_booleans::split::split_cylindrical_face_by_line 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6050}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eb1017d388dd4de12e7ff9e3864e53d6bfca53069f4c237606fd69422084ce"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_dfm::geom::setups::plan (cyclomatic 22): vcad_kernel_dfm::geom::setups::plan 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":"crates/vcad-kernel-dfm/src/geom/setups.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2075c08f7c88144fd9f6fb53dac4a228f1dfe39b0ebfa089fae38d9963e8606"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r5_min_wall (cyclomatic 22): vcad_kernel_dfm::rules::hobby_mill::r5_min_wall 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"da617944ae1d83e11b8fa1b6ceb48454f112140ef9ac20d5e2b0bf52da60b1c9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_diff::implicit::implicit_terms (cyclomatic 22): vcad_kernel_diff::implicit::implicit_terms 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":"crates/vcad-kernel-diff/src/implicit.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b484334e077ca2992a1575429a48b51a6a8d67e6485af1606d2cec96a16c9bc"}},{"ruleId":"D1","level":"warning","message":{"text":"FvSystem::solve (cyclomatic 22): FvSystem::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":"crates/vcad-kernel-em/src/grid.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"4326fb94cad6a0511e3b28bd6bf51f1fdefa430edcbf116853e98b253fb0aaee"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_em::ac::solve_complex (cyclomatic 22): vcad_kernel_em::ac::solve_complex 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":"crates/vcad-kernel-em/src/ac.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c375b6bede3d092967d28e18ea24a3529549e3f719c5f33c13774116f2cdc2"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::section::check_beam (cyclomatic 22): vcad_kernel_fea::section::check_beam 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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"447db8b6a5dc0fdccdf654752492b7ba8946c1e57755aaa060d7cd40f8d43118"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_curved::fillet_edges_detailed_inner (cyclomatic 22): vcad_kernel_fillet::fillet_curved::fillet_edges_detailed_inner 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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9dbdcaea43e1a20a46a4c182dca68df26c3986917a2781b2b00133520cff26"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::revolved::build_revolved (cyclomatic 22): vcad_kernel_fillet::revolved::build_revolved has cyclomatic complexity 22 (threshold 15). Of this number, 21 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3452a1312a32aa9d0822d00f218111b7b43f89a9fc1dd26d069ee904e1c5e49c"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::delaunay_flip (cyclomatic 22): vcad_kernel_tessellate::delaunay_flip 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa497a01fe7efb87a45d666d5e8056a3d4e2143afc06a41a01876608e5d3ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_toroidal_face (cyclomatic 22): vcad_kernel_tessellate::tessellate_toroidal_face 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76df4bd83ba738c8ccf5170aace262883dc30ab480d4c79e19be11566922865"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_topopt::extract::extract_mesh (cyclomatic 22): vcad_kernel_topopt::extract::extract_mesh 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":"crates/vcad-kernel-topopt/src/extract.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c941a70a09b95271a809970bdbd33536a1643625fbc21acaff84a4bb7a41e672"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::handle_legacy (cyclomatic 22): Connection::handle_legacy 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecef08b1501dcf0d24c08ec6bd6ce1b2f54595a29c72975d04d15cf48bf54da"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::exact::candidate_circles (cyclomatic 22): vcad_render::exact::candidate_circles 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":"crates/vcad-render/src/exact.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c2f267cdfcf8b4207f4d24d58d7bcba1e476b411b751f20dc7a4dad7a08a79"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.tools (cyclomatic 22): EditorModel.tools 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3478a1e5828083abaf9008eafa63f0b6de5bcb11602063d59da4ce09bf5cc83"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.adoptRuntimeFrame (cyclomatic 22): EditorModel.adoptRuntimeFrame 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":"apple/VcadApp/Sources/VcadApp/DocumentRuntime.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b41d91b59bd87cc5179b23d26e43c13ad074e580f10b7cf249addf8a3c8057c"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.measurement (cyclomatic 22): EditorModel.measurement has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 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":"apple/VcadApp/Sources/VcadApp/Measure.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20c3cee0f1222d69630cfbbd9269b2b61558a00250499d946bc825ab5996fb"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchSession.lineTap (cyclomatic 22): SketchSession.lineTap 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: SketchConstraintKind.label (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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f9cff6f80e997f76fa588c5af0d4880845b257c12cbdd35dd56ca63c8733d8"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.tools (cyclomatic 22): EditorModel.tools 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"85875bd849a5dadeb486ff7b36f7e303c0a8f4d07473e8053b15184b92fab336"}},{"ruleId":"D1","level":"warning","message":{"text":"build.runPage (cyclomatic 22): build.runPage 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72107a0475ddea9fcedf1c94228be8d9dbbe292e85866abc29b9c84c9586c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"render-task-assets.main (cyclomatic 22): render-task-assets.main has cyclomatic complexity 22 (threshold 15). Of this number, 20 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":"mecheval/scripts/render-task-assets.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2cfab5532d1327875f3267bf9026e5f24d65b230e715c727fae5ae2de6591b"}},{"ruleId":"D1","level":"warning","message":{"text":"CompressedFieldOverlay.CompressedFieldHud (cyclomatic 22): CompressedFieldOverlay.CompressedFieldHud has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 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":"packages/app/src/components/CompressedFieldOverlay.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b5c186514df640e519142384a77018c543f15ac1cbb1041997ee78fa780c46"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineProperties.InlineProperties (cyclomatic 22): InlineProperties.InlineProperties has cyclomatic complexity 22 (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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2294a4ab05c1fd0209b0bfa628d83b0593119bab8a084f0ab3ffe96266dc72a"}},{"ruleId":"D1","level":"warning","message":{"text":"executors.tryExecuteViaEngine (cyclomatic 22): executors.tryExecuteViaEngine 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11f99ff6042f9e9e514826dfbe26907451dd515a0e45e0eb6674523f47d759e"}},{"ruleId":"D1","level":"warning","message":{"text":"clearance.computeGroupClearance (cyclomatic 22): clearance.computeGroupClearance 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5e8ec37a572849d692430bb6bf1e008a84508786228d970b66a1a091ba5f9e"}},{"ruleId":"D1","level":"warning","message":{"text":"claims-ledger.recordClaimMeasurements (cyclomatic 22): claims-ledger.recordClaimMeasurements 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1223ef61ac2ac7c7fe04fad9274f8f6341f8099d06f39d69c09a388893203e85"}},{"ruleId":"D1","level":"warning","message":{"text":"print-check.recordMeasurement (cyclomatic 22): print-check.recordMeasurement 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":"packages/mcp/src/tools/print-check.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3234d15b49e8651eca02c678225a053ca0766a9beab7bebca77ad765ee818f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"loon.hasRootWithoutMaterial (cyclomatic 22): loon.hasRootWithoutMaterial has cyclomatic complexity 22 (threshold 15). Of this number, 19 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"106c18c744e03659db0ee01c1629cdcb50b2b3fabac498fd68eee7ea0d284ca8"}},{"ruleId":"D1","level":"warning","message":{"text":"trust-boundary.checkCommerceBoundary (cyclomatic 22): trust-boundary.checkCommerceBoundary 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":"packages/mcp/src/trust-boundary.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4c2cca43d6d4d0714951672b34d9df476c89fc82706542ebe1577195a3e93c"}},{"ruleId":"D1","level":"warning","message":{"text":"part-stock.annotateBomStock (cyclomatic 22): part-stock.annotateBomStock 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd21b86130898f92368b3f25eb9d044d483d519a9172210fa2b543cfb8a1b998"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.aggregateDrc (cyclomatic 22): ecad.aggregateDrc 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d08925cd41691199061af574eef33946e9105f6f9ddb12a53637d07d6d4903e"}},{"ruleId":"D1","level":"warning","message":{"text":"Key::parse (cyclomatic 21): Key::parse 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":"crates/vcad-app/src/keybinding.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1dca304e574868e1f0475e505a7e69d8c438c3ccb578758db04495eebe8c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_app::ecad_tools::sync_schematic_data (cyclomatic 21): vcad_app::ecad_tools::sync_schematic_data 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":"crates/vcad-app/src/ecad_tools.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b80e3b15dd06d942a076044286450f25b005027ff7b9f19b49c6d286eb6c20"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::meander_pair_skew (cyclomatic 21): vcad_ecad_pcb::router::meander_pair_skew 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":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"137471eb9ed84c87ca8966a4b48ad39b109960763fa5a3ed292b3fb584a5b7a8"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::try_commit (cyclomatic 21): vcad_ecad_pcb::router::flow::route::try_commit 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"032baa753b01b448a46157469e435b9521e04c08decc05121390663886c1e109"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel::sheet_fold::folded_sheet_solid (cyclomatic 21): vcad_kernel::sheet_fold::folded_sheet_solid 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":"crates/vcad-kernel/src/sheet_fold.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d451ccbd83adecc28987048526c26f9707585daeadabd5ea3552d1d99ccdef"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_cylindrical_face (cyclomatic 21): vcad_kernel_booleans::split::split_cylindrical_face 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3f3d8196833aa20f1fcab327c6f35fa5be76f93bc441aaf72da57976a99855"}},{"ruleId":"D1","level":"warning","message":{"text":"Envelope::path (cyclomatic 21): Envelope::path 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":"crates/vcad-kernel-cam/src/turning/envelope.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"164c2cf5afef9e3814f39225fcb464538e1be743749d33cc3e71de4034a968a8"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_dfm::rules::cnc::run (cyclomatic 21): vcad_kernel_dfm::rules::cnc::run 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":"crates/vcad-kernel-dfm/src/rules/cnc.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eae1d27e027c8f6b367e1436692d82a914a291b3203fc92b0590091da555f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::link_loops (cyclomatic 21): vcad_kernel_dfm::rules::hobby_mill::link_loops 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"086eba38b80f4419ce8ef7c8f373a4026f85bd23f6350e0487c905513344355a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_drafting::section::intersect_triangle_with_plane (cyclomatic 21): vcad_kernel_drafting::section::intersect_triangle_with_plane 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4a5127eaba6f9b9cfef7093b0285e149b24b7f4e98081078f6445c25dc5e22"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellCase::validate (cyclomatic 21): ShellCase::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":"crates/vcad-kernel-fea/src/shell.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cb36786172258d5b05c10900f67981fac06fb148c50ab8fc62feb1835898a9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_subset::fillet_plane_chain_edges (cyclomatic 21): vcad_kernel_fillet::fillet_subset::fillet_plane_chain_edges 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":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1645a073d8fcd6780b4a47898ab90c1362307e995693ae7d5e7dde1c633485c7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_naming::profile::seed_extrude_names (cyclomatic 21): vcad_kernel_naming::profile::seed_extrude_names 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":"crates/vcad-kernel-naming/src/profile.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0cdc3facf2639fd71c1ae537f96ab494497ee8ed8177762b8bb4376e774698"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::ear_clip_triangulate (cyclomatic 21): vcad_kernel_tessellate::ear_clip_triangulate 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"506713cde5b77b79f1dce6849c663b7ec881b865b62796d0b1d9bae3c91ec9fa"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::recover::recover (cyclomatic 21): vcad_loon::recover::recover 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":"crates/vcad-loon/src/recover.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f465d7cf79e904305e2fe7409a910419d111e458975604b781e29b602ec86aee"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::call_tool_inner (cyclomatic 21): Server::call_tool_inner 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac76c068d13ef565f770d779d2164963ba746a51ff9828c1fd1b0045268a615a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_render::run (cyclomatic 21): vcad_render::run 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":"crates/vcad-render/src/main.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4c0ca1e1a0d787e7016029aec648f3d90cb94bf1a73740e0993ec736892865"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.beginManip (cyclomatic 21): EditorModel.beginManip 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"509f335fac6e82fa21ea8a593952e935918deda2b992db0d0306c35e0b505250"}},{"ruleId":"D1","level":"warning","message":{"text":"BoardPainter.draw (cyclomatic 21): BoardPainter.draw 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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"932b07739a8368cebe05251f029dddc66181d88e08760066bbf9517b48e1e57c"}},{"ruleId":"D1","level":"warning","message":{"text":"build.main (cyclomatic 21): build.main has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9535337e2b91ae22e93ef71ee133edb48521899f1d1191817e150981f9a879"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.component (cyclomatic 21): launch.component 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":"packages/app/public/launch/launch.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb1e70a865989869ac313413e5c68b3893a4ecb63e1c59dcd250f1f4a069a21"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentPicker.DocumentRow (cyclomatic 21): DocumentPicker.DocumentRow has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9cdd769479c8197080e53ce12d2b9cf852e711cad9d5c947d7ec92749cba82"}},{"ruleId":"D1","level":"warning","message":{"text":"slicer-worker.onmessage (cyclomatic 21): slicer-worker.onmessage 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":"packages/app/src/lib/slicer-worker.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"980b7d21d6e2e56c680866f16a87f7abce7b10ec26b53dbf238b99108a84706f"}},{"ruleId":"D1","level":"warning","message":{"text":"registry-dispatch.engineArgs (cyclomatic 21): registry-dispatch.engineArgs 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b824e5c53409aa56428e01e8c1b677d35af786e801e3851421d8e526df827f"}},{"ruleId":"D1","level":"warning","message":{"text":"registry-dispatch.sameUnderSerdeDefaults (cyclomatic 21): registry-dispatch.sameUnderSerdeDefaults has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 belong to one function item 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1d0e0e7b2a03527473d36a9a50ac0bcb32b78755903cab63d7e686b08b2d90"}},{"ruleId":"D1","level":"warning","message":{"text":"topopt.topologyOptimizeTool (cyclomatic 21): topopt.topologyOptimizeTool 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":"packages/mcp/src/tools/topopt.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"63819d219406671f75dfd718fce05d652bda54873c5e776dd9717153d8c638bf"}},{"ruleId":"D1","level":"warning","message":{"text":"gym.gymStep (cyclomatic 21): gym.gymStep has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs 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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"773600f1004a55fe51d0d0d650a1bbd8ea44250f43d3baf4bbd2808d5840c2f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.summarizePlacementDrc (cyclomatic 21): ecad.summarizePlacementDrc has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5586}}}],"partialFingerprints":{"codehealthFindingId/v1":"28421772351cf064f4193062c2f699429b2ded71d930c5b45c5d17c6e06fc924"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.validateForFab (cyclomatic 21): ecad.validateForFab 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6607}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c5ab76a82528d3ca0499fc3c5bde13c15893055a80f1dd3de4b5760d59cbd6"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.setStackup (cyclomatic 21): ecad.setStackup 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9642}}}],"partialFingerprints":{"codehealthFindingId/v1":"b121359131caf41cfe63cff308e023aeec1cc20a2a757a2d2ebbc111ffdd7dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.addNetTie (cyclomatic 21): ecad.addNetTie 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf39a37b6429cbfb65034c5e57a4feeedb2762fd34e73165b0c47754ded945a"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.checkSelfStart (cyclomatic 21): ecad.checkSelfStart 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbb48683e6e132f4863f63e67cca3e78a0f332c0dff85e1073ad1664fc27648"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.traceGridBoundaries (cyclomatic 21): ecad.traceGridBoundaries has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13191}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b88809970a32fbdd692085792972a04b3725aab77727f9e39f94e7c01ed7c5"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.component (cyclomatic 21): gallery.component 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":"www/public/kit/gallery.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a6f4b7217994170be76c1662d7a08cb7d0af162b2cd47144d2e4222d56cbef"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::ui::toolbar::draw_toolbar (cyclomatic 20): vcad::ui::toolbar::draw_toolbar 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":"crates/vcad-cli/src/ui/toolbar.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"003ec51f1eecf5850410300f6fed1910e8a8cd3373d890f159b3d10003ae09a4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::drc::detect_shorts (cyclomatic 20): vcad_ecad_pcb::drc::detect_shorts 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f01b2021e8ee113fa9bda91c7c6233660a0b9d160b5640d45b49eb2bfa606b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::cdt::layer_obstacles (cyclomatic 20): vcad_ecad_pcb::router::flow::cdt::layer_obstacles 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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dec060c1b2f1885169ccdaf7b178ee95e4a42455a8651549157d7c7f83b7591"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::human::human_load (cyclomatic 20): vcad_ecad_pcb::router::flow::human::human_load 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":"crates/vcad-ecad-pcb/src/router/flow/human.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0b5ffeb3f60384f93fc649e617407ca9824c347a1721ddf0ca8a31dbf9d473"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_sim::circuit::netlist::parse_si_value (cyclomatic 20): vcad_ecad_sim::circuit::netlist::parse_si_value 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":"crates/vcad-ecad-sim/src/circuit/netlist.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb09cbdd3e9b21ccd384ced312c8e26f456d06b3e33e05edec55ff85a62bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::sim_extract::tolerance::extract_stackup_spec_from_scene (cyclomatic 20): vcad_eval::sim_extract::tolerance::extract_stackup_spec_from_scene 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":"crates/vcad-eval/src/sim_extract/tolerance.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9e634b099cc37305fa10604bb84096400651d798ad0f7d33f5f1877fb40e61"}},{"ruleId":"D1","level":"warning","message":{"text":"Solid::resolve_face (cyclomatic 20): Solid::resolve_face 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4108e66b66220174b14ce9b2d1c7fd7690bbf1812f91ec0d20956324eed4e941"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_acoustics::instrument::modal (cyclomatic 20): vcad_kernel_acoustics::instrument::modal 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bda10d5461e237faaf590ff8f066525835c3498007b5eb882c74643771d6d4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::parse_band (cyclomatic 20): vcad_kernel_booleans::cyl_band::parse_band 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7baeeb953cae56139a504c0a678a2dcb5dc3b7421928f88fb3f540a93df606e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::clip_spherical_face_multi (cyclomatic 20): vcad_kernel_booleans::split::clip_spherical_face_multi 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4542}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2897e81424cfce3b15af22228d3ba6757d6aa61633040cd34658010deb0af96"}},{"ruleId":"D1","level":"warning","message":{"text":"Simulation::step_te (cyclomatic 20): Simulation::step_te 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d078f379ed1f3edf7a4e89f49f9fa7f8b5d1c827bbd8461ac54ce35bc691164"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_small_arc_fan (cyclomatic 20): vcad_kernel_tessellate::tessellate_small_arc_fan 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"937d1914502b43bb2584db4bf779a3c17437d796b08ec860b8ab2161a53955c4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_thermal::thermocouple::reduce_log (cyclomatic 20): vcad_kernel_thermal::thermocouple::reduce_log 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":"crates/vcad-kernel-thermal/src/thermocouple.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"014efdd8c30097bae85672564fbf50ddcdfd254f5320ad7d2af0f3a70cc3e1b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Solid::text_extrude (cyclomatic 20): Solid::text_extrude 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b444360c9293b5476ff5f1a98e473bf7fe2dd1ad3e0d55271fc92d79821b418"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::convert::merge_value_into_doc (cyclomatic 20): vcad_loon::convert::merge_value_into_doc 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d6f2741035f021a33e3bd439e6162a2206b5887ba51d11306f4239b1ba8bae"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_runtime::run (cyclomatic 20): vcad_runtime::run 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":"crates/vcad-runtime/src/lib.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55f24d21381ce023f09f2a750e5727d9e6e5b2753d0ccea153426e831b504d1"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.assemblyScene (cyclomatic 20): EditorModel.assemblyScene has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4b5ddd05f13aa7626ad87be4583ff20edbec88b8f3d3bb3da84f77613e717b"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureRowView.row (cyclomatic 20): FeatureRowView.row 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. This is NOT this file\u0027s highest cyclomatic complexity: FeatureParamEditors.editors (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9155fbb64f42bc116853fdfdc0290d07a7c139090c8adce67366608fd6410c"}},{"ruleId":"D1","level":"warning","message":{"text":"SmartDimension.plan (cyclomatic 20): SmartDimension.plan 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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3663c77d65f71ded3232ab6244432aba39f03516fdf70e82b631a3c36ddce6d8"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchFill.triangulate (cyclomatic 20): SketchFill.triangulate has cyclomatic complexity 20 (threshold 15). Of this number, 18 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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc69c9e685aa5ba3e2a764e816788f6aa27c212144d199e49c6830718a9a769"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorView.body (cyclomatic 20): InspectorView.body 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bebc295142d0a68ef089c76107cd7f3049dea4c89317da1ed532d381fd475a"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.assemblyScene (cyclomatic 20): EditorModel.assemblyScene has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e2807ab9238bb27b823777661be0a499eec20e350f9f80d88bb2fcf6fd05e7"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureRowView.row (cyclomatic 20): FeatureRowView.row 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. This is NOT this file\u0027s highest cyclomatic complexity: FeatureParamEditors.editors (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b2934dcadc1ac5454726f4001b38feb1d5100124c2820738ca1987dbab94c4"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorView.body (cyclomatic 20): InspectorView.body 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":"apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"292ed08ee2fa9965675f2d37badab62403822766773bc6aa44afb5ea62cebe4f"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-mcp.makeClaudeMcpSolver.solve (cyclomatic 20): claude-mcp.makeClaudeMcpSolver.solve has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb53f6316f2d822437b60360e6a4a37ac703b7cbf9514d602eb2c908567cb5cf"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway-mcp.makeGatewayMcpSolver.solve (cyclomatic 20): gateway-mcp.makeGatewayMcpSolver.solve has cyclomatic complexity 20 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/solvers/gateway-mcp.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b63fb6bd996b8e2e46cf84da47ecd8d994a60557c86dd655f33ade11b159365"}},{"ruleId":"D1","level":"warning","message":{"text":"engine-host.handleEngineRequest (cyclomatic 20): engine-host.handleEngineRequest 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":"packages/engine/src/engine-host.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b300382c8778ab0165279ea4d453bddd6e084f37d42852548f67f5e9472bded"}},{"ruleId":"D1","level":"warning","message":{"text":"preview.generateGlbPreview (cyclomatic 20): preview.generateGlbPreview 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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"117cfbfedf5a7d979943ca22ce998f3439e2be61d9c0a99213067b079020274d"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.calcRf (cyclomatic 20): ecad.calcRf has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31bd31b634dc6210584aee8a4d964ba30d51b07231a688ea7213c2aa0bb142d"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalCaps::detect (cyclomatic 19): TerminalCaps::detect 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":"crates/termview/src/terminal.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8260481e55e0405f87bd2806cd03877c6aef6321c03dade616b59609c32446c3"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_atoms::optimize::optimize_parameters (cyclomatic 19): vcad_atoms::optimize::optimize_parameters 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":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad14a1c3d9088f71269bc9dc41edeb9021858632faeccd2f4a13cb538c5bf742"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::input::hit_test (cyclomatic 19): vcad::input::hit_test 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f018ab87ed0d1390794b18753c66b85b5cbb38728380c3106c3abcdbf9d4f89"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::ui::viewport::render_viewport_braille (cyclomatic 19): vcad::ui::viewport::render_viewport_braille 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":"crates/vcad-cli/src/ui/viewport.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e243687c2a8c7414b2e62dd2f507f2bc3b4a6f0478c1c8ef25a054a5dd69eab"}},{"ruleId":"D1","level":"warning","message":{"text":"GridRouter::route_net (cyclomatic 19): GridRouter::route_net 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":"crates/vcad-ecad-pcb/src/router/grid.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"64367a04ffb73cb5ad1d4a1c996e65f7e70dc41029ade237773efbdd6c7ac3e6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::drc::detect_unstitched_pads (cyclomatic 19): vcad_ecad_pcb::drc::detect_unstitched_pads 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc0f52f6483e53bfff599fa2eea29b76f684559c7cb7efdccc37f07f26a423e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::plan_microvia_fanout (cyclomatic 19): vcad_ecad_pcb::router::auto::plan_microvia_fanout 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7322f620f43eb4a28c6d8266164399d5f6e247ce11e66e18587894ae334b12"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::descent::descend_pair_mined_pinned (cyclomatic 19): vcad_ecad_pcb::router::descent::descend_pair_mined_pinned 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c99d91ebf12abcce7c428636e12d6b2c816249d92c32bf4a354f889fe8648c"}},{"ruleId":"D1","level":"warning","message":{"text":"CircuitEnv::attempt_step (cyclomatic 19): CircuitEnv::attempt_step 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":"crates/vcad-ecad-sim/src/circuit/mod.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8b54bc4caf71aea5b6ff7ca78f9a8cd3e108f04351f616e0b2b5bd5c9c1f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::sim_extract::chamber_cavity (cyclomatic 19): vcad_eval::sim_extract::chamber_cavity 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dcc0e01d57fe905d05d9e8cfecadbe0ee8ca2d7bb50ffa539f88dc29577161"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::train::vcad_train_start (cyclomatic 19): vcad_ffi::train::vcad_train_start 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc8cd850b0f5a79aea73c4caeee438d9cc06009bf031211a3d76fa0c2daad3"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_antenna::nanovna::parse_s1p (cyclomatic 19): vcad_kernel_antenna::nanovna::parse_s1p 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":"crates/vcad-kernel-antenna/src/nanovna.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fa6ee3a48e72665fb2ceaac9bfba257aef8c995e7b2bf65288261a70e4029e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::envelope_chain (cyclomatic 19): vcad_kernel_booleans::cyl_band::envelope_chain 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1e331e9acc692277f56783158d0f46d8a17d9f1a9356b3d40569871095989"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::no_crossing::point_in_brep (cyclomatic 19): vcad_kernel_booleans::no_crossing::point_in_brep 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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f9d9fc1955501eb4974b6455d6b0c8f4e5cfc9b9fd4e24f683d01111cb70c8"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_inscribed_circle (cyclomatic 19): vcad_kernel_booleans::split::split_planar_face_inscribed_circle 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"796fb39b1371fba81dc2d462f95a5080bd0e5f689617c8e9fd575eb8f77fba93"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_thin_face_at_curve_vertices (cyclomatic 19): vcad_kernel_booleans::split::split_thin_face_at_curve_vertices 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":7137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaf7044e5e81211dcdebd4f6ecf0a867216fca3f8afd3abf9817fd7f7cd017f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::trim::project_point_to_uv (cyclomatic 19): vcad_kernel_booleans::trim::project_point_to_uv 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c5be47397ab717be6d5f13fda96b20ce7b59bde1879892f538eceac45ff1fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Loop::new (cyclomatic 19): Loop::new 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d70ee709bc6d7943aa673da3352f989adc60c7da257c829c5cf0522876924ce"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::union_segments (cyclomatic 19): vcad_kernel_dfm::rules::hobby_mill::union_segments 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9927403a37cf710ffabcb27de771985142a625bbde135fcf8ad89734c9b3dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_drafting::hidden_line::merge_collinear (cyclomatic 19): vcad_kernel_drafting::hidden_line::merge_collinear has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (subtract, union). 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":"crates/vcad-kernel-drafting/src/hidden_line.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4068ea51ff58ed5f9dfe1a0bc3ed2e095f7fef74e9d4b09be0431d2429785c"}},{"ruleId":"D1","level":"warning","message":{"text":"Electrostatics::solve (cyclomatic 19): Electrostatics::solve 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":"crates/vcad-kernel-em/src/electro.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"910feb2f0ef4edc0e665c6f44d327c9cfaabda5641514cc7055f939a7b3e61b4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_enclosure::mesh::extract_standoffs (cyclomatic 19): vcad_kernel_enclosure::mesh::extract_standoffs 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":"crates/vcad-kernel-enclosure/src/mesh.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08f9eebbf514e2bbea804b5689f72af7e19edce6c59c09dbf64ca0a3abb6d69"}},{"ruleId":"D1","level":"warning","message":{"text":"Profile::validate (cyclomatic 19): Profile::validate 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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb410642ed92c2c5be365d48d6ad219a11287f4bda8b20fb674704fd488aee8c"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::graph::device_assembly (cyclomatic 19): vcad_kernel_fea::graph::device_assembly 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":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2ae6803868c68c0f2dedb0222b04b3609481995ddc69a4c4bcf6dc795a70ed"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::blend_loft::resolve_edge_query (cyclomatic 19): vcad_kernel_fillet::blend_loft::resolve_edge_query 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":"crates/vcad-kernel-fillet/src/blend_loft.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"defe025c58f58564d697db6c3eb97d40168347e38cf0b6f81942ba8e6d734e4a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_naming::resolve_edge (cyclomatic 19): vcad_kernel_naming::resolve_edge 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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82b58aff0f7d01016fbb227daf8608c295a6905416c9d124729a9e44d53e30a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_particle::chain::run_from (cyclomatic 19): vcad_kernel_particle::chain::run_from 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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d898aac0b6987845c84f2902fb5c4136efc6283c0237efc3b4d1b4e3f903f6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sheet::manufacturability::check_manufacturability (cyclomatic 19): vcad_kernel_sheet::manufacturability::check_manufacturability 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":"crates/vcad-kernel-sheet/src/manufacturability.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4de1b76ab00a43de3ec16d7e7977f2376f7377881047762cf7d52b45cbf58b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::refine_outer_polygon_for_holes (cyclomatic 19): vcad_kernel_tessellate::refine_outer_polygon_for_holes 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"51599c6739f44a145a5c54fb04a242f0141c5c84e7bbe9a69a2a443057f87e22"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_spherical_face (cyclomatic 19): vcad_kernel_tessellate::tessellate_spherical_face 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3ab445f5df2991e5259af0a4f0a2533cbc85bca234593dd6810d0a1be3abbd"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::flip_sliver_triangles (cyclomatic 19): vcad_kernel_tessellate::flip_sliver_triangles 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5415}}}],"partialFingerprints":{"codehealthFindingId/v1":"995c0d17e62dfafcd06fc2977c2832efa29a8c216153508e5a86de907d4f4328"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::mesh_ray::strip_membranes_once (cyclomatic 19): vcad_kernel_tessellate::mesh_ray::strip_membranes_once 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":"crates/vcad-kernel-tessellate/src/mesh_ray.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4117628021e3178d6c5d85d1aa5e3a750a8474f43a915d9d65cf0a79ef6d64"}},{"ruleId":"D1","level":"warning","message":{"text":"Stackup::validate (cyclomatic 19): Stackup::validate 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":"crates/vcad-kernel-tolerance/src/stackup.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecddc66d4e2214e4ddcf9d39d6d268df2216cfb8695892d47138f49349962cb"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceHeader.body (cyclomatic 19): WorkspaceHeader.body 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":"apple/VcadApp/Sources/VcadApp/CNCStudio.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4b5e62487f50c07fe3c7bf694cd652061f93aec22a9e6c75c63abb25e57cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.placedSpurGear (cyclomatic 19): EditorModel.placedSpurGear has cyclomatic complexity 19 (threshold 15). Of this number, 18 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":"apple/VcadApp/Sources/VcadApp/Gears.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7591cbda8cb8e1fd4845d4bc425fa45bdca07072af0ef1389adf5e3418b64b"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsWorkspace.annotate (cyclomatic 19): ElectronicsWorkspace.annotate has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"57761421556f2e83dc537f566d7896b93b85a8d5f189c973024822af5f3618b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasedOverlayView.commitTopologyMarquee (cyclomatic 19): ReleasedOverlayView.commitTopologyMarquee 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"068dccadd5cdfbb31b8e574ed6be9f5dd515a3d639ea51a2063b637dcf84ddae"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchSession.dimensionTap (cyclomatic 19): SketchSession.dimensionTap 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. This is NOT this file\u0027s highest cyclomatic complexity: SketchConstraintKind.label (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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b805b00dec16b7d20dd58b8fc01127efeff98c7593080b3b2a53e7f28ae6a0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"solver.getSolver (cyclomatic 19): solver.getSolver 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":"mecheval/harness/src/solver.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad7ca7af2e014ebf7be211480e3166ca74ed82c7f24fe10d2287a3cb0795699"}},{"ruleId":"D1","level":"warning","message":{"text":"Header.Header (cyclomatic 19): Header.Header 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 6 function items inside it that branch (a function literal at line 375, handleExport, a function literal at line 415, \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":"packages/app/src/components/Header.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed70e0951018a9ddff3f1485c987a7da0ccf7a1c7450e0d8210fb5d846adfbc"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsPanelHeader.ElectronicsPanelHeader (cyclomatic 19): ElectronicsPanelHeader.ElectronicsPanelHeader 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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd1f54e8a29616cdb0ff4829f2f6b828981b6b3be41a2a750b0a3918de02930"}},{"ruleId":"D1","level":"warning","message":{"text":"toolbar.MoreDropdown (cyclomatic 19): toolbar.MoreDropdown has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 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":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62902a0f21c7dbd7bb3f2eef756012d60a7528b79e3430638960ba32c8ef481"}},{"ruleId":"D1","level":"warning","message":{"text":"useBackgroundLuminance.useBackgroundLuminance (cyclomatic 19): useBackgroundLuminance.useBackgroundLuminance 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 4 function literals inside it that branch (lines 17, 90, 94, \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":"packages/app/src/hooks/useBackgroundLuminance.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5321875df95d4e257ddd0c7262f766ec21662f0ea6621c4b3f328c091c377d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"useElectronicsSync.useElectronicsSync (cyclomatic 19): useElectronicsSync.useElectronicsSync has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 110, 104, 41, \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":"packages/app/src/hooks/useElectronicsSync.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70b061fc38e5b1cf70415c091d4ece69febfd1f0a86201d070ddcab6f8d8495"}},{"ruleId":"D1","level":"warning","message":{"text":"ui-store.useUiStore (cyclomatic 19): ui-store.useUiStore 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 14 function literals inside it that branch (lines 426, 474, 556, \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":"packages/core/src/stores/ui-store.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7095deae76f37947fb67758d626647fc693b22346c6b42c0734706eff89df5c"}},{"ruleId":"D1","level":"warning","message":{"text":"executors.executePlacePart (cyclomatic 19): executors.executePlacePart 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25e0129e8b259fd643d2ba53309aaaf85a3d6b75a0f872c87b1a250415c5127"}},{"ruleId":"D1","level":"warning","message":{"text":"chat-store.useChatStore (cyclomatic 19): chat-store.useChatStore 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 9 function literals inside it that branch (lines 402, 464, 371, \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":"packages/core/src/stores/chat-store.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e511b31b88d5d7031450ca02eac5e7be73f82aaeb88d2222250f3d52cfe84"}},{"ruleId":"D1","level":"warning","message":{"text":"receipt-unified.unifiedFromSpec (cyclomatic 19): receipt-unified.unifiedFromSpec 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":"packages/mcp/src/receipt-unified.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"61af583d9010e9657c0f3fbfc7d3b5344168d843051ef3bd31b9da239c925ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"registry-dispatch.snapshotParts::canon (cyclomatic 19): registry-dispatch.snapshotParts::canon 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8f3e5ef9d8756cc3bfaa31e02b408bc43d312b0ceae93856da4fed080d754d"}},{"ruleId":"D1","level":"warning","message":{"text":"loon.addLoonToSession (cyclomatic 19): loon.addLoonToSession has cyclomatic complexity 19 (threshold 15). Of this number, 18 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7908e8c757d1220b9683db48a0428c4d0c835894341f00ad9cd2051d395655"}},{"ruleId":"D1","level":"warning","message":{"text":"parts.placePartTool (cyclomatic 19): parts.placePartTool 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":"packages/mcp/src/tools/parts.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8606f9f1d32ba6fd223f58fe53f2593e558834b24c0bc0d8f5a180924a2ce0dd"}},{"ruleId":"D1","level":"warning","message":{"text":"acoustics.simulateStrike (cyclomatic 19): acoustics.simulateStrike 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":"packages/mcp/src/tools/acoustics.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f6b58422649ebb7c9c576d1283bf384c31ce0c3a760032f7e653d4e74adc04"}},{"ruleId":"D1","level":"warning","message":{"text":"server.slimPreviewForInlineUi (cyclomatic 19): server.slimPreviewForInlineUi 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/server.ts"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"277e524877f9425c05ebdb1a458209085cee5769e6b2c572db487d55b33df404"}},{"ruleId":"D1","level":"warning","message":{"text":"server.resolvePreviewDocumentId (cyclomatic 19): server.resolvePreviewDocumentId 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":"packages/mcp/src/server.ts"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"538de9814d8fa56573d8f476dbb35536763510bc4b6d89159e962a1a96b8a283"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::ui::welcome::render_card (cyclomatic 18): vcad::ui::welcome::render_card 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":"crates/vcad-cli/src/ui/welcome.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0389506021796208746e7059d2f84900599d55c9c6463d2c891736c842392a39"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_fabprep::render::fab_notes (cyclomatic 18): vcad_ecad_fabprep::render::fab_notes 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":"crates/vcad-ecad-fabprep/src/render.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b98467cc5eb7239e1813df6de026c4f5697ea97b02d64344beaf4b67f4ce661"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::ratsnest::copper_groups (cyclomatic 18): vcad_ecad_pcb::ratsnest::copper_groups has cyclomatic complexity 18 (threshold 15). Of this number, 17 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":"crates/vcad-ecad-pcb/src/ratsnest.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2e326b15babbbb2412694f129ed0f17ba22af64a4e14246fc5ffa9e680c3be"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::stitch_planes (cyclomatic 18): vcad_ecad_pcb::router::auto::stitch_planes 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4399}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6ecd230c1bad94440d1298c511235eea6ee23874627e144a05e0df8896c1ce"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_sim::circuit::dc::operating_point (cyclomatic 18): vcad_ecad_sim::circuit::dc::operating_point has cyclomatic complexity 18 (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":"crates/vcad-ecad-sim/src/circuit/dc.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29fd6e29907040c122fbda69f781a0238ffd9e77eed27314290bac541f9ca59"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::evaluate::evaluate_text_extrude (cyclomatic 18): vcad_eval::evaluate::evaluate_text_extrude 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: vcad_eval::evaluate::op_name (cyclomatic 43) 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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2390}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b94532f37f01795d4c2ae83a4bc100da8f1154dbf26a935ff3cd21c2ca7837"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::sim_extract::em::rev_section (cyclomatic 18): vcad_eval::sim_extract::em::rev_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":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"daecd46602105015de5e1942a8db66fe3a1379d930a151439af347de118d09e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Roughing3D::generate_level_passes (cyclomatic 18): Roughing3D::generate_level_passes 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":"crates/vcad-kernel-cam/src/operation/roughing3d.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"458f4f361f69ce85648c930b6d54f0bdf61f23ad89c0fe5e657ca37f1ee0f55b"}},{"ruleId":"D1","level":"warning","message":{"text":"Probe::new (cyclomatic 18): Probe::new has cyclomatic complexity 18 (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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1789ab8e3d988a7a5d9d51e0b9dde69c9029f16f3577c038af1a7a748a879a8"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowModel::inlet_hydraulic_diameter_mm (cyclomatic 18): FlowModel::inlet_hydraulic_diameter_mm 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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d4b8c4929d21a4aa2d7cba6e04fb8d231eb210898ebdd8d9d7f04eae31c9e2"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_gpu::wavefront_batch::distance_fields_batch_async (cyclomatic 18): vcad_kernel_gpu::wavefront_batch::distance_fields_batch_async 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":"crates/vcad-kernel-gpu/src/wavefront_batch.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd999d222569d8c2f5561fb97c51d64ba65e274b30cbc12f656510a4a91a50e"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceSpec3d::parameter_roles (cyclomatic 18): DeviceSpec3d::parameter_roles has cyclomatic complexity 18 (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":"crates/vcad-kernel-particle/src/spec3d.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbbbcef20fd239a137ded93c8392cb138fcc52fa85894ab10086e55b42df319"}},{"ruleId":"D1","level":"warning","message":{"text":"PhysicsWorld::ground_contacts (cyclomatic 18): PhysicsWorld::ground_contacts has cyclomatic complexity 18 (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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f90e17c28145e6e823b1dbcc56edc0329fa3fafcca578c52508d915cb361ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sheet::poly2d::splits_from (cyclomatic 18): vcad_kernel_sheet::poly2d::splits_from 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":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"59595050b93c494f3d9decea54125d4535379f4f20f4bba7bed6ffb375a8fecd"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_shell::compute_offset_vertex (cyclomatic 18): vcad_kernel_shell::compute_offset_vertex 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74d8108f87275f19e49c5215bcc37f1dc6fa3cb644d6cafa70df54d5f0c1488"}},{"ruleId":"D1","level":"warning","message":{"text":"StepWriter::write_loops (cyclomatic 18): StepWriter::write_loops has cyclomatic complexity 18 (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":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc9f3867b51494a5b34dadac05f0281de19e0609bddacadc8809151c137374b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_step::reconstruct::circle_fit (cyclomatic 18): vcad_kernel_step::reconstruct::circle_fit 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":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7906604898e660e398e227884fd2b573ed320fa901b9241b5458bcc6ef6d3967"}},{"ruleId":"D1","level":"warning","message":{"text":"MeshRayIndex::new (cyclomatic 18): MeshRayIndex::new has cyclomatic complexity 18 (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":"crates/vcad-kernel-tessellate/src/mesh_ray.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6b8b1a71be28665da7a84e6ba424dca350df4b643f977fcb3acb09c2b9ea12"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::worth_repairing (cyclomatic 18): vcad_kernel_tessellate::worth_repairing 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b5b236bdbad6e2584e3bae8e085fe8d4835778a13c60490d2d3fe30589791f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::snap_boundary_rails (cyclomatic 18): vcad_kernel_tessellate::snap_boundary_rails 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1ab1b5931da651b73e6bf4c8c2d1bbc1699eceb66ef1e55bd9b97a94721dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::reinsert_dropped_boundary (cyclomatic 18): vcad_kernel_tessellate::reinsert_dropped_boundary 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5508}}}],"partialFingerprints":{"codehealthFindingId/v1":"14784d5a16a6f8cb04ea2599567ffdac74407a931cef013c26ffbf4d276cc5f2"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::manifold::cap_pinholes (cyclomatic 18): vcad_kernel_tessellate::manifold::cap_pinholes 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":"crates/vcad-kernel-tessellate/src/manifold.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3f2f5b425f29bf199c7db40ac8f92f9beb451a63ec8df6429b92eddc0ee726"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_topopt::analyze::analyze_fields_thermal_warm (cyclomatic 18): vcad_kernel_topopt::analyze::analyze_fields_thermal_warm has cyclomatic complexity 18 (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":"crates/vcad-kernel-topopt/src/analyze.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b36c23cbb47a48945c7f522bf383bfabcc11a8fb260955243333238b963cf9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_wasm::circuit_sim::circuit_from_schematic_wasm (cyclomatic 18): vcad_kernel_wasm::circuit_sim::circuit_from_schematic_wasm 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":"crates/vcad-kernel-wasm/src/circuit_sim.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"618d53490996f5a86af34acd5db58f758b0be4b80475ae38a9db336dc2bf30be"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_mcp::tools::engine::run (cyclomatic 18): vcad_mcp::tools::engine::run 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":"crates/vcad-mcp/src/tools/engine.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31261f72e982d703f659b4e87028b5414b5ea524db3fc07fb8d27ccc7f7df15"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_receipt_verify::verify (cyclomatic 18): vcad_receipt_verify::verify 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":"crates/vcad-receipt-verify/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f36459261f9732b3175832b11c7c791ef8102f760fd6439ca7417f0afeccf75"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentViewer.filletEdges (cyclomatic 18): AgentViewer.filletEdges 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":"apple/VcadApp/Sources/VcadApp/AgentResources.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"36758b65daa1ec317c6f5ae5b2b4574a6de7a2f57df877ab6a12288d068dd8d1"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.featureHandles (cyclomatic 18): EditorModel.featureHandles 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6534f7bafa1b5032aa251fb4a5a7388d6d1d00dfc481082a695befd6d3b6c82"}},{"ruleId":"D1","level":"warning","message":{"text":"SafeWriter.write (cyclomatic 18): SafeWriter.write 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":"apple/VcadApp/Sources/VcadApp/LocalHistory.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3da8000028f77e0a47acc69b6387c5348e752299ce66be857c31da705fb49c"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseWindowController.show (cyclomatic 18): ReleaseWindowController.show 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2827a660cf1744aa10357a89856abfeeb52bd6894cd8253f455706d947c19e"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasedOverlayView.body (cyclomatic 18): ReleasedOverlayView.body 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"826028a34e74aed73f0a563408ea29bee8d01bffdeb8ccfc21a258f69e04fb33"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasedARView.updateNSView (cyclomatic 18): ReleasedARView.updateNSView 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90a96350b140b6495c7563dfe9de5024cc3cac0c18b6a96e0bad79ed6057482"}},{"ruleId":"D1","level":"warning","message":{"text":"SoundPanel.swift.nearestPartHit (cyclomatic 18): SoundPanel.swift.nearestPartHit 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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee24588727526d7460b83720dfdd44bd9529ab0c746c33b1f36f01188910ef57"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.dressBoard (cyclomatic 18): launch.dressBoard has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 427, 459). 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":"packages/app/public/launch/launch.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d8020fadca132c92204af6d5083e47e13fe391486bf2485bbe456bc90249fb"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomInstances.AtomInstances (cyclomatic 18): AtomInstances.AtomInstances 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 5 function items inside it that branch (a function literal at line 308, handlePick, a function literal at line 363, \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":"packages/app/src/components/AtomInstances.tsx"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa21ea60b7cf1056d2781283c8db375785989588a0525bc110cf2380adbfc85"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureTree.getPartIcon (cyclomatic 18): FeatureTree.getPartIcon 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d444fc19b7c560880d43615f72a513af8155cbca4f80c232fd28eeb7a3c313c6"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyPanel.SubFeatureInspector (cyclomatic 18): PropertyPanel.SubFeatureInspector has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bb3bacda502ee6fa3e08c0027199aafb90aecdfa9b05345e70863717f694a6"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotePanel.QuotePanel (cyclomatic 18): QuotePanel.QuotePanel 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 7 function items inside it that branch (a function literal at line 135, a function literal at line 176, a function literal at line 187, \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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"df99daa9c5dae9fca225dfffc604acf6ff1c7719bd4f1a7d3af6ff1ee04e0b18"}},{"ruleId":"D1","level":"warning","message":{"text":"useAutoSave.useAutoSave (cyclomatic 18): useAutoSave.useAutoSave has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 155, 94, 103, \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":"packages/app/src/hooks/useAutoSave.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbc877f20340819a80e973b8cbefdcdc10a86b54d61ba604883102b9d95a344"}},{"ruleId":"D1","level":"warning","message":{"text":"useCircuitSim.useCircuitSim (cyclomatic 18): useCircuitSim.useCircuitSim has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 41, 30, 62, \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":"packages/app/src/hooks/useCircuitSim.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed5c588cb2014445041963bb8d2a88fd274768b0eddcf76d0631b59cf23643a"}},{"ruleId":"D1","level":"warning","message":{"text":"Navigation.Navigation (cyclomatic 18): Navigation.Navigation 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 5 function items inside it that branch (renderNavItem, a function literal at line 182, isActive, \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":"packages/docs/src/components/Navigation.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4d833b8e5428ba227b8e08f4f568c30531f89cea8c2c56a6a5ba804b3e76bc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_wasm.debugString (cyclomatic 18): vcad_kernel_wasm.debugString 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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":11400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9127ce5cd1b20c4d4b091ccc13e4bafdf605c06a876188636991e532413488c2"}},{"ruleId":"D1","level":"warning","message":{"text":"clearance.verifyClearanceClaims (cyclomatic 18): clearance.verifyClearanceClaims 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4eef64d64a35a4b4235a766f29523f2a308a184e0ededd183e1d41a6573783"}},{"ruleId":"D1","level":"warning","message":{"text":"print-check.parseMeasurables (cyclomatic 18): print-check.parseMeasurables 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 one function literal inside it that branches (line 160). 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":"packages/mcp/src/tools/print-check.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"730b20526e087db8c96411c5ab0ca5b7352cb98c891d417d8a36afeb094aefa4"}},{"ruleId":"D1","level":"warning","message":{"text":"Lattice.cast (cyclomatic 18): Lattice.cast 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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c8e31ab7b7669136abaff68ae61f6d0f7aa2d27effb651bcc2d300435b6f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.inspectSchematic (cyclomatic 18): ecad.inspectSchematic 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a901d26159dd2e62272040f40b7f5524ab01c37669a6e91f842afd5309c444"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.forceDirectedRefine (cyclomatic 18): ecad.forceDirectedRefine has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b980e561ab3c84bc56ae8ede807687f94b6f1af1f85719790757d492b9a773cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.lengthMatchTraces (cyclomatic 18): ecad.lengthMatchTraces has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77bbe799e4368d21d53c3f6977adffec3f9c492a147cccca46bf29b0d006666"}},{"ruleId":"D1","level":"warning","message":{"text":"main.applySimFrame (cyclomatic 18): main.applySimFrame 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9d38f4afa3b6188085d65434f45f54004fd5d4e34be493d4681b810a68b1fc"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.dressBoard (cyclomatic 18): gallery.dressBoard has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 600, 632). 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":"www/public/kit/gallery.js"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbcff851fba1c933bcb3cf6b2193508927d2ca360306684f9f56a6c5018ee75"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_termview::braille::buffer_to_braille (cyclomatic 17): vcad_termview::braille::buffer_to_braille 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":"crates/termview/src/braille.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12d863e62aa96ba97768262a322843cb58fe249a2d8c7b5ed756a0bd1341688"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::plan_bga_escapes (cyclomatic 17): vcad::plan_bga_escapes 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd56564c61843faee8c1376ef8e639abe432e0132bb24396a89b131f17f5fc30"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::floating_floor_area (cyclomatic 17): vcad::floating_floor_area 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2269713fe9d50e63793ad628bed5b4becac56d2a415731565e77875739a30d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_design_constraints::measure::constraint_residual (cyclomatic 17): vcad_design_constraints::measure::constraint_residual 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":"crates/vcad-design-constraints/src/measure.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9317c6b63c631dfc4903d33bb75eee13a92031ca1a35a75433abd2548e466b"}},{"ruleId":"D1","level":"warning","message":{"text":"ResidualSystem::compile_with (cyclomatic 17): ResidualSystem::compile_with 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7549b1e180356a70382c1af8f0fa9c10831f380a585e90ab1191573f5a21102c"}},{"ruleId":"D1","level":"warning","message":{"text":"RouteSession::from_pcb (cyclomatic 17): RouteSession::from_pcb 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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0ab21aa1bca15ed0d413c8d773374823d44825a9a781987273798588c53448"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::copper_pour::collect_clearance_regions (cyclomatic 17): vcad_ecad_pcb::copper_pour::collect_clearance_regions 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":"crates/vcad-ecad-pcb/src/copper_pour.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f92b85cf793149100212b47d6fe0baa3a5b2b88c86ea7a687ff9784d595a9c4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::bump_away (cyclomatic 17): vcad_ecad_pcb::router::bump_away 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":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5e0332f93241b6598050738c441b0a1d6829071a73c866a2a1c73c769a0227"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::commodities (cyclomatic 17): vcad_ecad_pcb::router::flow::route::commodities 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"028ef7e8c6db5fff8a6b3adadfc381ddb4a81c4cd73b001a3d85f5ff733762b9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::maze::cell_states_for_class_window (cyclomatic 17): vcad_ecad_pcb::router::maze::cell_states_for_class_window 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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"5530ffb2038a558342a2c8825de84a3786b6196db4d5acf3accf5be130af7298"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::maze::astar (cyclomatic 17): vcad_ecad_pcb::router::maze::astar 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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"16371438c9779feadbab07963c3c64afafa4e9926ca40018b71072fc0d0e73b7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_sim::airgap::airgap_solve (cyclomatic 17): vcad_ecad_sim::airgap::airgap_solve 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":"crates/vcad-ecad-sim/src/airgap.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3117e0382d7e2b93d8fe8dff06671ab6ac369cfc9b4e973eb3cfe1d506ac5739"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_sch::reconstruct_nets (cyclomatic 17): vcad_ecad_symbols::kicad_sch::reconstruct_nets has cyclomatic complexity 17 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_sch.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6714889e99c0961998d4db49a698232e488ffd1d60a0baa2bdf828e680b8cf51"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_sym::parse_symbol (cyclomatic 17): vcad_ecad_symbols::kicad_sym::parse_symbol 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":"crates/vcad-ecad-symbols/src/kicad_sym.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"91595c865cee7cdb145af49adf9352c2199ff4fcaf5ad34f4db707b55d684c1e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::net_stubs (cyclomatic 17): vcad_ecad_symbols::kicad_write::net_stubs 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea5804fc4655a5c2b64c66a76d5cf605a3e3b3da4744cced1bd07c6eb4b7e34"}},{"ruleId":"D1","level":"warning","message":{"text":"Problem::new (cyclomatic 17): Problem::new 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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8b230f745452b6580b2e3199d8591751a2c9df5129aec3b30aa7e454b7ea60"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::sensitivity::document_sensitivities (cyclomatic 17): vcad_eval::sensitivity::document_sensitivities 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":"crates/vcad-eval/src/sensitivity.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58a2174c5531beb9e8dc8a9705dd93ec91ffe0cc96ffbc0ea7e914a8dc89585"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_eval::sim_extract::extract_device_spec_from_scene (cyclomatic 17): vcad_eval::sim_extract::extract_device_spec_from_scene 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec6ac4440a67e62d60dc2a3d5003309b9acf0d1ac1375680c32100ba527e79"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::fea::cell_field (cyclomatic 17): vcad_ffi::fea::cell_field 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":"crates/vcad-ffi/src/fea.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0b05f1eb5f0c80eaa122c06898248d223ba34ee06c79d86bc7f8d85fd32ef7"}},{"ruleId":"D1","level":"warning","message":{"text":"Solid::fillet_reported (cyclomatic 17): Solid::fillet_reported 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"91881666e7a88caf3eb0dbb841f5822f88c0262fea9a828c2c8cb5710551649f"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel::sheet_json::tessellate_model (cyclomatic 17): vcad_kernel::sheet_json::tessellate_model 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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ff308d9301c7bec3950eb578244394857af8da0e180015174e6df504c9f135"}},{"ruleId":"D1","level":"warning","message":{"text":"Mesh::build (cyclomatic 17): Mesh::build 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":"crates/vcad-kernel-antenna/src/geometry.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea3c7d8ea2c0d4e0fde256ee1ba5593f6650f6e63419e8a46fb3385f030be15"}},{"ruleId":"D1","level":"warning","message":{"text":"QuadricCtx::project_mesh (cyclomatic 17): QuadricCtx::project_mesh 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c65e149f4b1dd9eaa4a65a5cae4ca34bbc8ef61fe2d820e1dfd02647db4ad4"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::sew::merge_nearby_vertices (cyclomatic 17): vcad_kernel_booleans::sew::merge_nearby_vertices 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":"crates/vcad-kernel-booleans/src/sew.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4284597319f01df51e9d881a4393e5769afbc025096dad612fcc3034e4132bca"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_drafting::section::chain_segments (cyclomatic 17): vcad_kernel_drafting::section::chain_segments 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77ae3257f0767d93bb53b84066140b00c1412f597a30619d7f125eb31083134"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::mesh::wall_thickness (cyclomatic 17): vcad_kernel_fea::mesh::wall_thickness 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa199a8bd39a05e71e15970612584284ab904b884ac9a07aeade2ef11ca81fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_naming::same_surface (cyclomatic 17): vcad_kernel_naming::same_surface 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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e42070523a1e80cf05ac89748b5afc9b36c183b479a6fb24908210b4722953"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_optics::optimize::minimize (cyclomatic 17): vcad_kernel_optics::optimize::minimize 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":"crates/vcad-kernel-optics/src/optimize.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd7a796806c153e620425d1005be2799d49e5b2e31dc508bcd82ce73c0b3a0c"}},{"ruleId":"D1","level":"warning","message":{"text":"WireField::surface_residual (cyclomatic 17): WireField::surface_residual 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":"crates/vcad-kernel-particle/src/bem.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0df89e7545b8b51a05a5d2db5b127db93bb343a5fb801c13dfb8f4822f97bd3"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::assemble (cyclomatic 17): vcad_kernel_sheet::flatten::assemble 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"4545fbbc804c475d2f558e7dca9ba9e3610c1f878b020b29bdbc4ed8cb2bae8e"}},{"ruleId":"D1","level":"warning","message":{"text":"MarchingCubes::extract (cyclomatic 17): MarchingCubes::extract 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":"crates/vcad-kernel-stocksim/src/marching_cubes.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22640b47f0662affa3ae4a4d23f716c75c8cceb7e166cc5b2237279a8178190"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_small_spherical_cap (cyclomatic 17): vcad_kernel_tessellate::tessellate_small_spherical_cap 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5921}}}],"partialFingerprints":{"codehealthFindingId/v1":"269f3a322ab4ba17ed70a962b5b37314674d9530f840f240dc460810f9de563e"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_brep_with (cyclomatic 17): vcad_kernel_tessellate::tessellate_brep_with 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cf83fa40bc889ff00484474ab5d067189afb5f233d299e9a18383d8679753b"}},{"ruleId":"D1","level":"warning","message":{"text":"PatternFit::monte_carlo (cyclomatic 17): PatternFit::monte_carlo 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":"crates/vcad-kernel-tolerance/src/gdt.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7196032c89f95de59991c12f10c1e606ec791fe4734bbd041b60e4e4bd1193"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tolerance::allocate::allocate (cyclomatic 17): vcad_kernel_tolerance::allocate::allocate 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":"crates/vcad-kernel-tolerance/src/allocate.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5f912fc1c1e7b3ea775d76e51405f2b08574018443eeeb15090355ec8da2db"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tolerance::economics::economics (cyclomatic 17): vcad_kernel_tolerance::economics::economics 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":"crates/vcad-kernel-tolerance/src/economics.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ee8aae54e6a08011716207bda5dfae04e980a4f73152ee0c79266e27c5dd87"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_topopt::simp::filter_sensitivities (cyclomatic 17): vcad_kernel_topopt::simp::filter_sensitivities 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":"crates/vcad-kernel-topopt/src/simp.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0574afb4f4a3da57ab517b8cfbb3f50b4928f6212bd75114c79b5ea81736db"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_loon::variants::parse_variant (cyclomatic 17): vcad_loon::variants::parse_variant 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":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d3553d7ae4251995cec54b9ba178fa5e1d80035ff30cf46f4be56b53af5d81"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_process::sim::simulate (cyclomatic 17): vcad_process::sim::simulate 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":"crates/vcad-process/src/sim.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f68b12ad3381fdee0503a19e516e878434729f0a34204d0ea8cb9955dffac6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_receipt::mechanical::mass_properties_claims (cyclomatic 17): vcad_receipt::mechanical::mass_properties_claims 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":"crates/vcad-receipt/src/mechanical.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8d94d2de12aa674442b2a367aa1fa280dedbc716c4ba1f6bf16bbcb4530386"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_torture::run (cyclomatic 17): vcad_torture::run 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":"crates/vcad-torture/src/main.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"37820c349e3db491269dfbaff30058922197d1202d5d409427327dc35ccd609f"}},{"ruleId":"D1","level":"warning","message":{"text":"mecheval_grader::grader::check_step_roundtrip (cyclomatic 17): mecheval_grader::grader::check_step_roundtrip has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mecheval_grader::grader::run_check (cyclomatic 38) 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":"mecheval/graders/src/grader.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1cea7de6d9a459baed6a13688a7924ec5df13916b445da85f7a183fd1db37c"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentEdits.adoptDocument (cyclomatic 17): AgentEdits.adoptDocument 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":"apple/VcadApp/Sources/VcadApp/AgentEdits.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe6bba947502345b883f7249adb05e64a64f302c8168cfd966cdcbbcce87ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentSession.submit (cyclomatic 17): AgentSession.submit 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":"apple/VcadApp/Sources/VcadApp/AgentPanel.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"19915c9f783052795758da79a3ede96816baab3b21256fd178441838abacad45"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepLink.init (cyclomatic 17): DeepLink.init 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":"apple/VcadApp/Sources/VcadApp/AppInstance.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"725d9fab7d3bb89746d328696801dfb1c74b9b56d597953cfd9f4d5636e745b3"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.gizmoDragTo (cyclomatic 17): EditorModel.gizmoDragTo 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e2d4a62bcdc41a8a76e9daa361949ee31d9a6be5e078db99722d3eead1472f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.installKeyMonitor (cyclomatic 17): EditorModel.installKeyMonitor 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5937c0c57ca5dee7a18efabdc4d0cd84691b1d4d63d36ff41075a9c83d97f136"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.cubeFaceKind (cyclomatic 17): EditorModel.cubeFaceKind 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a10df46c864768a62a66a499606262c7d6f1bfbc35ce4c4626cc251ffef024"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.applyBlend (cyclomatic 17): EditorModel.applyBlend 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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d86efeeca39bc0067ccf25889b436b18706d40f0d4dfc56cdcaac2844038ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"BoardPainter.drawPads (cyclomatic 17): BoardPainter.drawPads 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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"489116e86a6079a90d51bfc21783cc104f238c6edf9bf2d9c583ccbf8facf385"}},{"ruleId":"D1","level":"warning","message":{"text":"SchematicPainter.drawGlyph (cyclomatic 17): SchematicPainter.drawGlyph 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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c507e03e270a41f19608cc1d61b40d3671cf7479bee29f7ff9af3653aa646b5"}},{"ruleId":"D1","level":"warning","message":{"text":"SketchSession.filletTap (cyclomatic 17): SketchSession.filletTap 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. This is NOT this file\u0027s highest cyclomatic complexity: SketchConstraintKind.label (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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"61664690e90e6499f3a8e5644d9dd64858c491a78274a10a9aa23dd368348c7b"}},{"ruleId":"D1","level":"warning","message":{"text":"WelcomeView.move (cyclomatic 17): WelcomeView.move 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":"apple/VcadApp/Sources/VcadApp/WelcomeWindow.swift"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2784ec03709626a4d42db840767a55dbc43e45b2e7658356b7ceb996ae29ea1b"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.gizmoDragTo (cyclomatic 17): EditorModel.gizmoDragTo 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbd5b16341271cc039182ba5876a37fb05efa8a50b92d855d11f565e2d93603"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.installKeyMonitor (cyclomatic 17): EditorModel.installKeyMonitor 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04918aa16232297f07066f355b509b3dc95a14b7d2d9b86746e49cfffcaa6e3"}},{"ruleId":"D1","level":"warning","message":{"text":"launch-animatic.html.render (cyclomatic 17): launch-animatic.html.render has cyclomatic 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, 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":"docs/launch/launch-animatic.html"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5330525eb5c8a0140c7d280213d30b28fe00d775d4a898ef62330d016b6cbf05"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.autoSmooth (cyclomatic 17): launch.autoSmooth 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":"packages/app/public/launch/launch.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"10547f0f4aea13c8c271c58fbf813c624ab822710abf2fcdeed4d0ccc4086328"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalyzePanel.StudyCard (cyclomatic 17): AnalyzePanel.StudyCard has cyclomatic complexity 17 (threshold 15). Of this number, 15 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e5625bad742580e352eaab21db3f33e92749bd517f1ba9e4a7031d81134774"}},{"ruleId":"D1","level":"warning","message":{"text":"KoanChip.KoanChip (cyclomatic 17): KoanChip.KoanChip 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, 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":"packages/app/src/components/footer/KoanChip.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8cd3fa40fc31bd86b8e481e5c5420fb5ed87e6005d75eef06e3463225f6863"}},{"ruleId":"D1","level":"warning","message":{"text":"DfmOverlay.DfmOverlay (cyclomatic 17): DfmOverlay.DfmOverlay 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 4 function items inside it that branch (a function literal at line 43, severityIcon, a function literal at line 74, \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":"packages/app/src/components/print/DfmOverlay.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"762f7a50c5305cc9e8463dc7a757820bc8034134beaf480a3500a0a4cf0a5a55"}},{"ruleId":"D1","level":"warning","message":{"text":"usePcbAutoFit.usePcbAutoFit (cyclomatic 17): usePcbAutoFit.usePcbAutoFit 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 literals inside it that branch (lines 36, 32). 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":"packages/app/src/hooks/usePcbAutoFit.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c20e23e3f69e95c661f6b6ed55728a7a9e4435fa638b5d7bf851a04c3b86b70"}},{"ruleId":"D1","level":"warning","message":{"text":"sketch-constraint-persist.sketchConstraintToDesign (cyclomatic 17): sketch-constraint-persist.sketchConstraintToDesign 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":"packages/core/src/sketch-constraint-persist.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f078e9f5e37a26b50cbc3c2eecab6840df5acb7084b213e4d2313266b893c8"}},{"ruleId":"D1","level":"warning","message":{"text":"sheet-metal.buildSheetMetalChain (cyclomatic 17): sheet-metal.buildSheetMetalChain 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":"packages/engine/src/sheet-metal.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06706651ca1f5afbd60f04e6e4405a0466433035226afd07b36fbbcfdfcc01e"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate.evaluateDocumentTS (cyclomatic 17): evaluate.evaluateDocumentTS has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: evaluate.remapNodeIds (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/evaluate.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"09abdbb9333cff412c2d815d194d931a9dad264bf136783f0b1d9af78219c910"}},{"ruleId":"D1","level":"warning","message":{"text":"index.parseJoint (cyclomatic 17): index.parseJoint has cyclomatic complexity 17 (threshold 15). 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, separate the cases: extract each independent 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: index.getChildren (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ir/src/index.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f33da71d0fd01ec4b76a0d8b29fc2fad03fc96f90727c4cbbbc3f6c75b604d"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.schematicSummary (cyclomatic 17): ecad.schematicSummary 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91c1f3ee602461a19ca1e8684201f39b3f53dafd35dc735974b4a77339a85af"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.drcPcb (cyclomatic 17): ecad.drcPcb 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4941}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1186de9c3434d4f0db6b6ece6ffa4432923429dda803eb29f80e96f51994c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.polygonOverlapBbox (cyclomatic 17): ecad.polygonOverlapBbox 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0ad640d56a56f31f3db3e859f29a972ff81f28b01e3aaecc18840e82a54dd5"}},{"ruleId":"D1","level":"warning","message":{"text":"import-urdf.importUrdf (cyclomatic 17): import-urdf.importUrdf 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":"packages/mcp/src/tools/import-urdf.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b13005c0592c193ba4af99ab5d78d286e57836b26f0cfd6e4ebb8ae9c963a3"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog.getChangelog (cyclomatic 17): changelog.getChangelog 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, 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":"packages/mcp/src/tools/changelog.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4a0929acaffb069865d2b8f3268c7ba84e918bda3be68d79c258c4f44724c7"}},{"ruleId":"D1","level":"warning","message":{"text":"animate.validateTimeline (cyclomatic 17): animate.validateTimeline 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 one function literal inside it that branches (line 95). 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"560b9c22f2b591c427c587dfa6d4d8be1fdbfa427319a7494bfc88d45ae43fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.autoSmooth (cyclomatic 17): gallery.autoSmooth 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":"www/public/kit/gallery.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5b03ffbb07bf152352a2cff5fc1b6d5d89b6b75d6458383d981be6803b8379"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::trim_leaf_copper (cyclomatic 16): vcad::trim_leaf_copper 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4961}}}],"partialFingerprints":{"codehealthFindingId/v1":"773054c5384dc8caee9d66c5b9a93105cbdb7550c748a7d89fcc54847931065a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad::ui::menu::draw_open_menu (cyclomatic 16): vcad::ui::menu::draw_open_menu 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":"crates/vcad-cli/src/ui/menu.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"710029797a23842cf195c7f2546241e545f47ec3a0864d1779fac4be201ff6de"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_diff::recompose (cyclomatic 16): vcad_diff::recompose 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":"crates/vcad-diff/src/lib.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e173cd2bcf9803e1cb12fc6cd9b54efffa044379e641c825263af157188e8ab"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_diff::merge (cyclomatic 16): vcad_diff::merge 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":"crates/vcad-diff/src/lib.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0164d56cf897f72ef2f95874142c4d53c174bc260cee1cf710eaa025b393d37"}},{"ruleId":"D1","level":"warning","message":{"text":"PairProblem::add_clearance (cyclomatic 16): PairProblem::add_clearance 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa44d53854576aa489d2bf01065aa16026953ad6bbe66830ed3aa0a8b33c8081"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::silk_segments (cyclomatic 16): vcad_ecad_pcb::dfm::silk_segments 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b3eeb576310223babb0427da14bf47ed3ecce8af930a815595ea0fb745c0ee"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_acid_trap (cyclomatic 16): vcad_ecad_pcb::dfm::check_acid_trap 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95a8a2ec3c09fd7de38e26a200f545f0830eff0a68ab672f9e6a01b48a0ee55"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_pad_clearance (cyclomatic 16): vcad_ecad_pcb::drc::check_pad_clearance 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4d0b1afc83bf7de75a0964e159d606ed1ff45299e0df2a3ddad954de69b09a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::try_route_escape (cyclomatic 16): vcad_ecad_pcb::router::auto::try_route_escape 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc90384f0127d89c20ccf4f4c4cb4682db0ac4157a1cff88bb2aa4b41d3a3cde"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::escape_endpoint (cyclomatic 16): vcad_ecad_pcb::router::auto::escape_endpoint 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3605}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a7e58d3e4a92fdf2c71effe70889083cf7bc7f39589f2f61825b74c38b2ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::legalize::legalize (cyclomatic 16): vcad_ecad_pcb::router::legalize::legalize 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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"414e4d130473723c547532769d8bf2b1aba10f1a496f6fae62d573aa6b3c42b6"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::length_match::match_lengths_runs (cyclomatic 16): vcad_ecad_pcb::router::length_match::match_lengths_runs 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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35c24b38eb509044210ccb5b45cf471b23e40dbe58e4c458c4f06fcdfa8eb67"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::pair_partner (cyclomatic 16): vcad_ecad_pcb::router::pair::pair_partner 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3a64d5947999307195b4dfc5f7840cfd7fde56e44345ec6e5619f8334155a8"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_schematic::erc::check_unconnected_pins (cyclomatic 16): vcad_ecad_schematic::erc::check_unconnected_pins 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":"crates/vcad-ecad-schematic/src/erc.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cb98916a3d3848d09855ff0c03fafc9eccb0fd2ee44fb1b449979e0a151424"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_board::place_footprint (cyclomatic 16): vcad_ecad_symbols::kicad_board::place_footprint 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"348155ee8f8f8350e4dad08f4b86f3ce91122d87f71fd70c4ebc03028a8b4092"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::parse_footprint (cyclomatic 16): vcad_ecad_symbols::kicad_pcb::parse_footprint 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: vcad_ecad_symbols::kicad_pcb::parse_layer (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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ef55ff0c47e032ec9c863b260e0339f27a596cb33f86dcb7f86a2ab956b014"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::flip_sx (cyclomatic 16): vcad_ecad_symbols::kicad_write::flip_sx 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7d67d2f65d2c4180c4427342b6e7be383cdd4450cc0f4ba9ab299e5c39c993"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::clearance::check (cyclomatic 16): vcad_ffi::clearance::check 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":"crates/vcad-ffi/src/clearance.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daaac224cd409de6025261babefdbd562589537d22f2fd713e0860d3743e4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::sound::call_with_scene (cyclomatic 16): vcad_ffi::sound::call_with_scene 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":"crates/vcad-ffi/src/sound.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1133e582b60ac6238217b65b6ef73ad3accd8072f51e27f99e23a2894e4867"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ffi::train::run_training (cyclomatic 16): vcad_ffi::train::run_training 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce834abcf319381eb037f68c4566b8ef0f3453a9acbbab6aa8f5ac68b1ce3709"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_ir::expr_parser::eval (cyclomatic 16): vcad_ir::expr_parser::eval 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":"crates/vcad-ir/src/expr_parser.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38313e145d1f903730d7f3c705a66f4a567fefab1a80bb96a5d6113d7cdb6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel::fillet_aabb_is_reasonable (cyclomatic 16): vcad_kernel::fillet_aabb_is_reasonable 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"1472e76defa510b95240db7ce7a365c5594dd6ed98a5fd9f6a832557b4b0cfa7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_acoustics::instrument::lowest_modes (cyclomatic 16): vcad_kernel_acoustics::instrument::lowest_modes 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"169ef758f2eab50711efe1c015f3c9796783b786fdb193c9f959bf7a0e4d33e9"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_antenna::receipt::predicted_claims (cyclomatic 16): vcad_kernel_antenna::receipt::predicted_claims 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":"crates/vcad-kernel-antenna/src/receipt.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2651578dd77348acd279bcb4f4211d9471a924cf236d77fba6d898d7dd2c31"}},{"ruleId":"D1","level":"warning","message":{"text":"QuadricCtx::collect (cyclomatic 16): QuadricCtx::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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbe45a45ca3c926532eb26b0b1172d5ba8efddffff0bc9abe40dfbe8c16e862"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::realize_bands (cyclomatic 16): vcad_kernel_booleans::cyl_band::realize_bands 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ee79580b67c9bcc1404e4cdddf80fd8b86f011a1ce4ae1a53bbab0dea9bf4a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::flush_wall_phantom_cut (cyclomatic 16): vcad_kernel_booleans::pipeline::flush_wall_phantom_cut 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"931fb1cc37b7f958f79d7b873d471b07b4fbd02c10ba475f59c7c83cab887b33"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_booleans::validate::difference_removed_nothing (cyclomatic 16): vcad_kernel_booleans::validate::difference_removed_nothing 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":"crates/vcad-kernel-booleans/src/validate.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c5172c1d1f5740333ee8414271f23aa82def20b6a26154d51f9de09dd4fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_dfm::rules::cnc::thin_walls (cyclomatic 16): vcad_kernel_dfm::rules::cnc::thin_walls 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":"crates/vcad-kernel-dfm/src/rules/cnc.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed2bb90052c76fa35287939d7bb12cc26176fb02d42e48c86274b6b9c16e857"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_enclosure::fit::check_lid_clearance (cyclomatic 16): vcad_kernel_enclosure::fit::check_lid_clearance 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":"crates/vcad-kernel-enclosure/src/fit.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"98566aa3f3fe7e6bcbf7e29d3288093e18c1ac937ca90837986002a1011f224b"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fea::mesh::voxelize (cyclomatic 16): vcad_kernel_fea::mesh::voxelize 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d40ca0dad872afafb2745c696be1385fd528759bfaa244b99b46b0eae85b0a7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_fillet::revolved::blend_corners (cyclomatic 16): vcad_kernel_fillet::revolved::blend_corners 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27ed0601584a7f03d71df3ddfff53d1554edaeb153cf52fd838ae19179f6184"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_particle::chain::predict (cyclomatic 16): vcad_kernel_particle::chain::predict 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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8651228fc9a09ad7ea0adf1fcc07ae0955fcb6ff95d6dcfd8efefc9f62a440"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_sketch::extrude::extrude_with_arcs (cyclomatic 16): vcad_kernel_sketch::extrude::extrude_with_arcs 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"654a523278278c20fad4d634de056b846fd1922cd48acd5fbf0f4234eedff55a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_step::assembly::solid_occurrences (cyclomatic 16): vcad_kernel_step::assembly::solid_occurrences 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":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f5283d7174576d6f79355bd506f476bc02433e9c36fceef9dbf03013382bf5"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_step::reader::length_unit_mm (cyclomatic 16): vcad_kernel_step::reader::length_unit_mm 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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7ab5e43129dcc5b85e25d67c77548efc3150a9934c05c3246fe38ad8ec5c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"TriangleMesh::edge_segments (cyclomatic 16): TriangleMesh::edge_segments 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"70906b0a745cfd5666e11696f4795204dc1288e6487a516654f488b763c898f0"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_tessellate::sphere_boundary_with_neighbors (cyclomatic 16): vcad_kernel_tessellate::sphere_boundary_with_neighbors 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa85b448838af11adaf8d47449e74c4f796f3b7209c0116327a494e47871aed"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_thermal::solve::solve_field (cyclomatic 16): vcad_kernel_thermal::solve::solve_field 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcefc74b5e4aaf11e5132a4555eac652f171e38ed760213f06cd2a91be0f4557"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_kernel_thermal::solve::assemble_solution (cyclomatic 16): vcad_kernel_thermal::solve::assemble_solution 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b76c7888647cc8cbc1675790d54e256a7b7d197d865240ed20f247043b09bb"}},{"ruleId":"D1","level":"warning","message":{"text":"vcad_mcp::transport::handle_http (cyclomatic 16): vcad_mcp::transport::handle_http 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":"crates/vcad-mcp/src/transport.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc858c2c32b6194b0723165501c7829d720f207ea3db0ebeb4858cec5e7e6d"}},{"ruleId":"D1","level":"warning","message":{"text":"PrinterStatus::from_mqtt_payload (cyclomatic 16): PrinterStatus::from_mqtt_payload 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":"crates/vcad-slicer-bambu/src/status.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"06234da9964ae3ba5720c5f10f9351dc99d48e3977873f88c38ae7fa13321607"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisAgentTools.call (cyclomatic 16): AnalysisAgentTools.call 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":"apple/VcadApp/Sources/VcadApp/AnalysisAgentTools.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"da74833e280b19ad55ab9ebaff96b7fc85ad41d431480cf5e1a6ff0c83a078b7"}},{"ruleId":"D1","level":"warning","message":{"text":"FeaSection.body (cyclomatic 16): FeaSection.body 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":"apple/VcadApp/Sources/VcadApp/AnalysisPanel.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c747c2a41840bbf0cdbaff8d6839b00c73f9f8a775cd5bc617c6bcdf044bc3"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepLink.gunzip (cyclomatic 16): DeepLink.gunzip 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":"apple/VcadApp/Sources/VcadApp/AppInstance.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b838846f16f211cda6d152099ff7783c3371947a6402bd4d7cec67d6948bf903"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.appendIRFeatures (cyclomatic 16): EditorModel.appendIRFeatures 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"0245e4cbb9622b9773badbfcbdd86ec25c59f225e869ce8132d0e426301b4c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.beginGizmoDrag (cyclomatic 16): EditorModel.beginGizmoDrag 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12b99b590db7403014c3c2c4b077574421cbf070d2348808a56992ca89becb9"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.beginStepImport (cyclomatic 16): EditorModel.beginStepImport 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e423f86a95617ebb0cd07c2646d09174f1a46e9914d385919df146c686e576"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsWorkspace.commitRoute (cyclomatic 16): ElectronicsWorkspace.commitRoute 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2261b871f36c4a635b979f7f84e0c6be02d1286817f3cb15a6bf73187f5f51"}},{"ruleId":"D1","level":"warning","message":{"text":"ElectronicsWorkspace.saveFootprintToLibrary (cyclomatic 16): ElectronicsWorkspace.saveFootprintToLibrary has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fe71593451128f86462560e1c605284aa20245bf955baff90decd3aa376f48"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureRowView.menu (cyclomatic 16): FeatureRowView.menu 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: FeatureParamEditors.editors (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1567ae82a9996d1d6167303eee114cfee3dd7e21f1373e4f1a64c5a8af3db90"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.appendIRFeatures (cyclomatic 16): EditorModel.appendIRFeatures 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"615c130b22950f64af094df483388383f39e132e4664a6c17e87caa84f1dccbc"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.beginGizmoDrag (cyclomatic 16): EditorModel.beginGizmoDrag 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0be12c65a518df3dd2aa8c049f83d3306f398acfbc2844d8dae45bd29fbe7f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorModel.beginStepImport (cyclomatic 16): EditorModel.beginStepImport 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"818d5edf9fb95b4e896bdb7e542b7627479007f715352a0045b6c12f1242524c"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureRowView.menu (cyclomatic 16): FeatureRowView.menu 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: FeatureParamEditors.editors (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec350ace14111fd41a7c193f6300976dd6e4aebcfffc79424e9de19f45cac3bb"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.creaseGeometry (cyclomatic 16): launch.creaseGeometry has cyclomatic complexity 16 (threshold 15). Of this number, 15 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":"packages/app/public/launch/launch.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ef1907a0f82ce7396cb89b7df3c1c38acbdee1e1d59ed065c18b230e549b74"}},{"ruleId":"D1","level":"warning","message":{"text":"FeatureTree.FeatureTree (cyclomatic 16): FeatureTree.FeatureTree has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01690cfa4d9ea0847ef7a66d2d4a0c72e3b05f07a56ea2296c67e1528242ccb"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyboardPrefsPanel.CommandRow (cyclomatic 16): KeyboardPrefsPanel.CommandRow 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, 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8798acfa114c7e3887a726367fe23712747259a0ea9a938d74016328f4f967c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Header.RayTracingSubmenu (cyclomatic 16): Header.RayTracingSubmenu 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 4 function items inside it that branch (a function literal at line 298, qualityLabel, a function literal at line 286, \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":"packages/app/src/components/Header.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff9977e5ca42020e72b39f417a0761e67be4454ae252276f4de25118c841ab3"}},{"ruleId":"D1","level":"warning","message":{"text":"CircuitTabTools.CircuitTabTools (cyclomatic 16): CircuitTabTools.CircuitTabTools 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffe302b5b949355d6a1a23b62df40954db71783676d2f1b820d0a4dd88b0344"}},{"ruleId":"D1","level":"warning","message":{"text":"ActionResultCard.ActionResultCard (cyclomatic 16): ActionResultCard.ActionResultCard 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, 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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fa9e0e45de842045a4cae3fa9073f4b5a5d564f44ce5794d41ee16cab77371"}},{"ruleId":"D1","level":"warning","message":{"text":"drawing-sheet.buildDrawingSheetSpec (cyclomatic 16): drawing-sheet.buildDrawingSheetSpec 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":"packages/app/src/lib/drawing-sheet.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8265b72403e6275d1bbce7dcb6863645608c9a4f17521f352d8a1cb499ed161b"}},{"ruleId":"D1","level":"warning","message":{"text":"sub-feature-picking.pickSubFeature (cyclomatic 16): sub-feature-picking.pickSubFeature 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":"packages/app/src/lib/sub-feature-picking.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef73b897d4c81e65a06f31a3f44542634908776ece529369cc0a22daaecab95"}},{"ruleId":"D1","level":"warning","message":{"text":"camera-framing.expandBboxFromPositions (cyclomatic 16): camera-framing.expandBboxFromPositions 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":"packages/core/src/camera-framing.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4220510b6987911b467881a172b514953fa09a06b7c0db02a0acb440d9565ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"app-link.deliverPush (cyclomatic 16): app-link.deliverPush 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":"packages/mcp/src/app-link.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"26641c70d501457cc0ec96e05845424b548407443b5c453020d49de040ccc70a"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect.computeInspection (cyclomatic 16): inspect.computeInspection has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 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":"packages/mcp/src/tools/inspect.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9482e4e3fc371dfe1f9031fd0c4ae9d27136b86aa6db838e4dcf5dd1b7c43529"}},{"ruleId":"D1","level":"warning","message":{"text":"sweep.resolveSweepAxes (cyclomatic 16): sweep.resolveSweepAxes 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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c942528fd62212d9d1fb6eb7b53579bb46bdd018395502133f689de45c0348bf"}},{"ruleId":"D1","level":"warning","message":{"text":"measure.measure (cyclomatic 16): measure.measure 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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b5f212cb773f12d5e5ba6a16e8c4686e6f5baa128e0dc80bd8baaeaac1162a"}},{"ruleId":"D1","level":"warning","message":{"text":"pcb-validate.validatePcb (cyclomatic 16): pcb-validate.validatePcb 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":"packages/mcp/src/tools/pcb-validate.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69be0fdc93b70bef84b96f261c1ddbdd78b40ea738882c5b60cc779a4dd1138"}},{"ruleId":"D1","level":"warning","message":{"text":"constraint-claims.verifyConstraintClaims (cyclomatic 16): constraint-claims.verifyConstraintClaims 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":"packages/mcp/src/tools/constraint-claims.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9b16d9c1e4d341dcc0bb08ec371d0b3208d27c4739435cd274f16dd1d4ffa5"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.legalizeCrossNetClearance (cyclomatic 16): ecad.legalizeCrossNetClearance 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8a87363d6aafe78c15451ad6c4a44d821d11d1505bc6503659c4a827dd1dad"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.lmSolve (cyclomatic 16): ecad.lmSolve has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6823}}}],"partialFingerprints":{"codehealthFindingId/v1":"492b735c0aa7eab9d1db2c2cd560478c4c7013ff90c47017921503b460f9d256"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.getFootprint (cyclomatic 16): ecad.getFootprint 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9016}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b3bd3ab65f9bce3040287c51e08d5d61a22684969a0c8e2122461e5400dc49"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.rasterizeSection (cyclomatic 16): ecad.rasterizeSection 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13302}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fdb9f9f39706065c01549dc35da6c3adb431a68ce9a10a5b74bae0901507c8"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.largestComponent (cyclomatic 16): ecad.largestComponent 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee9092d186b237c140c73fee808d318b5e6f87e5601944ec3ac2514e2d0bad8"}},{"ruleId":"D1","level":"warning","message":{"text":"ecad.sealedCavityFromMesh (cyclomatic 16): ecad.sealedCavityFromMesh 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5cb65951118d8b2b89f4bb2250f867153a263823c16acbdd515fbc50ecffb9"}},{"ruleId":"D1","level":"warning","message":{"text":"animate.compileJointKeyframes (cyclomatic 16): animate.compileJointKeyframes 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb22eb8eac125e1e896ed69288ad420b4f82623848767b00b86b86dd6a3793a"}},{"ruleId":"D1","level":"warning","message":{"text":"version-check.compareVersions (cyclomatic 16): version-check.compareVersions 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":"packages/mcp/src/version-check.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff953e3001df6d8f31ca26c7878be7353c7d427c49eb1df1839246e467f384bd"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.creaseGeometry (cyclomatic 16): gallery.creaseGeometry has cyclomatic complexity 16 (threshold 15). Of this number, 15 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":"www/public/kit/gallery.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"00781d1ea7110b259c736b61de4d7ed1a7002329406dd205f04fe67a5f5f02ac"}},{"ruleId":"D1","level":"warning","message":{"text":"galleryFigure (cyclomatic 16): galleryFigure 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 7 function items inside it that branch (a function literal at line 480, a function literal at line 476, a function literal at line 507, \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":"www/public/kit/gallery.js"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1c490878209fb31322fc0f85070ba726b515d9176b1be44a5f07f00eb30ce"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::classify::face_sample_point (cognitive 359): vcad_kernel_booleans::classify::face_sample_point has cognitive complexity 359 (threshold 15). Drivers by points: if/else 80 (243 pts), loops 25 (105 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 247). 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"155f5e67812ea7d4af5c4cebc83f40db1a9c131823870c34e818d7c94923eba1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::brep_boolean (cognitive 298): vcad_kernel_booleans::pipeline::brep_boolean has cognitive complexity 298 (threshold 15). Drivers by points: if/else 91 (203 pts), loops 33 (59 pts), boolean chains 29, match/switch 3 (7 pts) (nesting depth added 142). 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbf61421980cc661c5fa14622888f8193795e69ec5906343f7577ad4c73e797"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::apply_splits_to_solid (cognitive 251): vcad_kernel_booleans::pipeline::apply_splits_to_solid has cognitive complexity 251 (threshold 15). Drivers by points: if/else 43 (203 pts), loops 6 (26 pts), match/switch 2 (15 pts), boolean chains 7 (nesting depth added 193). 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c8cedcf0e4e76d193d78fd92cc2c546deacee23d116f90af3f4af4be51a84b"}},{"ruleId":"D2","level":"warning","message":{"text":"SchematicCanvas.SchematicCanvas (cognitive 249): SchematicCanvas.SchematicCanvas has cognitive complexity 249 (threshold 15). Drivers by points: if/else 74 (108 pts), ternaries 46 (61 pts), boolean chains 45, loops 15 (35 pts) (nesting depth added 69). Of this number, 21 points are the body\u0027s own statements and 228 belong to 41 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e7f13aabfa6845b377a0c63e32b0901071804fddd0a1c8d283611f101faaf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.routeNets (cognitive 239): ecad.routeNets has cognitive complexity 239 (threshold 15). Drivers by points: if/else 63 (117 pts), loops 27 (52 pts), boolean chains 38, ternaries 26 (32 pts) (nesting depth added 85). Of this number, 213 points are the body\u0027s own statements and 26 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8de719dcc772fef96b3814646e13983eff035ea1b4a7faa38d90246608d7f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::complete::route_window_complete_islands (cognitive 238): vcad_ecad_pcb::router::complete::route_window_complete_islands has cognitive complexity 238 (threshold 15). Drivers by points: if/else 63 (144 pts), loops 28 (60 pts), boolean chains 19, match/switch 6 (15 pts) (nesting depth added 122). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e2e152007d7cb28f66018ed8786915cdeb50520c67fe84a7725f572f31f836"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::realize::realize_wires (cognitive 237): vcad_ecad_pcb::router::flow::realize::realize_wires has cognitive complexity 237 (threshold 15). Drivers by points: if/else 48 (127 pts), loops 34 (85 pts), match/switch 5 (17 pts), boolean chains 8 (nesting depth added 142). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"499c999d445d9f26fb7cd46a8bea929d2b43e327b5c33eb0840dab4b2bd8169d"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewportContent.ViewportContent (cognitive 228): ViewportContent.ViewportContent has cognitive complexity 228 (threshold 15). Drivers by points: if/else 103 (145 pts), boolean chains 40, loops 14 (30 pts), ternaries 7 (10 pts), match/switch 2 (3 pts) (nesting depth added 62). Of this number, 20 points are the body\u0027s own statements and 208 belong to 45 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3fc63f0dec20d0b956e82b95f726c4b52b62e31c424f43aec50b238693e307"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_flow::solve::solve_steady (cognitive 227): vcad_kernel_flow::solve::solve_steady has cognitive complexity 227 (threshold 15). Drivers by points: if/else 35 (124 pts), loops 21 (74 pts), match/switch 7 (26 pts), boolean chains 3 (nesting depth added 161). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/solve.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87d34a257e60e133336bd14208e8b3bac4040553040adc5c4d29bc30fada2fd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::evaluate::evaluate_inner (cognitive 219): vcad_eval::evaluate::evaluate_inner has cognitive complexity 219 (threshold 15). Drivers by points: if/else 54 (144 pts), match/switch 20 (47 pts), loops 9 (21 pts), boolean chains 7 (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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dad0be5731330f8225f6ed5cf878d0bed508fdd1dee5f027f160e6187101775"}},{"ruleId":"D2","level":"warning","message":{"text":"document-store.useDocumentStore (cognitive 215): document-store.useDocumentStore has cognitive complexity 215 (threshold 15). Drivers by points: if/else 119 (148 pts), boolean chains 30, error handling 12 (17 pts), loops 7 (10 pts), ternaries 9, match/switch 1 (nesting depth added 37). None of this is in the body itself: all 215 points belong to 53 function literals inside it that branch (lines 1656, 1263, 1584, \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a376c372d4f26982b9d064e864f03c92515a1a89f57caf32f1becda065155736"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel::turning_profile::turning_profile (cognitive 214): vcad_kernel::turning_profile::turning_profile has cognitive complexity 214 (threshold 15). Drivers by points: if/else 72 (158 pts), loops 20 (37 pts), boolean chains 12, match/switch 3 (7 pts) (nesting depth added 107). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/turning_profile.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e14d35a8ad1a281847f191b9c86d36071e9e9635c81c0944bc4bc06721fe0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addMotorWinding (cognitive 211): ecad.addMotorWinding has cognitive complexity 211 (threshold 15). Drivers by points: if/else 76 (189 pts), loops 39 (94 pts), boolean chains 38, ternaries 15 (22 pts) (nesting depth added 175). To reduce it, split the body into named stages: move each independent 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: 2 other methods here (ecad.addMotorWinding::buildFeed, ecad.addMotorWinding::feedClear) 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11593}}}],"partialFingerprints":{"codehealthFindingId/v1":"604d42547f0d1cbae8dacc531bcfc8a9f2faca07617bf89b194dc631e3b1e126"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::trim::point_in_face_inner (cognitive 195): vcad_kernel_booleans::trim::point_in_face_inner has cognitive complexity 195 (threshold 15). Drivers by points: if/else 53 (148 pts), loops 11 (27 pts), boolean chains 20 (nesting depth added 111). 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"022d34dc6c4ea4c321e5b84abb0257e3f6e0aa9e07ee063b616c734b0773d9a0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::solve::build (cognitive 195): vcad_kernel_thermal::solve::build has cognitive complexity 195 (threshold 15). Drivers by points: if/else 29 (87 pts), loops 30 (78 pts), match/switch 5 (25 pts), boolean chains 5 (nesting depth added 126). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9736e83042546497b78283361589719ae8a91fdda9f9a86c998ee9d5644f7ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.fixDrc (cognitive 191): ecad.fixDrc has cognitive complexity 191 (threshold 15). Drivers by points: if/else 51 (109 pts), ternaries 22 (45 pts), loops 12 (20 pts), boolean chains 17 (nesting depth added 89). Of this number, 161 points are the body\u0027s own statements and 30 belong to 14 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":15028}}}],"partialFingerprints":{"codehealthFindingId/v1":"82885537dbc328e98c27d1f6a2789d0b6195882d066f639d6c46483420aac9c3"}},{"ruleId":"D2","level":"warning","message":{"text":"useKeyboardShortcuts.useKeyboardShortcuts (cognitive 186): useKeyboardShortcuts.useKeyboardShortcuts has cognitive complexity 186 (threshold 15). Drivers by points: if/else 70 (111 pts), boolean chains 54, ternaries 6 (21 pts) (nesting depth added 56). None of this is in the body itself: all 186 points belong to one function literal inside it that branches (line 17). 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":"packages/app/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bab82f316c7c62b295d64ab42b02fe7cd25a3ea1eb134d11daa76f7e3e5f849"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::drafting::compose (cognitive 178): vcad_ffi::drafting::compose has cognitive complexity 178 (threshold 15). Drivers by points: if/else 57 (116 pts), loops 19 (36 pts), match/switch 7 (14 pts), boolean chains 12 (nesting depth added 83). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fe19869d2f7ab0402539d42e89c1f48f00bbcd9cd691b9c5dc887544bde916"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::route_all_once (cognitive 176): vcad_ecad_pcb::router::auto::route_all_once has cognitive complexity 176 (threshold 15). Drivers by points: if/else 40 (79 pts), loops 35 (70 pts), boolean chains 17, match/switch 3 (10 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b5cf1cdea61508c6b739dbd0ea2ab1f5e528c28ee9c6efe03b598eccaadaa6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::descent::descend_board_inner (cognitive 173): vcad_ecad_pcb::router::descent::descend_board_inner has cognitive complexity 173 (threshold 15). Drivers by points: if/else 37 (116 pts), loops 16 (42 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 106). 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddaf604136deb7ebab68fed7926ff581fd89ae766971f8a81210364045c982e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::maze::route_net_maze3d (cognitive 173): vcad_ecad_pcb::router::maze::route_net_maze3d has cognitive complexity 173 (threshold 15). Drivers by points: if/else 54 (117 pts), boolean chains 32, loops 11 (16 pts), match/switch 2 (8 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52c4f1e4c35d59916e747f3f9bf8d1eab5596c2dc451de8361b237a8b60dd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::evaluate::evaluate_op_timed (cognitive 171): vcad_eval::evaluate::evaluate_op_timed has cognitive complexity 171 (threshold 15). Drivers by points: if/else 31 (95 pts), loops 16 (43 pts), match/switch 11 (30 pts), boolean chains 3 (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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a577521bdb4413d99faf1568c85c21a0f556f420503f77dc693c073370b640ad"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_flow::adjoint::pressure_drop_gradient (cognitive 167): vcad_kernel_flow::adjoint::pressure_drop_gradient has cognitive complexity 167 (threshold 15). Drivers by points: if/else 22 (80 pts), loops 25 (72 pts), match/switch 2 (11 pts), boolean chains 4 (nesting depth added 114). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada7a6111cf725d173731e96e3c9335b10877f9b95fc0b3a495e654ce689557d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::cavity_extract::extract_cavity (cognitive 159): vcad_eval::cavity_extract::extract_cavity has cognitive complexity 159 (threshold 15). Drivers by points: if/else 56 (84 pts), loops 22 (37 pts), boolean chains 20, match/switch 10 (18 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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc07f01cb66bd605f8e178a12168ef4fde914eb80d8e9b0119e9fd289a16a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_photon_dose::transport::run (cognitive 157): vcad_kernel_photon_dose::transport::run has cognitive complexity 157 (threshold 15). Drivers by points: if/else 45 (111 pts), loops 14 (39 pts), boolean chains 7 (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":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfd4105af358d898b5e1a62b03e4313e99b885875ebaa45af86b7ee174dd166"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::route_flow (cognitive 151): vcad_ecad_pcb::router::flow::route::route_flow has cognitive complexity 151 (threshold 15). Drivers by points: if/else 27 (82 pts), loops 21 (58 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 94). 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"874f76869df80acd8132d20d550f2f2eb532c616f17ffb03e37dcd13f15c5cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"server.createServer (cognitive 150): server.createServer has cognitive complexity 150 (threshold 15). Drivers by points: if/else 56 (79 pts), ternaries 13 (21 pts), error handling 13 (20 pts), boolean chains 18, loops 9 (12 pts) (nesting depth added 41). Of this number, 24 points are the body\u0027s own statements and 126 belong to 15 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":"packages/mcp/src/server.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63640764c2ca2fabc14cd66400bdb46819f59af870b73683f5ec8f03c14788a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_cylindrical_face (cognitive 146): vcad_kernel_tessellate::tessellate_cylindrical_face has cognitive complexity 146 (threshold 15). Drivers by points: if/else 54 (106 pts), loops 16 (34 pts), boolean chains 6 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"209c31c21985b739f2fb15e5ffa7b5c3c2f99d142876c1be6f841d58c0134baa"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::render_svg_impl (cognitive 143): vcad_render::render_svg_impl has cognitive complexity 143 (threshold 15). Drivers by points: if/else 34 (76 pts), loops 20 (38 pts), match/switch 7 (22 pts), boolean chains 7 (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/lib.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c08981d22dd4d2846f7a6aa9022e12a12939c1c4ce66f688f8a3eabb46dbca9"}},{"ruleId":"D2","level":"warning","message":{"text":"Embedding::route (cognitive 142): Embedding::route has cognitive complexity 142 (threshold 15). Drivers by points: if/else 22 (79 pts), loops 14 (43 pts), match/switch 7 (16 pts), boolean chains 4 (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b8d1bce792f192e61363b65944a5d4f279777a47ef9cf5f4d175d01a7739f8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::fill_closed_boundary_loops (cognitive 137): vcad_kernel_tessellate::fill_closed_boundary_loops has cognitive complexity 137 (threshold 15). Drivers by points: if/else 34 (88 pts), loops 21 (45 pts), boolean chains 4 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7e60177c632534560548b49d08fdf4805aa68b267632561ccd88d65ab495b2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::buckling::buckling_on_mesh (cognitive 136): vcad_kernel_fea::buckling::buckling_on_mesh has cognitive complexity 136 (threshold 15). Drivers by points: loops 35 (66 pts), if/else 31 (62 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 64). 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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff8e03b6479647546b9ecb9cb7ff6aa5fcc2ea50774800069b0cf495b638809"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_trimmed_region (cognitive 135): vcad_kernel_tessellate::tessellate_trimmed_region has cognitive complexity 135 (threshold 15). Drivers by points: if/else 42 (81 pts), loops 24 (37 pts), boolean chains 16, match/switch 1 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7422}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac41af042e7f49ef29018348831f2db14c3d5f0335a4d6254db62b64baefde"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::pcb::render_pcb_svg_opts (cognitive 132): vcad_render::pcb::render_pcb_svg_opts has cognitive complexity 132 (threshold 15). Drivers by points: if/else 45 (81 pts), boolean chains 31, loops 14 (20 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":"crates/vcad-render/src/pcb.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9c70886f1779bff7f3ef85f3dd2e514552759f6d131f20a5e09c9c839f0487"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_cam::turning::verify::verify_gcode (cognitive 130): vcad_kernel_cam::turning::verify::verify_gcode has cognitive complexity 130 (threshold 15). Drivers by points: if/else 28 (87 pts), loops 13 (32 pts), boolean chains 10, match/switch 1 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b84b4f9646d88f21b0e00154c6604aab00cbee6741280329c1e83674c5e3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"useToolDefinitions.useToolDefinitions.byTab (cognitive 126): useToolDefinitions.useToolDefinitions.byTab has cognitive complexity 126 (threshold 15). Drivers by points: ternaries 36 (46 pts), if/else 36 (42 pts), boolean chains 36, error handling 1, loops 1 (nesting depth added 16). Of this number, 74 points are the body\u0027s own statements and 52 belong to 15 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, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c47afe769252f110a17345d084ff69157832ad854534822340169ce894c620b"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanarMagnetostatics::build_system (cognitive 125): PlanarMagnetostatics::build_system has cognitive complexity 125 (threshold 15). Drivers by points: if/else 27 (69 pts), loops 20 (53 pts), boolean chains 3 (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66fa3430bf56ff699a0e7e3fe5121e6a3da168b7f087741a2f34a345f50038e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_flow::adjoint::forward (cognitive 124): vcad_kernel_flow::adjoint::forward has cognitive complexity 124 (threshold 15). Drivers by points: if/else 17 (62 pts), loops 16 (47 pts), match/switch 3 (12 pts), boolean chains 3 (nesting depth added 85). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7059730bf8dea38e3f17428c693e407e3aef8730a4e6a2e1164013916957c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"AssemblyReader::read_structure (cognitive 124): AssemblyReader::read_structure has cognitive complexity 124 (threshold 15). Drivers by points: if/else 34 (76 pts), loops 20 (30 pts), match/switch 6 (18 pts) (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":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb932f10ac25f12d5c219365ad829a1240f663b3a1462480f34f38135a564097"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawingView.DrawingView (cognitive 124): DrawingView.DrawingView has cognitive complexity 124 (threshold 15). Drivers by points: if/else 46 (54 pts), boolean chains 36, ternaries 26 (29 pts), error handling 4, loops 1 (nesting depth added 11). Of this number, 34 points are the body\u0027s own statements and 90 belong to 38 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, 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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6f6ffb0ca3060b09614d8dbfb8e3ec03718cd10c4960d8cc37b1c8c1f1c17a"}},{"ruleId":"D2","level":"warning","message":{"text":"StepReader::read_solid (cognitive 122): StepReader::read_solid has cognitive complexity 122 (threshold 15). Drivers by points: if/else 36 (86 pts), loops 13 (27 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 69). 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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"037a687f77567b4e97d825e353e123fa7dc3f02fb71c5ab3656078a5657302a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedOverlayView.viewport (cognitive 122): ReleasedOverlayView.viewport has cognitive complexity 122 (threshold 15). Drivers by points: if/else 54 (81 pts), ternaries 11 (20 pts), boolean chains 18, match/switch 2 (3 pts) (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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2f87a9f1c4511688ae3b96f5e61d0439597b3eeb01357949c03954299e1b44"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::footprint::match_family (cognitive 121): vcad_ecad_symbols::footprint::match_family has cognitive complexity 121 (threshold 15). Drivers by points: if/else 60 (90 pts), boolean chains 27, loops 4 (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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c5d1d845f74e926bc0feb5a52c0fd1b2c2cebabf759c50cbbbe4d76157b785"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_by_circle (cognitive 121): vcad_kernel_booleans::split::split_planar_face_by_circle has cognitive complexity 121 (threshold 15). Drivers by points: if/else 35 (81 pts), loops 7 (19 pts), match/switch 5 (15 pts), boolean chains 6 (nesting depth added 68). 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03dac157de53da50eed8051b43209368725052b856f0a406c5bfd8d3e136c12"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::try_route_pair_reason (cognitive 118): vcad_ecad_pcb::router::pair::try_route_pair_reason has cognitive complexity 118 (threshold 15). Drivers by points: if/else 45 (86 pts), loops 13 (20 pts), boolean chains 9, match/switch 2 (3 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d721983ceea5fecb488e0cbabeefe083e075f7316ccbd9a290f32dd1384a552"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::detect_bend (cognitive 114): vcad_kernel_sheet::flatten::detect_bend has cognitive complexity 114 (threshold 15). Drivers by points: if/else 27 (83 pts), loops 8 (20 pts), boolean chains 11 (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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b94f288aa3d794d319c04c935646081b94077446bfe67db51cbb6f43543898e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::poly2d::boolean (cognitive 111): vcad_kernel_sheet::poly2d::boolean has cognitive complexity 111 (threshold 15). Drivers by points: if/else 22 (55 pts), loops 24 (42 pts), boolean chains 8, match/switch 3 (6 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"af09d9b009fb943400ab399b905f5362710b5ad55d721fe7809eca0576f037d4"}},{"ruleId":"D2","level":"warning","message":{"text":"PcbScene.PcbScene (cognitive 111): PcbScene.PcbScene has cognitive complexity 111 (threshold 15). Drivers by points: if/else 33 (69 pts), loops 12 (25 pts), boolean chains 12, ternaries 5 (nesting depth added 49). Most of this is not in the body itself: 15 of the 111 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 84, 272, 250, \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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbed7b4cdc57c68ac8b5a4623a7c898faf5965a38f17e734abf5691ba923cfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.layoutLint (cognitive 110): ecad.layoutLint has cognitive complexity 110 (threshold 15). Drivers by points: if/else 22 (60 pts), loops 14 (28 pts), boolean chains 19, ternaries 1 (3 pts) (nesting depth added 54). Of this number, 106 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2195cf3943345dd53d82e52c4aa02c913b26b7e8828bf3656cd2d952a3c3ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"ResidualSystem::solve_lm (cognitive 108): ResidualSystem::solve_lm has cognitive complexity 108 (threshold 15). Drivers by points: if/else 18 (53 pts), loops 15 (46 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c26e5063a91e520322b1a5060f6aa820a6e437961f1a9063f5ac6be59cc9d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App (cognitive 108): App.App has cognitive complexity 108 (threshold 15). Drivers by points: if/else 40 (49 pts), ternaries 15 (27 pts), boolean chains 20, error handling 7 (12 pts) (nesting depth added 26). Of this number, 16 points are the body\u0027s own statements and 92 belong to 13 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":"packages/app/src/App.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa469381267cf37c979d4ebe5d6a9266031f42676941e6a2d3071b9da5fbe056"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::input::handle_key (cognitive 107): vcad::input::handle_key has cognitive complexity 107 (threshold 15). Drivers by points: if/else 31 (81 pts), match/switch 8 (17 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 63). 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8ab8bac7e558131de9126d03c432dec46f2172c6037455e7a031b089eb877f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_export::gerber::write_gerber_layer (cognitive 106): vcad_ecad_export::gerber::write_gerber_layer has cognitive complexity 106 (threshold 15). Drivers by points: loops 27 (64 pts), if/else 18 (35 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 58). 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":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae5553306d4e76307155cfcd27cabb095b9f587e71e658028e39ea7b1c8f3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_neutronics::transport::run (cognitive 106): vcad_kernel_neutronics::transport::run has cognitive complexity 106 (threshold 15). Drivers by points: if/else 22 (66 pts), loops 10 (22 pts), match/switch 5 (15 pts), boolean chains 3 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/transport.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d54d323924a1127e90e59fcdc8e69965a2f581e432050ead926f3af8dc019b4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::escape::plan_field_escapes_toward (cognitive 105): vcad_ecad_pcb::router::escape::plan_field_escapes_toward has cognitive complexity 105 (threshold 15). Drivers by points: if/else 27 (75 pts), loops 11 (20 pts), boolean chains 9, match/switch 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26d2853c6adff68528703e8dd42d248da8b9cfc1e1cd191e15b2f23d00793e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.placeComponents (cognitive 105): ecad.placeComponents has cognitive complexity 105 (threshold 15). Drivers by points: if/else 38 (51 pts), ternaries 23 (30 pts), boolean chains 20, loops 2, match/switch 2 (nesting depth added 20). Of this number, 72 points are the body\u0027s own statements and 33 belong to 10 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65ad0e1283da796e7797c3a23647b1416b3ce13d7bc0fa35139b1fe33023f85"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::materializer::materialize_doc_extras (cognitive 104): vcad_app::materializer::materialize_doc_extras has cognitive complexity 104 (threshold 15). Drivers by points: if/else 53 (104 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8406aebf0a6ac63d9bdcb747fde00c8cc3ef456dd5470f900b1dfb00313acf7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_cam::turning::rotary::verify_rotary_gcode (cognitive 104): vcad_kernel_cam::turning::rotary::verify_rotary_gcode has cognitive complexity 104 (threshold 15). Drivers by points: if/else 27 (66 pts), match/switch 6 (20 pts), loops 8 (15 pts), boolean chains 3 (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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a7a16a2e22556942e25bcd39043ca3ab535145f0b3bd37e7015554471f7cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::altium::build_pcb (cognitive 103): vcad_ecad_symbols::altium::build_pcb has cognitive complexity 103 (threshold 15). Drivers by points: if/else 31 (80 pts), loops 7 (12 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc390376f7a24e584ae3c4fe92aa8f54e1ae1f016102d2e4e8725fcf4ab5a419"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessMarket::build (cognitive 102): AccessMarket::build has cognitive complexity 102 (threshold 15). Drivers by points: if/else 20 (65 pts), loops 13 (25 pts), boolean chains 12 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/access.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc126c41561323874ea3d5ef6deb1fad9956d54fc75ccaa03eb265e50eb6e66"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_flow::solve::finish (cognitive 102): vcad_kernel_flow::solve::finish has cognitive complexity 102 (threshold 15). Drivers by points: if/else 20 (66 pts), loops 10 (26 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/solve.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f1893ada63e1c9913888890232d9c433469a50ab281de6efaa9c652c6541c8"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderView (cognitive 102): render.renderView has cognitive complexity 102 (threshold 15). Drivers by points: ternaries 37 (51 pts), boolean chains 32, if/else 15 (17 pts), error handling 2 (nesting depth added 16). Of this number, 100 points are the body\u0027s own statements and 2 belong 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440a74f30be36aa75a17b112d34cb5e91c8cbf3b79a7525d025ca11b7c0beea"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCImport.parse (cognitive 100): CNCImport.parse has cognitive complexity 100 (threshold 15). Drivers by points: if/else 27 (70 pts), ternaries 3 (12 pts), loops 4 (8 pts), boolean chains 6, match/switch 1 (4 pts) (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":"apple/VcadApp/Sources/VcadApp/CNCImport.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd44bfeec4fe70f36fd315c3aceae573547268a2d1e24058c97ad2f1f2663b71"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::route_file (cognitive 99): vcad::route_file has cognitive complexity 99 (threshold 15). Drivers by points: if/else 36 (61 pts), loops 16 (27 pts), boolean chains 9, match/switch 2 (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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"335954b2605ad35c59ecb2575677ecdee2c60bbe00ca2b31e842222519dbaac9"}},{"ruleId":"D2","level":"warning","message":{"text":"source-parser.parseRustSourceContentWithInference (cognitive 97): source-parser.parseRustSourceContentWithInference has cognitive complexity 97 (threshold 15). Drivers by points: if/else 28 (82 pts), loops 4 (7 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 59). 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79ef8e242b9e4cefa6de60405460686cf1c07297a0359a279136e34955b7923"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::modal::brick_matrices (cognitive 96): vcad_kernel_fea::modal::brick_matrices has cognitive complexity 96 (threshold 15). Drivers by points: loops 20 (65 pts), if/else 8 (25 pts), match/switch 1 (6 pts) (nesting depth added 67). 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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4270da183e54dd78348c44e6dcf13e1190e1a2d945326601fc5f2b08d6ec8a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::resolve::apply_to_op (cognitive 95): vcad_ir::resolve::apply_to_op has cognitive complexity 95 (threshold 15). Drivers by points: if/else 47 (76 pts), match/switch 10 (19 pts) (nesting depth added 38). 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":"crates/vcad-ir/src/resolve.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad315d5305613b51443026e85dbd1794680c27288af2ec469f0f81b206380f2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::heal_t_junctions_pass (cognitive 95): vcad_kernel_tessellate::heal_t_junctions_pass has cognitive complexity 95 (threshold 15). Drivers by points: if/else 34 (70 pts), loops 11 (23 pts), boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e9978a9a3060ee25f2957ba33f4b0c0b229ff61c8c6794406c7cd75a5ad896"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::helmholtz::solve_driven (cognitive 93): vcad_kernel_acoustics::helmholtz::solve_driven has cognitive complexity 93 (threshold 15). Drivers by points: if/else 20 (50 pts), match/switch 7 (25 pts), loops 7 (10 pts), boolean chains 8 (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":"crates/vcad-kernel-acoustics/src/helmholtz.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b5eff05db1b00e952f21ddf77f8fe5128259dcaa8ea0ccbe2815e9322de134"}},{"ruleId":"D2","level":"warning","message":{"text":"FeSystem::build (cognitive 93): FeSystem::build has cognitive complexity 93 (threshold 15). Drivers by points: loops 18 (50 pts), if/else 12 (43 pts) (nesting depth added 63). 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":"crates/vcad-kernel-topopt/src/fea.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a346da439d4c02fee8bd5bbbb6d90a9a1c96a30e176f0fc10b096f1207eead"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::antenna_extract::extract_antenna_spec (cognitive 92): vcad_eval::antenna_extract::extract_antenna_spec has cognitive complexity 92 (threshold 15). Drivers by points: if/else 39 (58 pts), loops 14 (18 pts), boolean chains 14, match/switch 2 (nesting depth added 23). Of this number, 91 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":"crates/vcad-eval/src/antenna_extract.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4322aeccdfc6fdf75a17846def2cf357e924d513499ef7946f5eb1ad6cb100dd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_face_by_curve (cognitive 92): vcad_kernel_booleans::split::split_face_by_curve has cognitive complexity 92 (threshold 15). Drivers by points: if/else 41 (62 pts), loops 12 (20 pts), boolean chains 10 (nesting depth added 29). Of this number, 90 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"76723c44c73410401483716ddc7b07f92c2a745d3ff28a3afa5186bb728829b7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::route_pass (cognitive 90): vcad_ecad_pcb::router::auto::route_pass has cognitive complexity 90 (threshold 15). Drivers by points: if/else 25 (55 pts), loops 10 (24 pts), boolean chains 11 (nesting depth added 44). 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c736861c8ff9febcac2a9feb59fa2b5dadbbfa12e41ea9ab37ffa28a303c82"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::realize (cognitive 88): vcad_ecad_pcb::router::flow::route::realize has cognitive complexity 88 (threshold 15). Drivers by points: loops 23 (51 pts), if/else 10 (32 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 51). 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"544ea4983a88c854e853b8dfdf3067f56bb57d7ce7b0053daa635c8f91b2e85e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_cam::turning::verify::parse (cognitive 88): vcad_kernel_cam::turning::verify::parse has cognitive complexity 88 (threshold 15). Drivers by points: if/else 19 (43 pts), match/switch 8 (24 pts), loops 6 (11 pts), boolean chains 10 (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":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"85610e255f540eb318c8ccf348fad310f2c9cc3bee7ad69bda5af868171b1053"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::revolved::extract_profile (cognitive 88): vcad_kernel_fillet::revolved::extract_profile has cognitive complexity 88 (threshold 15). Drivers by points: if/else 29 (62 pts), loops 10 (14 pts), boolean chains 6, match/switch 3 (6 pts) (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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec24fb79a4f5d655e9ead3f6a4f3c219693f9b4cd491246263ff411911a5155"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::reconstruct::plan_edge_merges (cognitive 88): vcad_kernel_step::reconstruct::plan_edge_merges has cognitive complexity 88 (threshold 15). Drivers by points: if/else 29 (66 pts), loops 9 (13 pts), boolean chains 5, match/switch 2 (4 pts) (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":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eacbffe693be2ca24a11052f974d1e583ec096975cbf6fd576e659a0fbe3c98"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addCoil (cognitive 88): ecad.addCoil has cognitive complexity 88 (threshold 15). Drivers by points: if/else 23 (40 pts), loops 8 (17 pts), ternaries 10 (17 pts), boolean chains 14 (nesting depth added 33). Of this number, 86 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7744}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0b351e576684e63347b9edbafbc0b11444c4ec5c46051b00ca6b7c4267d395"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsCanvas.body (cognitive 87): ElectronicsCanvas.body has cognitive complexity 87 (threshold 15). Drivers by points: if/else 34 (50 pts), ternaries 9 (15 pts), boolean chains 14, loops 4 (6 pts), match/switch 2 (nesting depth added 24). Of this number, 86 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1615a4121b312b42b681ea9e809a58d0a6f96f9c80f33b5935017d44ce24b022"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.loopRegions (cognitive 87): SketchSession.loopRegions has cognitive complexity 87 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 10 (20 pts), boolean chains 16, ternaries 2 (8 pts) (nesting depth added 43). Of this number, 77 points are the body\u0027s own statements and 10 belong to 4 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"af045b23d7be2360bdda5ada3644e219e0226228e5448a384676729b50f1dad3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::polish_pairs (cognitive 86): vcad_ecad_pcb::router::pair::polish_pairs has cognitive complexity 86 (threshold 15). Drivers by points: loops 17 (40 pts), if/else 12 (33 pts), boolean chains 7, match/switch 2 (6 pts) (nesting depth added 48). 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"497d1db5de0c8cc71090c1aa8d5949c012b4d4081187a80d86325b9397c71da1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer_gcode::lint::lint (cognitive 86): vcad_slicer_gcode::lint::lint has cognitive complexity 86 (threshold 15). Drivers by points: if/else 30 (78 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/lint.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2639a782db44c9e3daf25eeedfb134b6ddd64918257405c4fce7c75b8ff96f56"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCController.simulateCommand (cognitive 85): CNCController.simulateCommand has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (40 pts), ternaries 6 (24 pts), match/switch 3 (9 pts), loops 4 (7 pts), boolean chains 5 (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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f038b22423ebb06040667ff29b9e55609d6b7f15c495e4cd4877803b1b63a421"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedARView.rebuild (cognitive 85): ReleasedARView.rebuild has cognitive complexity 85 (threshold 15). Drivers by points: if/else 34 (51 pts), boolean chains 24, ternaries 3 (6 pts), loops 3 (4 pts) (nesting depth added 21). Of this number, 84 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81230758c953cc30bd52870715b4964117274a9fb510fa63d14c07517854d64"}},{"ruleId":"D2","level":"warning","message":{"text":"SceneMesh.SceneMesh (cognitive 85): SceneMesh.SceneMesh has cognitive complexity 85 (threshold 15). Drivers by points: if/else 46 (51 pts), boolean chains 32, loops 1, ternaries 1 (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 66 belong to 20 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, 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b6fa85f68e90c9a6439402bff0afaf2ce248d723d78ffd182fda30ee136fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::blend_loft::loft_blend_edge_keyed (cognitive 84): vcad_kernel_fillet::blend_loft::loft_blend_edge_keyed has cognitive complexity 84 (threshold 15). Drivers by points: if/else 26 (55 pts), loops 10 (20 pts), boolean chains 9 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/blend_loft.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e11e56857b648ead7c0b8f6d5859a2e4b56c5c935b3bc0ce886be80c59bfba7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::trim::trim_curve_to_face (cognitive 83): vcad_kernel_booleans::trim::trim_curve_to_face has cognitive complexity 83 (threshold 15). Drivers by points: if/else 28 (56 pts), loops 8 (18 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 40). 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b31e0f0eab1c21c0cc832d2d4ad31e760a433819450652ef1b330ef67255059"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::raster::rasterize (cognitive 82): vcad_render::raster::rasterize has cognitive complexity 82 (threshold 15). Drivers by points: loops 16 (43 pts), if/else 18 (35 pts), boolean chains 2, match/switch 2 (nesting depth added 44). 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6a38284a9758ee9b7d35c4424bd3668ed750fbbe731fe3a1311152b6bd8db6"}},{"ruleId":"D2","level":"warning","message":{"text":"animate.exportVideo (cognitive 82): animate.exportVideo has cognitive complexity 82 (threshold 15). Drivers by points: ternaries 20 (31 pts), if/else 19 (25 pts), boolean chains 18, error handling 3 (7 pts), loops 1 (nesting depth added 21). Of this number, 81 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a03a0fafc4753c3045ad47da85b088631938de180dbf45d07cccdf81d58bac3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::migrate::migrate_node (cognitive 81): vcad_app::migrate::migrate_node has cognitive complexity 81 (threshold 15). Drivers by points: if/else 33 (70 pts), loops 4 (7 pts), match/switch 3 (4 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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"49008981eb71452aebffce3d2d2c1cddf3c7879aa482e0122c7a6ba899eb1831"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::topology::analyze (cognitive 81): vcad_ffi::topology::analyze has cognitive complexity 81 (threshold 15). Drivers by points: if/else 20 (61 pts), loops 7 (17 pts), boolean chains 3 (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":"crates/vcad-ffi/src/topology.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21151595901dff9ff144867c55b4d1df409138f2202cf49e02aab8802835b35"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::clip_spherical_face_by_circle (cognitive 81): vcad_kernel_booleans::split::clip_spherical_face_by_circle has cognitive complexity 81 (threshold 15). Drivers by points: if/else 34 (51 pts), loops 12 (19 pts), boolean chains 9, match/switch 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de8a44a614d33cc29bdc6913e800e2821c3217b05d8a410c978b71346f3909d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::legalize::merge_same_net_vias (cognitive 80): vcad_ecad_pcb::router::legalize::merge_same_net_vias has cognitive complexity 80 (threshold 15). Drivers by points: if/else 17 (55 pts), loops 11 (21 pts), boolean chains 4 (nesting depth added 48). Of this number, 78 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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c67906d18f22917bfca33faea7eb414ce32a1368db673dcbcf385c8fffa1751"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCOverlay.swift.syncCNCOverlay (cognitive 80): CNCOverlay.swift.syncCNCOverlay has cognitive complexity 80 (threshold 15). Drivers by points: boolean chains 33, if/else 16 (27 pts), ternaries 4 (13 pts), loops 3 (7 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":"apple/VcadApp/Sources/VcadApp/CNCOverlay.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"55276e1c65b121a3826321c38768ea9753db6ca654d19efa88a8708627a7b96c"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowGraph::build (cognitive 79): FlowGraph::build has cognitive complexity 79 (threshold 15). Drivers by points: loops 15 (35 pts), if/else 11 (34 pts), boolean chains 5, match/switch 2 (5 pts) (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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c236beb652ede668653bcc2ff67500f73bfcfbe4051ebb285c39663b3e9f92de"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::vcode::parse_geometry_opcode (cognitive 79): vcad_ir::vcode::parse_geometry_opcode has cognitive complexity 79 (threshold 15). Drivers by points: if/else 31 (69 pts), match/switch 3 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 43). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"98eb566cc116e2c332859b87e07f3a9e30de80d97ca12491de74f667c195ddfc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_export::build_glb (cognitive 79): vcad_kernel_export::build_glb has cognitive complexity 79 (threshold 15). Drivers by points: if/else 29 (49 pts), loops 9 (21 pts), match/switch 2 (5 pts), boolean chains 4 (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":"crates/vcad-kernel-export/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01fb1c16c9bcd7cd8e5458612bdcb3b9189982006e2d9d3c2bfbdfe925ba345"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_printcheck::checks::check_columns (cognitive 79): vcad_printcheck::checks::check_columns has cognitive complexity 79 (threshold 15). Drivers by points: if/else 18 (50 pts), loops 12 (23 pts), boolean chains 4, match/switch 1 (2 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":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a799b0a576e096080fa8de87708f20b3ae3a65049a95307600eec50da552a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentGraph.parse (cognitive 79): DocumentGraph.parse has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 22, loops 7 (14 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c0440876d4d699a68900ca8b028ee10f6ec787f3596cb253f8919855227577"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentGraph.parse (cognitive 79): DocumentGraph.parse has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 22, loops 7 (14 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":"apple/VcadVision/Sources/VcadVision/Shared/Document.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc89d89407cb363e813f0c7b70bcb5d0616a57a6f7602593a9d431e294f28593"}},{"ruleId":"D2","level":"warning","message":{"text":"AxisymMagnetostatics::build_system (cognitive 78): AxisymMagnetostatics::build_system has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (40 pts), loops 17 (36 pts), boolean chains 2 (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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a56fb07df54f495a22716fe2093a83894c3bb364e512a9c71f688f02e63cc65"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.calcMotor (cognitive 78): ecad.calcMotor has cognitive complexity 78 (threshold 15). Drivers by points: if/else 22 (43 pts), ternaries 15 (26 pts), boolean chains 9 (nesting depth added 32). Of this number, 73 points are the body\u0027s own statements and 5 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93fa4e7b65d5de3beb8b0debfcbb361a702805d8bd236296d03a4e703f9dcd3"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureInput::to_crdt_params (cognitive 77): FeatureInput::to_crdt_params has cognitive complexity 77 (threshold 15). Drivers by points: if/else 44 (74 pts), loops 1 (2 pts), match/switch 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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ba07a7c8edc96b08d5bbcbdf64c691c840cbd97af32bc4192b4a1c8f9d26b2"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveRouter::shortest_path (cognitive 76): InteractiveRouter::shortest_path has cognitive complexity 76 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 12 (21 pts), boolean chains 8 (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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ab6f5f2432fc9c316fd3dc494e2918e9b179506901ce8193bf4c8efdb6dd74"}},{"ruleId":"D2","level":"warning","message":{"text":"clearance.computeInterferenceAudit (cognitive 76): clearance.computeInterferenceAudit has cognitive complexity 76 (threshold 15). Drivers by points: if/else 12 (31 pts), ternaries 10 (22 pts), boolean chains 8, loops 5 (8 pts), error handling 3 (7 pts) (nesting depth added 38). Of this number, 72 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52e7c2d1d3c71d7d2b9c08eb83b3adfb99731d7247a458a6d0cb2853c9cc0ac"}},{"ruleId":"D2","level":"warning","message":{"text":"GizmoView.swift.buildGizmo (cognitive 75): GizmoView.swift.buildGizmo has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 19 (41 pts), if/else 12 (18 pts), loops 6 (10 pts), boolean chains 6 (nesting depth added 32). Of this number, 69 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":"apple/VcadApp/Sources/VcadApp/GizmoView.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"20702d51a95dacc1c9e0e20f11dececc5b8d8298e7b0416f6fda4df42ae8b631"}},{"ruleId":"D2","level":"warning","message":{"text":"Repl::execute (cognitive 74): Repl::execute has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 9 (18 pts), boolean chains 3, match/switch 2 (3 pts) (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":"crates/vcad-cli/src/repl.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9417fdb23af70ebb1d8922c80015bc6d1eb64dd575d19e95b3327059068c2a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowGraph::shortest (cognitive 74): FlowGraph::shortest has cognitive complexity 74 (threshold 15). Drivers by points: if/else 13 (43 pts), loops 9 (23 pts), boolean chains 6, match/switch 1 (2 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"69720418cc61890fc956ef80784b739f387f2fc521a5f81a9624c92412e415a4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::joint_window_repair (cognitive 74): vcad_ecad_pcb::router::auto::joint_window_repair has cognitive complexity 74 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 7 (22 pts), match/switch 2 (12 pts), boolean chains 8 (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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36e82aa498650bac44403bd91d75475e45735019e1b3f1fbfcc7bcb14796af0"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracer::trace_impl (cognitive 74): Tracer::trace_impl has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (64 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (nesting depth added 44). 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":"crates/vcad-kernel-particle/src/trace.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"157384f1cb50d7602f931f56e37017622851b2133460a59f0eed3f0291ae3871"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::manifold::clean_pass (cognitive 74): vcad_kernel_tessellate::manifold::clean_pass has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 11 (26 pts), match/switch 2 (10 pts), boolean chains 3 (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":"crates/vcad-kernel-tessellate/src/manifold.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bc4f14e1dbe5774ba7f3a6c8b8242ce524741bee5cc2fe73f36697285380b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedOverlayView.tapSelect (cognitive 74): ReleasedOverlayView.tapSelect has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (42 pts), boolean chains 32 (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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6356f24e061f7dc875618d1d781101bc091a4a668572b135fe84642b43fb0630"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::chat::draw_chat (cognitive 73): vcad::ui::chat::draw_chat has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 16 (33 pts), match/switch 1 (3 pts), boolean chains 2 (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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"567b6b91636102fbd4f191625acb2b09448593c34bebc8d8ee4ce562d11a6008"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::sco::qp_l1 (cognitive 73): vcad_ecad_pcb::router::sco::qp_l1 has cognitive complexity 73 (threshold 15). Drivers by points: loops 13 (40 pts), if/else 10 (32 pts), boolean chains 1 (nesting depth added 49). 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5669063da21b9428c3bf0ef0c829f93e0540220fbe0b65de780ac51572a3319d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::optimize::optimize_document (cognitive 73): vcad_eval::optimize::optimize_document has cognitive complexity 73 (threshold 15). Drivers by points: if/else 28 (49 pts), loops 9 (16 pts), boolean chains 4, match/switch 3 (4 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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d2208ac2453a6835cb2e3a80919516ed96ab92e48e5a5644bfacbb4cda2027"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::realize_legs (cognitive 72): vcad_ecad_pcb::router::pair::realize_legs has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 10 (14 pts), boolean chains 11, match/switch 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ddaf1de784f04f09ce1836af02346ae02730495cd9d41d80c7b3cc817ef3bc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::torus_two_chain_rotated (cognitive 72): vcad_kernel_tessellate::torus_two_chain_rotated has cognitive complexity 72 (threshold 15). Drivers by points: if/else 37 (53 pts), loops 10 (12 pts), boolean chains 6, match/switch 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6849}}}],"partialFingerprints":{"codehealthFindingId/v1":"24944a91453f996962835b29e17de5ad53761cc7ff4c2fa4d86687ec2d19f635"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol-2026.handleModernRequest (cognitive 72): protocol-2026.handleModernRequest has cognitive complexity 72 (threshold 15). Drivers by points: if/else 29 (39 pts), ternaries 12 (18 pts), boolean chains 14, error handling 1 (nesting depth added 16). Of this number, 66 points are the body\u0027s own statements and 6 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eaf48ce2d7a35278a7b8891879a2fec30de446c386aa0eb80dbcb0e9e03118"}},{"ruleId":"D2","level":"warning","message":{"text":"enclosure.sealedWallOpenings (cognitive 72): enclosure.sealedWallOpenings has cognitive complexity 72 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 7 (19 pts), ternaries 5 (19 pts), boolean chains 5 (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":"packages/mcp/src/tools/enclosure.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7764f19dca9557ac26ced5c5191831e6e00bfc6b602f9857cafa524663cf72fe"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::collapse_short_defective_edges (cognitive 71): vcad_kernel_tessellate::collapse_short_defective_edges has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 9 (19 pts), boolean chains 3 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8773}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddee7f096716a57f68d09bceca7b0ed44a0fb42755ab9f829c0c3c830f6e26e2"}},{"ruleId":"D2","level":"warning","message":{"text":"order.quoteManufacturing (cognitive 71): order.quoteManufacturing has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (33 pts), ternaries 18 (24 pts), boolean chains 9, error handling 3 (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":"packages/mcp/src/tools/order.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"432c6cb3f8c831f35ef76d19f653e1ad6550f488b2f09464c92bb775cf4d7b85"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::cam_job::job (cognitive 70): vcad_ffi::cam_job::job has cognitive complexity 70 (threshold 15). Drivers by points: if/else 29 (50 pts), loops 5 (9 pts), match/switch 3 (6 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":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b5ffe6aa6c001ac948a8188e2587bf7fd937f90a7d711e3eaae312cb1cb852"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::api::boolean_op_reported_untimed (cognitive 70): vcad_kernel_booleans::api::boolean_op_reported_untimed has cognitive complexity 70 (threshold 15). Drivers by points: if/else 29 (48 pts), boolean chains 20, 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0570747c11dfeeaed9a8059e875d5100936e5892ab64b875548a69e337f109"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::prune_redundant_patches (cognitive 70): vcad_kernel_tessellate::prune_redundant_patches has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 15 (27 pts), boolean chains 5 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd0aa442a51ad3196f56ace66984fdfa403543d833f4413c81eed138f67c6cd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_topopt::extract::extract_mesh (cognitive 70): vcad_kernel_topopt::extract::extract_mesh has cognitive complexity 70 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 10 (30 pts), match/switch 1 (6 pts), boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-topopt/src/extract.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d9ea30508acfc29427523198b94dc6cb79e61c8d58dfceb156513ee9245ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::stitch_to_planes (cognitive 69): vcad::stitch_to_planes has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (55 pts), loops 4 (10 pts), boolean chains 2, match/switch 1 (2 pts) (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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9a7ea8aa8f1971861dcb688833112f9f54f0813847e324359b7ee5d0db8b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::triangulate_circular_cap_with_holes (cognitive 69): vcad_kernel_tessellate::triangulate_circular_cap_with_holes has cognitive complexity 69 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 14 (29 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae28777b4b5a4f36f789aa2a26a5223d67f24a23bd3538e5b0c656c3b4f1371"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::input::handle_mouse (cognitive 68): vcad::input::handle_mouse has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (61 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 38). 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"129e0f4b3be8fd5ffb11be7a4469ad59a226b36634e564e248f1d10d86fdc6ad"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_conical_face_by_ruling (cognitive 68): vcad_kernel_booleans::split::split_conical_face_by_ruling has cognitive complexity 68 (threshold 15). Drivers by points: if/else 33 (51 pts), loops 5 (9 pts), boolean chains 7, match/switch 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4795}}}],"partialFingerprints":{"codehealthFindingId/v1":"106934551c1d44b967b4ca3357ed9fc6ee23368daef2efc63a9d85a7a2ef000c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::pmi::extract_pmi (cognitive 68): vcad_kernel_step::pmi::extract_pmi has cognitive complexity 68 (threshold 15). Drivers by points: if/else 12 (42 pts), loops 12 (25 pts), boolean chains 1 (nesting depth added 43). 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":"crates/vcad-kernel-step/src/pmi.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd52822d37b1ef470bde5891b24f1e81e064deab1e92b1e69a455c7a871939d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::frozen::capture_plan (cognitive 68): vcad_kernel_tessellate::frozen::capture_plan has cognitive complexity 68 (threshold 15). Drivers by points: loops 11 (25 pts), if/else 7 (24 pts), match/switch 4 (15 pts), boolean chains 4 (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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb40e6500745abcec4c838e3a15e1b02ffeababb033475d7ca24bce0f2987247"}},{"ruleId":"D2","level":"warning","message":{"text":"useCanvasRecorder.useCanvasRecorder (cognitive 68): useCanvasRecorder.useCanvasRecorder has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (35 pts), error handling 7 (14 pts), boolean chains 11, ternaries 3 (8 pts) (nesting depth added 26). None of this is in the body itself: all 68 points belong to 7 function literals inside it that branch (lines 103, 261, 305, \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":"packages/app/src/hooks/useCanvasRecorder.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"94723befd52b5db7d4a839ce313b59e141d9514e0daec547407e028f660b21ac"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::bem::solve (cognitive 67): vcad_kernel_particle::bem::solve has cognitive complexity 67 (threshold 15). Drivers by points: loops 15 (29 pts), if/else 18 (28 pts), boolean chains 7, match/switch 2 (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":"crates/vcad-kernel-particle/src/bem.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff3529b98e600e6779389551e7b4ef75ca0bc08cdd2e63f4e69cb40f1fc8ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::split_top_level (cognitive 67): vcad_loon::split_top_level has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 6 (16 pts), boolean chains 8, match/switch 1 (4 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":"crates/vcad-loon/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be2a55058639ae83ca07a94baa54339bfad3e126b510f995fb6d15b36bfbc9b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::callouts::detect (cognitive 67): vcad_render::callouts::detect has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 4 (9 pts), boolean chains 4, match/switch 1 (3 pts) (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":"crates/vcad-render/src/callouts.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"762e80d5395658948ce980600790e075dfba267932080e5e7026e7a2f09278f5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseGeometryOpcode (cognitive 67): index.parseGeometryOpcode has cognitive complexity 67 (threshold 15). Drivers by points: if/else 29 (63 pts), loops 1 (2 pts), boolean chains 1, 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":"packages/ir/src/index.ts"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69348ee6cd88fde8c07eac3e5859d4a26313cad038bb3329590604764ca5c28"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.deriveNets (cognitive 67): ecad.deriveNets has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 17 (27 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 28). Of this number, 63 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59701c127cde830cc46b2491ff3c77cccfda833bed6b019811e15a7f3102099"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::em::extract_axisym_mag_spec_from_scene (cognitive 66): vcad_eval::sim_extract::em::extract_axisym_mag_spec_from_scene has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (37 pts), loops 8 (15 pts), boolean chains 7, match/switch 3 (7 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":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"4354ba40e7a3fc21089d31fa9e4f3a43faab2b72d8007df6e275e797e9effc56"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::adjoint::smooth_max_gradient (cognitive 66): vcad_kernel_thermal::adjoint::smooth_max_gradient has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 9 (16 pts), match/switch 3 (8 pts), boolean chains 5 (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":"crates/vcad-kernel-thermal/src/adjoint.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"335b27da357f55f905dc5c5656801b85b1d41bbebcfb7d259e192a3725a3ccc0"}},{"ruleId":"D2","level":"warning","message":{"text":"KernelMesh.creasedNormals (cognitive 66): KernelMesh.creasedNormals has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 11 (17 pts), boolean chains 7, ternaries 2 (nesting depth added 28). Of this number, 56 points are the body\u0027s own statements and 10 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7f74f455cc100eb60c6b11a21f49e4fa95b62a303d1e448fb96ff8f320ef33"}},{"ruleId":"D2","level":"warning","message":{"text":"KernelMesh.creasedNormals (cognitive 66): KernelMesh.creasedNormals has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 11 (17 pts), boolean chains 7, ternaries 2 (nesting depth added 28). Of this number, 56 points are the body\u0027s own statements and 10 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":"apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"83427091e9d14c181fa07d148a513fb9d5c19f584c59a9737d4dd9964c166cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"RayTracedViewport.RayTracedViewportSync (cognitive 66): RayTracedViewport.RayTracedViewportSync has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (34 pts), error handling 5 (13 pts), boolean chains 8, ternaries 3 (6 pts), loops 3 (5 pts) (nesting depth added 27). None of this is in the body itself: all 66 points belong to 4 function literals inside it that branch (lines 91, 317, 158, \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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"409f48fa5f2e8ae453aa6fe8f1ebf98f9b82aaf148c725c4e272381a485cdb51"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_keepout (cognitive 65): vcad_ecad_pcb::drc::check_keepout has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 5 (14 pts), boolean chains 4 (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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bce544588857839e8acf286b825c7b1697170d4a7019e798123a858186ae6fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Device3d::validate (cognitive 65): Device3d::validate has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 8, loops 2 (4 pts), match/switch 2 (3 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":"crates/vcad-kernel-particle/src/wire3d.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a48ae107bb6413fb7ea9644f04b78ee8f49f72104c1539ff897b9927a0c835"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_shell::shell_brep_analytical (cognitive 65): vcad_kernel_shell::shell_brep_analytical has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 15 (27 pts), match/switch 2 (3 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4a3800173a3dde1dc40bc91bb745763125f56cdb776bca2df37a71da68b79f"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.ink (cognitive 65): SketchSession.ink has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 4 (12 pts), boolean chains 7, match/switch 2 (4 pts) (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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebcec3c94f7ba1f8901269226f353e7e6f49c74411f12e8387b0671e750afd2"}},{"ruleId":"D2","level":"warning","message":{"text":"usePcbCamera.usePcbCamera (cognitive 65): usePcbCamera.usePcbCamera has cognitive complexity 65 (threshold 15). Drivers by points: if/else 37 (52 pts), boolean chains 8, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 17). None of this is in the body itself: all 65 points belong to 12 function literals inside it that branch (lines 46, 277, 229, \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":"packages/app/src/components/electronics/pcb3d/usePcbCamera.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f71046148d9c5ad85367262c7f2876ecbf0acd98aed915c69ac533779ca05cd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_shell::shell_brep_open (cognitive 64): vcad_kernel_shell::shell_brep_open has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 11 (14 pts), match/switch 4 (7 pts), boolean chains 4 (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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dda4112311e48cec0afa550b0e2b70802f6ae3eaf1eb9fb3880013b9809ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::raytrace::rasterize_rt_scene (cognitive 64): vcad_render::raytrace::rasterize_rt_scene has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 10 (26 pts), boolean chains 2, match/switch 1 (2 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5444}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cc610e6f0945e8f92acf29132a8566a1090483d083d1ee17425702ee9dddb9"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsCanvas.installMonitor (cognitive 64): ElectronicsCanvas.installMonitor has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 16, ternaries 3 (5 pts), match/switch 1 (2 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32a74382ddaf4a860000385d3581cc25c30f4a710dc7018af3c6e93c2b727b6"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchInference.infer (cognitive 64): SketchInference.infer has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (34 pts), ternaries 5 (18 pts), boolean chains 12 (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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda7b0a4a0165d99433845549089a5092ebd824dd84f32f83a9e172d1a3c6bed"}},{"ruleId":"D2","level":"warning","message":{"text":"XRGestures.XRGestures (cognitive 64): XRGestures.XRGestures has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (42 pts), boolean chains 12, ternaries 4 (9 pts), loops 1 (nesting depth added 22). None of this is in the body itself: all 64 points belong to 4 function literals inside it that branch (lines 199, 255, 258, \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":"packages/app/src/components/xr/XRGestures.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad0052f3f032d318e121f70ace6eb8ee2932e923395cd52f49f96bcf5f476bc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::eagle_brd::parse_eagle_brd (cognitive 63): vcad_ecad_symbols::eagle_brd::parse_eagle_brd has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (39 pts), loops 8 (13 pts), match/switch 3 (10 pts), boolean chains 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":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50b7aaa6c7c44249d167bbc45a7266e23341608d62d0185bbfdd1eec4449953"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_adjoint::couple::solve_coupled (cognitive 63): vcad_kernel_adjoint::couple::solve_coupled has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (43 pts), loops 9 (17 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":"crates/vcad-kernel-adjoint/src/couple.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fb94e1959bb218e5a21c055fd751b3de7f3cf7fc0bfa0d5b0f0702270cfe97"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_cam::turning::rotary::plan_rotary (cognitive 63): vcad_kernel_cam::turning::rotary::plan_rotary has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 9 (19 pts), boolean chains 5 (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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a1fe4596dbaea668138b9d81e007da3f4831f6186fd7e3dd0800279fa74b6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_ruled_two_chain (cognitive 63): vcad_kernel_tessellate::tessellate_ruled_two_chain has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (43 pts), boolean chains 10, loops 8 (10 pts) (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"626c0eda23ea1ea66717e03b18b35e6953a0d155b75b9507a688383006c5b142"}},{"ruleId":"D2","level":"warning","message":{"text":"distill_lambda.distill (cognitive 63): distill_lambda.distill has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (51 pts), ternaries 3 (5 pts), loops 3 (4 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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3f9a435c0ff968859a5e3920faf302cb3351b112bb773c5dc63ec74e3b12ae"}},{"ruleId":"D2","level":"warning","message":{"text":"useCameraControls.useCameraControls (cognitive 63): useCameraControls.useCameraControls has cognitive complexity 63 (threshold 15). Drivers by points: if/else 28 (34 pts), boolean chains 13, loops 6 (13 pts), ternaries 3 (nesting depth added 13). None of this is in the body itself: all 63 points belong to 8 function literals inside it that branch (lines 64, 14, 244, \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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa86eee223b46068facac7a4eb0c0ac5ae3447e95d3e9a97a765243de08547a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_design_constraints::lower::write_back_group (cognitive 62): vcad_design_constraints::lower::write_back_group has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 4 (8 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 39). 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41ab7f33b1e4a16e45576a509cdbd2cfb8e2bc46d9609a79c68ca95bae9a062"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::gpu_bridge::gpu_search_batch_inner (cognitive 62): vcad_ecad_pcb::router::gpu_bridge::gpu_search_batch_inner has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 8 (15 pts), boolean chains 5, match/switch 1 (2 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":"crates/vcad-ecad-pcb/src/router/gpu_bridge.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ccadc40bab8d7ac0dcaba3bd7825282b78de497a5a48496fe861234a9886da"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::thermal_extract::extract_thermal_spec_from_scene (cognitive 62): vcad_eval::thermal_extract::extract_thermal_spec_from_scene has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 14 (23 pts), boolean chains 2, match/switch 1 (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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2b4b3c57d3f9a04df5e62738f3fe81b4451d71f4b7283b73b0f173b13e6712"}},{"ruleId":"D2","level":"warning","message":{"text":"Roughing3D::generate_level_passes (cognitive 62): Roughing3D::generate_level_passes has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (52 pts), loops 4 (10 pts) (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":"crates/vcad-kernel-cam/src/operation/roughing3d.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"671cc56ec76a3ffc060f43d9b81bfdc5664a52404af74d0af11539c692606b80"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentTools.call (cognitive 62): AgentTools.call has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (45 pts), ternaries 6 (12 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 30). Of this number, 53 points are the body\u0027s own statements and 9 belong 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":"apple/VcadApp/Sources/VcadApp/AgentBridge.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"130eaa12f893ae4416aa51d06ac43b0be8c0735d0de801f5bf16969865cf044b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::migrate::migrate_assembly (cognitive 61): vcad_app::migrate::migrate_assembly has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (50 pts), match/switch 2 (6 pts), loops 3 (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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccc4cb430258168522ae2e339b49f056bb6c128bbdb1ba965eba407ed35040f"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowGraph::negotiate (cognitive 61): FlowGraph::negotiate has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (40 pts), loops 8 (17 pts), boolean chains 4 (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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ffcc1b4ba1e0f237c98a388cf74bb8472108e1cc993867014037b10424f33c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r7_threads_and_gears (cognitive 61): vcad_kernel_dfm::rules::hobby_mill::r7_threads_and_gears has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 8 (16 pts), boolean chains 6, match/switch 1 (3 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f198d4544115901963c62bfb644ab8b128fa28ed844d9719d4f65f28d5f209d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_topopt::simp::filter_sensitivities (cognitive 61): vcad_kernel_topopt::simp::filter_sensitivities has cognitive complexity 61 (threshold 15). Drivers by points: if/else 7 (37 pts), loops 6 (21 pts), boolean chains 3 (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":"crates/vcad-kernel-topopt/src/simp.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf928adc6a81b5340d53cd669850999312ed45d51a911526c457af51cf39606"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_printcheck::checks::check_walls (cognitive 61): vcad_printcheck::checks::check_walls has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (35 pts), loops 6 (15 pts), match/switch 1 (6 pts), boolean chains 5 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ca84a4e133231122c82bdc8a2ea4e2dc01d3628f8d38573c6559d6929d15f2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.toVCode (cognitive 61): index.toVCode has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 11 (24 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":"packages/ir/src/index.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f7b975b5720fdd504499a50492a5f2c7e8872eef06786429939a0124a435b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.buildSheetBody (cognitive 61): ecad.buildSheetBody has cognitive complexity 61 (threshold 15). Drivers by points: boolean chains 27, if/else 13 (17 pts), ternaries 11 (14 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 43 belong to 9 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fddc49040dc00df9056d1ec34a7e29ecd325768fe31a7f80bc8e78a3101d33b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::run_fab_prep (cognitive 60): vcad_ecad_fabprep::run_fab_prep has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (46 pts), boolean chains 8, match/switch 2 (4 pts), loops 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":"crates/vcad-ecad-fabprep/src/lib.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96337a6a698135138285c1d79ed7016e1d90ce0ab4c29db8666688a19591bad"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::adjoint::shape_gradient (cognitive 60): vcad_kernel_fea::adjoint::shape_gradient has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 10 (28 pts), boolean chains 2, match/switch 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/adjoint.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab7d17f172dfaff5864822e3f6ea8b2dc7422a68e5f55c3656565bb4197149b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.formatSceneSettings (cognitive 59): index.formatSceneSettings has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (38 pts), ternaries 4 (12 pts), match/switch 2 (5 pts), loops 2 (4 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":"packages/ir/src/index.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adf97035b87a62f940de6773b0f3ef3f9295035b5a999f92da2b4a94a0d7f24"}},{"ruleId":"D2","level":"warning","message":{"text":"animate.buildSequenceGlb (cognitive 59): animate.buildSequenceGlb has cognitive complexity 59 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 7 (17 pts), ternaries 3 (9 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 35). Of this number, 58 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0a928a38d7a8c7e1c8dc9e3d6d18b9b5b5b093c2206bfbe020385e7aa7975c"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.analyzeRustSource (cognitive 59): cli.analyzeRustSource has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 6 (17 pts), ternaries 4 (7 pts), boolean chains 3 (nesting depth added 31). Of this number, 49 points are the body\u0027s own statements and 10 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a8cf2e1644f683cc4ae7024325dafb324c75463c6b5c8cfc73286bc0f1edb5"}},{"ruleId":"D2","level":"warning","message":{"text":"ResidualSystem::solve_sqp (cognitive 58): ResidualSystem::solve_sqp has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 7 (15 pts), boolean chains 7 (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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f8230eb62714724b85e9e0258508c6f18247f2f7554cba015f086da3d822d7"}},{"ruleId":"D2","level":"warning","message":{"text":"QuadricCtx::project_point (cognitive 58): QuadricCtx::project_point has cognitive complexity 58 (threshold 15). Drivers by points: if/else 25 (50 pts), boolean chains 6, loops 2 (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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478fa7ba30f28877bdbd54e47510f6426d555a56afebff5ed17895e82f5b700"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_by_multi_arc (cognitive 58): vcad_kernel_booleans::split::split_planar_face_by_multi_arc has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 13 (18 pts), boolean chains 4, match/switch 2 (4 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f20adfcfe3b78871258f797d0e87a4ad939843804e4b8ed45552db335676a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Envelope::new (cognitive 58): Envelope::new has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 12 (22 pts), boolean chains 4, match/switch 1 (3 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":"crates/vcad-kernel-cam/src/turning/envelope.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2801c9f5b59385b0f3a59fe3a78d54bab1183a22dbd4264d30034ac269dda788"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::refill_defective_neighborhoods (cognitive 58): vcad_kernel_tessellate::refill_defective_neighborhoods has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 8 (18 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"5775a54e128e23118ff5987cb4925440422c8cfb8ecf4086fbc6a76f038fdbda"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::handle_modern (cognitive 58): Server::handle_modern has cognitive complexity 58 (threshold 15). Drivers by points: if/else 28 (38 pts), match/switch 10 (18 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cde8595a2a7f7e6ee24001ae33f1a50dde00be80e9263550bd7dd4e6e3d8ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::raster::draw_annotations (cognitive 58): vcad_render::raster::draw_annotations has cognitive complexity 58 (threshold 15). Drivers by points: loops 11 (28 pts), if/else 13 (27 pts), boolean chains 3 (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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4809}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bd9af413199287362c48135c6e3c5357a75ce94525453f49879b33b945a1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::suite_c::solve_ik (cognitive 58): mecheval_grader::suite_c::solve_ik has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 9 (17 pts), match/switch 2 (3 pts), boolean chains 2 (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":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"9980fafe108c193c2ff2a92316bc7b2390d03e7a1e5eaeadf5c0dafc02da531e"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCController.ingest (cognitive 58): CNCController.ingest has cognitive complexity 58 (threshold 15). Drivers by points: if/else 25 (47 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"119af745cbca8d353235d5c8a10dc36a38172eb1679d5e15d7380791970a9d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm.__wbg_get_imports (cognitive 58): vcad_kernel_wasm.__wbg_get_imports has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 48 (49 pts), error handling 8, boolean chains 1 (nesting depth added 1). None of this is in the body itself: all 58 points belong to 48 function literals inside it that branch (lines 9377, 9371, 9430, \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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":9345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dd684adcb17cfb2233eafd736ee0994ac3f55e33d5a1f38d98b7187e520b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"carry-electronics.carryElectronics (cognitive 58): carry-electronics.carryElectronics has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 13, loops 6 (9 pts), ternaries 4 (6 pts) (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 18 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":"packages/mcp/src/tools/carry-electronics.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1354db6a43aff1c3f0c06d371e5d5b2b358e599db66244213d9c61d50cd9b5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Problem::sample (cognitive 57): Problem::sample has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 11 (20 pts), match/switch 3 (9 pts), boolean chains 2 (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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f63b946fda5abdba5ff2e54527c66b0a872d5217dbb03bce2eef02b6f6043"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::transient::solve_transient_schedule (cognitive 57): vcad_kernel_thermal::transient::solve_transient_schedule has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 8 (20 pts), boolean chains 6 (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":"crates/vcad-kernel-thermal/src/transient.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d182a37a1a85e73935402f29366a6f58f471502027b1f68af9583c945f964756"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeElectronicsView.inspector (cognitive 57): NativeElectronicsView.inspector has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 16, ternaries 11 (14 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"da632ff1527ae98b34ec753f57ae9e63c72f1c125668ebdc089fa683415b44b9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::recon::program_document (cognitive 56): vcad_ffi::recon::program_document has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 6 (12 pts), match/switch 4 (9 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":"crates/vcad-ffi/src/recon.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092fee557a4f97f15357f048a8688125b95600276d394f9f5bf0a4b94701731"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::fill_tiny_boundary_loops (cognitive 56): vcad_kernel_tessellate::fill_tiny_boundary_loops has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (37 pts), loops 11 (19 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"be75679544d593e8ca7dfebf31a7903aef2dcb766f0a68333fd231d9111ad3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::ear_clip_triangulate (cognitive 56): vcad_kernel_tessellate::ear_clip_triangulate has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 5 (11 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8a31d0fdef1742c033f6e48800a62b53df1933e81825133002c8ae06d43cee"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::graph::assemble (cognitive 56): vcad_kernel_thermal::graph::assemble has cognitive complexity 56 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 9 (15 pts), match/switch 4 (10 pts), boolean chains 5 (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":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecdce408b80191c25486f96c95e1dfc7562a444ee6900defe5b3c75f01cd361"}},{"ruleId":"D2","level":"warning","message":{"text":"sketch-math.computeSketchBounds (cognitive 56): sketch-math.computeSketchBounds has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 6 (24 pts), boolean chains 3 (nesting depth added 34). Of this number, 52 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":"packages/core/src/sketch-math.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f32caf7ad0afb00e6727b097c92fdfe604eead65440e9b322ef79f84c55d449"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_design_constraints::lower::run (cognitive 55): vcad_design_constraints::lower::run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (33 pts), match/switch 6 (12 pts), loops 6 (7 pts), boolean chains 3 (nesting depth added 26). 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"191dfaed821800e29743c25ce78add18c6669c828730e7ecaae7a44008d1c797"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_by_arc (cognitive 55): vcad_kernel_booleans::split::split_planar_face_by_arc has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30 (38 pts), loops 7 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce790ba74f260d8b954463d83e9ca135e762077cf6c7741ca702577b3713ece"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_curved::plan_convex_junction_blends (cognitive 55): vcad_kernel_fillet::fillet_curved::plan_convex_junction_blends has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 9 (23 pts), loops 5 (7 pts), boolean chains 2 (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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc5314e8205e79827b1df65464d1cd71f7bc0bd5a384762a2b4dcbb5b40ca65"}},{"ruleId":"D2","level":"warning","message":{"text":"MarchingCubes::extract (cognitive 55): MarchingCubes::extract has cognitive complexity 55 (threshold 15). Drivers by points: if/else 7 (30 pts), loops 9 (24 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":"crates/vcad-kernel-stocksim/src/marching_cubes.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d9411e6a7a5bf8f191dd90b32fb99842c4557f0204b3577d677a8a216a134d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_toroidal_face (cognitive 55): vcad_kernel_tessellate::tessellate_toroidal_face has cognitive complexity 55 (threshold 15). Drivers by points: if/else 26 (46 pts), loops 5 (8 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7121}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3a66d8df76ccba9ce18d7624034a7ac7fa588727d0977674f4b93ed9fca42e"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureTree.TreeNode (cognitive 55): FeatureTree.TreeNode has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 21, if/else 18 (19 pts), ternaries 9 (13 pts), match/switch 1 (2 pts) (nesting depth added 6). Of this number, 33 points are the body\u0027s own statements and 22 belong to 7 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7212813e36d95f3c47da793755cc25a5d5a995b575baa4ffc5107e5123b7563"}},{"ruleId":"D2","level":"warning","message":{"text":"build.normalizeGlue (cognitive 55): build.normalizeGlue has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 4 (10 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":"packages/kernel-wasm/scripts/build.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74f17de4cc069bfb231538af198f1e31c2b9f1c99ea4a7759dfa327947d68f"}},{"ruleId":"D2","level":"warning","message":{"text":"source-parser.parseRustSourceContent (cognitive 55): source-parser.parseRustSourceContent has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (42 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (3 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"388951a18e5c88ff0f464bb0b62b88b268fcbb57a719ac4778286a58e664f461"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerCdt::build (cognitive 54): LayerCdt::build has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 14 (20 pts), boolean chains 6, match/switch 1 (2 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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6d54dc664a0aca4176e96b04cf4ed8280ef0b6c3240539974b4a808d00a595"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::build_artifacts (cognitive 54): vcad_render::build_artifacts has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 4 (8 pts), match/switch 3 (7 pts), boolean chains 3 (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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7488bc31a9fb169ad355b56ea7d62272d7bbf6c299205d87110f7072ee1e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.verifyReceipt (cognitive 54): ecad.verifyReceipt has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 13 (17 pts), boolean chains 15 (nesting depth added 10). Of this number, 53 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14693}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df1c734b1cdcd13f38ecb4cbc19c84cda14b482017dd794df60790786b0caad"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::command::render_palette (cognitive 53): vcad::ui::command::render_palette has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 12 (25 pts), boolean chains 1 (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":"crates/vcad-cli/src/ui/command.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91a8bfb41745129b1b189464e0e933bf90c86c2cf9665430161e1207fae96d2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::compensate_run (cognitive 53): vcad_ecad_pcb::router::compensate_run has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 5 (13 pts), boolean chains 7, match/switch 2 (6 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":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2b1ac3d03dcf9531755b39f94ae99ded489014a57c3fa32c661dad20263a30"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::ring_escape (cognitive 53): vcad_ecad_pcb::router::auto::ring_escape has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 7 (13 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a34d2f401a0cfcd7d7e4843d57301291675c02422445fd01f725beb79d6410"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_schematic::generate_netlist (cognitive 53): vcad_ecad_schematic::generate_netlist has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 16 (26 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":"crates/vcad-ecad-schematic/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"233b8e1df8540fb083f582375c2c237158da3d4d3de818313abf7bd512a1574d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::vcode::format_scene_settings (cognitive 53): vcad_ir::vcode::format_scene_settings has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 5 (13 pts), loops 2 (4 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2f8a0321394b9aa51673aae33ab207b3a43a457bbefcfe264c98fd930bd139"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::link_loops (cognitive 53): vcad_kernel_dfm::rules::hobby_mill::link_loops has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 8 (14 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b3ff661c776f352991f43dd5b7c7d70853b39ba58238fd6ec3c5fe0f72dc10"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r5_min_wall (cognitive 53): vcad_kernel_dfm::rules::hobby_mill::r5_min_wall has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 5 (8 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c876ce418e5da6e14072963cfadd2a986da2193f9622bb06764be7c703a05c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Simulation::step_tm (cognitive 53): Simulation::step_tm has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (30 pts), loops 12 (21 pts), match/switch 1 (2 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e249e8e9016ee3bccd337def911d1045dfcc7f621bf42d258397aae3e1a922"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::anti_cheese::enforce (cognitive 53): mecheval_grader::anti_cheese::enforce has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (49 pts), boolean chains 2, match/switch 1 (2 pts) (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":"mecheval/graders/src/anti_cheese.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5ab6429736f15c6636c506e9c435f1568df945c48eb03121b2d49c53961975"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentGraph.paramSummary (cognitive 53): DocumentGraph.paramSummary has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 10, match/switch 1, ternaries 1 (nesting depth added 20). Of this number, 48 points are the body\u0027s own statements and 5 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"2590c547fd2d85f4483f150d927ef3789dbb002430613ceb9ecb8fa4b19e3352"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentGraph.paramSummary (cognitive 53): DocumentGraph.paramSummary has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 10, match/switch 1, ternaries 1 (nesting depth added 20). Of this number, 48 points are the body\u0027s own statements and 5 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":"apple/VcadVision/Sources/VcadVision/Shared/Document.swift"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"530fab3695acb24b82ca4541c2d019691a6775425e94bb02a5b8de7d4c548dde"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandPalette.CommandPalette (cognitive 53): CommandPalette.CommandPalette has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 21, ternaries 2 (6 pts), error handling 1, match/switch 1 (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 36 belong to 14 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1ee968c2c6cd0e3fe53fc2efb37b64c50137fbab68ec2a36e4334e090f18bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addMotorWinding::feedClear (cognitive 53): ecad.addMotorWinding::feedClear has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 8 (15 pts), boolean chains 4 (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. This shape REPEATS in the file: 2 other methods here (ecad.addMotorWinding, ecad.addMotorWinding::buildFeed) 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0290eca7bff2052dffb02441f3842c93f29d2e1a4052f816ead0eeaf2d4bb185"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::pcb_preview::pcb_preview_meshes (cognitive 52): vcad_eval::pcb_preview::pcb_preview_meshes has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 15 (18 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":"crates/vcad-eval/src/pcb_preview.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e6bfaa85ea2aec54fe29f8c8e85495d6ab89a4fa36ccab46d6d161c258ae7f"}},{"ruleId":"D2","level":"warning","message":{"text":"FvSystem::solve (cognitive 52): FvSystem::solve has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (45 pts), loops 3 (6 pts), boolean chains 1 (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":"crates/vcad-kernel-em/src/grid.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"469bdf66dce75b6efbedec1ae7feeefacd4ce99f4fff77afff21af572564c266"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_spherical_region (cognitive 52): vcad_kernel_tessellate::tessellate_spherical_region has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 13 (19 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5596}}}],"partialFingerprints":{"codehealthFindingId/v1":"8325af4225a2a5dc3807f8a707149b196c7ffcb0c9dcd4a9c07f9e75c6937e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_conical_face (cognitive 52): vcad_kernel_tessellate::tessellate_conical_face has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (36 pts), loops 7 (15 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6323}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f8f04d3b2e567850398ab12c8070d97ed501c07cf525abb22f99499711f007"}},{"ruleId":"D2","level":"warning","message":{"text":"HaloInput.handle (cognitive 52): HaloInput.handle has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 13, match/switch 2 (3 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":"apple/VcadApp/Sources/VcadApp/NavigationViews.swift"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a31b2ceb9755003f72b1f73008373cb2b38caed531c19ec9f92bd90d95a340"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchPlane3D.SketchGeometry3D (cognitive 52): SketchPlane3D.SketchGeometry3D has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (35 pts), ternaries 5 (9 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 22). None of this is in the body itself: all 52 points belong to 4 function literals inside it that branch (lines 378, 288, 348, \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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c748bf3e4ac95bbbea92649d097a45eef1f7c6ffa7fbc2077dda005d67025a"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.evaluateOp (cognitive 52): evaluate.evaluateOp has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 13, ternaries 1 (2 pts), match/switch 1 (nesting depth added 19). Of this number, 47 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7baed36067d71417c4918aad409832aa370f71fa9038fade063e235e560bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"clearance.checkClearance (cognitive 52): clearance.checkClearance has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 21 (27 pts), if/else 12 (13 pts), boolean chains 11, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"36aa127d225ace1693b35f3d4fd7f6d5abf3818b92ee220d41b47898737a8d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::vcode::to_vcode (cognitive 51): vcad_ir::vcode::to_vcode has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 7 (17 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daf8508c124979a71171578d17354e9b115266f2724eeb6ceb2e172157df3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::bbox::face_aabb (cognitive 51): vcad_kernel_booleans::bbox::face_aabb has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 7 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 29). 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":"crates/vcad-kernel-booleans/src/bbox.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"715fb83e0a685b5b9c39c10ebe163ba7daf922a3e51e1f04734a4858eab821e4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::try_parse_two_chain (cognitive 51): vcad_kernel_booleans::cyl_band::try_parse_two_chain has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 7 (8 pts), boolean chains 6, 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf843013baf66d346ba5a91705827a9c24fff68906099c5356dbbe7d7fa4e7da"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::trim::project_point_to_uv (cognitive 51): vcad_kernel_booleans::trim::project_point_to_uv has cognitive complexity 51 (threshold 15). Drivers by points: if/else 26 (50 pts), match/switch 1 (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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeb54e9c9551a7134d8742d4e1c9885a424151f97f1b668b84a016e575117d0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_enclosure::mesh::extract_standoffs (cognitive 51): vcad_kernel_enclosure::mesh::extract_standoffs has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (35 pts), loops 6 (13 pts), boolean chains 3 (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":"crates/vcad-kernel-enclosure/src/mesh.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e2cf4c74924bbda04a8bfb54f0be7cc09d444bf90edfca427b9986a2098e24"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_topopt::fea::hex_stiffness (cognitive 51): vcad_kernel_topopt::fea::hex_stiffness has cognitive complexity 51 (threshold 15). Drivers by points: loops 13 (47 pts), if/else 2 (4 pts) (nesting depth added 36). 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":"crates/vcad-kernel-topopt/src/fea.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"38794d7de18f3c4227bc2a32aec10302f62846d687a81d4e06565d08cb9dccd7"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.startBackgroundEvaluation (cognitive 51): EditorModel.startBackgroundEvaluation has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 8, ternaries 2 (4 pts), loops 2 (3 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7c70f5ed2b19a2c9e23df2a6e008fc01f6ace1ee12971e50d54b98a1063a34"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.startBackgroundEvaluation (cognitive 51): EditorModel.startBackgroundEvaluation has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 8, ternaries 2 (4 pts), loops 2 (3 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d540bd725cde9ed3125f58f8a87e1a5d59a7eba49cacbfb6c65ac7919161d82c"}},{"ruleId":"D2","level":"warning","message":{"text":"bom.buildLine (cognitive 51): bom.buildLine has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (38 pts), ternaries 7 (10 pts), boolean chains 3 (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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec05d384d5e2f22a62940aa33fa03d032f46a3367e5ec8d119d80c848e8b9ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.buildReceipt (cognitive 51): ecad.buildReceipt has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 20 (28 pts), if/else 13 (18 pts), error handling 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14504}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf8faac184317ec2804a9082a501bef9c596db3d6f4548668a082266ecaaaf4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::materializer::materialize_feature (cognitive 50): vcad_app::materializer::materialize_feature has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 7 (12 pts), loops 2 (4 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a02318faa2de06b0cc818eaf54cba892f1f357e1781eaaf42b17f983192351"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::extract_regions (cognitive 50): vcad_kernel_booleans::cyl_band::extract_regions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 6 (15 pts), boolean chains 4 (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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c4100ab15f1bdbc4887b9581503d806e612ebe659ce84b9d45d0be3f26679b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::freeze::freeze_circle_loops (cognitive 50): vcad_kernel_booleans::freeze::freeze_circle_loops has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 4 (9 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8304fb9077f792262197a64f1e45066adf4601b380efc54586b59bcb0c8b7f8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::features::detect_circles (cognitive 50): vcad_kernel_drafting::features::detect_circles has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 10 (13 pts), boolean chains 4 (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":"crates/vcad-kernel-drafting/src/features.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"26244c33e928a34ba75dc3eb17a393cc3c4eb77c701c927eca6d8d3c9a8a0774"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_curved::fillet_edges_detailed_inner (cognitive 50): vcad_kernel_fillet::fillet_curved::fillet_edges_detailed_inner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (41 pts), match/switch 2 (5 pts), loops 4 (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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb20cb6a0f7b4b6efd7e419fb4b71ef6438943297b3f87b3a38db65a24c0297"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowModel::validate (cognitive 50): FlowModel::validate has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 15, loops 1 (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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79cab13bf612bc95395ee59c03434e76991780e3d0c87d17258ab9803d8e3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.finishSketch (cognitive 50): EditorModel.finishSketch has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (30 pts), ternaries 3 (9 pts), boolean chains 6, match/switch 3 (5 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"066cfe837fc8c34dde508894881da3470f900199a762eccd50bbdf4c50dcd097"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisOverlay.swift.syncAnalysisOverlay (cognitive 50): AnalysisOverlay.swift.syncAnalysisOverlay has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 3 (12 pts), loops 3 (7 pts), boolean chains 5, match/switch 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":"apple/VcadApp/Sources/VcadApp/AnalysisOverlay.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d873e689d7bf386a334db358b996f25db4b4d53781abf7c1b7eadcb127e6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.finishSketch (cognitive 50): EditorModel.finishSketch has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (30 pts), ternaries 3 (9 pts), boolean chains 6, match/switch 3 (5 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"faad2bedb24532efa380fdf9ed6ec27fbe475990ac3b3616dc75e1d79621b12b"}},{"ruleId":"D2","level":"warning","message":{"text":"launch.stitchTJunctions (cognitive 50): launch.stitchTJunctions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 10 (14 pts), boolean chains 5, ternaries 3 (nesting depth added 18). Of this number, 49 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":"packages/app/public/launch/launch.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5450b6c60b24e7ecd30519d90855e8e8bd953bd9727a795d3507924f6c8a4062"}},{"ruleId":"D2","level":"warning","message":{"text":"mech-parts.searchMechCatalog (cognitive 50): mech-parts.searchMechCatalog has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 10, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 23). Of this number, 49 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":"packages/mcp/src/tools/mech-parts.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b426747000d71a53a746a9794e1ea4b159961fd3815cc94e5edbad89702585a"}},{"ruleId":"D2","level":"warning","message":{"text":"record.recordSimulation (cognitive 50): record.recordSimulation has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 9 (13 pts), boolean chains 7, error handling 2 (3 pts), loops 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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dc54aa24e7ba59c614721c2f6b2cf099a53099f79a3d433d1bab1d2577c956"}},{"ruleId":"D2","level":"warning","message":{"text":"gallery.stitchTJunctions (cognitive 50): gallery.stitchTJunctions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 10 (14 pts), boolean chains 5, ternaries 3 (nesting depth added 18). Of this number, 49 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":"www/public/kit/gallery.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cba155c6cc7696eeb9fa7eb72027eb9efc334048dbd747974627c483307f0fd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::auto_layout (cognitive 49): vcad_ecad_symbols::kicad_write::auto_layout has cognitive complexity 49 (threshold 15). Drivers by points: loops 14 (25 pts), if/else 8 (22 pts), boolean chains 2 (nesting depth added 25). 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9787deff317744faa6df61cfb4d68e1dadcef7c9998b244209d5e5f19321b58"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::split_cylindrical_face_by_patch (cognitive 49): vcad_kernel_booleans::cyl_band::split_cylindrical_face_by_patch has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (35 pts), boolean chains 7, loops 6 (7 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"255c53bf0783da24a21bb9becb15cfd885b95e7c0b640164f90235bd84e8ad08"}},{"ruleId":"D2","level":"warning","message":{"text":"WireField::surface_residual (cognitive 49): WireField::surface_residual has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/bem.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d337761a13806bb9e45aa1c5255a303deac59c0b1ef7c008146893a03d8e332"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::poisson::solve_with_chamber (cognitive 49): vcad_kernel_particle::poisson::solve_with_chamber has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 10 (19 pts), boolean chains 1, match/switch 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":"crates/vcad-kernel-particle/src/poisson.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d079456531f46ae9593028506bf2186fb66ba01daa29b424bde67e6c9f7338"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_runtime::run (cognitive 49): vcad_runtime::run has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (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":"crates/vcad-runtime/src/lib.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0108be321993cd53c5415d311c86631bc5ce945af37b67f09b88e5858d84c1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::analyze::analyze_for_printing (cognitive 49): vcad_slicer::analyze::analyze_for_printing has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (43 pts), loops 4 (5 pts), boolean chains 1 (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":"crates/vcad-slicer/src/analyze.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aab975ecb58c32c878d5c952ef4d9cd676ef9b784b08375175debd1064b43af"}},{"ruleId":"D2","level":"warning","message":{"text":"useAppCommands.useAppCommands (cognitive 49): useAppCommands.useAppCommands has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (25 pts), ternaries 12 (17 pts), boolean chains 5, error handling 2 (nesting depth added 10). None of this is in the body itself: all 49 points belong to 20 function literals inside it that branch (lines 265, 75, 373, \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":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c185efabd0e8002903b1c7e7c533710da7af25d6450d49838631cce22c06adf"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.applyDesignRuleArgs (cognitive 49): ecad.applyDesignRuleArgs has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 9 (25 pts), if/else 16 (22 pts), loops 1 (2 pts) (nesting depth added 23). Of this number, 46 points are the body\u0027s own statements and 3 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9830d6e83c305013839f0fe7eecc05fc3dcab63cdc79c0dbf14dad585607993"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addViaArray (cognitive 49): ecad.addViaArray has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 10, loops 5 (9 pts), ternaries 4 (6 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7309073e737f5e1011d13cd95451a333883752e4ede779217efa5b9ad2881236"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::detect_shorts (cognitive 48): vcad_ecad_pcb::drc::detect_shorts has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 6 (11 pts), match/switch 1 (4 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac3ae0c8f861185de25dfa876fb58e50af3faa30c88ef1d85d156e9154ed11d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::human::human_load (cognitive 48): vcad_ecad_pcb::router::flow::human::human_load has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 7 (16 pts), match/switch 1 (4 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":"crates/vcad-ecad-pcb/src/router/flow/human.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a064ba68f622553bb4039e80bbb653ace329ca2819c1e059494de3ceaa3d73"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::transient_adjoint::transient_sensitivities (cognitive 48): vcad_ecad_sim::circuit::transient_adjoint::transient_sensitivities has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 8 (13 pts), match/switch 5 (13 pts), boolean chains 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":"crates/vcad-ecad-sim/src/circuit/transient_adjoint.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"033f25885fadaff0dfb6d677136e7fc7a815bba4721c11769e7abc22e3a34479"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::cnc::run (cognitive 48): vcad_kernel_dfm::rules::cnc::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (40 pts), loops 3 (6 pts), match/switch 1 (2 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":"crates/vcad-kernel-dfm/src/rules/cnc.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d39df81b08e97056feabc688ba960a51e8bb1f206e1d02cf7c4b3d4932b0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::sample_fields_to_vertices (cognitive 48): vcad_kernel_wasm::sample_fields_to_vertices has cognitive complexity 48 (threshold 15). Drivers by points: if/else 4 (23 pts), loops 7 (23 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":9786}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bf17022e17a2bfe7191224cae1baa1e33988965510833e5edacaaf060dec18"}},{"ruleId":"D2","level":"warning","message":{"text":"Proxy::spawn (cognitive 48): Proxy::spawn has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 5, match/switch 2 (5 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":"crates/vcad-mcp/src/proxy.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ab565f958c84524fd929e66d5525d3bb52343c55b6b316c1ff96be5b449bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"parameters.setParameters (cognitive 48): parameters.setParameters has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (24 pts), ternaries 8 (10 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 10). Of this number, 41 points are the body\u0027s own statements and 7 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, 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":"packages/mcp/src/tools/parameters.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3902e7e007d1158922501afb6bc8c8599e1f488159a5ece184813ef4bb09d330"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::entities::surfaces::parse_bspline_surface (cognitive 47): vcad_kernel_step::entities::surfaces::parse_bspline_surface has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 8 (16 pts), boolean chains 4, match/switch 3 (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":"crates/vcad-kernel-step/src/entities/surfaces.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0665cd33bb25acf4107c782b35942217e3846d9b82f9561c13f12e799f9119c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::frozen::evaluate_plan_impl (cognitive 47): vcad_kernel_tessellate::frozen::evaluate_plan_impl has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 7 (11 pts), match/switch 4 (10 pts), boolean chains 1 (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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca325d3d49a797e3cf37b335266dd66f89ba8c62f10b4ab268e5f5b1656cff4"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentCore.answer (cognitive 47): AgentCore.answer has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (32 pts), ternaries 4 (9 pts), boolean chains 5, match/switch 1 (nesting depth added 19). Of this number, 46 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":"apple/VcadApp/Sources/VcadApp/AgentCore.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a353049be1f022d9145655727cf5a0defd08e7ad6cfb29916b055630992b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"build.modelIdentity (cognitive 47): build.modelIdentity has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 12 (34 pts), boolean chains 8, if/else 5 (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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"645777514a4c15e2fc07947db7af20e22cddb89e56f21ac1116a1158fe5c4662"}},{"ruleId":"D2","level":"warning","message":{"text":"RayTracedViewport.RayTracedViewportOverlay (cognitive 47): RayTracedViewport.RayTracedViewportOverlay has cognitive complexity 47 (threshold 15). Drivers by points: if/else 38 (41 pts), boolean chains 4, ternaries 2 (nesting depth added 3). Most of this is not in the body itself: 1 of the 47 points is its own statement and the rest belongs to 14 function literals inside it that branch (lines 731, 497, 461, \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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c798adec183f9664ae6f788cd7ecda82a563a77cca857f098fa1a523b40cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchPropertyPanel.SketchPropertyPanel (cognitive 47): SketchPropertyPanel.SketchPropertyPanel has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (24 pts), ternaries 10 (17 pts), boolean chains 5, error handling 1 (nesting depth added 13). Most of this is not in the body itself: 8 of the 47 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 469, 439, 467). 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1621043e0b190b701658dd21f9285acfb20ecf629bf621e7212436785d806b"}},{"ruleId":"D2","level":"warning","message":{"text":"annotate.generateSyntheticDescription (cognitive 47): annotate.generateSyntheticDescription has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 10 (19 pts) (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":"packages/training/src/annotate.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"29454fda20f2eddada8cc47003b9eed99f2f8ce61822c451d7db0be925148160"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::adjoint::ac_sensitivities (cognitive 46): vcad_ecad_sim::circuit::adjoint::ac_sensitivities has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 7 (14 pts), 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":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd578ffd8ce9d1ec00119038534474a72983c674e220ada4cd5797b5178784c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::to_loon::op_to_loon (cognitive 46): vcad_ir::to_loon::op_to_loon has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 8 (16 pts), boolean chains 2, loops 1 (2 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":"crates/vcad-ir/src/to_loon.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c2336585305850b8972fe36ca2a05764967ae0769f9fd3642851e3c3b67a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Envelope::path (cognitive 46): Envelope::path has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 3 (5 pts), boolean chains 4, 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":"crates/vcad-kernel-cam/src/turning/envelope.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"45540b0af3ec7f5ca16fd13b4c79a6ec1b25cd483dc736a66c9a46203d25d37c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::union_segments (cognitive 46): vcad_kernel_dfm::rules::hobby_mill::union_segments has cognitive complexity 46 (threshold 15). Drivers by points: loops 12 (27 pts), if/else 6 (19 pts) (nesting depth added 28). 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"29738d61b14b9cc226f2185ffd29508baaa156cdb203815599167ed512fec3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_em::ac::solve_complex (cognitive 46): vcad_kernel_em::ac::solve_complex has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/ac.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb17619a420a214af705acf4daec40520efd84dd959542afd8785a35cc8ab349"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::graph::device_assembly (cognitive 46): vcad_kernel_fea::graph::device_assembly has cognitive complexity 46 (threshold 15). Drivers by points: loops 12 (25 pts), if/else 4 (14 pts), match/switch 1 (6 pts), boolean chains 1 (nesting depth added 28). 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":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"83da920f258a8f760e9bea3a856568c402120af3b96b6147d3f5a9ce928c1ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_subset::is_plane_plane_chain_set (cognitive 46): vcad_kernel_fillet::fillet_subset::is_plane_plane_chain_set has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 5 (8 pts), match/switch 2 (5 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":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d66632c8c6ce7eedf65114cb1e3e3389667fd48df0427e01e9b68d0f844a240"}},{"ruleId":"D2","level":"warning","message":{"text":"StepWriter::write_loops (cognitive 46): StepWriter::write_loops has cognitive complexity 46 (threshold 15). Drivers by points: loops 7 (23 pts), if/else 7 (19 pts), boolean chains 4 (nesting depth added 28). 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":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"41442a0ab9cce98a948c3d2ebd2ed3eb3f66b11d959b9cffcd5f65cad4a261c7"}},{"ruleId":"D2","level":"warning","message":{"text":"make_figures.figB (cognitive 46): make_figures.figB has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 13 (26 pts), if/else 4 (10 pts), loops 5 (8 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":"docs/compression-math-survey/launch-figures/make_figures.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb51806232455c58d0fbee4e8c5fbdb2f14bf3c71de6e10e89af85e938f3fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsWorkspace.tidySchematic (cognitive 46): ElectronicsWorkspace.tidySchematic has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 10 (15 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 6 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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"52360f6b937a1074cd4a877aac7fe668130940bc5f4bf1edd40005b10d8f6c02"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::stitch_planes (cognitive 45): vcad_ecad_pcb::router::auto::stitch_planes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 3 (6 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcea60715f690938b8cb839d28f3a5e2f5d984cbc82229fba016af48f3a21af"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::flow::choose_sites (cognitive 45): vcad_ecad_pcb::router::flow::flow::choose_sites has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 6 (9 pts), boolean chains 5 (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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d93f81ed91ceb685ef87a45de2b1bcbe0c3bee52a23a9b2d39054607cc599f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::tolerance::measure_fit (cognitive 45): vcad_eval::sim_extract::tolerance::measure_fit has cognitive complexity 45 (threshold 15). Drivers by points: if/else 5 (23 pts), loops 5 (18 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/sim_extract/tolerance.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41082a0148e138ed0ba1d7e004eed1b2c970cbf84078b7bd06051659bf200cc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::flatten_solid (cognitive 45): vcad_kernel_sheet::flatten::flatten_solid has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 8 (10 pts), boolean chains 3, match/switch 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"945c14268ed6fa54975168c608004bb084ceae2e49900f482c33657b1a73acb4"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsCanvas.copperAt (cognitive 45): ElectronicsCanvas.copperAt has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 11, ternaries 2 (10 pts), loops 4 (7 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"61865173189683b07f298c51d6db07fbc1184eb5d74b7fd11bf786734230e963"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.setPlacement (cognitive 45): ecad.setPlacement has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (31 pts), ternaries 5 (7 pts), boolean chains 5, loops 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9761}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ef087df45092c8c2e6bed219552a4de2a88ec3eec390fdf5db6a790b19da00"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::migrate::migrate_v1_mapped (cognitive 44): vcad_app::migrate::migrate_v1_mapped has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 4 (7 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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ed86a859209d08cf9fea94c3f14e26ac58832c64beee76db4fcb1729ee855"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::instrument::modal (cognitive 44): vcad_kernel_acoustics::instrument::modal has cognitive complexity 44 (threshold 15). Drivers by points: loops 11 (26 pts), if/else 8 (17 pts), match/switch 1 (nesting depth added 24). 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd19429341e54d3f889e26b64806bc40e50dc6b24ad7d155192037ba92cee734"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::instrument::tune_bar (cognitive 44): vcad_kernel_acoustics::instrument::tune_bar has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 6, loops 3 (6 pts), match/switch 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6f4ebe08309083d29d372c1bfcd3a4836db160b28b8993a3d957685ae1f908"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::mesh::csg::triangulate (cognitive 44): vcad_kernel_booleans::mesh::csg::triangulate has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 5 (14 pts), boolean chains 2 (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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cd4e30fb95dc08ba9c759edba606dd3bfe4ed1d501c3c34f8ebc7c635f1496"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::geom::setups::plan (cognitive 44): vcad_kernel_dfm::geom::setups::plan has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 6 (9 pts), match/switch 1 (2 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":"crates/vcad-kernel-dfm/src/geom/setups.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b99dba48560dbe35db41c73ad0e9b392884c66ec41d1c3f8c188e46b732ea4f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::blend_loft::resolve_edge_query (cognitive 44): vcad_kernel_fillet::blend_loft::resolve_edge_query has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 25). 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":"crates/vcad-kernel-fillet/src/blend_loft.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"39088ed09a58904b48bd29a081ca6ce19541fa89f948afc8431c66dbac38f9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"PhysicsWorld::from_document_with_colliders (cognitive 44): PhysicsWorld::from_document_with_colliders has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 9 (10 pts), match/switch 6 (10 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8333e3221db81a4a2b0d65403ebacf458d262cf01838578bf845b2cc4f2d15a1"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchViews.swift.buildSketchRoot (cognitive 44): SketchViews.swift.buildSketchRoot has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 5 (8 pts), boolean chains 7, loops 5 (6 pts), match/switch 1 (nesting depth added 11). Of this number, 33 points are the body\u0027s own statements and 11 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":"apple/VcadApp/Sources/VcadApp/SketchViews.swift"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2b34d6f1094dcc5d3f52b6742f005c932705791b57be33ac7bafce370f1e74"}},{"ruleId":"D2","level":"warning","message":{"text":"pass_k.failureReason (cognitive 44): pass_k.failureReason has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 5 (12 pts), loops 2 (5 pts), boolean chains 4, 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":"mecheval/harness/src/pass_k.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f56af7fc8d56397795663a497513e30e799a70147d6c7f9c4e590807441dcca"}},{"ruleId":"D2","level":"warning","message":{"text":"build.paretoScatter (cognitive 44): build.paretoScatter has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 18 (39 pts), if/else 2 (3 pts), loops 2 (nesting depth added 22). Most of this is not in the body itself: 7 of the 44 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1605, a function literal at line 1653, a function literal at line 1565, \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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"42741c5ac86118e56ed20e475c2757df11d25a1fea0b07b24a71e4db940cf1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"StatusBar.StatusBar (cognitive 44): StatusBar.StatusBar has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 13 (23 pts), boolean chains 12, if/else 5 (8 pts), loops 1 (nesting depth added 13). Of this number, 32 points are the body\u0027s own statements and 12 belong to 4 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c20837864f5181f8dc95d0043c48e3cab255d9916eddc2a7b68c657a1bb7595"}},{"ruleId":"D2","level":"warning","message":{"text":"scrub-input.ScrubInput (cognitive 44): scrub-input.ScrubInput has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 14, ternaries 8 (9 pts) (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 26 belong to 10 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":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ce0c590ac2e9a918026eb24981a2d92076a5d79eb8f17692afd16c52bf326"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.runErc (cognitive 44): ecad.runErc has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 6 (9 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 19). Of this number, 43 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5788}}}],"partialFingerprints":{"codehealthFindingId/v1":"c748a05debfebaf642a40a8c3c6ae8fc3bbbd6ccde826796f23ca7987654e1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.traceGridBoundaries (cognitive 44): ecad.traceGridBoundaries has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 27). Of this number, 39 points are the body\u0027s own statements and 5 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13191}}}],"partialFingerprints":{"codehealthFindingId/v1":"af032ddf914e6e04789f9a28c6fbdf08646451481953c185eeaa9a3a3d3a245f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::slice_file (cognitive 43): vcad::slice_file has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (13 pts), match/switch 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"0822ff58143ba1cb2403d3601e0710eb73b6f2539af8d0e72bf5d416c75695d7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::viewport::render_viewport_braille (cognitive 43): vcad::ui::viewport::render_viewport_braille has cognitive complexity 43 (threshold 15). Drivers by points: if/else 4 (21 pts), match/switch 2 (11 pts), loops 4 (10 pts), boolean chains 1 (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":"crates/vcad-cli/src/ui/viewport.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7bdac986a5a4603c07d3a0c4d9ea353de211fbe0ac35632a69dde7692a1c80"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::sew::sew_faces (cognitive 43): vcad_kernel_booleans::sew::sew_faces has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 2 (7 pts), match/switch 2 (3 pts) (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":"crates/vcad-kernel-booleans/src/sew.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f8a3f7f827007890c2f14039964a9218f04daa6c6a1be7bbc9245cb1309e67"}},{"ruleId":"D2","level":"warning","message":{"text":"Electrostatics::solve (cognitive 43): Electrostatics::solve has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 7 (12 pts), boolean chains 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":"crates/vcad-kernel-em/src/electro.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40898f6cc31bc8b92657429b9f93204c0c85e1ab838c54a3b3608c73f79c3b2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_subset::fillet_plane_chain_edges (cognitive 43): vcad_kernel_fillet::fillet_subset::fillet_plane_chain_edges has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 7 (8 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":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b306599adc36582c1a79c26ae678e3f92aa4ed386c47f3a3e6b7d390abe29d"}},{"ruleId":"D2","level":"warning","message":{"text":"PeriodicTrim::build (cognitive 43): PeriodicTrim::build has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 4 (7 pts), boolean chains 6, 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":"crates/vcad-kernel-raytrace/src/trim.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4510b9ba3fe4c5b2ed032cb9fd95f8dae9ce3c73bd4c7ddd9172d4ef07f6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::delaunay_flip (cognitive 43): vcad_kernel_tessellate::delaunay_flip has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 6 (12 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a452cff76c61906ea46498a98e5d1550df4eee74dbcba390b3b9a6cae5d133b7"}},{"ruleId":"D2","level":"warning","message":{"text":"integrity.computeIntegrity (cognitive 43): integrity.computeIntegrity has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 8 (11 pts), loops 4 (7 pts), boolean chains 5, 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":"packages/mcp/src/tools/integrity.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c252f72478bfa427a2b4b7a5152291a094c47deb1176d83a8ff228638f23bca2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_atoms::optimize::optimize_parameters (cognitive 42): vcad_atoms::optimize::optimize_parameters has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 7 (15 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":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"460d713d3cae02a5d972cee204e5de0a8acc90bddf0a521b411576921e2642fb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_clearance (cognitive 42): vcad_ecad_pcb::drc::check_clearance has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 4 (6 pts), match/switch 4 (6 pts), boolean chains 4 (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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"203003a2113643ec2b015c2e3b95ec395febb508d86a6b728e9d7829153f39be"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::route_batch (cognitive 42): vcad_ecad_pcb::router::auto::route_batch has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 4 (12 pts), loops 4 (7 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fb6e36bd1f4c9ffa884316488901726517546bd142d843dab6ecca0dc1072e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::classify::find_coincident_classification (cognitive 42): vcad_kernel_booleans::classify::find_coincident_classification has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 3 (5 pts), match/switch 3 (5 pts), boolean chains 3 (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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2053c5b2b77bc335a06eb78967e4da354ccbb71c97ecc1e68d698e3cecfe0c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::clip_spherical_face_multi (cognitive 42): vcad_kernel_booleans::split::clip_spherical_face_multi has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 6 (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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4542}}}],"partialFingerprints":{"codehealthFindingId/v1":"991711988844a71e401f8c6006c034c4d3098272ee363e33fb07010df5ab5199"}},{"ruleId":"D2","level":"warning","message":{"text":"LinuxCncPost::segment (cognitive 42): LinuxCncPost::segment has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (30 pts), match/switch 5 (10 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":"crates/vcad-kernel-cam/src/post/linuxcnc.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ceda8558d973e824d3d3f0c61faf651712f6bccbbd629320774932260ec77c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_shell::compute_offset_vertex (cognitive 42): vcad_kernel_shell::compute_offset_vertex has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 1 (5 pts), loops 2 (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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e24b25f5c486a0afca51d1bd13610177527301d4db639b6f1df343176edcfcb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sketch::revolve::revolve (cognitive 42): vcad_kernel_sketch::revolve::revolve has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 6 (11 pts), boolean chains 3, match/switch 1 (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":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2797762b0fda2969b2c76756c149c99ad8e4a732c9a3f64e6f5739c32e0a9992"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_small_spherical_cap (cognitive 42): vcad_kernel_tessellate::tessellate_small_spherical_cap has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 7 (12 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5921}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92ec3dab2b8f20e809f4a83ad27b346db35235ab50f255586e746d299562f62"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedOverlayView.commitTopologyMarquee (cognitive 42): ReleasedOverlayView.commitTopologyMarquee has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 5 (12 pts), boolean chains 2 (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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d462d8af9a4709be728d34d61f33d8752f38e40677fe9049501517d438e8b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisSmoke.swift.analysisSmoke (cognitive 42): AnalysisSmoke.swift.analysisSmoke has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 9, ternaries 4 (7 pts), error handling 3 (6 pts) (nesting depth added 14). Of this number, 39 points are the body\u0027s own statements and 3 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":"apple/VcadApp/Sources/VcadApp/AnalysisSmoke.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8cd83c55c3c6a26f7b2e2ebd20272b7920eeb665b2cb123d37b23c1f296d99"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::doc_edits::lower (cognitive 41): vcad_app::doc_edits::lower has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 4 (7 pts), loops 2 (5 pts), boolean chains 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":"crates/vcad-app/src/doc_edits.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6354b2794b723f701a30cd32ed231ec5750a17bc48398b69211ad8498d8d04f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::ecad_tools::sync_schematic_data (cognitive 41): vcad_app::ecad_tools::sync_schematic_data has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 6 (9 pts), match/switch 1 (4 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":"crates/vcad-app/src/ecad_tools.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57c0c74413589bf688d53f729870b607cacc32b6226ca8038f86603e1d8cfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::meander_pair_skew (cognitive 41): vcad_ecad_pcb::router::meander_pair_skew has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 5 (9 pts), boolean chains 3 (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":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2961f405a172d69ec605cf3384c22c81d2e89efa69ad1afdea17c4e60575c3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::descent::descend_pair_mined_pinned (cognitive 41): vcad_ecad_pcb::router::descent::descend_pair_mined_pinned has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 5, loops 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa8edf9b512d527b964528d0399e5c3c46e8ac3b8e180b4ec520aa89a6cace"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::netlist::circuit_from_netlist (cognitive 41): vcad_ecad_sim::circuit::netlist::circuit_from_netlist has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 5 (11 pts), loops 6 (7 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":"crates/vcad-ecad-sim/src/circuit/netlist.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e923597665f89ff0c90cc6e02e083603376b3551158a4eb1fe08396a638c013"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::repair::split_edges_at_interior_vertices_impl (cognitive 41): vcad_kernel_booleans::repair::split_edges_at_interior_vertices_impl has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5 (8 pts), boolean chains 6, 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":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9fc7e834da30c585b8ea1dc84ef979542970b10f6131091086aa8a3eed0c38"}},{"ruleId":"D2","level":"warning","message":{"text":"Regions::new (cognitive 41): Regions::new has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 8 (10 pts), boolean chains 5 (nesting depth added 17). Of this number, 40 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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efae147fc53810a041bf7c4b0a75a15b01dc42d56ec6836b3ead6c5a849b8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Loop::new (cognitive 41): Loop::new has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 5 (8 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be5f9ad9491797f11e8bb646dceb36397a6e413e40d4b3ab53a10f6fa80e721"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::revolved::build_revolved (cognitive 41): vcad_kernel_fillet::revolved::build_revolved has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). Of this number, 40 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"0438d7db50518f60af6e95848f9cb1b9b51213971ca2265901e363d7d231a48f"}},{"ruleId":"D2","level":"warning","message":{"text":"PhysicsWorld::ground_contacts (cognitive 41): PhysicsWorld::ground_contacts has cognitive complexity 41 (threshold 15). Drivers by points: loops 8 (25 pts), if/else 4 (11 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 26). 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eee204d54390bf0f224176c545e8d37101cf13ca8b0c93f6a84f3bca9f7bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"GpuScene::from_brep (cognitive 41): GpuScene::from_brep has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 6 (11 pts), match/switch 5 (11 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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"485c4323f0b3eb5031af74e08bfb16b7092a5e08bf5426b21e0179d20adf17d0"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeElectronicsView.navigator (cognitive 41): NativeElectronicsView.navigator has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 8 (15 pts), boolean chains 4 (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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f2f8deebf83c44701676ce2d01aa299defa1e5f15a2e1e10a52dfe40bf018b"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.sizePdn (cognitive 41): ecad.sizePdn has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (19 pts), ternaries 8 (13 pts), boolean chains 8, loops 1 (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 13 belong to 6 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b427f1ab7c14d35915c1e6421cdfd1eadddf0db461aa5ceda556e23c19231326"}},{"ruleId":"D2","level":"warning","message":{"text":"SixelEncoder::encode (cognitive 40): SixelEncoder::encode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 5 (11 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":"crates/termview/src/protocols/sixel.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafd6f90570d8f3aff08e5bc07eb11c177ec617e85313d046418d2cd7c177326"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::maze::cell_states_for_class_window (cognitive 40): vcad_ecad_pcb::router::maze::cell_states_for_class_window has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 6 (16 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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d625879099636de81445c84d3264bb8306ab1a20967e6994f90e2cb7f91dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel::hull::convex_hull (cognitive 40): vcad_kernel::hull::convex_hull has cognitive complexity 40 (threshold 15). Drivers by points: loops 14 (22 pts), if/else 8 (15 pts), boolean chains 3 (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":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2653ae269af6c9be106bb886f23ca3d4cfbb5d9fdec8d709f501598a780c6c5"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowModel::inlet_hydraulic_diameter_mm (cognitive 40): FlowModel::inlet_hydraulic_diameter_mm has cognitive complexity 40 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 7 (16 pts), boolean chains 3, 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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"390b5eb0426c885c8eb40db5bc9a836aa4d2ce01b153e678218ea6683d821b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_naming::profile::seed_extrude_names (cognitive 40): vcad_kernel_naming::profile::seed_extrude_names has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (9 pts), loops 5 (6 pts), boolean chains 3 (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":"crates/vcad-kernel-naming/src/profile.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd58580bd72b2c3eb8385e1c7aba6887764af1bd328585b5393057290b8d66c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_mcp::tools::loon_carry::carry_electronics (cognitive 40): vcad_mcp::tools::loon_carry::carry_electronics has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 7, loops 5 (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":"crates/vcad-mcp/src/tools/loon_carry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ec9cb505e831b01eb12e2ee5a8caa4031bf8b9500777c1a9596a626b92fd7a"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCController.connect (cognitive 40): CNCController.connect has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 12, 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a9dc4843c06602684924882b1f4b48597ed2a5bd102a9a5a1fa10fab37068a"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyPanel.PropertyPanel (cognitive 40): PropertyPanel.PropertyPanel has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 20, if/else 13 (17 pts), ternaries 3 (nesting depth added 4). Of this number, 37 points are the body\u0027s own statements and 3 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d1fa13f921ec18a4b5c2a7df21815dc8858bd13411cf166f6b61136c8e26f6"}},{"ruleId":"D2","level":"warning","message":{"text":"PcbFootprintGroup.PcbFootprintGroup (cognitive 40): PcbFootprintGroup.PcbFootprintGroup has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (13 pts), ternaries 7 (12 pts), match/switch 1 (nesting depth added 11). Most of this is not in the body itself: 6 of the 40 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 159, a function literal at line 57, isNetHighlighted, \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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"458bb54f6d69c87ca928eb1cc9c93ff530de731bf12c0e8ab46bef8ee035703b"}},{"ruleId":"D2","level":"warning","message":{"text":"part-stock.annotateBomStock (cognitive 40): part-stock.annotateBomStock has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (12 pts), boolean chains 3 (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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed866d82d90aa7f55a1e39bb41549d4d0f29cd7efdab0f1c81c1832d60a28e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.deleteNetTie (cognitive 40): ecad.deleteNetTie has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (27 pts), ternaries 4 (7 pts), boolean chains 6 (nesting depth added 12). Of this number, 28 points are the body\u0027s own statements and 12 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10751}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c5e2eb87cac9a770b242969aa8760d0536d86d17249b1c02367cd3d6cf8a14"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.componentKeepouts (cognitive 40): ecad.componentKeepouts has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 3, error handling 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14008}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb1cd7cdf2e5461dea8b3d3ae8b107b0889ed9ae0a176ff9504eea0dd773e23"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.program.command(\u0022infer\u0022).description(\u0022Generate VCode from a text prompt\u0022).requiredOption(\u0022-p, --prompt \u003Cprompt\u003E\u0022,\u0022Text d (cognitive 40): cli.program.command(\u0022infer\u0022).description(\u0022Generate VCode from a text prompt\u0022).requiredOption(\u0022-p, --prompt \u003Cprompt\u003E\u0022,\u0022Text d has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (23 pts), error handling 5 (9 pts), ternaries 3 (6 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":"packages/training/src/cli.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac21ec3c936877110ffcee0a1a4df494973dea35c3e230f80e54db97d77b6f63"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::plan_microvia_fanout (cognitive 39): vcad_ecad_pcb::router::auto::plan_microvia_fanout has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab105a54a79cbd103e8882d27107a72a2fe3b743b7f11b343ffcb9ec2c5e4eac"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel::sheet_json::tessellate_model (cognitive 39): vcad_kernel::sheet_json::tessellate_model has cognitive complexity 39 (threshold 15). Drivers by points: loops 11 (25 pts), if/else 6 (14 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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0764c731f03a272006bc7adfdb0e6d322f7e317359e314fa145efb93c99892"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::split_band_by_profile (cognitive 39): vcad_kernel_booleans::cyl_band::split_band_by_profile has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 7 (10 pts), boolean chains 6 (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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2ceafff4ffda0e0019188e6a85a26e107bdc263bcc6b9249d5b63fd8a3accd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::cnc::thin_walls (cognitive 39): vcad_kernel_dfm::rules::cnc::thin_walls has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 2 (3 pts), boolean chains 1 (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":"crates/vcad-kernel-dfm/src/rules/cnc.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae8035f453c31f679b1fd701f0eed3a8da5d83c7388bb3f3ad092ae8f09c9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::mesh::hex_fill_conforming (cognitive 39): vcad_kernel_fea::mesh::hex_fill_conforming has cognitive complexity 39 (threshold 15). Drivers by points: loops 13 (24 pts), if/else 7 (13 pts), boolean chains 2 (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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"34aefe30ed9cf8e68325e98dc3aadfd5eb24340dc75d95b06a76b83d9773fe19"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::flip_sliver_triangles (cognitive 39): vcad_kernel_tessellate::flip_sliver_triangles has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (8 pts), boolean chains 4 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad17a3d27808873c0de7adcb8af41eae9989ccf3be73e7e9d8b5f9235e5b46c7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::em_simulate (cognitive 39): vcad_kernel_wasm::em_simulate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (30 pts), loops 2 (4 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dc605de18c468517ce0001706762edde56ed60fa6f9e03bd3d8ed397e83e31"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolPalette.ToolPalette (cognitive 39): ToolPalette.ToolPalette has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 15, if/else 15, ternaries 8 (9 pts) (nesting depth added 1). Most of this is not in the body itself: 4 of the 39 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 132, a function literal at line 102, a function literal at line 217, \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":"packages/app/src/components/ToolPalette.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53f5a88351181d0836ce936f78a672d46936347e7f5a7dc6efe2a386f450a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintPanel.PrintPanel (cognitive 39): PrintPanel.PrintPanel has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 14, ternaries 8 (11 pts), if/else 9, error handling 5 (nesting depth added 3). Most of this is not in the body itself: 15 of the 39 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 80, handleStartPrint, a function literal at line 149, \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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c174a4088f333577a04ee1f328dd41cc10af98ccd1dae2541f36fbf4ae3730"}},{"ruleId":"D2","level":"warning","message":{"text":"electronics-store.useElectronicsStore (cognitive 39): electronics-store.useElectronicsStore has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 14 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). None of this is in the body itself: all 39 points belong to 19 function literals inside it that branch (lines 635, 392, 443, \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":"packages/app/src/stores/electronics-store.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bba68f9156ac6bebdf4178d0f48eb882c8496146d89738778f73374ad2e5e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"schematic-hierarchy.flattenSchematic::elaborate (cognitive 39): schematic-hierarchy.flattenSchematic::elaborate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 10 (12 pts), ternaries 3 (9 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. This shape REPEATS in the file: one other method here (schematic-hierarchy.flattenSchematic::elaborateAll) 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":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0376543d959c299715c8b635a9ef284ad034ed69bcdcd2136e5c19fcf39cc171"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.exportKicad (cognitive 39): ecad.exportKicad has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 7 (13 pts), boolean chains 2, error handling 1 (2 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67a52e50cdcb326f876dc8c3c2c6f6777d84304a3651ee2f8fe655fdb48a61f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::direct_links (cognitive 38): vcad::direct_links has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (6 pts), boolean chains 3 (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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"65df347e3137175a2dd5ded07b4fd8cfa9084b94e854a11c4eeadbe189a28d68"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::tree::render_sidebar (cognitive 38): vcad::ui::tree::render_sidebar has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 9 (13 pts), boolean chains 3 (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":"crates/vcad-cli/src/ui/tree.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a6631b256f5634197447693f335322f0dacf864e7598f4ccb802875c73cbfb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::pour_synth::synthesize_outlines (cognitive 38): vcad_ecad_pcb::pour_synth::synthesize_outlines has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 7 (10 pts), match/switch 2 (3 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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b67c65d9166b0c0b2ccb732468045c84dc0b9bd1f17164efffc1d822da871f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::write_library_body (cognitive 38): vcad_ecad_symbols::kicad_write::write_library_body has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 18). Of this number, 34 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd8d3c8ac7fb8ef6e228a81add158b0c5401ee7724ebee8c289263400bf11f6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_cylindrical_face (cognitive 38): vcad_kernel_booleans::split::split_cylindrical_face has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 3 (6 pts), boolean chains 2 (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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8731a2a09c5fb6acd5989decf8d64b9fffb1b4e69486c5549e2c670fb55690b3"}},{"ruleId":"D2","level":"warning","message":{"text":"GrblPost::segment (cognitive 38): GrblPost::segment has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 5 (10 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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"698302902cabb884a210cfbdfdf3bc97f6fc32e490fcb12ba9f79e1d9caaf038"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::lift::lift_surface (cognitive 38): vcad_kernel_diff::lift::lift_surface has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 8 (20 pts), loops 8 (18 pts) (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"416656dbb555241a6a36f75f563c664a9799cdbce6c8778aae224c27539c4951"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::optimize::maximize_hybrid (cognitive 38): vcad_kernel_particle::optimize::maximize_hybrid has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 5 (13 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":"crates/vcad-kernel-particle/src/optimize.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"50419d25743021844ef4ea94d6faa7d0adf3e5545d3e3b2e0c858ba13663441e"}},{"ruleId":"D2","level":"warning","message":{"text":"BoardPainter.draw (cognitive 38): BoardPainter.draw has cognitive complexity 38 (threshold 15). Drivers by points: loops 11 (16 pts), if/else 6 (12 pts), ternaries 4 (10 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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3922a49d975d717524db40b16aa630b5f92aff8d10b1a59124c08f4fa8c6b15f"}},{"ruleId":"D2","level":"warning","message":{"text":"usePhysicsSimulation.usePhysicsSimulation (cognitive 38): usePhysicsSimulation.usePhysicsSimulation has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 4 (12 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 13). None of this is in the body itself: all 38 points belong to 7 function literals inside it that branch (lines 213, 73, 59, \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":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36015f097f5fb9a912a7b86813efb26af3a2fb3f71d0961469896ffac5546ef"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.evaluateDocumentTS (cognitive 38): evaluate.evaluateDocumentTS has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 3 (11 pts), loops 4 (9 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 24). 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2df3fcd97f4552d98737e93af24ec152e8cee58d58b415435136c5f29f0fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"loon.hasRootWithoutMaterial (cognitive 38): loon.hasRootWithoutMaterial has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 16). Of this number, 35 points are the body\u0027s own statements and 3 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95be7a13e33828afdcfb845e0cb4ab2d55d4df475074a0562e742ea60241555"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.getCopper (cognitive 38): ecad.getCopper has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 7 (10 pts), boolean chains 6, loops 1, match/switch 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 19 belong to 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10395}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcd2ea0caa3a6b3eb29a05078193a53f58aeca3e40075fc58b38056043a6aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::plan_bga_escapes (cognitive 37): vcad::plan_bga_escapes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 6 (11 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60e932d90f967bc82d975038c7d89a0c4ecb176f9bca62efe138a5c2d7acff2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::anchor_track_ends (cognitive 37): vcad::anchor_track_ends has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 6 (9 pts), boolean chains 7, match/switch 1 (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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b240d8aaf3dc3d56592550302aed0deedde22a3e2c8336d69c76ef5573e8c9ef"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::welcome::render_card (cognitive 37): vcad::ui::welcome::render_card has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 10 (16 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":"crates/vcad-cli/src/ui/welcome.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1fe8c33800248cc3379474c67f8c9bab4cabbe744217c23cc02e8eb4b0c2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::detect_unstitched_pads (cognitive 37): vcad_ecad_pcb::drc::detect_unstitched_pads has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 5 (6 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88a1dbed8a8a021eb1971aee6e823da74c4673b93c40c2c3d4e685914908ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::commodities (cognitive 37): vcad_ecad_pcb::router::flow::route::commodities has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 6 (11 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27dcdc4973d9d238be7732039d15f180637d2d3ab3daf79490280ba16346a38"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctx::elaborate (cognitive 37): Ctx::elaborate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 9 (10 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":"crates/vcad-ecad-schematic/src/hierarchy.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"be85695627f83f27f7e8214b498ba767db555bbca46ea691c9cd488030409146"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_sym::parse_symbol (cognitive 37): vcad_ecad_symbols::kicad_sym::parse_symbol has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 2 (7 pts), loops 2 (5 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":"crates/vcad-ecad-symbols/src/kicad_sym.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b176e1649c30a0c203ef0625526012a0d011c70311a1133f3119d5e52534e82"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::flip_sx (cognitive 37): vcad_ecad_symbols::kicad_write::flip_sx has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 3 (7 pts), loops 2 (6 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b466f23b3fcb617de7273622f508b29693dd516f86351251d378613b36ee78"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::parse_band (cognitive 37): vcad_kernel_booleans::cyl_band::parse_band has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 3 (4 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"065d325d68ea123982ad1fbbd20fd443e1e47c81362873a4f48cea1573ad2a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::chain::trace_ion (cognitive 37): vcad_kernel_particle::chain::trace_ion has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 5 (7 pts), boolean chains 2, 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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c7e45bc3bebba3e6de148ab4a86701017a8615a770ec3f371f8b4fda5ff722"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::manufacturability::check_manufacturability (cognitive 37): vcad_kernel_sheet::manufacturability::check_manufacturability has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (8 pts), boolean chains 2, 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":"crates/vcad-kernel-sheet/src/manufacturability.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0a47d9b2997552f36c4f07a7634dce570e58cf57d5bbcf1be60012c3e81de3"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundPanel.swift.nearestPartHit (cognitive 37): SoundPanel.swift.nearestPartHit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 5, loops 3 (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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa43293fabcdb5add8197acad479467ab9c866589ff91c9d919c28a5580c38f5"}},{"ruleId":"D2","level":"warning","message":{"text":"render-task-assets.main (cognitive 37): render-task-assets.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (7 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 18). Of this number, 36 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":"mecheval/scripts/render-task-assets.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2c330701084616f34a4a50098ed1e1361cb175da7baffd66057bdad90525e6"}},{"ruleId":"D2","level":"warning","message":{"text":"claims-ledger.attachClaims (cognitive 37): claims-ledger.attachClaims has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 7 (15 pts), boolean chains 3, loops 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a16f18bf810cfc9683c7ab86057d0ce8882f1721f03915420cea4e3776b1e7"}},{"ruleId":"D2","level":"warning","message":{"text":"claims-ledger.importMeasurement (cognitive 37): claims-ledger.importMeasurement has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 10 (18 pts), if/else 10 (15 pts), boolean chains 4 (nesting depth added 13). Of this number, 35 points are the body\u0027s own statements and 2 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7530b39fbc71647dfcfa26fece126dbec38ba6925ba13ceba59332913fc6f7"}},{"ruleId":"D2","level":"warning","message":{"text":"joint-range.checkJointRange (cognitive 37): joint-range.checkJointRange has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (10 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 14). Of this number, 26 points are the body\u0027s own statements and 11 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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"29855c86e0911395cea3d5f965950dd4fc77dda6ee719f44b0b73c53f4d195af"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.detectStaleNets (cognitive 37): ecad.detectStaleNets has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 7 (9 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 16). Of this number, 21 points are the body\u0027s own statements and 16 belong to 6 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1acbe1825d202744ec2a6cc56e303813d3cd27dccac03a0b746ab89230cfa9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.sizeImpedance (cognitive 37): ecad.sizeImpedance has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 16 (17 pts), if/else 12, boolean chains 8 (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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06633e029373b8ffe20e698d720b74f834c1d6c76ea61018a56f163454d3667"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::tools::lower_update (cognitive 36): vcad_app::tools::lower_update has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (7 pts), match/switch 4 (7 pts), boolean chains 6 (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":"crates/vcad-app/src/tools.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef4adc3e633f96e7b49ff8b0ed0b208ff56f760f31dccd2bf46f08c43c016f"}},{"ruleId":"D2","level":"warning","message":{"text":"PairProblem::add_clearance (cognitive 36): PairProblem::add_clearance has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 5 (13 pts), boolean chains 3, match/switch 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b6763986c986d569e59cbb62d61c2d9e8d660067bff2ea268b53e0d65c7d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::pour_synth::decide_pours (cognitive 36): vcad_ecad_pcb::pour_synth::decide_pours has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 8, loops 6 (8 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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed575da17e34719413fd2c7dbd33e0a215f2246f456af1994c160671adf6af0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::escape::plan_multilayer_escapes (cognitive 36): vcad_ecad_pcb::router::escape::plan_multilayer_escapes has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 5 (7 pts), match/switch 2 (7 pts), boolean chains 3 (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":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea16905dac37eddd94e8d3244130b5c478b07ff6dc9229bc3d2169bb0def592"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::try_commit (cognitive 36): vcad_ecad_pcb::router::flow::route::try_commit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (12 pts), boolean chains 7 (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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30378ca6b6e066c892667ef13746471973582d31a1655655394695f30e5369a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::section::weld_endpoints (cognitive 36): vcad_kernel_drafting::section::weld_endpoints has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 2 (14 pts) (nesting depth added 28). 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd538a478a475752d01b3d757f915610143b137dac114aa07eb60cd235cf57a2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::assemble (cognitive 36): vcad_kernel_sheet::flatten::assemble has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 7 (11 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfaaf735e0e8db9c6bd013b39b84fb3444e98f7a2cf93deb02a9e78c13b2260"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_cone_direct (cognitive 36): vcad_kernel_tessellate::tessellate_cone_direct has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 6 (14 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6707}}}],"partialFingerprints":{"codehealthFindingId/v1":"212d2129073e2c97c0aed1c641e50e9634a9440dce4c375643077da58ab25eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternFit::monte_carlo (cognitive 36): PatternFit::monte_carlo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (9 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":"crates/vcad-kernel-tolerance/src/gdt.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e06670f16ec2209a0ae5f74f65047bda8f2820ff4e9d365a6f813696df068c2"}},{"ruleId":"D2","level":"warning","message":{"text":"make_figures.figA (cognitive 36): make_figures.figA has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 18 (26 pts), loops 6, if/else 3 (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":"docs/compression-math-survey/launch-figures/make_figures.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dedb45335b8b45cc10572a6259a02fa2d9a795b43d970497843e7c78196720"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCController.setOverride (cognitive 36): CNCController.setOverride has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 5 (9 pts), boolean chains 7, loops 2 (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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cbdb09015c765e1c5c42aa3a1b2ea422fb6555d11ce6464cdca022e5d69485"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.tools (cognitive 36): EditorModel.tools has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 7 (16 pts), boolean chains 2, 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"0903643ccc49e630f11e75eefaecd5453fb0298b2b3b7e600a074130b62f02fc"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.tools (cognitive 36): EditorModel.tools has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 7 (16 pts), boolean chains 2, 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce13a496e48eac161583209142ae4cb02ef91a73bcf72940b178c4278d41a189"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-mcp.makeClaudeMcpSolver.solve (cognitive 36): claude-mcp.makeClaudeMcpSolver.solve has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 2 (5 pts), ternaries 3, error handling 2, boolean chains 1 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 6 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e23b5685c3bdcae132e65eea9691803d9a5ce966c4f7d5a1d1b0279fe681934"}},{"ruleId":"D2","level":"warning","message":{"text":"launch.autoSmooth (cognitive 36): launch.autoSmooth has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 4 (10 pts), ternaries 3 (5 pts), boolean chains 3 (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":"packages/app/public/launch/launch.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dda91c422e6680833b1b6a910426ec2f2f5a978f123db29b04b1f784a45db35"}},{"ruleId":"D2","level":"warning","message":{"text":"expression-input.ExpressionInput (cognitive 36): expression-input.ExpressionInput has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 19 (23 pts), if/else 6, boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 14 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":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8e70fba10031488661f2fb51d5503f487bd76f67c8aa780cedebb86dc2fb60"}},{"ruleId":"D2","level":"warning","message":{"text":"next-actions.suggestNextActions (cognitive 36): next-actions.suggestNextActions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 5 (9 pts), boolean chains 7 (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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff131b4f67425657a2f537f8742aa8f5a36af8db8f24ffcaae1d041821019b55"}},{"ruleId":"D2","level":"warning","message":{"text":"flat-pattern.flatPatternFromSolid (cognitive 36): flat-pattern.flatPatternFromSolid has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 17 (28 pts), if/else 4 (5 pts), error handling 1 (2 pts), loops 1 (nesting depth added 13). Of this number, 32 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/flat-pattern.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8326eaa1d05cc4744fc396c46322e472d0dbc3ee37f3a7ce568a0bd0438ccad7"}},{"ruleId":"D2","level":"warning","message":{"text":"gallery.autoSmooth (cognitive 36): gallery.autoSmooth has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 4 (10 pts), ternaries 3 (5 pts), boolean chains 3 (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":"www/public/kit/gallery.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6970f7654f4266c4caab71860cd8183fe163e2275052cb3d1810d5839873cd54"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::toolbar::draw_toolbar (cognitive 35): vcad::ui::toolbar::draw_toolbar has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (8 pts), boolean chains 4 (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":"crates/vcad-cli/src/ui/toolbar.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"317df9ef9ce7af71fd08d60aede25280320376e9bda438b51e6c242eac0484e3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::build_connectivity_with_contacts (cognitive 35): vcad_ecad_pcb::drc::build_connectivity_with_contacts has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 4 (16 pts), boolean chains 2 (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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cc0ae2e0c307121956d7689c2af2198eea14d4186664b4aa3ef77ea141c4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::census_pairs (cognitive 35): vcad_ecad_pcb::router::pair::census_pairs has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 4 (13 pts), match/switch 1 (2 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5843f4b46897d3aac416594f3704b957b1076b4217f363c17e35d4d0cf9c559b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::ac::build_and_solve (cognitive 35): vcad_ecad_sim::circuit::ac::build_and_solve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 2 (3 pts), boolean chains 1, 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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c80e14b40f9246fc860f8f4db620112e7081876eb9f61d139a7b5554f1eaf6d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::footprint::match_power_family (cognitive 35): vcad_ecad_symbols::footprint::match_power_family has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 10 (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, 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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"883c9e51185dd4c30e54f74d907c1a7dc0b35b3c5f1de1df949ebf837ececdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::thermal_extract::part_box (cognitive 35): vcad_eval::thermal_extract::part_box has cognitive complexity 35 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 5 (15 pts), boolean chains 3 (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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ff4743e769fa90adb6c5447e4c4026e4322a7c80656c5834dcaadb38df2973"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::cam::generate (cognitive 35): vcad_ffi::cam::generate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 5, match/switch 2 (3 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":"crates/vcad-ffi/src/cam.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b6082981c9b338f4bd29573544134616cb4e1f0c539ddfeb408af7104f77f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::fea::cell_field (cognitive 35): vcad_ffi::fea::cell_field has cognitive complexity 35 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 5 (16 pts), boolean chains 2 (nesting depth added 19). 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":"crates/vcad-ffi/src/fea.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f862ff01b4ee5b59556000951feac5c465a8a544373e6dbffa3b925b624e57ec"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::instrument::jacobi_vectors (cognitive 35): vcad_kernel_acoustics::instrument::jacobi_vectors has cognitive complexity 35 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 4 (11 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d489e2295005ad73b48aacf18c24f7a97ae7dac5111ae0d62a59e81a7cc3b9b9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_calibration::build_calibration_report (cognitive 35): vcad_kernel_calibration::build_calibration_report has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 5, 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":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff3427c723d8a54890f993499fda9f647adc5cc3e6c809ab4e2de09eb992ede"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::modal::sym_eig (cognitive 35): vcad_kernel_fea::modal::sym_eig has cognitive complexity 35 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 4 (11 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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"558e936db8daa11981c34ff695c001d8f6f7ceb8d34dc02f089b76b560f39e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::adjoint::adjoint_poisson (cognitive 35): vcad_kernel_particle::adjoint::adjoint_poisson has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 6 (13 pts), boolean chains 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":"crates/vcad-kernel-particle/src/adjoint.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38790eae5b902ae9979435e49f1fa4a030df6d7539fd93721f0a18ca5559d81"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::electrode_opt::optimize_electrodes (cognitive 35): vcad_kernel_particle::electrode_opt::optimize_electrodes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/electrode_opt.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee46c0d8c3d6bce17cb79f1db2be090fec1d1883602e45f2eedbcab7100309a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Simulation::step_te (cognitive 35): Simulation::step_te has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 8 (13 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"362c8d2d7ee342818835c3eac08b57d4e990d44fe861aab0461e4137a9ae0f21"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_shell::logical_faces (cognitive 35): vcad_kernel_shell::logical_faces has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 9 (11 pts), match/switch 4 (5 pts), boolean chains 4 (nesting depth added 12). Of this number, 33 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7cebee4c9eebfbf47e6d0d1da77f4865e02514142531f98e47b6dc59b8d4a2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_spherical_face (cognitive 35): vcad_kernel_tessellate::tessellate_spherical_face has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 7 (11 pts), match/switch 1 (2 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5139}}}],"partialFingerprints":{"codehealthFindingId/v1":"478a0e2bfeb89954a8043c2a513d1298ae181c4d3e635385546d7b8d1eab8779"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::reinsert_dropped_boundary (cognitive 35): vcad_kernel_tessellate::reinsert_dropped_boundary has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 7, loops 4 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc1b971ebcffbc1ffaa4898ce8ffab3a459129eb643c55c329142c65a936c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_cone_sector_two_chain (cognitive 35): vcad_kernel_tessellate::tessellate_cone_sector_two_chain has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 5, loops 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6536}}}],"partialFingerprints":{"codehealthFindingId/v1":"4332970558ba1079f3f42cfd291ab6d084dd9035a2122b9a1f34306ef528e7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"System::apply (cognitive 35): System::apply has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 5 (11 pts), match/switch 1 (5 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deefac4586ccb3a82e5c4d4fae32b31d6904a5e963ea3ced546c7609291c45c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::solve::check_grounding (cognitive 35): vcad_kernel_thermal::solve::check_grounding has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 3 (6 pts), boolean chains 4 (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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ffc5bd4a9068fc822bd2f5a8cd04fddbb4d525342e8086b5edeced1b6e4ebe"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvertCtx::convert_solid (cognitive 35): ConvertCtx::convert_solid has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, match/switch 4 (5 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d65c73016f72803649cd92b4a48472f84133efea0f2d3a8a86bda399094321d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.beginManip (cognitive 35): EditorModel.beginManip has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 8, ternaries 2 (6 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31aa88d7c5f31f97e3bb007c7cb8a08b463b2c7ace2636676a46bc686165818"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.tapNow (cognitive 35): SketchSession.tapNow has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), ternaries 1 (3 pts), boolean chains 1, match/switch 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d38f58e8e50848943f870d5e5a8b80e8d57258315ff66565c01594f9bcae92"}},{"ruleId":"D2","level":"warning","message":{"text":"matrix-cli.main (cognitive 35): matrix-cli.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (34 pts), ternaries 6 (12 pts), loops 7 (10 pts), boolean chains 4 (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 (matrix-cli.main::worker) 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":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"87690791e27b9505f33cb04b4c0b2bb0d14c8a11a14610ae591234bab9379587"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitTabTools.PcbConstrainControls (cognitive 35): CircuitTabTools.PcbConstrainControls has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 4 (8 pts), boolean chains 5 (nesting depth added 11). Most of this is not in the body itself: 2 of the 35 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 421, 384, 389, \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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef2044d5bcb9565d240739605a126583b2143a0cc08757a43de0e352b5f18f2"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbroideryPanel.EmbroideryPanel (cognitive 35): EmbroideryPanel.EmbroideryPanel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 12, loops 2 (3 pts), ternaries 2, error handling 1 (nesting depth added 9). Most of this is not in the body itself: 12 of the 35 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 38, 60, 94, \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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7a6b26faf332acb4d267ebdcdfae050f91918fd219cc7bc5a1ff99ea1aad4c"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.lmSolve (cognitive 35): ecad.lmSolve has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 4 (9 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 19). Of this number, 31 points are the body\u0027s own statements and 4 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6823}}}],"partialFingerprints":{"codehealthFindingId/v1":"972e54d29470fd47075596c1005d197e2702af22c11be3e91635b4bd0e6ba7b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.findCavity (cognitive 35): ecad.findCavity has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 6 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 11). Of this number, 34 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13350}}}],"partialFingerprints":{"codehealthFindingId/v1":"339e8037cfa16236d5da9f622a0e64a1b9883b277406ee53bd73e1f481e66b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"init (cognitive 35): init has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (21 pts), ternaries 9, loops 4 (5 pts) (nesting depth added 3). Most of this is not in the body itself: 2 of the 35 points are its own statements and the rest belongs to 35 function items inside it that branch (play, setReceipt, el, \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":"www/src/hero-app.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1564948b426195e7a21b2c6ae8dc7fdf4e696a6e9811c20e7e62af52fb0a91d1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::legalize::legalize (cognitive 34): vcad_ecad_pcb::router::legalize::legalize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd8ebd49c0f20b5d64da437355d038b695b09780d9dad8aff25442df5e2a59b"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitEnv::attempt_step (cognitive 34): CircuitEnv::attempt_step has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 5 (12 pts), loops 5 (8 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":"crates/vcad-ecad-sim/src/circuit/mod.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5da7d23deddcf4a0f90a7b1d4ad0e29c59bc6c090a202467e2342032ebf58ef"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::tolerance::extract_stackup_spec_from_scene (cognitive 34): vcad_eval::sim_extract::tolerance::extract_stackup_spec_from_scene has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (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":"crates/vcad-eval/src/sim_extract/tolerance.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b12fff380a687f20212b748257cb646544b7adbfe3d264c8da141a06c0ddea7"}},{"ruleId":"D2","level":"warning","message":{"text":"Solid::resolve_face (cognitive 34): Solid::resolve_face has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 3 (6 pts), loops 2 (3 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5609aed063a9fa085783645b54967465cb6ca247f9c11e3a10b7ad962417eb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::instrument::lowest_modes (cognitive 34): vcad_kernel_acoustics::instrument::lowest_modes has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (30 pts), if/else 1 (2 pts), match/switch 1 (2 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6d8ec88a0d5e113c91b6c1a11bb0c7e272868fe65e5108b907d9b1a6b0606e"}},{"ruleId":"D2","level":"warning","message":{"text":"QuadricCtx::collect (cognitive 34): QuadricCtx::collect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 4, 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe7ebb86c24d12ec962a8f61d75da08eee091c3690819258ea7fc3aff1c0eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_cylindrical_face_by_line (cognitive 34): vcad_kernel_booleans::split::split_cylindrical_face_by_line has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (22 pts), match/switch 3 (6 pts), boolean chains 3, loops 2 (3 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, 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6050}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adaba5cf2d542b579d92a394fc5b448fa9e69848557b61e6e89fb60e2951ab4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::casting::run (cognitive 34): vcad_kernel_dfm::rules::casting::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts), boolean chains 1 (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":"crates/vcad-kernel-dfm/src/rules/casting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"843d216390205b310319d20d10c6efb79ea36951ef0aa59c23701bf0e3ed5ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"AxisymMagnetostatics::solve_nonlinear (cognitive 34): AxisymMagnetostatics::solve_nonlinear has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (12 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1375bba870cdc4342390f04943f0e8b0ead707a769beda0f2e389d9ef881b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanarMagnetostatics::solve_nonlinear (cognitive 34): PlanarMagnetostatics::solve_nonlinear has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (12 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":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e0464de0c09af7cd4bc97519350ee274220d49f81d3913548ce0941a8dd90c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::trim::build_vertex_faces (cognitive 34): vcad_kernel_fillet::trim::build_vertex_faces has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 2 (3 pts), match/switch 1 (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":"crates/vcad-kernel-fillet/src/trim.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0955ce96ea8eae0bcb4d9a09efff46a51bfa45fc9aba0a48dd31d70f9d08d9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_shell::solve_offset (cognitive 34): vcad_kernel_shell::solve_offset has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (21 pts), if/else 5 (12 pts), 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccfb8941f44862838126d02574406984abcfcbd401933fef952c8a6a5a73e23"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::merge_overlapping_holes (cognitive 34): vcad_kernel_tessellate::merge_overlapping_holes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (8 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa0f48caab27993dc221c1ab289f8a8b0ba485ed17df632430a8dd1897feb46"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::collapse_zero_area_triangles (cognitive 34): vcad_kernel_tessellate::collapse_zero_area_triangles has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (7 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8901}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49fb40b83dee23a526834753769a67d1e0c5ca4ed0494a7ad3f121cfcb91c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_topopt::analyze::analyze_fields_thermal_warm (cognitive 34): vcad_kernel_topopt::analyze::analyze_fields_thermal_warm has cognitive complexity 34 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 7 (14 pts), boolean chains 1, match/switch 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":"crates/vcad-kernel-topopt/src/analyze.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a5b2e428171242dd1fba148c139302c3f2645f881a3f601b8c03610bb65e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::recover::recover (cognitive 34): vcad_loon::recover::recover has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (10 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":"crates/vcad-loon/src/recover.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b650dd4a2541e4d3bfe24fcaaf5278d90acd6932d2c61567c3bef303e7a5bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_receipt_verify::verify (cognitive 34): vcad_receipt_verify::verify has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 4 (5 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":"crates/vcad-receipt-verify/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"400d68f77b253c15f1df81a3616d08d7ccc7f1c0457c84771c35f561219c80da"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentPicker.DocumentRow (cognitive 34): DocumentPicker.DocumentRow has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 11 (23 pts), if/else 4 (6 pts), boolean chains 5 (nesting depth added 14). Of this number, 26 points are the body\u0027s own statements and 8 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e010a8a8db4a9a80b9fbd1954eaa3718a5748dd4f844e956023e6e8f78491928"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-store.useAnalyzeStore (cognitive 34): analyze-store.useAnalyzeStore has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 9 (14 pts), boolean chains 5, error handling 1 (nesting depth added 8). None of this is in the body itself: all 34 points belong to 6 function literals inside it that branch (lines 261, 392, 376, \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":"packages/app/src/stores/analyze-store.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"533ba64dcaa087f8399db45fbeb87935902252d81c14127d17489f02428b373d"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.createCommandRegistry (cognitive 34): commands.createCommandRegistry has cognitive complexity 34 (threshold 15). Drivers by points: if/else 34. 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":"packages/core/src/commands.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe87ad36c8f10097a7c2de6d0089c2f26bbae36e17e548e475d83bdd73fd1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"clearance.verifyClearanceClaims (cognitive 34): clearance.verifyClearanceClaims has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 6 (14 pts), boolean chains 1, 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55c30f04424f81b67d60269e3502bd4a0c23026fcbf356b66955f2bb0ac8cba"}},{"ruleId":"D2","level":"warning","message":{"text":"claims-ledger.ledgerReceiptClaim (cognitive 34): claims-ledger.ledgerReceiptClaim has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 17 (24 pts), if/else 5 (7 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db21c6b150949e5135483c9e17548564514c6c53ef524e7dfc750ef9f4966c9"}},{"ruleId":"D2","level":"warning","message":{"text":"PartStockClient.check (cognitive 34): PartStockClient.check has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 7, ternaries 5 (7 pts), error handling 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"992bbde07ba878104a923d63326d425ea5314963037b538ceb37765c54ae6eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.legalizeCrossNetClearance (cognitive 34): ecad.legalizeCrossNetClearance has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 7 (12 pts), boolean chains 1 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 12 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a3e00a99f8891019843b91c5932632d626b4119161c9070f16b26015c0f1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.validateForFab (cognitive 34): ecad.validateForFab has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 6 (9 pts), boolean chains 1, 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6607}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cd2cb714ce55664c01911c6343d5b2204acd9604256dbb94bf5071b31934e8"}},{"ruleId":"D2","level":"warning","message":{"text":"infer.validateVCode (cognitive 34): infer.validateVCode has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 20). Of this number, 32 points are the body\u0027s own statements and 2 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":"packages/training/src/infer.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4790b27c3d50a800d74e75ed7a1297b70748e5d77efe2b0f564e947fae75801e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_termview::braille::buffer_to_braille (cognitive 33): vcad_termview::braille::buffer_to_braille has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (10 pts), match/switch 1 (7 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":"crates/termview/src/braille.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6866f0626ff1caecc4d85a97849a7856451025ba831a660dd0e3fb9dbd4e4cba"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_hole_to_hole (cognitive 33): vcad_ecad_pcb::drc::check_hole_to_hole has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (7 pts), match/switch 1 (4 pts), boolean chains 2 (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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0f68228cdbd9eeec41b48af4039e92c1548d63c4531ee92987bb4f91da516"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::maze::astar (cognitive 33): vcad_ecad_pcb::router::maze::astar has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, loops 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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0482ec2123e8e851d7e781b42887fc7aa018c56aa964e3603640fe2cb6af9d45"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::no_crossing::point_in_brep (cognitive 33): vcad_kernel_booleans::no_crossing::point_in_brep has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (8 pts), match/switch 2 (5 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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"0074f73b5e8b5c4a5705be2d895cf842373dab3465e0c5ad6610f810118fb10f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::sew::merge_nearby_vertices (cognitive 33): vcad_kernel_booleans::sew::merge_nearby_vertices has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 8 (15 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":"crates/vcad-kernel-booleans/src/sew.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a1c0f20be55bf8368d3ed973a9f6399fe3c06793d6fe0e89bdba5b43955985"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::merge_circle_with_crossing_hole (cognitive 33): vcad_kernel_booleans::split::merge_circle_with_crossing_hole has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 8, 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a7c76c6d21f68cfc4c188844711c8c4cd10c452f819e6ad71358a68e562f24"}},{"ruleId":"D2","level":"warning","message":{"text":"LathePost::post (cognitive 33): LathePost::post has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 6 (15 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":"crates/vcad-kernel-cam/src/turning/post.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa92460c5e69906d75d94ee89d453ac349b1e170e5e2551ac74c9c53ca8ca31"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::mesh::voxelize (cognitive 33): vcad_kernel_fea::mesh::voxelize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 8 (16 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f375882c988f78aaabc7811b8eb1f941bf8ff1efeda691ac0278c3f0eda4a9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::mesh::wall_thickness (cognitive 33): vcad_kernel_fea::mesh::wall_thickness has cognitive complexity 33 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 7 (16 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bc26c1ccbdd41f085cecd809da169679abcc289d9b0f6ceae10a26968ea26a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::modal::assemble (cognitive 33): vcad_kernel_fea::modal::assemble has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 7 (13 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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca798a1e7bd066f8ea48f1e2ac1bf61df5dae26ff6c35877c5bd83667a9b400"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::chain::run_from (cognitive 33): vcad_kernel_particle::chain::run_from has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 5 (7 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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eef3318680e48e7fdb20a85292ec6ebe00d6f8e7d8496ed0937d7af2d718bd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::nesting::nest_rectangles (cognitive 33): vcad_kernel_sheet::nesting::nest_rectangles has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 5 (9 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":"crates/vcad-kernel-sheet/src/nesting.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79f81893310d69b0a2655052e3c74ccc6e08e4d4c4db044b8e1e868645cbc98"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sketch::extrude::extrude_with_arcs (cognitive 33): vcad_kernel_sketch::extrude::extrude_with_arcs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (10 pts), match/switch 3 (6 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"923ba90c4c33c9767f87a0458910deec221da2d4b116670116a7cf277eebd806"}},{"ruleId":"D2","level":"warning","message":{"text":"Domain::from_mesh (cognitive 33): Domain::from_mesh has cognitive complexity 33 (threshold 15). Drivers by points: loops 9 (19 pts), if/else 4 (14 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":"crates/vcad-kernel-topopt/src/domain.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f5be12910765ba25ca53a0d87231e1777b62b40055004756b1c62a94872e8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::photonics_simulate (cognitive 33): vcad_kernel_wasm::photonics_simulate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 8, loops 2, match/switch 2 (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, 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10925}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae2e6077fa0afd65182a329ed1d9c905b0c9def3451fade565e8ea79292c27"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::variants::parse_variant (cognitive 33): vcad_loon::variants::parse_variant has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (8 pts), match/switch 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"20572e1edbbcc853e8bd4f92ea10dd2ff2d3319bc3961c0c168ae5de83f0515b"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentTools.setPose (cognitive 33): AgentTools.setPose has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 10, loops 2, match/switch 1, 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":"apple/VcadApp/Sources/VcadApp/AgentBridge.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db79a1363212584bf8f25f80bf7e581f631f509061a599af60b26ff57538fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"DocEdit.patternInstancing (cognitive 33): DocEdit.patternInstancing has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (13 pts), loops 2 (4 pts) (nesting depth added 6). Of this number, 29 points are the body\u0027s own statements and 4 belong to one function item 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71d6e7a36d5d70a04e35b389d0f20eaddf528dd1d5aeb878780310a0d53fc05"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingMesh.update (cognitive 33): StreamingMesh.update has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 10, loops 5 (9 pts), ternaries 1 (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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"561e22c7d82201243ebb1ac59294be8497e5928cc6984ef2eed7357bb70bd3bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocEdit.patternInstancing (cognitive 33): DocEdit.patternInstancing has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (13 pts), loops 2 (4 pts) (nesting depth added 6). Of this number, 29 points are the body\u0027s own statements and 4 belong to one function item 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":"apple/VcadVision/Sources/VcadVision/Shared/Document.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd9f562b45781de0d2f5f66e31d3d2a3aa50768a24278f0c8558f3f25f4269e"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingMesh.update (cognitive 33): StreamingMesh.update has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 10, loops 5 (9 pts), ternaries 1 (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":"apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ba31ba220f96c7922b3193dd802914e13dc7e7c71576762319ed2a177e3e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"pose.applyJointState (cognitive 33): pose.applyJointState has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 4 (8 pts), boolean chains 3, loops 3 (nesting depth added 12). Of this number, 30 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":"packages/mcp/src/tools/pose.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae301d508c5f6956177ce318c45f9ae399dcff73b22df24b38f2954ef9d495f8"}},{"ruleId":"D2","level":"warning","message":{"text":"registry-dispatch.runMutationViaEngine (cognitive 33): registry-dispatch.runMutationViaEngine has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 4, ternaries 3 (4 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cd17f47ba643f8fbba74bcca538200eebbd17112ac5cd6a8afb288b03cbbbb"}},{"ruleId":"D2","level":"warning","message":{"text":"claims-ledger.recordClaimMeasurements (cognitive 33): claims-ledger.recordClaimMeasurements has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 4 (8 pts), boolean chains 5, loops 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b861eb216f0c1eb3d524fc17a2feb13e9cae8979c9549fe5a623456286568051"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.drcPcb (cognitive 33): ecad.drcPcb has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (11 pts), ternaries 1 (3 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4941}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd026f613af78499dbf90a71b86ce0c754e0ec4e3673d01e02ff182444657b39"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addZone (cognitive 33): ecad.addZone has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 7, boolean chains 6, loops 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daeb18556def8b679c4b037aaef1d4325a48678919eb6066ba0a160614aa1af"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_atoms::optimize::face_sensitivities (cognitive 32): vcad_atoms::optimize::face_sensitivities has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (11 pts), match/switch 2 (8 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":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9874490d3ddae8a207615ad3cbc974d4c4279fc09fe41cd5e45f769825ffe9"}},{"ruleId":"D2","level":"warning","message":{"text":"GridRouter::route_net (cognitive 32): GridRouter::route_net has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (5 pts), boolean chains 4, match/switch 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":"crates/vcad-ecad-pcb/src/router/grid.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd165033225a2fa2b1ef489aab2c295ae14627825b1ba32b94347bd0fc5c58e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::ratsnest::copper_groups (cognitive 32): vcad_ecad_pcb::ratsnest::copper_groups has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 5 (13 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). Of this number, 31 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":"crates/vcad-ecad-pcb/src/ratsnest.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e66d12525c26943cfbcaaddfb7bd462a7d29901e3e9e756664f7169051ed691"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::validate_and_commit (cognitive 32): vcad_ecad_pcb::router::auto::validate_and_commit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 7 (8 pts), boolean chains 6, 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a700f34bf13871162ca67948d5123b3152e715cde736c1692730d433979621"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::chamber_cavity (cognitive 32): vcad_eval::sim_extract::chamber_cavity has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (7 pts), boolean chains 4, match/switch 1 (3 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cbff4e5954280a91fb2899a25dc29250d26ece1e01313f5a0916326f38aa2d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::merge_crossed_hole (cognitive 32): vcad_kernel_booleans::split::merge_crossed_hole has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 5, 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f7c11da632f201030bfbf10457ef9da33b04e4151ff48697e90b54fd571a74"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::section::offset_section_mesh (cognitive 32): vcad_kernel_drafting::section::offset_section_mesh has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (11 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad477c61d0d25518b40b4524ffeb32141dd2ee2537a3cafed1d8223d2d1418f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_flow::conjugate::wetted_surface (cognitive 32): vcad_kernel_flow::conjugate::wetted_surface has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (21 pts), loops 4 (10 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":"crates/vcad-kernel-flow/src/conjugate.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2109c552ddc8750fd2718a1772e1527d40a0ac39ef8329cfc70d44f617578b"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceSpec3d::parameter_roles (cognitive 32): DeviceSpec3d::parameter_roles has cognitive complexity 32 (threshold 15). Drivers by points: loops 10 (28 pts), if/else 2, match/switch 1 (2 pts) (nesting depth added 19). 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":"crates/vcad-kernel-particle/src/spec3d.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53e139ef2b759acbfbf456f8d7ccf583eb644ec94a589c225171378f30dafd1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_physics::world::solve_contacts_pgs (cognitive 32): vcad_kernel_physics::world::solve_contacts_pgs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 5 (13 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd234cc6700e2ad474a7979e83a176eef308828bc06c3f0a8756b792d188b2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"MeshRayIndex::new (cognitive 32): MeshRayIndex::new has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 10 (13 pts), boolean chains 2 (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":"crates/vcad-kernel-tessellate/src/mesh_ray.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"329f295f26e64a42b5da105dbf28a98a75571100b81e6f6f6c2a4432a9d42680"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::worth_repairing (cognitive 32): vcad_kernel_tessellate::worth_repairing has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (7 pts), boolean chains 4 (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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"33643c020f475120acf052be5c832cf967d9225a7a95b33364d8138eb77ef308"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::refine_outer_polygon_for_holes (cognitive 32): vcad_kernel_tessellate::refine_outer_polygon_for_holes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6 (10 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c29ea4cf6cab72fede80616c3677cbdc01c01775057c85671d7d987af2cb575"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::exact::candidate_circles (cognitive 32): vcad_render::exact::candidate_circles has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (9 pts), boolean chains 7 (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":"crates/vcad-render/src/exact.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"17685240446f379ca71ea44e1c30b55c05d6044c3bfc046d8228f8a37d39ba3e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_torture::run (cognitive 32): vcad_torture::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (9 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":"crates/vcad-torture/src/main.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"442a9188621ac1577c0e6b31205b452aee1a77c1f46b3bf02d61db1913f0c727"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::grader::check_step_roundtrip (cognitive 32): mecheval_grader::grader::check_step_roundtrip has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (10 pts), 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":"mecheval/graders/src/grader.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e5f39f5678422226eab7ad8a74bb793ba63f9757210a6b6ca4d924fa18b12e"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::pcb::check_decoupling_proximity (cognitive 32): mecheval_grader::pcb::check_decoupling_proximity has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts), match/switch 2 (5 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":"mecheval/graders/src/pcb.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"33365e4e82edef327b9ba85fabcd6e8421fb8fdc770099b82b059994c287e5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.documentScene (cognitive 32): EditorModel.documentScene has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 9 (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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f30421e0d70cb6a351e8b6d5e0f6f2af5a77e59fd96d238d742a77c46b2b452"}},{"ruleId":"D2","level":"warning","message":{"text":"PathTracer.step (cognitive 32): PathTracer.step has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 13, ternaries 3 (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":"apple/VcadApp/Sources/VcadApp/PathTracer.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"71655e82101f1e4d3323f07a6382dbe2a93aa6ea147c7effd2a6a9ffa73a5b36"}},{"ruleId":"D2","level":"warning","message":{"text":"StrikeDetector.process (cognitive 32): StrikeDetector.process has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, ternaries 1 (3 pts), 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":"apple/VcadApp/Sources/VcadApp/PitchDetector.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae11dc10fa80f54a8912095c07f8e5e12333ffcf64fd9e186f1764e3da74a310"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.documentScene (cognitive 32): EditorModel.documentScene has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 9 (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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"25395add200833381bb4a6a1aa8b1874de2ae53306f203eedd1f373626b21118"}},{"ruleId":"D2","level":"warning","message":{"text":"build.runPage (cognitive 32): build.runPage has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 19 (30 pts), boolean chains 2 (nesting depth added 11). Most of this is not in the body itself: 11 of the 32 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 2311, 2351). 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fe2ad73c89393eb03fba9a103e750d23f16e36dffdcf7a82748c474da87ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"ParametersPanel.ParameterRow (cognitive 32): ParametersPanel.ParameterRow has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 6 (12 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 11 of the 32 points are its own statements and the rest belongs to 5 function items inside it that branch (commitValue, a function literal at line 229, commitName, \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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df3def73572cf6474b8f6f8c065d82327c78a191cbf85fe37523cec5adb4618"}},{"ruleId":"D2","level":"warning","message":{"text":"claims-ledger.extractClaims::visit (cognitive 32): claims-ledger.extractClaims::visit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3 (6 pts), boolean chains 5, error handling 1 (2 pts), ternaries 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"34475a84b17e2eb89d700b8b9af6084f2ae1916a4dfebaf35070f2dd39d1c240"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.forceDirectedRefine (cognitive 32): ecad.forceDirectedRefine has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 2 (6 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 17). Of this number, 21 points are the body\u0027s own statements and 11 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a3a56bd759018062a877addb8a2af6c76eea8eda1255a8010b1901dbbd240b"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.deletePcbElement (cognitive 32): ecad.deletePcbElement has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 9 (13 pts), boolean chains 5 (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 5 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bdb78e77e1e6e5a8db94435ac265f93c4912fe6e05c12f2af0876584b2b684"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.boardFromSolid (cognitive 32): ecad.boardFromSolid has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 11 (15 pts), if/else 11 (12 pts), boolean chains 5 (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 8 belong to 5 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, 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae3c0cbcc8f9855236790cea60b378763934aa3ee68230eb4d836df07634530"}},{"ruleId":"D2","level":"warning","message":{"text":"main.handleToolResult (cognitive 32): main.handleToolResult has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 6, error handling 2 (3 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcde41f1a6344e4a534383543478bde605305edac190dd2cd86439c1a4e6e353"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentApi::exclusive_inputs_closure (cognitive 31): DocumentApi::exclusive_inputs_closure has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 5 (9 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":"crates/vcad-app/src/document_api.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6846a9fa2681a5cfd257c6c1fdcb6e1fe72830582b0e524098fa330920dc25ef"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::app::run_loop (cognitive 31): vcad::app::run_loop has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f101f2a18635661d08b5a5d3bc88f6c57a37a88069eb093aa1673ae0b83f783"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::render::fab_notes (cognitive 31): vcad_ecad_fabprep::render::fab_notes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-fabprep/src/render.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e6cddd3989700d8bf83423f43388627112879ef57b6482fd4a64326e03f633"}},{"ruleId":"D2","level":"warning","message":{"text":"Raster::build (cognitive 31): Raster::build has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 5 (14 pts), boolean chains 1 (nesting depth added 19). 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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b8d4691a6465819d245bda37e1182ac07978fa786a9842eaebdd72437b6fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_pad_clearance (cognitive 31): vcad_ecad_pcb::drc::check_pad_clearance has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7c31fe571375f88c79f0d070c9d48cd357941d7aec7324ade237b281bb2502"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::try_route_escape (cognitive 31): vcad_ecad_pcb::router::auto::try_route_escape has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 1, 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bc72edcd70044465d08f727fbbbd46c4d9a9e2263464fd2abe13a1473a99fd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::ripup_pass (cognitive 31): vcad_ecad_pcb::router::auto::ripup_pass has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (13 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4519}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bac7bede4decd3551e696bd7aac01b1dd5ae4022fd7b7c6a4b55ec77856b35"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::cdt::layer_obstacles (cognitive 31): vcad_ecad_pcb::router::flow::cdt::layer_obstacles has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 7 (9 pts), boolean chains 3, 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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1172ff1e9d5fdc8e793894a9fe3c21c8209de2317a34cc05dad12ef89b184"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::net_stubs (cognitive 31): vcad_ecad_symbols::kicad_write::net_stubs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (5 pts), match/switch 1 (3 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dfbeb20546c59a83592237b443bbb58f175e92944f4be835adf07c63f165c3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::evaluate::union_tree (cognitive 31): vcad_eval::evaluate::union_tree has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts), match/switch 1 (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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b871a456efa12399679b3f212a13f5f963c8cf365237058d8e876366c13b967d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sensitivity::document_sensitivities (cognitive 31): vcad_eval::sensitivity::document_sensitivities has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (9 pts), 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":"crates/vcad-eval/src/sensitivity.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"f847d260d9dd2fb290d922fece84be60658ff43c1dc0f6b078c9b73c416c5472"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_antenna::mom::fill_impedance_matrix (cognitive 31): vcad_kernel_antenna::mom::fill_impedance_matrix has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 6 (9 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":"crates/vcad-kernel-antenna/src/mom.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"686d030c7365c2e4d5d9bcf81959061de2119a634a788b72479e6bc1bc517cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"QuadricCtx::project_mesh (cognitive 31): QuadricCtx::project_mesh has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 5 (8 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fbdfbe332a0112aebdd39763253ddccbc7689f64def539fe313de66e13e28f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_dense_conical_band_by_circle (cognitive 31): vcad_kernel_booleans::split::split_dense_conical_band_by_circle has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 6, loops 3, match/switch 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cba223b60e32ed34c244301a0253ccc4067d42a10f3ad1fd91b3bab2815acac"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::ssi::intersect_surfaces (cognitive 31): vcad_kernel_booleans::ssi::intersect_surfaces has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 16 (31 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":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"59818c21f3ffbbbfd8651d5c61438d997894d8d355e1f5cfc38ef0441e5ffb29"}},{"ruleId":"D2","level":"warning","message":{"text":"Probe::new (cognitive 31): Probe::new has cognitive complexity 31 (threshold 15). Drivers by points: loops 10 (18 pts), if/else 5 (10 pts), match/switch 1 (2 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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e5f7176180c1cb25f052e54e206a1ee2aab7897088402f76478b2d3cab11ca"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::dxf::sheet_to_dxf (cognitive 31): vcad_kernel_drafting::dxf::sheet_to_dxf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 8 (10 pts), boolean chains 2, match/switch 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":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c470e2608aef90c9e709f54064bb93eedaf577a0266ea6bf9f7ab09b23546679"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::assembly::solid_occurrences (cognitive 31): vcad_kernel_step::assembly::solid_occurrences has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 7 (11 pts), match/switch 1 (2 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":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dfa277568966d506ecf6c684b5eb3f0c4f75a17e94f0f5ba13ce30bfc9fdcb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_small_arc_fan (cognitive 31): vcad_kernel_tessellate::tessellate_small_arc_fan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 8 (11 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4551880c456ebab4b6516b1b6b9bfdfee16ad50aef2cdab99b1373a319e197"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::convert::convert_assembly (cognitive 31): vcad_loon::convert::convert_assembly has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 8 (12 pts), boolean chains 3, loops 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba0728ef6075f8b3b85a6e935ca248a871676f569d31130292df8bf8e6892c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::call_tool_inner (cognitive 31): Server::call_tool_inner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 4 (6 pts), 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"249546d35e4b676e516cac9586805bfd00430ca32d9848696a24fc58953d0bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::raster::draw_text (cognitive 31): vcad_render::raster::draw_text has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 3 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5207}}}],"partialFingerprints":{"codehealthFindingId/v1":"178259fe75b3a3b007428e77e9152d0ee861c4da167fe413a2eb05ea687a5393"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCStatus.ingest (cognitive 31): CNCStatus.ingest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcfe141893ee4d4a81e01527a6186bf83fd5b89b38cc12077a2c68486a71322"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.assemblyScene (cognitive 31): EditorModel.assemblyScene has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 5 (11 pts), boolean chains 5 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 3 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"564b7b093d0d9dc98a0b5c13bcf9142a7082c447a6f45c7af7efbd229559c864"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.paletteCommands (cognitive 31): EditorModel.paletteCommands has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, loops 7 (8 pts), ternaries 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":"apple/VcadApp/Sources/VcadApp/FeatureOpsPalette.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8d6230a76481078378690b07df56c4cf925b05ab048776a742728674a89226"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.assemblyScene (cognitive 31): EditorModel.assemblyScene has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 5 (11 pts), boolean chains 5 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 3 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35e46553db0c7c67e9ac003bb73864db685adb710b0e6c226b43881a2933de"}},{"ruleId":"D2","level":"warning","message":{"text":"build.main (cognitive 31): build.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 6 (10 pts), loops 7 (9 pts), boolean chains 1 (nesting depth added 12). Of this number, 29 points are the body\u0027s own statements and 2 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"671349ee96e9706381ae3a5f87a995411fbb85dc5e8b5c1e0f609f4d11a6250e"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentPicker.DocumentPicker (cognitive 31): DocumentPicker.DocumentPicker has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 8 (9 pts), boolean chains 5, error handling 4, loops 1 (nesting depth added 2). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 311, 255, 346, \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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c38e981400a0a5b57e76fea8690d107fa06c5d9b185c60a7c2e218b028b4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"part-summary.getPartSummary (cognitive 31): part-summary.getPartSummary has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (29 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":"packages/app/src/components/tree/part-summary.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a919b6bc303808cda0a42c44499c8d0ce58626b052db158943f6dacf875d3633"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformGizmo.TransformGizmo (cognitive 31): TransformGizmo.TransformGizmo has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (21 pts), ternaries 5 (6 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 7 of the 31 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 105, 187, 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":"packages/app/src/components/TransformGizmo.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8076c435653ff2cf75fe48dbc07443f639fc2606111409458d0501c8b750a06c"}},{"ruleId":"D2","level":"warning","message":{"text":"assemble.assembleInto (cognitive 31): assemble.assembleInto has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 5 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). Of this number, 23 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":"packages/mcp/src/tools/assemble.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7057bf6e310dbbe9f8ced070600f3a56cd7e6d5d50c89b74bc5c324f92f61188"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.setStackup (cognitive 31): ecad.setStackup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9642}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0115e810fd43e67b9847abf83a996977cd1188265589d981911e0556717e79d"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.checkSelfStart (cognitive 31): ecad.checkSelfStart has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 8 (13 pts), boolean chains 4 (nesting depth added 10). Of this number, 29 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12872}}}],"partialFingerprints":{"codehealthFindingId/v1":"741749a738d828990ce63113f0dc1c0e850c1d5514230861302d30df13cc4c31"}},{"ruleId":"D2","level":"warning","message":{"text":"main.applySimFrame (cognitive 31): main.applySimFrame has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 6, loops 1 (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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"606d7abdeed7f5c5efc33829190729ff0a24a3420f0e16d2b4c575c53fc781df"}},{"ruleId":"D2","level":"warning","message":{"text":"component (cognitive 31): component has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 11 (26 pts), loops 2 (4 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":"www/public/kit/gallery.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef010932a0ad4a008f1cfe86c15fbb516bc7a3447bf365f2c6700a2bf70a0b7"}},{"ruleId":"D2","level":"warning","message":{"text":"component (cognitive 31): component has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 11 (26 pts), loops 2 (4 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":"packages/app/public/launch/launch.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40b56a49821a1564efb300c90e1a5d3f0b559e950462f592101ddee4f662342"}},{"ruleId":"D2","level":"warning","message":{"text":"App::get_triangles (cognitive 30): App::get_triangles has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (27 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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15671907f5d80bcf027b79dfa781421a984045e1eee15421f320b423b02f4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ResidualSystem::compile_with (cognitive 30): ResidualSystem::compile_with has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (9 pts), boolean chains 3, 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"766ccfa0797af08e7bfd1767eb1049d60e4459b567bb9d5fc447a49f2c9338cf"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_silk_over_pad (cognitive 30): vcad_ecad_pcb::dfm::check_silk_over_pad has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (9 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0661dd030f4bad4bf13a637d7f9227ccddd307c69089186ca40e10b598c8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_acid_trap (cognitive 30): vcad_ecad_pcb::dfm::check_acid_trap has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 7 (12 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcab314c5ad76c1e1c59e3beaafc5b28f9d259aa1f8fdfd809d748dddb4eee5b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::bump_away (cognitive 30): vcad_ecad_pcb::router::bump_away has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, 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":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fa377d8e8908cb361370dc9a7ae273852e7e8ba25bf00e0a6b577ff9a58487"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::route::runs_of (cognitive 30): vcad_ecad_pcb::router::flow::route::runs_of has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (9 pts), loops 2 (5 pts), boolean chains 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc1497684eb48f7cca794cf2269be41821184507e646590514afa312a515147"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::length_match::match_lengths_runs (cognitive 30): vcad_ecad_pcb::router::length_match::match_lengths_runs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (3 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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"33050785b12f0b95bc4ad9b1efadb86472fbf3907800a174decb10330a256ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::pair_partner (cognitive 30): vcad_ecad_pcb::router::pair::pair_partner has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 4, 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c78d741eec5950e7a53bc90fbd2b2d350843280aae5e81b03556cbd928da7d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::parse_stackup (cognitive 30): vcad_ecad_symbols::kicad_pcb::parse_stackup has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 1 (3 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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"960ecdfa84763d2ca3bf71180f92ee63b2d33c67e086bf72f8055a8c220a8c37"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::extract_device_spec_from_scene (cognitive 30): vcad_eval::sim_extract::extract_device_spec_from_scene has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (6 pts), match/switch 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"1629aca4a2202b1f0bfaf74b70d1dcc06b120215f183313b41219aefcea20160"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::to_loon::document_to_loon_checked (cognitive 30): vcad_ir::to_loon::document_to_loon_checked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (8 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":"crates/vcad-ir/src/to_loon.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c38dac3f09f4b64dcf0684602e959729b99ce5e3c1db38ed1bd9945a1e9636"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel::turning_profile::chain_segments (cognitive 30): vcad_kernel::turning_profile::chain_segments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts), boolean chains 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":"crates/vcad-kernel/src/turning_profile.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda7f528dc2e1922aac37fe6a7115d923192f1380b89367dbab8b6029f6e9180"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::freeze::rechain_rim (cognitive 30): vcad_kernel_booleans::freeze::rechain_rim has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 7, boolean chains 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, 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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc1bed79cabbb47debd255888c8236b531f15c76753a5269470deeaffd725ef"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_planar_face_inscribed_circle (cognitive 30): vcad_kernel_booleans::split::split_planar_face_inscribed_circle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 6 (8 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"25430c9ee6b6ed785157e0d95dcf42c98412aa0de79d6143ac3d977aa7539838"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::fdm::run (cognitive 30): vcad_kernel_dfm::rules::fdm::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (6 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":"crates/vcad-kernel-dfm/src/rules/fdm.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19794bfed23becdb7b96e361ca993db832267740ecc0353051b4a9275bd68c4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::buckling::pressure_face (cognitive 30): vcad_kernel_fea::buckling::pressure_face has cognitive complexity 30 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 2 (8 pts) (nesting depth added 19). 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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fb5061d57b37093b51ae7b092e134c4fa85d07231afb652d4f1f59a1de01d9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::section::check_beam (cognitive 30): vcad_kernel_fea::section::check_beam has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 3, 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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e7b1d8c6123367cf81f78045ce146f4680e959f3c2c6ebfc8ca33d1dc4007a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_features::relate (cognitive 30): vcad_kernel_features::relate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (10 pts), match/switch 1 (3 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":"crates/vcad-kernel-features/src/lib.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfe21818a2eea8bbe3121939deef076a8c3679dde5ce65ae8e3665d2974ebb5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_optics::optimize::minimize (cognitive 30): vcad_kernel_optics::optimize::minimize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (9 pts), boolean chains 4 (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":"crates/vcad-kernel-optics/src/optimize.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"518a74675ed058152d7954e699ad7010d626c868e7e72faf00fffe6c0eef3bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_photonics::gds::decompose_rects (cognitive 30): vcad_kernel_photonics::gds::decompose_rects has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (13 pts), boolean chains 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":"crates/vcad-kernel-photonics/src/gds.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"de83a4b4b9ea6acb0c14770cd737492927b3cca273ae6650a7d4e9062edaeda1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::snap_boundary_rails (cognitive 30): vcad_kernel_tessellate::snap_boundary_rails has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (7 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab15b4f9b9dab76fe7c3b4b9853d02bbd9059d73f9517c5759374f2ef0caab14"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::mesh_ray::strip_membranes_once (cognitive 30): vcad_kernel_tessellate::mesh_ray::strip_membranes_once has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 3 (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":"crates/vcad-kernel-tessellate/src/mesh_ray.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bed83b5e70628dd6a667f3c7947b9ba5db44b47d84e3754f7e12b148cd51844"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_text::profile::text_to_profiles (cognitive 30): vcad_kernel_text::profile::text_to_profiles has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (6 pts), match/switch 1 (2 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":"crates/vcad-kernel-text/src/profile.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"150730c14aa881d0e0208f8c9f41885da7946a10945e8e3e5254f9bdd51ae0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::solve::solve_field (cognitive 30): vcad_kernel_thermal::solve::solve_field has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (8 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca15bb0f1721dd63be851bc2a3510c960a1e54a2fd04035d48f6f6d14a101bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Solid::text_extrude (cognitive 30): Solid::text_extrude has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (10 pts), boolean chains 2, match/switch 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b564f0d7a1bb594d1cc3e5b736c9a1aec69a2e7670c95aa0979dd6f0c87b54a1"}},{"ruleId":"D2","level":"warning","message":{"text":"VariantSet::resolve (cognitive 30): VariantSet::resolve has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (7 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":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccd284ce088ff33677ffe16f0127b7a0f0160f1282e1404bd6e7b67189738ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureOpSheet.apply (cognitive 30): FeatureOpSheet.apply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 5 (11 pts), boolean chains 2, 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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"df10af035e13dea3f87703820ba329581e4f5763fdbca36b43e567ac5f24556d"}},{"ruleId":"D2","level":"warning","message":{"text":"DockTools.design (cognitive 30): DockTools.design has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 11, ternaries 6 (11 pts), if/else 4 (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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70d2acef6476c90e7082fdffd0ee670ec8a78bc760fa9efd58abe95ec0340fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.constrainSelectionNow (cognitive 30): SketchSession.constrainSelectionNow has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 10, 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9559f09f2597644d2a77299ee2a5f5d4445718e41272befacb0e70e842abdec3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentVolume.rebuild (cognitive 30): DocumentVolume.rebuild has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (8 pts), ternaries 2 (6 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":"apple/VcadVision/Sources/VcadVision/DocumentVolume.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da3c79b96e20cafe05525bc37d6664be26a4ee8f1379d4a25df8487038e62b3"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchPlane3D.SketchPlane3D (cognitive 30): SketchPlane3D.SketchPlane3D has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 5, loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 773, 905, 802, \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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7478298cc8a8c0d60dc35b38503a2267185884ce8f9e1e9a75902758ea399d"}},{"ruleId":"D2","level":"warning","message":{"text":"PcbKernelBoard.PcbKernelBoard (cognitive 30): PcbKernelBoard.PcbKernelBoard has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 5 (9 pts), boolean chains 6, ternaries 3 (nesting depth added 7). None of this is in the body itself: all 30 points belong to 6 function literals inside it that branch (lines 216, 146, 261, \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":"packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b7349a8d8c9d2badf33edb2b243d2f393c63bb9d58854f29688f1f0956cb8d"}},{"ruleId":"D2","level":"warning","message":{"text":"circuit-build.buildCircuitSpec (cognitive 30): circuit-build.buildCircuitSpec has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 8 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 15 belong to 4 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":"packages/app/src/lib/circuit-build.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d16f017bd9757f3201c1678a515557eab0958729305f0c05142364b27b22c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"sheet-metal.buildSheetMetalChain (cognitive 30): sheet-metal.buildSheetMetalChain has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (18 pts), if/else 10 (11 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":"packages/engine/src/sheet-metal.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5c84632d8a6a343558d23685621e77fb2ced0fb4b2ae0d3f045d3e83bea377"}},{"ruleId":"D2","level":"warning","message":{"text":"receipt-unified.unifiedFromSpec (cognitive 30): receipt-unified.unifiedFromSpec has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 11 (23 pts), if/else 7 (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":"packages/mcp/src/receipt-unified.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ba170268843caef5c4b84a9eaaae5a3bb12b1e4be96611fa307b326813e280"}},{"ruleId":"D2","level":"warning","message":{"text":"registry-dispatch.snapshotParts (cognitive 30): registry-dispatch.snapshotParts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 12, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 3 function items inside it that branch (canon, canon::isZero, canon::isOne). 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7c76316bf9aa46c03b20fb85a9b5cb8f3a5fe6ec47a57f00e312af56021040"}},{"ruleId":"D2","level":"warning","message":{"text":"Lattice.cast (cognitive 30): Lattice.cast has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (9 pts), boolean chains 3, ternaries 1 (2 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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c775ddc91509ce9a9a8675c5a3c14cf01f5cbb595e93783481f0978b4936f619"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.polygonOverlapBbox (cognitive 30): ecad.polygonOverlapBbox has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (7 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1402290273fa31e315505a14dd951cb1bc361cd3580a270e13bf7c2e795435"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerCdt::walk (cognitive 29): LayerCdt::walk has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (3 pts), boolean chains 2, 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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a6d50097438b2b6a6f76d143d76d98a4248200252d20119e3e36df3d38fe14"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_schematic::erc::check_unconnected_pins (cognitive 29): vcad_ecad_schematic::erc::check_unconnected_pins has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 9 (14 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":"crates/vcad-ecad-schematic/src/erc.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf6446fc50e7a260065a25da80c8a3601a639ff81c5aef9a66f65949d8156ff"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::netlist::parse_si_value (cognitive 29): vcad_ecad_sim::circuit::netlist::parse_si_value has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, loops 1, 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":"crates/vcad-ecad-sim/src/circuit/netlist.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdb01b9c92ceb17ee4ddd6d4b66d961a6f9da9a9444531be6b32690b3cc7cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::cavity_extract::trace_passage (cognitive 29): vcad_eval::cavity_extract::trace_passage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 1, 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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"309223069b309e1a0d9c2f32a80d2caeb07a399f023555a3c564f8a2bb0fc340"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::evaluate::evaluate_text_extrude (cognitive 29): vcad_eval::evaluate::evaluate_text_extrude has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (9 pts), match/switch 2, 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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceca4b51bd4833debceb9f87fc67b687f4f6cb7b2759f62ed3522d6139d88de2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_photon_dose::capture::capture_lines (cognitive 29): vcad_kernel_photon_dose::capture::capture_lines has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 5 (11 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":"crates/vcad-kernel-photon-dose/src/capture.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff7d1a464e30e1cd945b175a0266c86f17074c69b2fa39f418015ecfa743fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sweep::sweep::build_swept_solid (cognitive 29): vcad_kernel_sweep::sweep::build_swept_solid has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 6 (12 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":"crates/vcad-kernel-sweep/src/sweep.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"553c247e1b4f74f795078f6897c51a629abccea2c9992c524b935276ba561f24"}},{"ruleId":"D2","level":"warning","message":{"text":"Stackup::validate (cognitive 29): Stackup::validate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, loops 2 (3 pts), 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":"crates/vcad-kernel-tolerance/src/stackup.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce93b74d2d27a63c588e57a43cc9c5e17c09183f873fc9fa005f61046539169c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::evaluate_node (cognitive 29): vcad_kernel_wasm::evaluate_node has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3 (5 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":4823}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0acdf74f20d716e58dc4dfae2c714429a15f4fdadec0192ff2b687b809e5b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::handle_legacy (cognitive 29): Connection::handle_legacy has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 2 (3 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"99995bbcfac87db8649eadda21027d97217388a9ed46f966b05442a7e72cfcdc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_torture::run_one_isolated (cognitive 29): vcad_torture::run_one_isolated has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 2 (3 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":"crates/vcad-torture/src/main.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4009e6a06459691f13bda458aa30a99d83f53190528b263bc130f0d0e3f58438"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCOutline.parseDXF (cognitive 29): CNCOutline.parseDXF has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). Of this number, 28 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":"apple/VcadApp/Sources/VcadApp/CNCOutline.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"989db8e88d0af32e2c54f4ca0285d847f22e86fc87c5b9767756b25b421b19e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedOverlayView.marqueeOrOrbitGesture (cognitive 29): ReleasedOverlayView.marqueeOrOrbitGesture has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 5, match/switch 1 (2 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a41b857966e973b741c66b33eebc7c086eba03cf76993b3d4b5ec8032bceab1"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorView.body (cognitive 29): InspectorView.body has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"619886867fadadb3df61bc69d4a80378cdf7a58adfefbc5b8f3e780774b527b9"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorView.body (cognitive 29): InspectorView.body has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 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":"apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0f887bc7cedf022d6d27d4ff718f64cda824f9bfffb2c3993cb8571b544522"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway-mcp.makeGatewayMcpSolver.solve (cognitive 29): gateway-mcp.makeGatewayMcpSolver.solve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 3 (5 pts), ternaries 3 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). Of this number, 24 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":"mecheval/harness/src/solvers/gateway-mcp.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f0c0a3ff1ffa3ea5fd7943a5ac135b2abf770ea16fcfafcb5613de07496ab"}},{"ruleId":"D2","level":"warning","message":{"text":"EcadFeatureInspector.ComponentFootprintPanel (cognitive 29): EcadFeatureInspector.ComponentFootprintPanel has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 11, loops 2 (5 pts), ternaries 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 10 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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a8bea285bc7b4be4bf68e4d4ea3b92b8efcd88a845311f4d0f33fe7b690973"}},{"ruleId":"D2","level":"warning","message":{"text":"measure.measureSweepResult (cognitive 29): measure.measureSweepResult has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (9 pts), boolean chains 4, error handling 3 (4 pts), loops 1 (nesting depth added 8). Of this number, 27 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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc286f37f135091ad7e374c2346ecbd6d03165ce3425eeae7104049b909c043"}},{"ruleId":"D2","level":"warning","message":{"text":"preview.generateGlbPreview (cognitive 29): preview.generateGlbPreview has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (13 pts), if/else 5 (10 pts), loops 3, boolean chains 2, error handling 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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead7304a712c699b5a2f98ac5eb7b5ad75e0f18b03f04ed70584da36bdbf0048"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.solidFromBoard (cognitive 29): ecad.solidFromBoard has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 10 (13 pts), if/else 7, boolean chains 5, error handling 1 (2 pts), loops 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14099}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09e4cd370bc8db7c6e0ef723387941691f18c7b8fff910d25403bd82677f6cd"}},{"ruleId":"D2","level":"warning","message":{"text":"sim-replay.getSimReplay (cognitive 29): sim-replay.getSimReplay has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (9 pts), error handling 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 18). 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":"packages/mcp/src/tools/sim-replay.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2777e35701112b7745a971eb222bce969d5e24bd3d75fb19f1d97ad5c8f467d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::input::hit_test (cognitive 28): vcad::input::hit_test has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"db23062ee7c21e5bc7af632daaaba1c43e1081a5ae7424dd4cb24f01753b270a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_diff::recompose (cognitive 28): vcad_diff::recompose has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (9 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":"crates/vcad-diff/src/lib.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dd3826d9c72b80dd7c40cf7d5331f36defd8e438ab1798dfc2131b57376104"}},{"ruleId":"D2","level":"warning","message":{"text":"RouteSession::probe (cognitive 28): RouteSession::probe has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 1 (4 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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b9f852728064df919446bfd84ff9a1af0f61452fb655d88758f5e4283418bd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::copper_pour::collect_clearance_regions (cognitive 28): vcad_ecad_pcb::copper_pour::collect_clearance_regions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (6 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":"crates/vcad-ecad-pcb/src/copper_pour.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ba7bc0d14d791cbf00be273edabd621e9576908882be320ac3a9b7b9f443d7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_annular_ring (cognitive 28): vcad_ecad_pcb::drc::check_annular_ring has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebf2e4821635d5d555a033c68ef7cc65baf97d0165d495fe3a0f2606b22b237"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::length_tune::generate_meanders_inner (cognitive 28): vcad_ecad_pcb::router::length_tune::generate_meanders_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (8 pts), match/switch 2 (3 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":"crates/vcad-ecad-pcb/src/router/length_tune.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3638858d276e65f4c58528f2a84c30c2ba5fff908ead4b94e4d8c6ccaba5d84d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::sound::call_with_scene (cognitive 28): vcad_ffi::sound::call_with_scene has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (22 pts), boolean chains 2, if/else 1 (2 pts), loops 1 (2 pts) (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":"crates/vcad-ffi/src/sound.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a720488d93038a571a85780cfd4b35a0bc61dc5f7b72ad72501d43857f2b6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::classify::find_coincident_cylinder_classification (cognitive 28): vcad_kernel_booleans::classify::find_coincident_cylinder_classification has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (4 pts), loops 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f07635b1012ba14017cb7327f1d9c40ff0769d79dde14c49e16aac676f501a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::envelope_chain (cognitive 28): vcad_kernel_booleans::cyl_band::envelope_chain has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"591187a86a6d0c599bf59d9e55998f19fab3aa6a72bdb2f712759c922ddedf2b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::mesh::csg::split_polygon (cognitive 28): vcad_kernel_booleans::mesh::csg::split_polygon has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (3 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e30ddae006b2d2eabf197e17d5bc7af926a00bf33e572701a5d2482df4c28b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::repair::pair_half_edges (cognitive 28): vcad_kernel_booleans::repair::pair_half_edges has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (4 pts), boolean chains 2, loops 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":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb0c36af6e8b72e03794fa6a90345dcc4e06af5799b2e18fda70ce0887b3221"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::mold::run (cognitive 28): vcad_kernel_dfm::rules::mold::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 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":"crates/vcad-kernel-dfm/src/rules/mold.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d083a3c2b05bd8f0ddcc86acee11ece5b30f3c5a16e2bffca2ae90df5a68b5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::implicit::implicit_terms (cognitive 28): vcad_kernel_diff::implicit::implicit_terms has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (16 pts), loops 5 (10 pts), if/else 1 (2 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":"crates/vcad-kernel-diff/src/implicit.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"650c3c5b94f3454d0880db9fda7f4fc40e3f577c7c75f7b50036f0bf7b5fe43f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::mesh::tet_fill (cognitive 28): vcad_kernel_fea::mesh::tet_fill has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 5 (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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc02d9c86295c0c2a298997b9968064321997f26c6d1178ae52db7c1d396080"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::modal::lobpcg (cognitive 28): vcad_kernel_fea::modal::lobpcg has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 7 (13 pts), boolean chains 1 (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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d06066cc15d3ef16e616db266561b4596aa01dcd1c594db420ea6339eb2991a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::solve::assemble_bc (cognitive 28): vcad_kernel_fea::solve::assemble_bc has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 7 (14 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":"crates/vcad-kernel-fea/src/solve.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dbac160a90434e04de5a2ee7033d0c5406f3f296894588c2ed1cc6ffe0617e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::manifold::cap_pinholes (cognitive 28): vcad_kernel_tessellate::manifold::cap_pinholes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 7 (11 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":"crates/vcad-kernel-tessellate/src/manifold.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"60866e501b38b6ad0e927fcddb10849af2b52b55b9681966b33f7647421e7de8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tolerance::allocate::allocate (cognitive 28): vcad_kernel_tolerance::allocate::allocate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (6 pts), boolean chains 2, 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":"crates/vcad-kernel-tolerance/src/allocate.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab9533b0f946debc7f6c79ced8e0c84d8990be6f955c45663c384a2a5681f21"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_topopt::simp::optimize_densities (cognitive 28): vcad_kernel_topopt::simp::optimize_densities has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (22 pts), if/else 3 (6 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":"crates/vcad-kernel-topopt/src/simp.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"786df9134beeccf593ed9f01e20b8675183cc05d00b7d622f3b848b57b9ed611"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::convert::value_to_document_in (cognitive 28): vcad_loon::convert::value_to_document_in has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, loops 3 (6 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36b77a570b21c1aa1b7f5ec15b9a31dab772d02eb3299183f97100787787597"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureOpSheet.fields (cognitive 28): FeatureOpSheet.fields has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 6 (11 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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cfb9f6340d3d794ab044f1f27958901b5e8fd871846b6ce41bc1d0eb11ab80"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchFill.triangulate (cognitive 28): SketchFill.triangulate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 8). Of this number, 26 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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f60430d1dae950ddda8d850b7588c016abbc81b8f08a3f4be8d3f5ac3bbbfbb"}},{"ruleId":"D2","level":"warning","message":{"text":"NavSmoke.swift.navSmoke (cognitive 28): NavSmoke.swift.navSmoke has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, ternaries 6, loops 3 (nesting depth added 2). Most of this is not in the body itself: 13 of the 28 points are its own statements and the rest belongs to 3 function items inside it that branch (drag, send, check). 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":"apple/VcadApp/Sources/VcadApp/NavSmoke.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3848a3fe5b73e9fed1ede14e24c3d411a178db8f69d09b8a6fab2276a3eb9ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsPanelHeader.BoardSizeControl (cognitive 28): ElectronicsPanelHeader.BoardSizeControl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, ternaries 4 (nesting depth added 4). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 6 function items inside it that branch (fitToEnclosure, commit, a function literal at line 104, \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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"87728e42b187aa3e2d86039e211cf9f532c0678f21124900d58c3d1570bfb5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.schematicSummary (cognitive 28): ecad.schematicSummary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 6 (7 pts), loops 4 (5 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"406dc05810f514bfbd639a3a86b3b3362328407b15eff7586dd8bb07235f0af0"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.setBoardOutline (cognitive 28): ecad.setBoardOutline has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 8, ternaries 4, loops 1 (nesting depth added 5). Of this number, 27 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d0ef0d868c7f4b9c7e5865142e9f2fa06a861eddcddf7fe08783dc6fb99258"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.largestComponent (cognitive 28): ecad.largestComponent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (8 pts), loops 4 (7 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87af419f900460ab622b7f681156e4d276ced94aa80e43987c9d7f87077873d"}},{"ruleId":"D2","level":"warning","message":{"text":"init (cognitive 28): init has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 5, ternaries 5, boolean chains 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 25 function items inside it that branch (play, a function literal at line 188, el, \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":"www/src/receipt-art.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b9c474cfee4b3e0d9071e065fcbc95b3e6898f272f6284cf6019bcff498bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"CellBuffer::flush (cognitive 27): CellBuffer::flush has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 4, loops 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":"crates/vcad-cli/src/ui/buffer.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab53322328e85da4460fa71152289b278a6768daef8c23b4201c2162b8c2ed71"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::floating_floor_area (cognitive 27): vcad::floating_floor_area has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (7 pts), boolean chains 2, 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c51526327c796cda7072bf24f7fa93f541696b3f503b588167d9667f7711f13"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseDiff::inner (cognitive 27): SparseDiff::inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 2, match/switch 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":"crates/vcad-ecad-pcb/src/router/claims_ir.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"4845727df46656f1820492c73630a6a0f90421c37a48fedbd0bac26f84baa0fd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::silk_segments (cognitive 27): vcad_ecad_pcb::dfm::silk_segments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (9 pts), match/switch 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc12873efa4bb846222ae17fdcd855c3923414aeff1ddf5048b3e0b333437101"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::classes::classify_nets (cognitive 27): vcad_ecad_pcb::router::classes::classify_nets has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, 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":"crates/vcad-ecad-pcb/src/router/classes.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c8a0346460178944bbeb08669c9787ab0dbd924659e6b9ee629dd7e653c4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_board::place_footprint (cognitive 27): vcad_ecad_symbols::kicad_board::place_footprint has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (5 pts), match/switch 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81286bcabfdccd29142ca3c8f22fc4d9d2c42a37be11ea810c4efa73ead847d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::parse_declared_stackup (cognitive 27): vcad_ecad_symbols::kicad_pcb::parse_declared_stackup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a374129b7e1c0844d26d2784022ed64f7080e8a8b2dd6bd9d6c566d4c6e6fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_embroidery::digitize::fill::fill_stitch_multi (cognitive 27): vcad_embroidery::digitize::fill::fill_stitch_multi has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (11 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":"crates/vcad-embroidery/src/digitize/fill.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a35e4343042c0ca654355137a1c2f6efe73c09d56598f076c5bfe668b9af80f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::em::rev_section (cognitive 27): vcad_eval::sim_extract::em::rev_section has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (8 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":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"656bfde3bc2ff6a82573599e6c9de9022b4ec598b4ee1bdd5fc3c60c73d370dc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::realize_bands (cognitive 27): vcad_kernel_booleans::cyl_band::realize_bands has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 6 (12 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"762f3487a78bb0d40acada48399ce68700af617e2504afd89c826a9e322df96c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::planar_wall_crossings (cognitive 27): vcad_kernel_booleans::pipeline::planar_wall_crossings has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (6 pts), boolean chains 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"989d28388028c68822a5c6f591f4013aa90d08b2627a602106cd5d8b72d6427a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_constraints::residual::compute_constraint_residuals (cognitive 27): vcad_kernel_constraints::residual::compute_constraint_residuals has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, 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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c840e12756e65b2df5e47d81aef8ce49606a1a403316c47a716ce1fdc6e21"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::section::clip_polyline_to_strip (cognitive 27): vcad_kernel_drafting::section::clip_polyline_to_strip has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 1, 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d3729df9b3e514bacc5b2fc3c0a61eaa39b8e5280e2c16f773f6ab1e2da06a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_planar::fillet_all_edges_checked (cognitive 27): vcad_kernel_fillet::fillet_planar::fillet_all_edges_checked has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3, 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":"crates/vcad-kernel-fillet/src/fillet_planar.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea42755439a993f2a7c48980dc19ee064aa491a7afc30267834f70398ee4d6da"}},{"ruleId":"D2","level":"warning","message":{"text":"PhysicsWorld::step (cognitive 27): PhysicsWorld::step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (13 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec52d13d9892ca4002fdc7a5f7ae59e139962f95d79a25b75d9b14e4716df06"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::clearance::closest_pair (cognitive 27): vcad_kernel_tessellate::clearance::closest_pair has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b03d365a6f111e3b9c8d34fb2bc8176dc612bac7dfbdede93357e80cb25c1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tolerance::economics::economics (cognitive 27): vcad_kernel_tolerance::economics::economics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 3, 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":"crates/vcad-kernel-tolerance/src/economics.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f79081195ecefbc5f0e8f0eeb6bf4bcb91fc5b61851bfe5484a58751631b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_topopt::extract::taubin_smooth (cognitive 27): vcad_kernel_topopt::extract::taubin_smooth has cognitive complexity 27 (threshold 15). Drivers by points: loops 9 (23 pts), if/else 1 (4 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":"crates/vcad-kernel-topopt/src/extract.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"871dd1e03ca9a96aaa134f52e7f26413c308f53c0755cbc5e050ccf7e60a0962"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::chain_segments (cognitive 27): vcad_render::chain_segments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec9c302334431bd2f64aa5f5820240551c74208c71add89c0f347eb079347f5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::slice::chain_segments (cognitive 27): vcad_slicer::slice::chain_segments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (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":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee56df42b559c38123c637354a8c443e3ea4553a1d1a7ba09792b75c3c3a14d5"}},{"ruleId":"D2","level":"warning","message":{"text":"FeaSection.body (cognitive 27): FeaSection.body has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 10 (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":"apple/VcadApp/Sources/VcadApp/AnalysisPanel.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"241e14f283159661c24efbe2a0e931d2e090b8ec600c4352ca55bf3385afb6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.placedSpurGear (cognitive 27): EditorModel.placedSpurGear has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 26 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":"apple/VcadApp/Sources/VcadApp/Gears.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"404b9bc075d186763c471945b124ad17c6b21276e73743f7e2e30301a4f4c357"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldHud.body (cognitive 27): FieldHud.body has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 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":"apple/VcadApp/Sources/VcadApp/FieldOverlay.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"867a5accb396d1fb1674f2f64a122cbed200d454bd0609e480b7ba746cd89e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureRowView.menu (cognitive 27): FeatureRowView.menu has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6 (12 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"599399d6112c694b09e44fc5411ca998c6819ff03d986079ee888e40b1a3bd77"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchConstraintPanel.body (cognitive 27): SketchConstraintPanel.body has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 5 (12 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":"apple/VcadApp/Sources/VcadApp/SketchViews.swift"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bff89ea19cb19e1f553dc9d2d3bef8eba48fbc481bcad0b6412026261afc5a"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundPanel.swift.syncSoundOverlay (cognitive 27): SoundPanel.swift.syncSoundOverlay has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, loops 5, ternaries 2 (3 pts) (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 10 belong to 2 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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d98e29f2beaf8abd1f520642978a19179ef1a270db68e75d88a3500fec85ca"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureRowView.menu (cognitive 27): FeatureRowView.menu has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6 (12 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b5829a00ee473033665ded00696bd077e18f386b886812707346e90a9cc5f8"}},{"ruleId":"D2","level":"warning","message":{"text":"launch-animatic.html.chrome (cognitive 27): launch-animatic.html.chrome has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (9 pts), boolean chains 5, loops 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 11 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":"docs/launch/launch-animatic.html"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99f0f64e2f441a4f207464a2ee9faa6965df06554de7b9519a117fd96d73f17"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.describePcb (cognitive 27): ecad.describePcb has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 16 (17 pts), boolean chains 4, loops 4, if/else 2 (nesting depth added 1). 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: 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9209}}}],"partialFingerprints":{"codehealthFindingId/v1":"144dc3e415822fa06080f50267797797b275bd727cd103e152fc3da00fd9f170"}},{"ruleId":"D2","level":"warning","message":{"text":"dressBoard (cognitive 27): dressBoard has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (13 pts), loops 6 (10 pts), boolean chains 2, if/else 2 (nesting depth added 11). None of this is in the body itself: all 27 points belong to 2 function items inside it that branch (a function literal at line 600, (anonymous)::mat). 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":"www/public/kit/gallery.js"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aa25dd04e0b1ee58d01089112bb309598f3ebb2b844b3a925141fbd63e041d"}},{"ruleId":"D2","level":"warning","message":{"text":"dressBoard (cognitive 27): dressBoard has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (13 pts), loops 6 (10 pts), boolean chains 2, if/else 2 (nesting depth added 11). None of this is in the body itself: all 27 points belong to 2 function items inside it that branch (a function literal at line 427, (anonymous)::mat). 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":"packages/app/public/launch/launch.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c84548daa7a16d530ccba724960377b39a85b571d3ac967eb820824df8705a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::toolbar::render_sub_tools_flush (cognitive 26): vcad::ui::toolbar::render_sub_tools_flush has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (5 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":"crates/vcad-cli/src/ui/toolbar.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0835dc7131fbcb6f4c8f8a1da58ed4ba16232ba43111ded00243e1f20d5537"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_diff::merge (cognitive 26): vcad_diff::merge has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (11 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":"crates/vcad-diff/src/lib.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a0796f62652629076b838f4dc16e2e280fd3f084f2ebac433eb57fcc3ac7bb"}},{"ruleId":"D2","level":"warning","message":{"text":"PairProblem::build_pinned (cognitive 26): PairProblem::build_pinned has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2286b12b74a052fc0949a700a335f60b09ebb20b0ab7e3958d0b16359153ea1a"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowNet::mcmf (cognitive 26): FlowNet::mcmf has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 5 (10 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":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8783eddbef587d5be3090eb0efdc9f96508caf10b6cdc3549030e88eed5b3c17"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::escape_endpoint (cognitive 26): vcad_ecad_pcb::router::auto::escape_endpoint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3605}}}],"partialFingerprints":{"codehealthFindingId/v1":"061405a8293ddf374d0f4229b9a3ab01d079b432b5e5699a96f298716e42fcd0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::escape::detect_pin_fields (cognitive 26): vcad_ecad_pcb::router::escape::detect_pin_fields has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (8 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":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1ef518473d90bf4c1a9aefe3fd4ab7152c535e42b2ecff8048e21840f3275d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::funnel::funnel (cognitive 26): vcad_ecad_pcb::router::flow::funnel::funnel has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, 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":"crates/vcad-ecad-pcb/src/router/flow/funnel.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"208fcfa32fe372edab8444f19dc75563374fc262503f629ed6adbc19603b73bd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::sco::box_qp_newton (cognitive 26): vcad_ecad_pcb::router::sco::box_qp_newton has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 4 (9 pts), boolean chains 3 (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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"349b17eb208098efdcfc3163c6cc614bd3ddbda6d323e779b192177be61007c8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::ac::solve_dense_c (cognitive 26): vcad_ecad_sim::circuit::ac::solve_dense_c has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (11 pts) (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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9be8941ffce6503a97a305030b408aef0922b55f070eb9f4ee3b4f5a92e25f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::dc::operating_point (cognitive 26): vcad_ecad_sim::circuit::dc::operating_point has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5 (10 pts), match/switch 1 (2 pts) (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":"crates/vcad-ecad-sim/src/circuit/dc.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dded15415466224dea3762c824d7e972590251f4d30b00a3ca5353906f1f5293"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::circuit::linalg::solve_dense (cognitive 26): vcad_ecad_sim::circuit::linalg::solve_dense has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (11 pts) (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":"crates/vcad-ecad-sim/src/circuit/linalg.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"250a9f4aeea2ccbf8df9eda07504e3076fa9134b791ae2ebec739845e2fe1266"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_embroidery_pes::pec::decode_stitch_delta (cognitive 26): vcad_embroidery_pes::pec::decode_stitch_delta has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20 (26 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":"crates/vcad-embroidery-pes/src/pec.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0054d06096371ad4d9416418d8b7bf815c8664a2872e3236f9b113d69c61f405"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::step_doc::step_assembly_document (cognitive 26): vcad_eval::step_doc::step_assembly_document has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (3 pts), boolean chains 2, loops 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":"crates/vcad-eval/src/step_doc.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6912b3cbd4a1e772d9f1d0ac447a4404292fe981465f480161f21313b64ee3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::clearance::check (cognitive 26): vcad_ffi::clearance::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 2 (4 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":"crates/vcad-ffi/src/clearance.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e1df160b87db8fc2f43f23e5f22bd34a50ec5a76c17810b8685cd5ff5d6614"}},{"ruleId":"D2","level":"warning","message":{"text":"Solid::fillet_reported (cognitive 26): Solid::fillet_reported has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (4 pts), match/switch 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"90acf52c9d3bac7ce53000d9ba9698a152c179049a93fdbbbc07b0c2728040b2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel::sheet_fold::folded_sheet_solid (cognitive 26): vcad_kernel::sheet_fold::folded_sheet_solid has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 6, 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":"crates/vcad-kernel/src/sheet_fold.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f4f57a6725c8c99534f9ce4b4db9c0b14b4cd6b74decce8b04652d8d63d832"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh::build (cognitive 26): Mesh::build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (8 pts), match/switch 2 (5 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":"crates/vcad-kernel-antenna/src/geometry.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28777f6a44157b7bf4cc8efd4690c01c24b0354823973133a2af877bc3c18b5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::freeze::pair_cylinder_rims_with_planes (cognitive 26): vcad_kernel_booleans::freeze::pair_cylinder_rims_with_planes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (10 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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"50eec0cdd51e23b42f1db1c78cf13cd4cd392bf0f365ba718a0b05c02b78c233"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::mesh::csg::fill_small_holes (cognitive 26): vcad_kernel_booleans::mesh::csg::fill_small_holes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (10 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17093eda122c2a125543641968fa988669eaae7e96860159011e9eeeeea21f1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::split_thin_face_at_curve_vertices (cognitive 26): vcad_kernel_booleans::split::split_thin_face_at_curve_vertices has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 4, 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, 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":7137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f025ec36d20d94d63a05da8ee93bb9f27f09d7ce18ac563230ee432e1366c4b"}},{"ruleId":"D2","level":"warning","message":{"text":"LinearDimension::render (cognitive 26): LinearDimension::render has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 8 (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":"crates/vcad-kernel-drafting/src/dimension/linear.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a13896407b2dae6c7a482298e99c262ca506d88af4928d49a9cf013fb7442"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_enclosure::pcb::mounting_holes_from_pcb (cognitive 26): vcad_kernel_enclosure::pcb::mounting_holes_from_pcb has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (3 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":"crates/vcad-kernel-enclosure/src/pcb.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"940d749c75761d815e79cb7dd55b2b9da2aad0df121f1cfad18e50d104f21674"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::revolved::blend_corners (cognitive 26): vcad_kernel_fillet::revolved::blend_corners has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (5 pts), loops 3, 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"2645243c60d90760a3831f6a7e9c2b1e5254a69935af0c1c4eba838f5744b2b4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_gpu::wavefront_batch::distance_fields_batch_async (cognitive 26): vcad_kernel_gpu::wavefront_batch::distance_fields_batch_async has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (8 pts), boolean chains 2, 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":"crates/vcad-kernel-gpu/src/wavefront_batch.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8f49bcb885a3fe52c64ac4eefb521446b6f7d4668eebb2718091d94e40de35"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::sphere_boundary_with_neighbors (cognitive 26): vcad_kernel_tessellate::sphere_boundary_with_neighbors has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (6 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c54d757acac2358ae4b4c6959a464307143735fd7b771c7a8b61ff1e639fae0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::fastener::plan (cognitive 26): vcad_loon::fastener::plan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 3 (4 pts), boolean chains 3, 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":"crates/vcad-loon/src/fastener.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9d0fbef217a21c75e68864fd40e28f5878230fc49db80ace853e77170e6675"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::run (cognitive 26): vcad_render::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, match/switch 2 (4 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":"crates/vcad-render/src/main.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8ad18d68473e8245ecaa2f5d43a5c659b24a5adffa9adfed904bf57bc62920"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::holes::find_z_holes (cognitive 26): mecheval_grader::holes::find_z_holes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (23 pts), 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":"mecheval/graders/src/holes.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d146a1dbad08937c84c1395629bc007373794b5bc6544ff43ed99274ca98c7"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.promoteSandboxToDocument (cognitive 26): EditorModel.promoteSandboxToDocument has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, match/switch 2 (5 pts), error handling 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"de072b78bf432170cee43148f2db1b56211adb0326510a5ab5921e111a1ae47c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.measurement (cognitive 26): EditorModel.measurement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, ternaries 3 (6 pts), match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to one function item inside it that branches (describe). 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":"apple/VcadApp/Sources/VcadApp/Measure.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca88794d39ad663e134b11227210d097b522852d808ab013ff30cae28abca109"}},{"ruleId":"D2","level":"warning","message":{"text":"build.taskPage (cognitive 26): build.taskPage has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 14 (17 pts), boolean chains 6, if/else 3 (nesting depth added 3). 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: 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af2d53ec2a81b6578db2237c38b5914a66c5aea4d27d89a6b2807e2cd64bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"launch.creaseGeometry (cognitive 26): launch.creaseGeometry has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (6 pts), ternaries 4 (6 pts), boolean chains 1 (nesting depth added 11). Of this number, 25 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":"packages/app/public/launch/launch.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2305d24681377640a1d031a656384951c8b4f69a4a79382aa508bcd1b854a4"}},{"ruleId":"D2","level":"warning","message":{"text":"CamPanel.CamPanel (cognitive 26): CamPanel.CamPanel has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (6 pts), ternaries 5 (6 pts), match/switch 1 (2 pts), error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 11 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 59, 237). 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8567aa5c14dff60469316a907db2059a27558d28f1371a240c8fd4e6f35cb1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"circuit-analysis.computeMapOptions (cognitive 26): circuit-analysis.computeMapOptions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (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":"packages/app/src/lib/circuit-analysis.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9b21539d05b60332876a8612e2968bdb95c8944baf3ceb1286851d2c3d2adf"}},{"ruleId":"D2","level":"warning","message":{"text":"compressed-field.buildSkin (cognitive 26): compressed-field.buildSkin has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 2 (9 pts), boolean chains 1 (nesting depth added 17). Of this number, 25 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":"packages/app/src/lib/compressed-field.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7efccaa955f5724ee68d1b731e4e453765f63530aaedbd9279b373b3824e7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"slicer-worker.onmessage (cognitive 26): slicer-worker.onmessage has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 6 (10 pts), error handling 2 (3 pts), boolean chains 1, 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":"packages/app/src/lib/slicer-worker.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4126561287e4ea3c0fa2d161f328f062d9cb036ddebbbe5d9f08a45705b21845"}},{"ruleId":"D2","level":"warning","message":{"text":"clearance.computeGroupClearance (cognitive 26): clearance.computeGroupClearance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, ternaries 4 (6 pts), error handling 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b72d18c5c2f08cf17dd6e50311276f077065de64069d8e5b5f1cc4260bc5f67"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.aggregateDrc (cognitive 26): ecad.aggregateDrc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (6 pts), boolean chains 5 (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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4630}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e94a044e501b01376c4014e6d9960e82a0fc0fd93b879aca53cafe512f0c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.summarizePlacementDrc (cognitive 26): ecad.summarizePlacementDrc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 4 (5 pts), ternaries 2 (3 pts) (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 5 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5586}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b05db1e07358755f9669d59db7d68f9e6afb8de6e4fe2da204254a864d9acd"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addCoilArray (cognitive 26): ecad.addCoilArray has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 8 (9 pts), boolean chains 6, loops 1 (nesting depth added 3). Of this number, 21 points are the body\u0027s own statements and 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8098}}}],"partialFingerprints":{"codehealthFindingId/v1":"687732a1905199f689e6435151d042adaa9ef04c7509989f2e0fca5a3524519b"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.windingLayout (cognitive 26): ecad.windingLayout has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 8 (9 pts), boolean chains 3, loops 2 (nesting depth added 2). Of this number, 25 points are the body\u0027s own statements and 1 belongs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f960fb4c38f6d63d48557a9f4efbc1de5919ddb73cc3d35de87a20f459b69547"}},{"ruleId":"D2","level":"warning","message":{"text":"gallery.creaseGeometry (cognitive 26): gallery.creaseGeometry has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (6 pts), ternaries 4 (6 pts), boolean chains 1 (nesting depth added 11). Of this number, 25 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":"www/public/kit/gallery.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc669b4a97d53c26afccdaf5178872f8c331815ae02d15737c0773b19ab707f5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::verdict::route_remaining (cognitive 25): vcad_ecad_fabprep::verdict::route_remaining has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), match/switch 2 (4 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9d5ef0dc370b6520f22487ba1e8d93ebc4f48df2214fa4e9909f440f913fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_board::place_designators (cognitive 25): vcad_ecad_symbols::kicad_board::place_designators has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 2 (3 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c258dd7edb52a5670b9637efba2ccc26b751895f9a1554e019cfb9f619ae20"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_embroidery_dst::reader::decode_record (cognitive 25): vcad_embroidery_dst::reader::decode_record has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, boolean chains 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":"crates/vcad-embroidery-dst/src/reader.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c0381cebdf42e904fa0a382d7a00eaed21749d62a77956951358f8d6262207"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::vcode::split_line_respecting_quotes (cognitive 25): vcad_ir::vcode::split_line_respecting_quotes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (9 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32b911d39befa2db6eb1b094376d3889db28047a965f4c2fd8218c13a6cad46"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::strike::jacobi_eigenvalues (cognitive 25): vcad_kernel_acoustics::strike::jacobi_eigenvalues has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 2 (6 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":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2540d67574f56c68f4780c4700a0dad38a5e34d79786066ea6f3a4bdadb779eb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_antenna::nanovna::parse_s1p (cognitive 25): vcad_kernel_antenna::nanovna::parse_s1p has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (8 pts), boolean chains 1, 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":"crates/vcad-kernel-antenna/src/nanovna.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19f5fbbf3b5968ce2003fe1489960de084ca46f1b2e6594e326ce7c3e78647a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::merge_collinear_line_splits (cognitive 25): vcad_kernel_booleans::pipeline::merge_collinear_line_splits has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4564aaf4f75213393eba03d5b7f2614c62c559e982e2ff71400be8b03a04c9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::repair::weld_boundary_vertices (cognitive 25): vcad_kernel_booleans::repair::weld_boundary_vertices has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (8 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":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e264536a3f9a0bf1bcaa94c449643a2d4bd88df3090201b4c92445e3d24980a"}},{"ruleId":"D2","level":"warning","message":{"text":"Pocket2D::generate (cognitive 25): Pocket2D::generate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 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":"crates/vcad-kernel-cam/src/operation/pocket.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82b7fb37c6bed69f426348372b0398029c866cca40c3816b6e3be82b7fe271b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::section::chain_segments (cognitive 25): vcad_kernel_drafting::section::chain_segments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 4 (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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3575eaaaf31366b903389ba677eb961717cf5b6973ad3a3fc15672d0b89d37e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_curved::snap_trims_at_junctions (cognitive 25): vcad_kernel_fillet::fillet_curved::snap_trims_at_junctions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (8 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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c52523cd4f44cb366c2bb2d92ea6f7b51e974dea7602f376c08b4e0877ab30"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowModel::inlet_net_flux_m3_s (cognitive 25): FlowModel::inlet_net_flux_m3_s has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 4 (10 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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fe8910b3e27093fc19933091d392835da6a2171d72d9b9e9ae33eddde7dabb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_gpu::decimate::cpu_decimate (cognitive 25): vcad_kernel_gpu::decimate::cpu_decimate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (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":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bd466b33a92efe2339e7e8c0cd07d240879cfbe159bfcd9230b32f560720da"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_naming::propagate_from (cognitive 25): vcad_kernel_naming::propagate_from has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 7 (10 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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"114a85bb822ec6d90c09e97017fb53fbc181a8d34ecbb52dfdd5ce0f8edc367a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::weld (cognitive 25): vcad_kernel_sheet::flatten::weld has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 5 (11 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac80a19dbc903e6c0c1d8ec7e59d7c5db92ee2641687c4e5577b94b401ad4eed"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_stocksim::verify::verify_stock_against_mesh (cognitive 25): vcad_kernel_stocksim::verify::verify_stock_against_mesh has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (7 pts), boolean chains 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":"crates/vcad-kernel-stocksim/src/verify.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"846b66f28711f4e2a841d55352770edfc4d7daa066055013a706894dfb614e22"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::receipt::predicted_claims (cognitive 25): vcad_kernel_thermal::receipt::predicted_claims has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 3, 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":"crates/vcad-kernel-thermal/src/receipt.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"11141a3897d43dbd3918201ca45d48392a46296c26269b59c97915bb19475f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::animate::plan_animation (cognitive 25): vcad_render::animate::plan_animation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (5 pts), match/switch 2 (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":"crates/vcad-render/src/animate.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c85ac03c2597baf127b68da0cf404cbaf60b24c156b9d0be998be13de269b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::callouts::plan (cognitive 25): vcad_render::callouts::plan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 pts), match/switch 1 (2 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":"crates/vcad-render/src/callouts.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a492ffa942ac6f98197429292c740889d6203236ec24ed12198549c435cd3917"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::raster::draw_edge (cognitive 25): vcad_render::raster::draw_edge has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6b1633adef41d0ea6a2f30a358b2e051ee7fabbeba14a0115e097b003ff09a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::perimeter::generate_perimeters (cognitive 25): vcad_slicer::perimeter::generate_perimeters has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 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":"crates/vcad-slicer/src/perimeter.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6200adc105a00259077da780cccf13264f4837f5d66d1632137f28339e050ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"make_figures.fig_rd_grid (cognitive 25): make_figures.fig_rd_grid has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 3 (9 pts), loops 4 (5 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":"docs/compression-math-survey/paper-draft-figures/make_figures.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cc12b06337ab2fb8a9f0fea2a5485ee742b51d5065e1fa6e8217d09ecdca55"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepLink.init (cognitive 25): DeepLink.init has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, loops 1, ternaries 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":"apple/VcadApp/Sources/VcadApp/AppInstance.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8b9be2349d5f911e167289b0a18291d8e1700e7317feba5312e2d076e41d61"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCMachineBar.jobStatus (cognitive 25): CNCMachineBar.jobStatus has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 11 (22 pts), if/else 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":"apple/VcadApp/Sources/VcadApp/CNCMachineBar.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae448091b19aef0674f40ae7561e820a3778550e02f1997774f920f32922d13"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.beginStepImport (cognitive 25): EditorModel.beginStepImport has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2c165bed8087756f49c725b138cc99e524ee2600fb57461d4307ff564ef55d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.cubeFaceKind (cognitive 25): EditorModel.cubeFaceKind has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb6062614293b03ee980d821b1dedf39d85c64eb49072b578661d6395be9467"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.adoptRuntimeFrame (cognitive 25): EditorModel.adoptRuntimeFrame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/DocumentRuntime.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"410f9badc1b3c43a2c6bf99f1cdebc65e983888cecdbb2b06815a128ffc3a965"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.explodedTransforms (cognitive 25): EditorModel.explodedTransforms has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (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":"apple/VcadApp/Sources/VcadApp/PoseStudio.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f035bc2fc1924166c8cc1d21cbcd4c47914213dfc473f84ea4b12f54e68b875"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureRowView.row (cognitive 25): FeatureRowView.row has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, ternaries 8 (11 pts), 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, 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bbd1b9b9241ef4ed624ffd3d68c8e06a83d47bb2a3703fd4b3c2ca8cd18bea"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.beginStepImport (cognitive 25): EditorModel.beginStepImport has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f273cfec016e4096000560a44d93d83ed9e2074929edefb32773f465c76f773"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureRowView.row (cognitive 25): FeatureRowView.row has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, ternaries 8 (11 pts), 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, 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":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fd306bc897e8d30fdf4c8ca20e3763396cf533a69ae90b6b14615694c0a60d"}},{"ruleId":"D2","level":"warning","message":{"text":"matrix-cli.main::worker (cognitive 25): matrix-cli.main::worker has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (5 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. This shape REPEATS in the file: one other method here (matrix-cli.main) 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":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2292e066d9c7d5efc2bb426112a5926ca6cb8a6ff87c1d5dec205b77c26664ef"}},{"ruleId":"D2","level":"warning","message":{"text":"RaytraceChip.RaytraceChip (cognitive 25): RaytraceChip.RaytraceChip has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 15 (19 pts), boolean chains 4, if/else 2 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 4 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":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc65807f1d75f36f4acc56c7b7d1cfa201df42d4ed4747bfd0e8f5b9e17fb8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"useBackgroundLuminance.useBackgroundLuminance (cognitive 25): useBackgroundLuminance.useBackgroundLuminance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 8). None of this is in the body itself: all 25 points belong to 4 function literals inside it that branch (lines 17, 90, 116, \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":"packages/app/src/hooks/useBackgroundLuminance.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c79ee37f361ac782eee7be328f05687a495abcd006a9ed8a4a26b8872845437"}},{"ruleId":"D2","level":"warning","message":{"text":"executors.tryExecuteViaEngine (cognitive 25): executors.tryExecuteViaEngine has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 6 (7 pts), boolean chains 4 (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":"packages/core/src/commands/executors.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"db861bce7450abf186512549f79d869664f8051513b870aa3edb244be978c454"}},{"ruleId":"D2","level":"warning","message":{"text":"trust-boundary.checkCommerceBoundary (cognitive 25): trust-boundary.checkCommerceBoundary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, 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":"packages/mcp/src/trust-boundary.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff96d0ba70c9066f3d0d442068d63cab59a23ab4c1b2b4227f6f09896d06f262"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.exportGerber (cognitive 25): ecad.exportGerber has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 8 (10 pts), error handling 1 (2 pts), loops 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cdd42edb2ca0428ea15d5c8490944af67586a334b98e46363b8437fee564fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.projectionGrid (cognitive 25): ecad.projectionGrid has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13627}}}],"partialFingerprints":{"codehealthFindingId/v1":"6091dd9a82eb9619a46aa7ac1094a58da9af214f59105795c5c81b6ef6972b45"}},{"ruleId":"D2","level":"warning","message":{"text":"record.resolveActions (cognitive 25): record.resolveActions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (4 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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c5888fd7f8de3e37a67d323216df44d07c21a22765ba76f0573a641691acda"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::materializer::materialize (cognitive 24): vcad_app::materializer::materialize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), boolean chains 2, 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"578d741d82e9e3347a0c9dc9e5ed99c70a879af0d8ee9a0870f30771cdf0bd43"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::status::draw_cursor_segment (cognitive 24): vcad::ui::status::draw_cursor_segment has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts), match/switch 2 (4 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":"crates/vcad-cli/src/ui/status.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c102476786c447f6dd0e0e9c40fccefa2dbebc2cf6749228c69808a24dd569ab"}},{"ruleId":"D2","level":"warning","message":{"text":"RouteSession::from_pcb (cognitive 24): RouteSession::from_pcb has cognitive complexity 24 (threshold 15). Drivers by points: loops 11 (16 pts), if/else 4 (7 pts), boolean chains 1 (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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5bbf6bfe362795e26e7e36702205b9dfef31b5bc20a2767481ad75b09b022c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::shove::try_route_shove (cognitive 24): vcad_ecad_pcb::router::shove::try_route_shove has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (7 pts), match/switch 1 (3 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":"crates/vcad-ecad-pcb/src/router/shove.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b0197039a3a5baffd99942e33218e511c19068d2db7f07c0c8d73977cbb9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_board::board_from_sheet (cognitive 24): vcad_ecad_symbols::kicad_board::board_from_sheet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (9 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc184b4c805a6c03e4e66b5c724b1450392c4063cc94e7f4d5058aadd1748f1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::convert_pcb (cognitive 24): vcad_ecad_symbols::kicad_pcb::convert_pcb has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4, boolean chains 3 (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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"135349efa1ed45e25021bc03c31fbce4468f594bee8a087c4e860bc0228c371b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::wire_features (cognitive 24): vcad_eval::sim_extract::wire_features has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (8 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"803ac4dc8d9f1cd62bb8aebf7b84f505e96761d6e64ba2f2275549de03ccf0bf"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_gdsii::flatten::flatten_cell (cognitive 24): vcad_gdsii::flatten::flatten_cell has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (8 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":"crates/vcad-gdsii/src/flatten.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"014a2b29f45ac852512d65753e4a0f899421826b2da02b264123d946e103de70"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::optimize::maximize (cognitive 24): vcad_kernel_acoustics::optimize::maximize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba23d05f3f4bea8f0c937c2d8d0d3231a3e003d2101a8ac77e01f287ffd9447f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::classify::classify_face_indexed (cognitive 24): vcad_kernel_booleans::classify::classify_face_indexed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 1 (3 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"349e7a96b80987a0af44d7b8da5ff612924a03ae9a233b901adadf60fe949373"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::ssi::plane_cylinder (cognitive 24): vcad_kernel_booleans::ssi::plane_cylinder has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 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":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f12796f08b8de3950480294bb7205bb6c6bdc95be21f4c37a6452fe60fee02"}},{"ruleId":"D2","level":"warning","message":{"text":"Envelope::below (cognitive 24): Envelope::below has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), match/switch 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":"crates/vcad-kernel-cam/src/turning/envelope.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8152b16d606a6a074fa2e0e67cd149ab806fe141c743420cae6fe3bf9066c7d2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::lift::lift_surface_second (cognitive 24): vcad_kernel_diff::lift::lift_surface_second has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 15 (20 pts), loops 2 (4 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":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3931687a658d5b35f4e3fde8df921134a4a647195f657886d15cbb74444c431"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellCase::validate (cognitive 24): ShellCase::validate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 8, 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":"crates/vcad-kernel-fea/src/shell.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc5adc9bc01a220ecab42f600d3a786b0b10cdaadc7aca4815fd152aee95f09"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::buckling::element (cognitive 24): vcad_kernel_fea::buckling::element has cognitive complexity 24 (threshold 15). Drivers by points: loops 12 (24 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6f09dad42afcd155dd66c15f6338d7c38f12f95fb39b304fd02ab5d69b2606"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_naming::resolve_edge (cognitive 24): vcad_kernel_naming::resolve_edge has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (5 pts), boolean chains 4, 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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef10c467325ed485b94e21895beb6542800da70f01fe189660a009bc58469cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Material::from_constituents (cognitive 24): Material::from_constituents has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (7 pts), match/switch 1 (4 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":"crates/vcad-kernel-neutronics/src/materials.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16aa059c7742381214ef2bf3ed4cf42fdb291c7693839f350a70359a0f5a1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::optimize::maximize (cognitive 24): vcad_kernel_particle::optimize::maximize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 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":"crates/vcad-kernel-particle/src/optimize.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfff956720fb703b9c52285ff2c47d709f6c6c45699a82e7296bd2ef01392e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::space_charge::solve_grounded_source (cognitive 24): vcad_kernel_particle::space_charge::solve_grounded_source has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 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":"crates/vcad-kernel-particle/src/space_charge.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d30b5dbf460e07a2a0d374120510871970344ad4729c7d9b7924b9a7ba7494"}},{"ruleId":"D2","level":"warning","message":{"text":"FluxTubeAccumulator::measure (cognitive 24): FluxTubeAccumulator::measure has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (24 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":"crates/vcad-kernel-qcd/src/fields.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c10b1cda330b4c96e8b3cd7630a4dfefc390c3d99800c207ec263c784b8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_raytrace::intersect::cone::intersect_cone (cognitive 24): vcad_kernel_raytrace::intersect::cone::intersect_cone has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 1 (3 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":"crates/vcad-kernel-raytrace/src/intersect/cone.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"564740118dfb46931272f7cdd7ff9ae7de5426b596c8c9a08e360e0fba78be67"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::cluster_planes (cognitive 24): vcad_kernel_sheet::flatten::cluster_planes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (10 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dfc2ec038c0556d0f503e35d0d0dce0d1c9826726caf929c103648f5937e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::reconstruct::validate_loop_consecutiveness (cognitive 24): vcad_kernel_step::reconstruct::validate_loop_consecutiveness has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (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":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0797a07c2458e85419aa58368a574999015afe1aa5bb0e38eea1aa39079f0c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"TriangleMesh::edge_segments (cognitive 24): TriangleMesh::edge_segments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (5 pts), boolean chains 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e6b7b43d53a7fb85f14dfb2857fac12346a0177c3975b7bc8bbc7d04c37f18"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::bowyer_watson_2d (cognitive 24): vcad_kernel_tessellate::bowyer_watson_2d has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 5 (10 pts), boolean chains 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0827aed5c5cc32fc02ddac15f3aa7fd5531d575a0394f68a4d2707ee7b8ef03"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_brep_with (cognitive 24): vcad_kernel_tessellate::tessellate_brep_with has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (9 pts), boolean chains 2, 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f35c8d7754967331d59101cefc2d29d3e0aaf2605f09cd07efd0663599d69ce"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::scene_to_js (cognitive 24): vcad_kernel_wasm::scene_to_js has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":7617}}}],"partialFingerprints":{"codehealthFindingId/v1":"004ae3ebebf55428b75cc69572839759e6201a8431e6beb06fd1bd31853a6a70"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::raster::fill_triangle (cognitive 24): vcad_render::raster::fill_triangle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4677}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecc038ab6ff87cb84b37ba72070b59692a97cc5e70029243b7cf222d2abdff8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_sound::to_render_vertices (cognitive 24): vcad_sound::to_render_vertices has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 3 (8 pts) (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":"crates/vcad-sound/src/lib.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a87a27dc15bfe76f07a84df2224784cd1e197f296b6a352a90cb434d75058f"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::suite_c::check_task_success (cognitive 24): mecheval_grader::suite_c::check_task_success has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 5, 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":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09ace7eafb0458ec76f8ceeccbe45e9bf1d4700ba04012e75911717a641ab09"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintWorkbench.orientStep (cognitive 24): PrintWorkbench.orientStep has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 8 (10 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":"apple/VcadApp/Sources/VcadApp/PrintWorkbench.swift"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f2a052dae94024d618de13aef0bd88caa0b676b333581a30ebdb793ffff456"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedARView.updateNSView (cognitive 24): ReleasedARView.updateNSView has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de94af83d5cf4a9539a31ab2feb7927a6074bd9c8402c48bc6641a400eb1013"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCommands.body (cognitive 24): DocumentCommands.body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 5 (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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a376f38748a372f5ba11677a92722cd6ab8bd1cc234ec0da07e8a7b819a296d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCommands.body (cognitive 24): DocumentCommands.body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 5 (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":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6944a93fc8a722131bc58b3b608deedde8f677c332c222147c99aba4c15973d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawingToolbar.DrawingToolbar (cognitive 24): DrawingToolbar.DrawingToolbar has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, ternaries 9, if/else 5, error handling 1. Of this number, 18 points are the body\u0027s own statements and 6 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8f30b5ea3560050698862065b6943c62db64e11d99f642fac16c67722f2e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm.debugString (cognitive 24): vcad_kernel_wasm.debugString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":11400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4e38bf24b0dc5792019152da02fc92fb2e71e74f4d4bafef5034235de70ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"receipt-unified.unifiedFromPcbReceipt (cognitive 24): receipt-unified.unifiedFromPcbReceipt has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (17 pts), loops 3 (4 pts), if/else 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":"packages/mcp/src/receipt-unified.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"64919479459e3ad42352d54e3f611f494cef15378bc313db0911785314b41422"}},{"ruleId":"D2","level":"warning","message":{"text":"print-check.recordMeasurement (cognitive 24): print-check.recordMeasurement has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 2 (3 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/print-check.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ae04ed2cb4f9a035e4e94e497ca9184681e799ce06038256a01791f8aacca7"}},{"ruleId":"D2","level":"warning","message":{"text":"constraint-claims.verifyConstraintClaims (cognitive 24): constraint-claims.verifyConstraintClaims has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 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":"packages/mcp/src/tools/constraint-claims.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2ad0f95d41819a575fa0a846ae40f2bc6753446bd90f7d42155cabd1454126"}},{"ruleId":"D2","level":"warning","message":{"text":"design-constraints.validateAnchors (cognitive 24): design-constraints.validateAnchors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, loops 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":"packages/mcp/src/tools/design-constraints.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c9e4a3b73daf103726a5be8d1f96ab1e3d3257177040424c617353b561990"}},{"ruleId":"D2","level":"warning","message":{"text":"acoustics.simulateStrike (cognitive 24): acoustics.simulateStrike has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, loops 1 (2 pts), ternaries 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":"packages/mcp/src/tools/acoustics.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b53137a4bd211ab734d173a3536ee6d82311c2c404ee7217301d2bc4ae8223e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::restore_layer_change_vias (cognitive 23): vcad::restore_layer_change_vias has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (9 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4818}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d6cfd8467fa6e811c630cc6491ce40535d79a4e371d8074e393a19d490524b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::menu::draw_open_menu (cognitive 23): vcad::ui::menu::draw_open_menu has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 5 (8 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/ui/menu.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f4cf5db3f0303911df03ecd477d654436ea70eca13e923da0c4b904d18c4b2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::calibrate::tightest_pad_hole_gap (cognitive 23): vcad_ecad_fabprep::calibrate::tightest_pad_hole_gap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 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":"crates/vcad-ecad-fabprep/src/calibrate.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd8ea7b3b9f6286d5b39d81f4df8692cd425ddd611414270f3466d29f28cba1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_via_in_pad (cognitive 23): vcad_ecad_pcb::dfm::check_via_in_pad has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85409eaaea6f6e2d07bd424253d4915dc992aa2f1a440e94f83c1107fc35e82"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::check_min_drill (cognitive 23): vcad_ecad_pcb::drc::check_min_drill has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"880799eb75cbec495e706995837e46dfd6d71ff747c31ee7b49916c8c62473f5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::ratsnest::mst_edges (cognitive 23): vcad_ecad_pcb::ratsnest::mst_edges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (6 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":"crates/vcad-ecad-pcb/src/ratsnest.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4868556ebbeac2739c0510a2bc9f7aacb37a801775d9e7e1aa8e54b294c8668d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::search_route (cognitive 23): vcad_ecad_pcb::router::auto::search_route has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eab1fcec47dab573ca924e130eb0da4521dc541243c22fb9f09b32553e4964"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::to_component (cognitive 23): vcad_ecad_pcb::router::auto::to_component has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 11). Of this number, 22 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3158}}}],"partialFingerprints":{"codehealthFindingId/v1":"412417cbdb883ed0dde04a593e0167aaf8ed3f31f55bb424bb33b7272b031da7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::gpu_negotiate_rounds (cognitive 23): vcad_ecad_pcb::router::auto::gpu_negotiate_rounds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 pts), match/switch 1 (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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":7252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d55281d5cce40ffc44afb3e1a3843780d0d77c1507d9fa60690bb625506503d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::teardrop::generate_teardrops (cognitive 23): vcad_ecad_pcb::teardrop::generate_teardrops has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (7 pts), boolean chains 1, 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":"crates/vcad-ecad-pcb/src/teardrop.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"831af5c5c746fb542d22de47efcc278a202ba4afd35ad619f8dfb67e87100662"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::order_outline_points (cognitive 23): vcad_ecad_symbols::kicad_pcb::order_outline_points has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2377ebaa55adc918b41171c3f1747603f41ed1bd38c66dddce02f50c274882"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_sch::reconstruct_nets (cognitive 23): vcad_ecad_symbols::kicad_sch::reconstruct_nets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 7 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). Of this number, 22 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":"crates/vcad-ecad-symbols/src/kicad_sch.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f5e3c52030d96aec79ce92e2d81d591c0e8f5376216147c6ded381b475bec0"}},{"ruleId":"D2","level":"warning","message":{"text":"Problem::new (cognitive 23): Problem::new has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4, boolean chains 2, match/switch 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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"269254529ebe7ed6f53d91aaa97f4f62d41c9339e0facd4066c5937c6631bf5c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::cavity_extract::measure (cognitive 23): vcad_eval::cavity_extract::measure has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 1 (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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0ea6d80767c013cfd6e472cc08343fc6f4bbe3355432756e09bb011e838bde"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::thermal_extract::voxelize_part (cognitive 23): vcad_eval::thermal_extract::voxelize_part has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (21 pts), boolean chains 1, if/else 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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d9ff1e69389e0c1b1b9811f9fc47b3c826e5ac5964c2457fc320eea4b20401"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::build (cognitive 23): Builder::build 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). 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":"crates/vcad-ffi/src/features.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29a31a04bee7837d94ecec6566caa63f4ea283bbe05a41fd9ce5ef55afad41"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::train::run_training (cognitive 23): vcad_ffi::train::run_training has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"940d43e28990a2a6acf6b3eb55f26773b5f512b8855b3db29d903c53ef01bad2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_antenna::receipt::predicted_claims (cognitive 23): vcad_kernel_antenna::receipt::predicted_claims has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 pts), boolean chains 4, 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":"crates/vcad-kernel-antenna/src/receipt.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"00994f0a3352d258f93171d8f47145e118788081978977b42c52beea2ce87a18"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::api::max_open_edge_gap (cognitive 23): vcad_kernel_booleans::api::max_open_edge_gap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (6 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f1fe9747691d28bab3247d5ce90c46dd53bf2e31c9edf7634b1d7362f1e115"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::api::difference_left_tool_material (cognitive 23): vcad_kernel_booleans::api::difference_left_tool_material has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (9 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"447b60800ea36c1ba88bdaad48f686d13d3edded2425f0fe350f4b55574816be"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh::slice (cognitive 23): Mesh::slice has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c23b109bd7f9b9dcc873d23fecf87c61239396f083014e0651dfb6ebb26581"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::section::intersect_triangle_with_plane (cognitive 23): vcad_kernel_drafting::section::intersect_triangle_with_plane has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 11 (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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a418f8d54af1783083fce6f3f5dcf032ae430243a1ef6b5705e4d87b8b3654c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_enclosure::fit::check_connectors (cognitive 23): vcad_kernel_enclosure::fit::check_connectors has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 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":"crates/vcad-kernel-enclosure/src/fit.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3acf093eb8d282b09b3f3207cbd00756a066da5979b57fe238ab6ce2c2c8cc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::shell::check_shell (cognitive 23): vcad_kernel_fea::shell::check_shell has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 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":"crates/vcad-kernel-fea/src/shell.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffb283a01d87a4354040f2dbbd38cc2c56d7b5e8df42ec4770ee2d3480cf3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::blend_loft::apply_edge_blend (cognitive 23): vcad_kernel_fillet::blend_loft::apply_edge_blend has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 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":"crates/vcad-kernel-fillet/src/blend_loft.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016b59bd96b2b62e75a769126109db8c6beb5684247120b79c01699e3718436"}},{"ruleId":"D2","level":"warning","message":{"text":"WireField::evaluate (cognitive 23): WireField::evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 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":"crates/vcad-kernel-particle/src/bem.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eedc92ac9792d99bb9be3c42f3f565a7cf336e4b74c7e1e1bf3da0f1e946fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::adjoint::yield_gradient (cognitive 23): vcad_kernel_particle::adjoint::yield_gradient has cognitive complexity 23 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 2 (7 pts), match/switch 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/adjoint.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d4871bcce0fce083a8ac96f3ed7a3956e8fdcc0bd530f8a460bf9e0ffcd334"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_photonics::adjoint::objectives_and_gradients (cognitive 23): vcad_kernel_photonics::adjoint::objectives_and_gradients has cognitive complexity 23 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photonics/src/adjoint.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac39f87bb8656016440294c2d3113c9e1076bb22d3fc59b2fdcca5de894d887"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_photonics::optimize::maximize_split (cognitive 23): vcad_kernel_photonics::optimize::maximize_split has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 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":"crates/vcad-kernel-photonics/src/optimize.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8935d8bfbf47f21fc0f7934085fada3bbc6e3365342c13de188defb93007c2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::flatten::boundary_loops (cognitive 23): vcad_kernel_sheet::flatten::boundary_loops has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"590d92214b6e93557b20267b64b37b3040d03f6d2c059d4e0254ba66e75224c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchProfile::tessellate (cognitive 23): SketchProfile::tessellate has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 4 (9 pts), match/switch 1 (2 pts) (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":"crates/vcad-kernel-sketch/src/profile.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ba9e6a7ec65046fa2a5997cb14c5a775126ad3cda523063bf8238c015071a7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::end_ring_anchor_points (cognitive 23): vcad_kernel_tessellate::end_ring_anchor_points has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b6bbf87176277034a909d018a6fdd965aa9e060c657645c2cee59101a6c518"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::creased_normals::apply_creased_normals (cognitive 23): vcad_kernel_tessellate::creased_normals::apply_creased_normals has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 6 (9 pts), match/switch 1 (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":"crates/vcad-kernel-tessellate/src/creased_normals.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabbb87bd4a1f3fb509b554639460a8ba92ad897321fe98b00344e927d49a62c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::thermocouple::reduce_log (cognitive 23): vcad_kernel_thermal::thermocouple::reduce_log has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, match/switch 2 (3 pts), loops 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":"crates/vcad-kernel-thermal/src/thermocouple.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a6c9279bddc22b5c4c7bcfbd17aec97a70afe6cb27acb6897e5bda8c16b83f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::callouts::group (cognitive 23): vcad_render::callouts::group has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (10 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":"crates/vcad-render/src/callouts.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca656dc79622568d9bfb53ed07816aecdf36510a384fa39ea2500b14c9a6c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::fillets::find_non_z_cylinders (cognitive 23): mecheval_grader::fillets::find_non_z_cylinders has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 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":"mecheval/graders/src/fillets.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d961d332f492087bd551278dc4bf312b25333c8b070727d3c21c21180cfb90"}},{"ruleId":"D2","level":"warning","message":{"text":"distill.distill (cognitive 23): distill.distill has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts), ternaries 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":"packages/training/src/modal/distill.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0e0741331ffa8f353c9d9e27b235e5a72f8393639ce3d6823d723f5537c219"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigationScheme.action (cognitive 23): NavigationScheme.action has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (18 pts), boolean chains 2, if/else 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/NavigationScheme.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c3e8133d343bc74db678684d2da4e18c990aeced76fb3b258b16e0deb8454"}},{"ruleId":"D2","level":"warning","message":{"text":"DocTitle.DocTitle (cognitive 23): DocTitle.DocTitle has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), ternaries 5 (7 pts) (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 8 belong to 5 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4882d21863839a6c546b5689266e4a5ca2b896348b350567b35b2dec013722"}},{"ruleId":"D2","level":"warning","message":{"text":"sub-feature-picking.pickSubFeature (cognitive 23): sub-feature-picking.pickSubFeature has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 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":"packages/app/src/lib/sub-feature-picking.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"241949daba0b62a3cf7bc32ffb6c7d5f90820f74426f0edb291875693417e642"}},{"ruleId":"D2","level":"warning","message":{"text":"registry-dispatch.engineArgs (cognitive 23): registry-dispatch.engineArgs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dec8f1cd6a5e72f5966cdec84f1a86766e02f11d9050f7958130d49df6af7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.updateSchematic (cognitive 23): ecad.updateSchematic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Of this number, 20 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a724c7b2537bb1687f3b9e5342ef6cfb1cefa8d7b9b0971db22fb25209750e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderPcb (cognitive 23): render.renderPcb has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 8 (9 pts), boolean chains 3, error handling 1 (nesting depth added 2). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/render.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc12fb37fd5aea43f8af935ed5240855383939404143337627e23161fd80328"}},{"ruleId":"D2","level":"warning","message":{"text":"version-check.compareVersions (cognitive 23): version-check.compareVersions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2, ternaries 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":"packages/mcp/src/version-check.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d221eaf75bd57e2c8783dd7ea040f6c1e100712cc8ccbbca79c4729eab0ff76"}},{"ruleId":"D2","level":"warning","message":{"text":"crate-generator.generateTypeScriptLoader (cognitive 23): crate-generator.generateTypeScriptLoader has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (6 pts), loops 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":"packages/wasmosis/src/crate-generator.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74619a9911e4f1618d5e373c0aff9234c0befd28befcbf389eba0394d09d608"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_termview::rasterize::render_scene (cognitive 22): vcad_termview::rasterize::render_scene has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts), boolean chains 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":"crates/termview/src/rasterize.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff306c9050797873deafeec30634db23a9d1011a7b278b1e1fd239afe4160c6"}},{"ruleId":"D2","level":"warning","message":{"text":"KeybindingRegistry::load_overrides (cognitive 22): KeybindingRegistry::load_overrides has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 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":"crates/vcad-app/src/registry.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5df2c5f0415b5e711e357f4cfe794eab748de7c11c56023a74749cbe7f996fe"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_atoms::fab::gcode_envelope (cognitive 22): vcad_atoms::fab::gcode_envelope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), match/switch 2 (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":"crates/vcad-atoms/src/fab.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"75420553314adfd269ac4e20149da2513a0d7c4baca250c596cd8bb4d955a902"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::recognize_features (cognitive 22): vcad::recognize_features has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 pts), 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"046072cd149cbc79c96fff5d4e502b4f3eb6488ebdfc43d98851b45d06edccf4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::trim_leaf_copper (cognitive 22): vcad::trim_leaf_copper has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, loops 4 (6 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec5972b721708fa7bd97597b0978b0b501d5c931c456f0b4c55a94ea96bf444"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityMesh::assign (cognitive 22): CapacityMesh::assign has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 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":"crates/vcad-ecad-pcb/src/router/global.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f8ac07e65d4065a15f18fa78fcc4181d73c6bc7d8d27b9013fdea6ac472626"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_min_clearance (cognitive 22): vcad_ecad_pcb::dfm::check_min_clearance has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6919c9c778be3ed0baad346b22dfc4b3c79b814924ca7d73870af8ac24f84b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::parse_footprint (cognitive 22): vcad_ecad_symbols::kicad_pcb::parse_footprint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (6 pts), loops 5 (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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"997dae5fe9c2fef3e0c1aba35ec440ea9705b8366b3f0a2226c56a8d0e02dd1f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_embroidery_dst::writer::encode_record (cognitive 22): vcad_embroidery_dst::writer::encode_record has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21, match/switch 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":"crates/vcad-embroidery-dst/src/writer.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a336896b00f7956fb1673b1bdcbc020159c871e7b70d5ffb9ff297ee039a73c2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::cache::root_fingerprint (cognitive 22): vcad_eval::cache::root_fingerprint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (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":"crates/vcad-eval/src/cache.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd163327140d62c81f7deaa58240feb6193ee8fbe05aa6ad6312bf2d8ac17f3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::cam_job::simulate (cognitive 22): vcad_ffi::cam_job::simulate has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 4 (7 pts), 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":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf48a15db0e7f585e2e7677fd09eb14790f85c5d2f64ec4dea6a1c1b39992fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Lattice::cast (cognitive 22): Lattice::cast has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 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":"crates/vcad-kernel-assembly/src/joint_range.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6daa922b4b4ad41a00404c9059620816a7b771fb5b03798cdd33abdbcf3ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::mesh::csg::collapse_degenerate_triangles (cognitive 22): vcad_kernel_booleans::mesh::csg::collapse_degenerate_triangles has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d89fa1df9693af4603ba1851330f295cab96a317176f404b054556f79c6ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::insert_circle_tangent_vertices (cognitive 22): vcad_kernel_booleans::split::insert_circle_tangent_vertices has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af3be2d674ef6f39dd3b3335e135a169753787998e733b57acb7ff796c2f705"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::canonical_arc_points (cognitive 22): vcad_kernel_booleans::split::canonical_arc_points has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5904}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b909a0a10903658f3718496047735a965c131a310f40d88e8820d5128cb0dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Face::generate (cognitive 22): Face::generate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 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":"crates/vcad-kernel-cam/src/operation/face.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"83190dc13e7e57b8050d98dbcbd0f5d801f599ebbf557b99d36027f2fe1cdbb6"}},{"ruleId":"D2","level":"warning","message":{"text":"TurnPlanner::level_rough (cognitive 22): TurnPlanner::level_rough has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (8 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":"crates/vcad-kernel-cam/src/turning/ops.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ea3ed815ede7df8b26fad545bf5f86ae751afaf568550986ad104b2b1a9e58"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::mass::mass_properties (cognitive 22): vcad_kernel_diff::mass::mass_properties has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 4 (8 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":"crates/vcad-kernel-diff/src/mass.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efa54e942e20e9b6934fd4bc32b51c1d9d305ec375e4d81fa20db54ecb79198"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_em::adjoint::cell_nu_gradients (cognitive 22): vcad_kernel_em::adjoint::cell_nu_gradients has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/adjoint.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac183f7f45db748651f2c3f7421d683040e13d0282d2b33c2ad4c9ab22599863"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_enclosure::fit::check_lid_clearance (cognitive 22): vcad_kernel_enclosure::fit::check_lid_clearance has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, loops 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":"crates/vcad-kernel-enclosure/src/fit.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a744ffd98dea74f4089150189a4611fc4a09a04972605a59ad80e53956a1e61"}},{"ruleId":"D2","level":"warning","message":{"text":"Skyline::factor (cognitive 22): Skyline::factor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (10 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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c5c0816f93c671aa7b3d176caabbd6a6e28508513aeda29689612dc84eab1"}},{"ruleId":"D2","level":"warning","message":{"text":"Profile::validate (cognitive 22): Profile::validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, 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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e01153da0865ba52e92c45c5314628e77a4b6bb8974fb7e0b88286a0b9a1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::modal::modal_on_mesh (cognitive 22): vcad_kernel_fea::modal::modal_on_mesh has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (8 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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a7222c824cbc4f9cdfdcee974be1e45eacb6606390a6e4f0f5c56ad65d8fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_features::raw_cylindrical_faces (cognitive 22): vcad_kernel_features::raw_cylindrical_faces has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 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":"crates/vcad-kernel-features/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"06726c8549f6e8e399f9ba15277ca1491976fcd24422702e08777b80ea85ab2b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_orbit::pass::predict_passes (cognitive 22): vcad_kernel_orbit::pass::predict_passes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3, 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":"crates/vcad-kernel-orbit/src/pass.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1cfc1d6b9af2ad364535b556ecc0145403aabd022c903c28dbdb87391a2db8"}},{"ruleId":"D2","level":"warning","message":{"text":"Simulation::record_monitors (cognitive 22): Simulation::record_monitors has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 4 (10 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e74dfd670c10da506b0a7de837759b2072b7c8158ed4564d1a7481cbd032b1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_photonics::design::cone_filter_transpose (cognitive 22): vcad_kernel_photonics::design::cone_filter_transpose has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts), boolean chains 2 (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":"crates/vcad-kernel-photonics/src/design.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3946e0f5a52f16f3012fbea36413f5846ea75312ca65ce7c67964935e8bf6bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"StepReader::anchored_solid_ids (cognitive 22): StepReader::anchored_solid_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"93268fe176b98281d377d3a0c1029ac19bebea13d20132f9f9ebb31884f8b52e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_bilinear_face (cognitive 22): vcad_kernel_tessellate::tessellate_bilinear_face has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (10 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a5239b5a18835d3f665f71c9125813d93d32a3f92845ed3209fcf9283cbd58"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_degenerate_cap (cognitive 22): vcad_kernel_tessellate::tessellate_degenerate_cap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4, match/switch 1 (2 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8261}}}],"partialFingerprints":{"codehealthFindingId/v1":"be03335bb4feea3b457c2cce5878ccff6516eb75445ef85ab7bfd8a06eb69ada"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_printcheck::checks::anchor_reach (cognitive 22): vcad_printcheck::checks::anchor_reach has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (7 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":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17fbd1f4583fcda69e4931a5e3fdd0c03115fbceb647cbd134e440b8babe359"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_receipt::mechanical::mass_properties_claims (cognitive 22): vcad_receipt::mechanical::mass_properties_claims has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 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":"crates/vcad-receipt/src/mechanical.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef1aec87126014dc64b00a7f59790949bcf03ecd8905ea1e6018b93493e3e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::exact::extract (cognitive 22): vcad_render::exact::extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (6 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":"crates/vcad-render/src/exact.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5ad8c54ee9e7f08cd7850cdbe066c88c3002d30e3a4a7aafb579475f2f1a40"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::analyze::detect_bridges (cognitive 22): vcad_slicer::analyze::detect_bridges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 3 (6 pts), boolean chains 1, 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":"crates/vcad-slicer/src/analyze.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"242830d190275554af923b1ca2520711a75d21c512dd69476c5f4a5cd7abb19c"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::fit_physics::find_contacts_with_epa_depth (cognitive 22): mecheval_grader::fit_physics::find_contacts_with_epa_depth has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (4 pts), boolean chains 2, 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":"mecheval/graders/src/fit_physics.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf13dcd6b67ef1dc41dfc05d407899c92ee0cbbf033bc10f0507673ab386a628"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentViewer.call (cognitive 22): AgentViewer.call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (5 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/AgentResources.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2933161358d47a0904132a06d2804b1050af11218ed15cf8e92152e2604652e1"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.gizmoDragTo (cognitive 22): EditorModel.gizmoDragTo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 2 (3 pts), ternaries 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"356a885964ee50d5c4f6a059a523f10a339caf3227df68820ad694288ed1545b"}},{"ruleId":"D2","level":"warning","message":{"text":"BoardPainter.drawPads (cognitive 22): BoardPainter.drawPads has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, match/switch 1 (2 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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce20d3db44d091da9f1da5aabcdcce6c94814a1aacd3bddd4d9524693adf9539"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsWorkspace.deleteSheetSelection (cognitive 22): ElectronicsWorkspace.deleteSheetSelection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (9 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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8838aa8b8b7b5f155749a224f16bff64271fb672a6e02275fb8a57c8758813eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectInspectorWindow.documentSections (cognitive 22): ObjectInspectorWindow.documentSections has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e36de28ad5abb1e8ca91f8c7ea1a1bf37dd09471648d190afb3863bc5a5c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.lineTap (cognitive 22): SketchSession.lineTap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 2 (5 pts), boolean chains 4, loops 3 (4 pts), ternaries 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a1077a46b32c265294df77c173780a34e7c73097b1edff1b732de0203735cd"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.gizmoDragTo (cognitive 22): EditorModel.gizmoDragTo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 2 (3 pts), ternaries 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77a15e98cb1171a8bb68ab8ada930b1f91fc1810adae44bb1c1b7140c0818af"}},{"ruleId":"D2","level":"warning","message":{"text":"build.modelDisplayName (cognitive 22): build.modelDisplayName has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (13 pts), loops 2 (4 pts), if/else 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9438605f74227b1daa1cfd0c081ff491d6311a715a232b52d28a483fbaa6913a"}},{"ruleId":"D2","level":"warning","message":{"text":"build.renderHeroMetric (cognitive 22): build.renderHeroMetric has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 5 (7 pts), loops 3 (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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0b6f26db9d54607b2e80d1d5eece899dd123e1d5bb9ef7f1065b277345c594"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedFieldOverlay.CompressedFieldHud (cognitive 22): CompressedFieldOverlay.CompressedFieldHud has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 9, if/else 2 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 6 belong to 2 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":"packages/app/src/components/CompressedFieldOverlay.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fa06739a7f5546d3b65a167d2f886c1b9efb71bbf159761ed480dc1fb30198"}},{"ruleId":"D2","level":"warning","message":{"text":"executors.executePlacePart (cognitive 22): executors.executePlacePart has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 8 (9 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"326d3ddc0b1674691b9d034b80c012af33f84c3c53bcb2e52aafdaceeb8f4786"}},{"ruleId":"D2","level":"warning","message":{"text":"engine-host.handleEngineRequest (cognitive 22): engine-host.handleEngineRequest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 1 (2 pts), error handling 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":"packages/engine/src/engine-host.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ade9dfac797b5ce815aed98496d6c2530aedd8186c36b461f7c94a837518fd"}},{"ruleId":"D2","level":"warning","message":{"text":"sweep.resolveSweepAxes (cognitive 22): sweep.resolveSweepAxes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 8). Of this number, 19 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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd297e87fa80848cec375f7a7e19a527e7456509ef74e785e95324b5dd240af"}},{"ruleId":"D2","level":"warning","message":{"text":"loon.addLoonToSession (cognitive 22): loon.addLoonToSession has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 6). Of this number, 21 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3332d759bab61f43aebf430168239a17695ef546b7078775ea283b4f4d0bd69f"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.calcRf (cognitive 22): ecad.calcRf has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 7 (8 pts), boolean chains 3, loops 1 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7631}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67c0d66954f09ba8b02c827938c4067844b405218f769e5292b3a466d6ae9d"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addNetTie (cognitive 22): ecad.addNetTie has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4, boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca81cbb9f6505e14c96a0c95bb70652c12756db39a19f11dd566190e2629aa09"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.rasterizeSection (cognitive 22): ecad.rasterizeSection has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (8 pts), loops 3 (6 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bd4f4aaae639edf08fa08d97ea9534ce3e8760b0a1d949b3a03719103bfb61"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.sealedCavityFromMesh (cognitive 22): ecad.sealedCavityFromMesh has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 8). 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3743aa899ce816a8a5846410e40e1be023436e8605c5bc18a92f52eb83b4c74b"}},{"ruleId":"D2","level":"warning","message":{"text":"import-urdf.importUrdf (cognitive 22): import-urdf.importUrdf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 5, 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":"packages/mcp/src/tools/import-urdf.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daaa97b1b41ff101b4405c741fe6bed4da97be30e105eaede5dac03f1b810bb"}},{"ruleId":"D2","level":"warning","message":{"text":"animate.compileJointKeyframes (cognitive 22): animate.compileJointKeyframes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6181f65f45e06b646471b328357d26be2097fa9cffb08ef15f00a7fa1097a98f"}},{"ruleId":"D2","level":"warning","message":{"text":"startHeroEngine::extractEdges (cognitive 22): startHeroEngine::extractEdges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), ternaries 2 (5 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":"www/src/hero-engine.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9974e8eb50c9a1dc71684680457941a0fcc5c3037f26b41ae87736c7f0a0148e"}},{"ruleId":"D2","level":"warning","message":{"text":"extractEdges (cognitive 22): extractEdges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), ternaries 2 (5 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":"www/src/wireframe.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f992858a7097cccd69a2fee915d00676208af1f3c31e5cbb9da834a6583e90a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::doc_edits::move_footprint (cognitive 21): vcad_app::doc_edits::move_footprint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (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":"crates/vcad-app/src/doc_edits.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"359abb58dd7f2833f0b4bdfd5b7fbfc99108a1e085a1aeb674d5685c9f01963a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::input::handle_tool_input_key (cognitive 21): vcad::input::handle_tool_input_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, match/switch 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c4bb01b1352a49e84864a09543ebddeea3a7ded7ff2c4f4687753d925efbc6"}},{"ruleId":"D2","level":"warning","message":{"text":"FractionalIndex::between (cognitive 21): FractionalIndex::between has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), boolean chains 1, 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":"crates/vcad-crdt/src/fractional_index.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"979023f446efcdbe6c0f11735cc90aac5008998ccc8cc2c7dc7df1a4ac9efc49"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveRouter::route (cognitive 21): InteractiveRouter::route has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fd8b3e8ba73a81050547cd46d63267ce4f9a4acf6120ee06a419ce91c931ab"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::calibrate::calibrate_rules (cognitive 21): vcad_ecad_fabprep::calibrate::calibrate_rules has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (21 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":"crates/vcad-ecad-fabprep/src/calibrate.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5c50c0af4ec14609c8b1093f0463721862f6c5c6e92c9816520cbba263dc6c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::spur_copper_mask (cognitive 21): vcad_ecad_pcb::drc::spur_copper_mask has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 6, 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b53b96cfd71b388b49c7f4147eb08146d655aaf159b66e2d007e6a4bb5ab42f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::complete::live_layers (cognitive 21): vcad_ecad_pcb::router::complete::live_layers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (5 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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6cd1173881a0d805356741cfda9398395a83f106832fc7e67f7d3d50221ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::descent::pin_attachments (cognitive 21): vcad_ecad_pcb::router::descent::pin_attachments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1e076215fdde9c58b13811c7481f6afaf288bec997d7e606b3b94d35ea1e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitEnv::step_adaptive (cognitive 21): CircuitEnv::step_adaptive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 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":"crates/vcad-ecad-sim/src/circuit/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"82631d6477c6c2af5b43f79f9db7fc9927c09261bc93b5b7b81542c16c8a2a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_sim::airgap::airgap_solve (cognitive 21): vcad_ecad_sim::airgap::airgap_solve has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, match/switch 5, loops 1 (2 pts) (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":"crates/vcad-ecad-sim/src/airgap.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"672735ba78808508398f9b53c8daac0df6b73c1a0f32d16b4704527704102950"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::transistor_artwork (cognitive 21): vcad_ecad_symbols::kicad_write::transistor_artwork has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, loops 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbd76d66d37170945b8043e40e163fe672f5d0c9843f60033d9feacd393521e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::parameters::resolve_parameters (cognitive 21): vcad_ir::parameters::resolve_parameters has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (7 pts), match/switch 3 (5 pts) (nesting depth added 9). Of this number, 17 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":"crates/vcad-ir/src/parameters.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"71733731da51f68bed45f33fd0fa0b3fc2cc04e5d828d6f4789b2597561d6a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"Solid::apply_transform (cognitive 21): Solid::apply_transform has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 2 (5 pts), if/else 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68d1ec437a8919cc4b0f7e9dea7c638757db451d3a10d1befedc2d80fcb7039"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_assembly::interference::check_interference (cognitive 21): vcad_kernel_assembly::interference::check_interference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 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":"crates/vcad-kernel-assembly/src/interference.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0e6a5404cf86c59bcdedd0e1462f057c23e8d059f39842dbc7c389dd8c8def"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::no_crossing::edges_touch_swept (cognitive 21): vcad_kernel_booleans::no_crossing::edges_touch_swept has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cdbfef56e0e884497fafb758f80bd98b4c2c63b02d1e22121dadc4e61a7784"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::sew::copy_faces (cognitive 21): vcad_kernel_booleans::sew::copy_faces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), match/switch 1 (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":"crates/vcad-kernel-booleans/src/sew.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"af599dea21a1ca412709f994d319f903cb1e243e61d3b552febc5c28d1b3c5c9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::cut_polyline_between (cognitive 21): vcad_kernel_booleans::split::cut_polyline_between has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9caf402b223ff24da9c4fa7bf7ddebb130f01a35c4e5765c5e7c8399642804"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession::on_click (cognitive 21): SketchSession::on_click has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 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":"crates/vcad-kernel-constraints/src/session.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57abc56f1b2e88b66290518224728b781bf2e8e11be0bff2666ba6547a9961e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::cnc::internal_radii (cognitive 21): vcad_kernel_dfm::rules::cnc::internal_radii has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (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":"crates/vcad-kernel-dfm/src/rules/cnc.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7d6f401e1b9331fb9ec5fcd18dc858581a7b7c790e22246f778cde492fc9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r1_corner_radius (cognitive 21): vcad_kernel_dfm::rules::hobby_mill::r1_corner_radius has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (8 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bba7bf44cb651056ba41b33d6b4baf5fc139f9b922b3b6a5809ff81db67a48f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r3_hole_diameters (cognitive 21): vcad_kernel_dfm::rules::hobby_mill::r3_hole_diameters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b13f84792696c17421bf367fe604bf57c5d33fac8e0cfdbe2bef1b5724c63e5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::adjoint::evaluate_with_pullback (cognitive 21): vcad_kernel_diff::adjoint::evaluate_with_pullback has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 2 (6 pts), if/else 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/adjoint.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"693620523ca36ade62b37ea05362175a3aefc2f1392e28a9396452893082ba7e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::hidden_line::merge_collinear::subtract (cognitive 21): vcad_kernel_drafting::hidden_line::merge_collinear::subtract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (5 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":"crates/vcad-kernel-drafting/src/hidden_line.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb5b05a596d12fec674c2632c40dd91abe43122f69ff6183b1f93802ddc01aa"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_enclosure::mesh::extract_openings (cognitive 21): vcad_kernel_enclosure::mesh::extract_openings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 6 (9 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":"crates/vcad-kernel-enclosure/src/mesh.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"824a4f4823bb95984132cd3322b146836266b3f7c232c86bde9678e260aa9953"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::buckling::sphere_shell (cognitive 21): vcad_kernel_fea::buckling::sphere_shell has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (21 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6243cde495ad2d7e35ee98dc719c09abb7a5433e03b892a6df38cfaf1a470d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::rolling_ball::chord_length_params (cognitive 21): vcad_kernel_fillet::rolling_ball::chord_length_params has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5 (10 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":"crates/vcad-kernel-fillet/src/rolling_ball.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa93b504dafa522a7bdbfdfa5bf713d0494d51d668f383861b01b34f1e99ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::trim::compute_trim_vertices_with_setbacks (cognitive 21): vcad_kernel_fillet::trim::compute_trim_vertices_with_setbacks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, 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":"crates/vcad-kernel-fillet/src/trim.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7a5859401668e291d0951e41335d64740efd0dbc122bda9e5621ccceb5c26a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::chain::predict (cognitive 21): vcad_kernel_particle::chain::predict has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 6, match/switch 1 (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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"277cee2f7cee0e4632d22eeb7987726fee890ab138e014c45534254295dc97a1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::receipt::compare (cognitive 21): vcad_kernel_particle::receipt::compare has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 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":"crates/vcad-kernel-particle/src/receipt.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a90a1220791dade17bee8bddfb6da7e523111699b18df8b16a17d900eba10d3"}},{"ruleId":"D2","level":"warning","message":{"text":"RobotEnv::check_termination (cognitive 21): RobotEnv::check_termination has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, 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":"crates/vcad-kernel-physics/src/gym.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ee3d703f408698a3baa1f47b5d3c61740d42e82b0b53c45912ab5cc6303119"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sketch::extrude::extrude_with_options (cognitive 21): vcad_kernel_sketch::extrude::extrude_with_options has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a841afe25384627962fc9efbf47200f1cc4fce27d7748019a23f44c18f8eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::reconstruct::circle_fit (cognitive 21): vcad_kernel_step::reconstruct::circle_fit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 3 (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":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56549559eff1f588179e86b515a169a7fbcc57e9a61e423c224c7c2ea257fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"TriangleMesh::merge (cognitive 21): TriangleMesh::merge has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 5 (9 pts), 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"98def23f9110899ff60b929c6f53d8d6f0690a1fc4b6b6e59020a44a9c6be3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::solve::assemble_solution (cognitive 21): vcad_kernel_thermal::solve::assemble_solution has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 6 (7 pts), match/switch 1 (2 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b10731bfe34a1d468836246ed390732e653541a053315176f466c3ea3485f9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_urdf::reader::contains_doctype (cognitive 21): vcad_kernel_urdf::reader::contains_doctype has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 1 (2 pts), boolean chains 1, 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":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"8116bc8f0472fb7931381b7fb141473e7225abe7f01a454aef755fea5aa9282c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_mcp::transport::handle_http (cognitive 21): vcad_mcp::transport::handle_http has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts), match/switch 2, 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":"crates/vcad-mcp/src/transport.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c45052ed487cdd00a03b37b4040668a4c5f5f009f6679a5154eb9199d3056e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::smart_defaults::recommend_settings (cognitive 21): vcad_slicer::smart_defaults::recommend_settings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 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":"crates/vcad-slicer/src/smart_defaults.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2240717bd23dcce96951a39254a747da92c1462e93d054725786a8f1e2c6c53"}},{"ruleId":"D2","level":"warning","message":{"text":"FidelityMatrix::to_markdown (cognitive 21): FidelityMatrix::to_markdown has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (6 pts), match/switch 2 (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":"crates/vcad-torture/src/fidelity.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fae2dd8df32e8a6878c42b66e9fe7bde5558170fc42fe94c4924c6ff523de9"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisAgentTools.call (cognitive 21): AnalysisAgentTools.call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, 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":"apple/VcadApp/Sources/VcadApp/AnalysisAgentTools.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"928a2c4a012f2b6117b6773ace6b2974a20c9da8b7301af3ca1d57026bfc37c5"}},{"ruleId":"D2","level":"warning","message":{"text":"CNCStudioInspector.selected (cognitive 21): CNCStudioInspector.selected has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 4 (9 pts), boolean chains 2, 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":"apple/VcadApp/Sources/VcadApp/CNCStudio.swift"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d4bce5f0bb0d7ab26c366522963e958137c6dded403db2d86d77d28413ed7a"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.appendIRFeatures (cognitive 21): EditorModel.appendIRFeatures has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a2894d094bdbbf9a19a46cb011f59dfef018750a000c375c02c64c754445d2"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.navCommand (cognitive 21): EditorModel.navCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (6 pts), boolean chains 3, 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":"apple/VcadApp/Sources/VcadApp/NavigationViews.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"033766c33694f2d4b7688633b43b47ecf5791a426dd5521e3e9ac58b3b264297"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.pathTraceGeometry (cognitive 21): EditorModel.pathTraceGeometry has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (7 pts), boolean chains 5, if/else 3 (5 pts), ternaries 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":"apple/VcadApp/Sources/VcadApp/PathTracer.swift"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"555c9c9a5121203fbce0a701a73acbba772d2c80fa5353772ed141a88ffdf2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsWorkspace.annotate (cognitive 21): ElectronicsWorkspace.annotate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, loops 4, ternaries 1 (nesting depth added 3). Of this number, 17 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7faea97e4eea5b07b981c3ffeec60954ad2cb0f49dd25f61706fd5ed67cb9b"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldSkin.init (cognitive 21): FieldSkin.init has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), boolean chains 6 (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 6 belong 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":"apple/VcadApp/Sources/VcadApp/FieldOverlay.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ba004f9bce512bc801e48a9c72ea30af2c4e5b7eafa29e12a7b1f90e718cca"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentShimmerOverlay.rect (cognitive 21): AgentShimmerOverlay.rect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), ternaries 1 (5 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"31473a6a517eac983007222eb42e10b3467a89cc4bb87c5740ac7584d0e3bd9c"}},{"ruleId":"D2","level":"warning","message":{"text":"SectionPlane.clip (cognitive 21): SectionPlane.clip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 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":"apple/VcadApp/Sources/VcadApp/Section.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd67ce8e18fa73b0447a1800b91d674ef461a2b085ebf345d93003ecab0c6261"}},{"ruleId":"D2","level":"warning","message":{"text":"SmartDimension.plan (cognitive 21): SmartDimension.plan has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (9 pts), boolean chains 1, 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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"844d6a2d4769e2407688769b7c22cebab68825bf2bf45e9c056cccc0fb059ed6"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.dimensionTap (cognitive 21): SketchSession.dimensionTap has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (10 pts) (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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f252aeb94f329195f48427ed8278c3a6fcd57bec14c1590779e0eeb20756d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.appendIRFeatures (cognitive 21): EditorModel.appendIRFeatures has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ed704aa01c76b827ee80e59fae302e0e77ff1474a0318031a0564ab849c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"print-flow-mockup.html.document.addEventListener(\u0022click\u0022) (cognitive 21): print-flow-mockup.html.document.addEventListener(\u0022click\u0022) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19 (20 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":"docs/design/print-flow-mockup.html"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1a43dce225d79f31404abe230d4e4fb00cb3e0ae87aad81e698aa22d5a74ed"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchPlane3D.SketchCursor3D (cognitive 21): SketchPlane3D.SketchCursor3D has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 5, ternaries 5, loops 1. Of this number, 14 points are the body\u0027s own statements and 7 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa15bafb3045e087a8d473d0a79bc44703949c6b825a84e733535a994c863fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewport.BoxSelectHandler (cognitive 21): Viewport.BoxSelectHandler has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 4, loops 2. None of this is in the body itself: all 21 points belong to 6 function literals inside it that branch (lines 125, 155, 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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cd5d72df482021d70fdc942e99513aaf01fdf3605d4177d4fe4d82acf046d4"}},{"ruleId":"D2","level":"warning","message":{"text":"camera-framing.expandBboxFromPositions (cognitive 21): camera-framing.expandBboxFromPositions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 6, 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":"packages/core/src/camera-framing.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4933e7bea084d03ace4b012c1bf7f9daf445109e638bca4f90a4efc1a2e6db6c"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandRegistry.buildSystemPrompt (cognitive 21): CommandRegistry.buildSystemPrompt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (6 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 8). Of this number, 14 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":"packages/core/src/commands/registry.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cc4ab279a825673552e6c2dc95ea1fb1dd361aba10fdbc46c63857c9aa4a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"clearance.measureGroups (cognitive 21): clearance.measureGroups has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 4 (6 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 3 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d068d3d2beccb1c0d43f475fb568a41d3e94cfa8fadbff959d51b79c0831fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"server.slimPreviewForInlineUi (cognitive 21): server.slimPreviewForInlineUi has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 2 (3 pts), error handling 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":"packages/mcp/src/server.ts"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"398aa06c82e7703103a414c33a9b58a415351eed56b806dbca894c2719864827"}},{"ruleId":"D2","level":"warning","message":{"text":"annotate.annotate (cognitive 21): annotate.annotate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 10). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 175). 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":"packages/training/src/annotate.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7ea70c4b56aedc826daceb6a7f89fb48e9c9c06791f4f4c2ccd2df94e01f64"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.validateExample (cognitive 21): validate.validateExample has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (5 pts), error handling 2 (3 pts), boolean chains 2, loops 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":"packages/training/src/validate.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"46239295b09677f2eb021d9b840d65bb654abf5c1400a87a89617552b59a5a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::run_command (cognitive 20): vcad::run_command has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), loops 1 (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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2c31172f546055175a11ae92312f0c6b30c1ac462955f4c9eac71ca20315e7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::run_params (cognitive 20): vcad::run_params has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (7 pts), match/switch 2 (4 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd21c03796025dc9ab31d1a54c364dfa9e0b17768fb2799ec27f09261033ce1d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::dangling_ends (cognitive 20): vcad::dangling_ends has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 4 (6 pts), boolean chains 5, match/switch 1 (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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d8735ac26f0a8396421391bba4b35b38853d1955adcda0479554e182115b46"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveRouter::shove_moves (cognitive 20): InteractiveRouter::shove_moves has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa966050e3f34ea11590c25630f2f793a8df3ff9e03a192babc0413bc6b0351"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowGraph::max_flow (cognitive 20): FlowGraph::max_flow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (8 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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb948b49f77e3001b87b0d5d90f08ed83a4156b572d04d15502c6e1606f22ae"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowGraph::apply (cognitive 20): FlowGraph::apply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 3, 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aaa7b652e002ad59376bb65447a718ade2ed523a74dd140a288b96351c98a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Obstacle::intersects_segment (cognitive 20): Obstacle::intersects_segment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 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":"crates/vcad-ecad-pcb/src/router/push_shove.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e23ffcb9e927768f2f1bbbe51cc68085c46da89a0f048355413ca2b5b42dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"PushShoveRouter::build_visibility_path (cognitive 20): PushShoveRouter::build_visibility_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (10 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":"crates/vcad-ecad-pcb/src/router/push_shove.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4d9d3ac07d6f942e0ef14841fa684559279aa92453850e02f88d801f140407"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::diff_pairs (cognitive 20): vcad_ecad_pcb::drc::diff_pairs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":3667}}}],"partialFingerprints":{"codehealthFindingId/v1":"590c20c5ee9a07979a1213b158a1b69d2e7ae1c17eb2510825655a893719231c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::realize::round_bends (cognitive 20): vcad_ecad_pcb::router::flow::realize::round_bends has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 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":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0bcf68ced6ae7fb8dcbc715507159b3a1bc6ae17cd2448484a209b9a83c758"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::em::section_annuli (cognitive 20): vcad_eval::sim_extract::em::section_annuli has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 5 (7 pts), match/switch 1 (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":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0e895df838f5be58db3641a85efc078c5abb81792772ec05afa9465240f2b9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::thermal_extract::thickness_p05 (cognitive 20): vcad_eval::thermal_extract::thickness_p05 has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4b991dc9a39c0b7eba56990fe97f664f751420080f12918580cde6ca037569"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::gym::build_env (cognitive 20): vcad_ffi::gym::build_env has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 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":"crates/vcad-ffi/src/gym.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10302c1d377071642494f9f2b2b54839fa5f0c868455f1474a804dacf71c755"}},{"ruleId":"D2","level":"warning","message":{"text":"Pcb::infer_layer_roles (cognitive 20): Pcb::infer_layer_roles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/ecad.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18b776a5f6487cf0803ae533ad15f48be67e9b4f66955c336ac9739745942b6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_antenna::linalg::lu_decompose (cognitive 20): vcad_kernel_antenna::linalg::lu_decompose has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (8 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":"crates/vcad-kernel-antenna/src/linalg.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"56875cdafdaced65e73195996dd9b7c5a87cc0306bbe2daadf7f979a66936191"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::chain_into_loops (cognitive 20): vcad_kernel_booleans::pipeline::chain_into_loops has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c7d865355de415975e205d127d1651caeb5681a812d74c7c956bf21fa33c65"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::find_line_polygon_crossings (cognitive 20): vcad_kernel_booleans::split::find_line_polygon_crossings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ca52bc018b13e858e3d3ab8246b797e5bd0f509ae3a1e4a67281e4294cb8c4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::validate::mesh_report (cognitive 20): vcad_kernel_booleans::validate::mesh_report has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 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":"crates/vcad-kernel-booleans/src/validate.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"024da702f45541144469f5022a5312d07cf9fbad017f5e21541618718f24cd2a"}},{"ruleId":"D2","level":"warning","message":{"text":"TurnPlanner::new (cognitive 20): TurnPlanner::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (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":"crates/vcad-kernel-cam/src/turning/ops.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0782f84d1a6f2846d7de1f9d8f589d31a59169a81167301240b5fef2d8d7970"}},{"ruleId":"D2","level":"warning","message":{"text":"Probe::first_hit (cognitive 20): Probe::first_hit 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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8765cf9da41975e182ca67c0b6e181c5969f75e9a23eba7f3ffaf848b31bd382"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r2_reachability (cognitive 20): vcad_kernel_dfm::rules::hobby_mill::r2_reachability has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"897849cf1538f5580c2e80322d9b600c3551b2a5e13cf49f6752dfee562e257a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::sheet::run (cognitive 20): vcad_kernel_dfm::rules::sheet::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (2 pts) (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":"crates/vcad-kernel-dfm/src/rules/sheet.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"caff28fbef50894fd5f562e178e1d08899f41c0abc42ddc9598b435ff639f9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_em::adjoint::rotor_torque_gradients (cognitive 20): vcad_kernel_em::adjoint::rotor_torque_gradients has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 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":"crates/vcad-kernel-em/src/adjoint.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"009ec7dc7107a4ff1532b73379131448e4053559ca917cc6164d608cebb7ab7a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_export::build_stl (cognitive 20): vcad_kernel_export::build_stl has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-export/src/lib.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bc8147e7e86b5858ca9bd5e0945ba505b0d8aa4a05c1264e3721f8a7798ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::fillet_curved::build_cylinder_bridge_quads (cognitive 20): vcad_kernel_fillet::fillet_curved::build_cylinder_bridge_quads has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), match/switch 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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"7875f011ccd056abcd42da0acfbd6c281fb2e7b92961358dd1d854b69a6da643"}},{"ruleId":"D2","level":"warning","message":{"text":"GpuRouterState::apply_deltas (cognitive 20): GpuRouterState::apply_deltas has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (8 pts), boolean chains 2 (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":"crates/vcad-kernel-gpu/src/router_state.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"62aef1129d04223e156730ba1c564b8ef2e20625cfd7b5bdcda29aa24c6cf101"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_raytrace::cpu::render_scene_samples (cognitive 20): vcad_kernel_raytrace::cpu::render_scene_samples has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), match/switch 1 (5 pts), if/else 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aa53bce85f2f5d8713a58c9eaa8becfb9c8f4d819ddb52610b17bbca90c9c3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::nesting::bottom_left (cognitive 20): vcad_kernel_sheet::nesting::bottom_left has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, 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":"crates/vcad-kernel-sheet/src/nesting.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f51b1b4c026a70707c988028f9d6c3e3887092ab19a349ed95fa651e1174379"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sheet::poly2d::splits_from (cognitive 20): vcad_kernel_sheet::poly2d::splits_from has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (10 pts) (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":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cbc64e082e9471bbe89f430f42a47b8b2357cc73dcab015bc1172a79e3b36b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sketch::extrude::extrude_with_holes (cognitive 20): vcad_kernel_sketch::extrude::extrude_with_holes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 7 (9 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"399fc5b312717dca327a3b7dd792f6c87fede669b4125be7d715517f407e642a"}},{"ruleId":"D2","level":"warning","message":{"text":"PointGrid::two_nearest (cognitive 20): PointGrid::two_nearest has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), match/switch 1 (5 pts) (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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acc2ccf4b9b87cb4f54faec96c2870d8bbb814f05fbd8db04140c5a181cda40"}},{"ruleId":"D2","level":"warning","message":{"text":"TriangleMesh::boundary_loops (cognitive 20): TriangleMesh::boundary_loops has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (6 pts), loops 3 (4 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f153c1df429cec053a4bbd9e51d0e2fb934439cb020c5b0b56f017998bec99d5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::weld_coincident_vertices (cognitive 20): vcad_kernel_tessellate::weld_coincident_vertices has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b620d53c80bfeaeffc03240df67ce242a821ff60ee8cfa89f3ecc990b8a405"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::clearance::mesh_clearance (cognitive 20): vcad_kernel_tessellate::clearance::mesh_clearance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 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":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec552290fda8ac4f0a655db94b43f8a3ee74a370340fc502e82545200baa178"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_urdf::reader::locate_robot_bounds (cognitive 20): vcad_kernel_urdf::reader::locate_robot_bounds has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf31641b708c4410dd79a4c4f9c748c63d2db9785e09b36df1b28eeaa6c04a0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_urdf::reader::normalize_link_child_order (cognitive 20): vcad_kernel_urdf::reader::normalize_link_child_order has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 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":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93c2db37417411da78e07a6790b6dcc2bc96f36c1229bb71e5a5805d46084dd"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::embroidery_wasm::sketch_profile_to_path2d (cognitive 20): vcad_kernel_wasm::embroidery_wasm::sketch_profile_to_path2d has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (vcad_kernel_wasm::embroidery_wasm::sketch_segments_to_path2d) 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c537d255057c48c0be751c911a6c5100bc18345dbfdb33302cef7ef7d4ef052f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::embroidery_wasm::digitize_text (cognitive 20): vcad_kernel_wasm::embroidery_wasm::digitize_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f8f99c88028c36bd320b5607f222257b9444e69b9adc26026c989885874a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::embroidery_wasm::sketch_segments_to_path2d (cognitive 20): vcad_kernel_wasm::embroidery_wasm::sketch_segments_to_path2d has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (vcad_kernel_wasm::embroidery_wasm::sketch_profile_to_path2d) 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2834448f3e126ecc5bb1e034f35b021ee6cf49b5fedfced10c8e06589bd53e91"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_mcp::tools::engine::run (cognitive 20): vcad_mcp::tools::engine::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-mcp/src/tools/engine.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef26eab0b5fa9629d1e88845845cd3fe5f790b351873b3e3387bb11c386e968"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_parts::vacuum::flange_at (cognitive 20): vcad_parts::vacuum::flange_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (7 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":"crates/vcad-parts/src/vacuum/mod.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d5cce6f97a13d60f89f61b05a1a46184dbf3910bec94570883b40f3c97465a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::photoreal_gpu::rasterize (cognitive 20): vcad_render::photoreal_gpu::rasterize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 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":"crates/vcad-render/src/photoreal_gpu.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c4f8684849565fee354043c1a5c5d7b529d01b164a234e311a732826d85424"}},{"ruleId":"D2","level":"warning","message":{"text":"Polygon::dedupe_collinear (cognitive 20): Polygon::dedupe_collinear has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (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":"crates/vcad-slicer/src/path.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d1628b255b51bc345c0f2f0d71e8f12a78597403f59ed263731ebf97467f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::grader::grade (cognitive 20): mecheval_grader::grader::grade has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 8, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/grader.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f402ee566e1887c12843aab39f06cd5dc063733e15d10f37c7b854dbabe48283"}},{"ruleId":"D2","level":"warning","message":{"text":"eval.validate_references (cognitive 20): eval.validate_references has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (18 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":"packages/training/src/modal/eval.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21f8476f962b652deff8e4b70a57a0cb18a02e1401a07cec1bb870fb1abb975"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSelection.resolve (cognitive 20): AgentSelection.resolve 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). Of this number, 19 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":"apple/VcadApp/Sources/VcadApp/AgentCore.swift"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"246682249755b6d41561bad534084a687e51eb64cc39fef749f3e31f12e31c61"}},{"ruleId":"D2","level":"warning","message":{"text":"ContactShadow.layer (cognitive 20): ContactShadow.layer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 3, ternaries 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":"apple/VcadApp/Sources/VcadApp/ContactShadow.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55867e96f6643c5302dcba64cb5493a76f7afa6d6cc5ac23016600e96595912"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.currentKernelMeshes (cognitive 20): EditorModel.currentKernelMeshes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d31df9f6e1ed956bc88751ac29677e7a0a52224bc7dde74cf193c353cd349a"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsBoardPreview.updateNSView (cognitive 20): ElectronicsBoardPreview.updateNSView has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (6 pts), loops 4 (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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardPreview.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0edf180e0e4752e337633f6a50a282295837849797a9c39bbd72eb4306b56f4"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldOverlayStore.showSolved (cognitive 20): FieldOverlayStore.showSolved has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (5 pts), boolean chains 3, ternaries 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":"apple/VcadApp/Sources/VcadApp/AnalysisStore.swift"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8025b9f39dcee9e1634c406d1f5828755a1d234a100661a018b86070a0583d"}},{"ruleId":"D2","level":"warning","message":{"text":"SafeWriter.write (cognitive 20): SafeWriter.write has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 1, loops 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":"apple/VcadApp/Sources/VcadApp/LocalHistory.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ba03a419e5a637543fb02b608ee44cf8eedb5b9348b8c935cbddf9796283b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PickingState.prewarm (cognitive 20): PickingState.prewarm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 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":"apple/VcadApp/Sources/VcadApp/Picking.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b854a3d76d438acd6858f684b2d4e9dc0873755c7e431cf0614345714f8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.constructionInk (cognitive 20): SketchSession.constructionInk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 4, 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeca55225fd5670a7f99eb96cb7d35e4e0f9c39ee5d755ff9daa41956f6ed8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.currentKernelMeshes (cognitive 20): EditorModel.currentKernelMeshes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ee94ce1b537117ddef4c06f85285dc860678993ab3de801878f96a6e571d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"solver.getSolver (cognitive 20): solver.getSolver has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 2 (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":"mecheval/harness/src/solver.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee7eb7b6314c28e1095278cc079047dff301dd055d1de557f2aeb90f6d3e7bc"}},{"ruleId":"D2","level":"warning","message":{"text":"pass_k.loadAllRuns (cognitive 20): pass_k.loadAllRuns has cognitive complexity 20 (threshold 15). Drivers by points: error handling 3 (6 pts), loops 3 (6 pts), if/else 1 (4 pts), ternaries 1 (4 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":"mecheval/harness/src/pass_k.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"884a8f8ef29946bfba3a34d37c0936ff06e4ea54ddd436b9e011459639127895"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewport.Viewport (cognitive 20): Viewport.Viewport has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, boolean chains 8, ternaries 2 (3 pts) (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 5 function literals inside it that branch (lines 386, 353, 274, \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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef7bd793f3858db4caaf831be6811dc745d673c9bd55b79e2ed4c4aff04e77b"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitTabTools.CircuitTabTools (cognitive 20): CircuitTabTools.CircuitTabTools has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 4 (5 pts), boolean chains 3 (nesting depth added 5). Of this number, 15 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67cc73e11e0c3534e2397e0cf5d25d10fb06020e4ab8f2c586ff367c73dd83d"}},{"ruleId":"D2","level":"warning","message":{"text":"DfmChip.DfmChip (cognitive 20): DfmChip.DfmChip has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (15 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":"packages/app/src/components/footer/DfmChip.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc7df5feb4ccb02ab4e5c38c51ce3e814bdbf46ca6122bfe5e2ccbae9304339"}},{"ruleId":"D2","level":"warning","message":{"text":"KoanChip.KoanChip (cognitive 20): KoanChip.KoanChip has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 5 belong 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, 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":"packages/app/src/components/footer/KoanChip.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"104b330ab854c1f78ced08b68b4b4d5c2e006de709d6207918348e88b5def81e"}},{"ruleId":"D2","level":"warning","message":{"text":"usePerfMonitor.usePerfMonitor (cognitive 20): usePerfMonitor.usePerfMonitor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (4 pts), error handling 1 (2 pts) (nesting depth added 8). None of this is in the body itself: all 20 points belong to 3 function literals inside it that branch (lines 84, 51, 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":"packages/app/src/components/footer/usePerfMonitor.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"932a0b6afd2bf879153e35c11f1609f72cb8e225dd3029a34a7e817412989f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderReceiptText (cognitive 20): render.renderReceiptText has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (7 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":"packages/core/src/utils/receipt/render.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a13a38dcf5a59d7e9ec1606faef4606f3d270796e326ca1407198cf6423183"}},{"ruleId":"D2","level":"warning","message":{"text":"Navigation.Navigation (cognitive 20): Navigation.Navigation has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 5, if/else 4 (nesting depth added 3). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to 5 function items inside it that branch (renderNavItem, a function literal at line 182, isActive, \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":"packages/docs/src/components/Navigation.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f489b80107c978b44ae95ed6b18c645cd96abe721f803430246d583ef133da"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-worker.onmessage (cognitive 20): analyze-worker.onmessage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 3 (6 pts), ternaries 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":"packages/engine/src/analyze-worker.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62626f2e345d114ccf474a1c1589bfe2bef6282843b423d60ab93869e1d7664"}},{"ruleId":"D2","level":"warning","message":{"text":"index.fromVCode (cognitive 20): index.fromVCode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 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":"packages/ir/src/index.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"edda807b83b69f7d41f9cbeb11dd825ddd0b6303df2aed29b2eca3a74f75784c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.splitLineRespectingQuotes (cognitive 20): index.splitLineRespectingQuotes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, 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":"packages/ir/src/index.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"891e92f8fe6d43dbc5977e07d48a8df186a2ce814c5126e948e64f4551150806"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm.__wbg_load (cognitive 20): vcad_kernel_wasm.__wbg_load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). Of this number, 19 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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":11771}}}],"partialFingerprints":{"codehealthFindingId/v1":"5865db41c76490c9dd6140dd93e2836fdf70ec4d8b90970ac5b50d90d39ef262"}},{"ruleId":"D2","level":"warning","message":{"text":"loon.composeLoonModules (cognitive 20): loon.composeLoonModules has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 2, 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82e7cf15773a9eb145d8fc5dfb025332f2ec621107f602eb22c9cd0e0326f28"}},{"ruleId":"D2","level":"warning","message":{"text":"pcb-validate.validatePcb (cognitive 20): pcb-validate.validatePcb has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 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":"packages/mcp/src/tools/pcb-validate.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d264ab6a20ef8be4fb84649109318cbb2fe6139df84925faba8408daf0702f09"}},{"ruleId":"D2","level":"warning","message":{"text":"part-stock.parseCsv (cognitive 20): part-stock.parseCsv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf331d074160e0f842f7bf6459865b704b2d8feded90daa216a5209f9f41ffca"}},{"ruleId":"D2","level":"warning","message":{"text":"parts.placePartTool (cognitive 20): parts.placePartTool has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 4, if/else 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/parts.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfd37f2053b82c5b5dbd4179480ac07f0dc66ce607ca904e503db1ea7c19a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"animate.validateTimeline (cognitive 20): animate.validateTimeline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 95). 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d3227b2821a8f8f9295ccadda58d05243964549ab15a92dfad0431724bf0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"server.resolvePreviewDocumentId (cognitive 20): server.resolvePreviewDocumentId has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, error handling 2, ternaries 1 (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":"packages/mcp/src/server.ts"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a72713445575c2a348018886200e05b48b62a5ef2cdc70fe2d4aa53c5a2ba7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_termview::rasterize::draw_line (cognitive 19): vcad_termview::rasterize::draw_line has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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":"crates/termview/src/rasterize.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b259768acfe807010bf921d91c9451013f563f815f07d3cdce32ba1c13642c4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::write_step_strict (cognitive 19): vcad::write_step_strict has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (7 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aced43b66071f5cbd689b544abca680ac84ec038c6d2e5d49e40e1714bd19d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::render_to_image (cognitive 19): vcad::render_to_image has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (9 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fce9f2a5ddfd1f821e4a227c70aff09f5d084f5dfc18de2931a5ad224d03d36"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::toolbar::render_tool_input_flush (cognitive 19): vcad::ui::toolbar::render_tool_input_flush has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 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":"crates/vcad-cli/src/ui/toolbar.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"86807c908fad36b9936b19306d26df1a9e20568278a03263cce15b0c0857f6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ResidualSystem::normal_eqs (cognitive 19): ResidualSystem::normal_eqs has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (12 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"973a602f433434c586f9d644286db3f4febd5ae738992a9f7929bc9d9a6637cf"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_annular_ring (cognitive 19): vcad_ecad_pcb::dfm::check_annular_ring has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a1868604f491060e19887471321847cc5b461522474c479333248286709558"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_soldermask (cognitive 19): vcad_ecad_pcb::dfm::check_soldermask has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"89000e683bea7c7c35d2610a4acc8eb2fb4b3b432c5458887f4e24a2238938da"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::islands::mst (cognitive 19): vcad_ecad_pcb::router::islands::mst has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (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":"crates/vcad-ecad-pcb/src/router/islands.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"937da1e634143342c9d8f4b8c94d4aac056b40acf7f61443bff716e403f1d370"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::length_match::longest_chain (cognitive 19): vcad_ecad_pcb::router::length_match::longest_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"102e7a189d7381e4fdc7e9c7f0151e41ecd556e93f45b1ecdff913f98ec7847c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::pair::split_at_neck (cognitive 19): vcad_ecad_pcb::router::pair::split_at_neck has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"453df3b9cba53c77f71415293ba5c844b5bef6e0fc91b973a050fa48e8227e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::si_claims::si_claims (cognitive 19): vcad_ecad_pcb::router::si_claims::si_claims has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/vcad-ecad-pcb/src/router/si_claims.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cd317e1a5780d35a3047d1cb3cc3b5204b92cf3166f2527a9f102fafb64b24"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::spatial::copper_elements (cognitive 19): vcad_ecad_pcb::spatial::copper_elements has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 2 (7 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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"50490768d4ebf9fbd2ecc25efe27e768bd902f2071ab8b30a6a59f5600d6065f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::altium::chain_outline (cognitive 19): vcad_ecad_symbols::altium::chain_outline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a57fc9663ec8984d17605378de94739d8c46c95a2d87ff1f736b22c61e13bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::eagle_brd::chain_outline (cognitive 19): vcad_ecad_symbols::eagle_brd::chain_outline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed9d745434fde9219bd53ca11051651532696cbf5cbb8cb9726bdf32e9b3ac9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::eagle_brd::xml_depth_exceeds (cognitive 19): vcad_ecad_symbols::eagle_brd::xml_depth_exceeds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 1 (3 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":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5004e7721dba4cc7182c93f6d8077e4101e03d298592733cc99d0a1e53092d5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_write::write_footprint (cognitive 19): vcad_ecad_symbols::kicad_write::write_footprint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 2 (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, 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed83e9af90ffc4e7bb2ad8a45a4b2aa43b22f58d36f0669c5e6d115ebdc7f90"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::vcad_scene_raytrace_gpu (cognitive 19): vcad_ffi::vcad_scene_raytrace_gpu has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts), boolean chains 2, 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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"24539cf1859f171682c7afeb085afa518afa1d4c31812220d02665ff252a9dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::fea::prepare (cognitive 19): vcad_ffi::fea::prepare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts), match/switch 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":"crates/vcad-ffi/src/fea.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceba35d331479acad495321d44158e45ca898e63aa84c3aa107549ec7c34f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::schematic::simulate (cognitive 19): vcad_ffi::schematic::simulate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (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":"crates/vcad-ffi/src/schematic.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e06df94f9a64c1a31fd1edafe6da96520f2c71c2fead2244c8cdaf69ed1e26e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::vcode::parse_joint (cognitive 19): vcad_ir::vcode::parse_joint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f261c4604093788f74bb07db3167bca8d973c1c6cbb92f124ac821902d0c89"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_atoms::inspect::report (cognitive 19): vcad_kernel_atoms::inspect::report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 5 (6 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":"crates/vcad-kernel-atoms/src/inspect.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79283f055df1f8818236457461e38e4831b0c87263edfd30324b6a58816fdec"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::bbox::sweep_candidate_face_pairs (cognitive 19): vcad_kernel_booleans::bbox::sweep_candidate_face_pairs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 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":"crates/vcad-kernel-booleans/src/bbox.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd99d0341746647af644a21007a58f3550df3df50d6a16af2afbd9c31a11b779"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_cyl::emit_wall_strips (cognitive 19): vcad_kernel_booleans::cyl_cyl::emit_wall_strips has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/vcad-kernel-booleans/src/cyl_cyl.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"157eb49e60cb796b0bb9bd3feb1b75242b7a394ab03bca12df376d62ee5b2e05"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::pipeline::split_walls_at_outline_planes (cognitive 19): vcad_kernel_booleans::pipeline::split_walls_at_outline_planes has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (6 pts), match/switch 2 (6 pts), if/else 2 (4 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6a85891a0afe5e0c855c64ce70fe40deabda7d1c6f7ecf2969d96ba1da41f2"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::crossing_on_rim_circle (cognitive 19): vcad_kernel_booleans::split::crossing_on_rim_circle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4737e3ad1be43ebe6f7593b74c9277759865bd3182f2e6689d5769304a121aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::circle_frame_arc_points (cognitive 19): vcad_kernel_booleans::split::circle_frame_arc_points has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5782}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92d7e319a39fdcfc5654495b5bfa9d4d8e47c675b38745c31e4415766f88d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_cam::turning::verify::hull_vs_part (cognitive 19): vcad_kernel_cam::turning::verify::hull_vs_part has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 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":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4bc96b4768eae4009a733dff0c599d549c4a1e76247c433a1736310df4613b"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::cast_filtered (cognitive 19): Grid::cast_filtered has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea08a63cbc9e69435c674e8b0512355fc2e5bd3e8b3fe8225b0f62c60173af"}},{"ruleId":"D2","level":"warning","message":{"text":"OrdinateDimension::render (cognitive 19): OrdinateDimension::render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (19 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":"crates/vcad-kernel-drafting/src/dimension/ordinate.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"767188e73b4fcefe32b6d0270d5b5ee5cc6e5b0882d83301dcf9ee753011016d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::pdf::emit_class (cognitive 19): vcad_kernel_drafting::pdf::emit_class has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (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":"crates/vcad-kernel-drafting/src/pdf.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0610177f5c3a6fe0dbbdadc2af3e43b234c87dee43ac91381e0957809a5661fb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::mesh::build_hex (cognitive 19): vcad_kernel_fea::mesh::build_hex has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (9 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"555b45ca4f161e818f1ddb8715018524e4590b1a223f7467f1a91c9c0e5f598f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_features::step::place (cognitive 19): vcad_kernel_features::step::place has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (9 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":"crates/vcad-kernel-features/src/step.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfa706ea1626b79eb77efeb0c83b614108e621a3d2bd38d4ec2fa5624cc21e3"}},{"ruleId":"D2","level":"warning","message":{"text":"IronStack::expand (cognitive 19): IronStack::expand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 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":"crates/vcad-kernel-magnetostatic/src/iron.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ac278755f4eb70d2f481a60de40c95f95da52657353d4160248f92ce4e9cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_optics::trace::trace_to_image (cognitive 19): vcad_kernel_optics::trace::trace_to_image has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 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":"crates/vcad-kernel-optics/src/trace.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"847ca79f0e71fb835d643cebdb6185617bb5589aaedbd6a2b6b849917a509865"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_raytrace::intersect::intersect_surface (cognitive 19): vcad_kernel_raytrace::intersect::intersect_surface 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":"crates/vcad-kernel-raytrace/src/intersect/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b78ac8f0b21694bbc52fd00e1ce612945835f87a983d5a80e1655a3dd4c27f3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_sketch::extrude::detect_axial_full_circle (cognitive 19): vcad_kernel_sketch::extrude::detect_axial_full_circle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1160e842e03a298ff4fec364b82ff97fe1e024bcc48097f270a082b328753ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::reader::length_unit_mm (cognitive 19): vcad_kernel_step::reader::length_unit_mm has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (13 pts), loops 2 (3 pts), if/else 1 (2 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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"173b9050f1f0c1847e312da9c867ede8d97e2c1e830c3f52156989e7000d1e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::tessellate_large_spherical_cap (cognitive 19): vcad_kernel_tessellate::tessellate_large_spherical_cap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6 (8 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b58670065abf324e7c52dc5c69211d021024eb10d8fe91cbf824d3fc31eaa0b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::clearance::winding_ray (cognitive 19): vcad_kernel_tessellate::clearance::winding_ray has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 1 (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":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"907d419c61950efdfec14e3b3f6cac19a2fd34ae6cca77d0dd63ad70c709269d"}},{"ruleId":"D2","level":"warning","message":{"text":"FeSystem::apply (cognitive 19): FeSystem::apply has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (9 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":"crates/vcad-kernel-topopt/src/fea.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bc0d4a550ef4bec674de60e77196ef3bc698c1c5806143bd086d46ae1f4bad"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvertCtx::material_physics (cognitive 19): ConvertCtx::material_physics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (7 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9686f0fb98e11f3e73c259dcab9c314cf00b8efdbe5b2f72a591cf9d4227050"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::rootnames::capture_expr (cognitive 19): vcad_loon::rootnames::capture_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (3 pts), loops 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":"crates/vcad-loon/src/rootnames.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2db2fdb874f39a227b885b67418b35f74cc18d747eee356dc48e61d54cb9368"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_mcp::discovery::attach_http_stdio (cognitive 19): vcad_mcp::discovery::attach_http_stdio has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 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":"crates/vcad-mcp/src/discovery.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1da03a1b06e95befe3ae65c33c9edec7a6c69de0211623281614711b849a49"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_process::sim::simulate (cognitive 19): vcad_process::sim::simulate has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (6 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":"crates/vcad-process/src/sim.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b239baffb5a0d266f4777f6805063ac7659fd0babcf134d7ca9657bdad7c8d2c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::evaluate_assembly_instances (cognitive 19): vcad_render::evaluate_assembly_instances has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce15356316480353facc78b192e8ac621c54130e487b1c47dba8e5e4dd4f0d1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::sheet::raster_sheet::render_sheet_jpeg_str (cognitive 19): vcad_render::sheet::raster_sheet::render_sheet_jpeg_str has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (9 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":"crates/vcad-render/src/sheet.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b96b042af478bf82a4ae604ea8b0be537a72add8d45269faf0121fc0407edc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer_bambu::discovery::collect (cognitive 19): vcad_slicer_bambu::discovery::collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 1 (2 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":"crates/vcad-slicer-bambu/src/discovery.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2cfe67995a6eb216fb5e824f264c31128bcda441094e59d899766837180879"}},{"ruleId":"D2","level":"warning","message":{"text":"make_figures.fig_aggregate (cognitive 19): make_figures.fig_aggregate has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (6 pts), ternaries 2 (6 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":"docs/compression-math-survey/paper-draft-figures/make_figures.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"317b6c09123f3fd85ea85c26a1ab9bb13064ba538030ffcf98be6094276c2b73"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSession.submit (cognitive 19): AgentSession.submit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, 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":"apple/VcadApp/Sources/VcadApp/AgentPanel.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb367527dfbbb86ed703423f469da62ec930cf6f39f45a3e229d136260f66783"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceHeader.body (cognitive 19): WorkspaceHeader.body has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 7, boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/CNCStudio.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f49e667d8e98f540d994a31002ed0ba636b9ccc208c95e6ac70df7c783f91b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.installKeyMonitor (cognitive 19): EditorModel.installKeyMonitor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d30a9f03537bd63971c2af49ebf09226916e13a3917855242087c2e6208a76"}},{"ruleId":"D2","level":"warning","message":{"text":"SchematicPainter.drawWires (cognitive 19): SchematicPainter.drawWires has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (8 pts), ternaries 3 (6 pts), if/else 1 (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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"50daf22b5e3dbff7e0932de31db407a536705d2429a9b65cf74b0bfde8b0566e"}},{"ruleId":"D2","level":"warning","message":{"text":"FrogAgent.send (cognitive 19): FrogAgent.send has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 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":"apple/VcadApp/Sources/VcadApp/FrogAgent.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c21d939f88591899cf969fbca729445f64af71e28f1a8f037325b657472621"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintWorkbench.printerStep (cognitive 19): PrintWorkbench.printerStep has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (6 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":"apple/VcadApp/Sources/VcadApp/PrintWorkbench.swift"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06cec6259e22beaa410bc102d6817a8746e04e3fc6dcfc05981dbfd6b3ff871"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeScrubBench.runIfRequested (cognitive 19): RuntimeScrubBench.runIfRequested has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 6 (7 pts), ternaries 2 (3 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":"apple/VcadApp/Sources/VcadApp/RuntimeBench.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4b4c46f876b8096e914d87045a30aa5cb321ed4305844aba215d90e7c47937"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.inferenceModel (cognitive 19): SketchSession.inferenceModel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 1 (4 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3029c6f11b9be04dbfa8b0b7c101649453c082cad6a0673927f5b5e4f5f97db"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.polyline (cognitive 19): SketchSession.polyline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ac3d78a27cbbfe25e8b4fb57c8c6124ecc1a67dca420e693b123b789b6e9f1"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.installKeyMonitor (cognitive 19): EditorModel.installKeyMonitor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"971773ef535f9ef95280c03d99bb8e1006e0cad1004b308ea5204a694ed31e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"launch-animatic.html.topo (cognitive 19): launch-animatic.html.topo has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (5 pts), loops 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":"docs/launch/launch-animatic.html"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a57cf1dde7fbbe3baa48e217a93f8ad8516dd82510bf2db5b7fcea6fdf543af"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-mcp.applyConversationCacheBreakpoints (cognitive 19): claude-mcp.applyConversationCacheBreakpoints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"08387c445c15a34e74396a47d274ff37d70ef75d18cf36d1c5aef76f43153375"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyzePanel.useSelectedFaceRegion (cognitive 19): AnalyzePanel.useSelectedFaceRegion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 9). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 134). 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f63973c8a70c6feb74a08906aa01d8fedf11c1e032dee763ddbde5a92e7a1f2"}},{"ruleId":"D2","level":"warning","message":{"text":"molecule-store.buckyball (cognitive 19): molecule-store.buckyball has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (7 pts), boolean chains 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":"packages/app/src/stores/molecule-store.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e377f9c6af7f865800e369847e04ef7084771ea943a09993b2a05421b02c979"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMenu.dispatchDesignPcbForSelection (cognitive 19): ContextMenu.dispatchDesignPcbForSelection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), boolean chains 1, ternaries 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c23ce40b74618563be6c37859a2a32aaa50e6c26f77b12a505e66a28c0551ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureTree.SketchTreeSection (cognitive 19): FeatureTree.SketchTreeSection has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, ternaries 6, if/else 2. Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a02d93b7d88ac441f0a0cfb8989f390d92ca78ecaf72d6d06147358fd3dcd1"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotePanel.QuotePanel (cognitive 19): QuotePanel.QuotePanel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 135, a function literal at line 176, a function literal at line 187, \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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b796317032afe110bd81d707f4e989305a17ab12ec1d89222d87449abe85953f"}},{"ruleId":"D2","level":"warning","message":{"text":"SplashMolecule.buildC60 (cognitive 19): SplashMolecule.buildC60 has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (7 pts), boolean chains 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":"packages/app/src/components/SplashMolecule.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2ed5a2b9574bbdcd502cdadd8575e88e647b71a9d1e759b8177f8e593384b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PrinterSelect.PrinterSelect (cognitive 19): PrinterSelect.PrinterSelect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 3 (4 pts), error handling 2 (nesting depth added 2). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (handleConnect, handleDiscover, a function literal at line 30, \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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"074d509af1a6ba83f1ae6c1f9b2d94974cd89d287d9c17c1489a5a419380729c"}},{"ruleId":"D2","level":"warning","message":{"text":"useElectronicsSync.useElectronicsSync (cognitive 19): useElectronicsSync.useElectronicsSync has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 2 (nesting depth added 1). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 104, 110, 41, \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":"packages/app/src/hooks/useElectronicsSync.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b37e9e937217bf73cbbe7226eee640ced3c50c4874b35723859ef608adb002"}},{"ruleId":"D2","level":"warning","message":{"text":"useEngine.useEngine (cognitive 19): useEngine.useEngine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 12 function literals inside it that branch (lines 35, 157, 180, \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":"packages/app/src/hooks/useEngine.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"948581d2456a2c62ec4da8c9ca938ba47a444122af976ab86c4c22ff87298a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"usePcbAutoFit.usePcbAutoFit (cognitive 19): usePcbAutoFit.usePcbAutoFit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 5). None of this is in the body itself: all 19 points belong to 2 function literals inside it that branch (lines 36, 32). 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":"packages/app/src/hooks/usePcbAutoFit.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"47accb59d6463164bb4cbbf073308a68dbda9805ad36cb05beadb3ca09230382"}},{"ruleId":"D2","level":"warning","message":{"text":"useTimelinePlayback.useTimelinePlayback (cognitive 19): useTimelinePlayback.useTimelinePlayback has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, loops 1 (nesting depth added 4). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 39). 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":"packages/app/src/hooks/useTimelinePlayback.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"31feb7bd406d7f3a81785def4158d1aead8bdada311532cad75e73ebb3aaa120"}},{"ruleId":"D2","level":"warning","message":{"text":"ui-store.useUiStore (cognitive 19): ui-store.useUiStore has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (10 pts), error handling 6, if/else 2, boolean chains 1 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 14 function literals inside it that branch (lines 426, 474, 556, \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":"packages/core/src/stores/ui-store.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a380d0bcb436d2f565f66b631ff448d4baa64ad1f193a11c4d633977f35e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseJoint (cognitive 19): index.parseJoint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 3 (5 pts), match/switch 1 (nesting depth added 8). Of this number, 18 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":"packages/ir/src/index.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8955a03dc4d951a9b50e5965694da1574ebfb313cc4366393fb5de890ed2d13"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect.computeInspection (cognitive 19): inspect.computeInspection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3, boolean chains 2, loops 2 (nesting depth added 4). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/inspect.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6368529f33998084b34f85b645ce482b6c644b8902f44e86729c86dcd751e03f"}},{"ruleId":"D2","level":"warning","message":{"text":"topopt.topologyOptimizeTool (cognitive 19): topopt.topologyOptimizeTool has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, ternaries 6, 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":"packages/mcp/src/tools/topopt.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8f3c32c58df04bbb95c9ee708d3ead25f182c852648fd8779d988a1f3c1bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol-2026.handleTaskMethod (cognitive 19): protocol-2026.handleTaskMethod has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), boolean chains 3, ternaries 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05d8ebc10f3456dbbcd55502e690683c139ff8bdff40addecf44702e9ea798e"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.largestRectangle (cognitive 19): ecad.largestRectangle has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 1 (4 pts), ternaries 1 (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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13496}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dd348ca1b13a1629a9bd5c686807afe6c3d7da45c3aee553f09bf1fafbc138"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderStackup (cognitive 19): render.renderStackup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (5 pts), error handling 1 (2 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"791b1d802a82b90e8c43d9b7363b9d5e81091fdcc2e4e2560cf24e7f125490e4"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.program.command(\u0022convert-conversations\u0022).description(\u0022Convert multi-turn conversations to flat training examples\u0022).requi (cognitive 19): cli.program.command(\u0022convert-conversations\u0022).description(\u0022Convert multi-turn conversations to flat training examples\u0022).requi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 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":"packages/training/src/cli.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"40545ecd5f19b9c4db59558f70ffb6230f47fe22a2bdd76ff88094beda7a75dc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_termview::rasterize::rasterize_grid_line (cognitive 18): vcad_termview::rasterize::rasterize_grid_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 4 (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":"crates/termview/src/rasterize.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bbcd7933480f2fc948e1d723dbcc4f5e5c394a85e1b034faa2ffc1233ed8cc"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_termview::rasterize::draw_tiny_char (cognitive 18): vcad_termview::rasterize::draw_tiny_char has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2 (3 pts), boolean chains 2, 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":"crates/termview/src/rasterize.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"441867cbb702d0fb16c379d940c78f91019df3380161f4bc30b54d93d089f23a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::migrate::remap_bindings (cognitive 18): vcad_app::migrate::remap_bindings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"85386aa072e677cc2ed9b698085dc79e17b31bb518fe206ee592bdda864cdc3f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_app::tools::lower (cognitive 18): vcad_app::tools::lower has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (9 pts), match/switch 3 (5 pts), loops 1 (3 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":"crates/vcad-app/src/tools.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eb8aaa68e437d39fe4751e292ca82ad0967cfeccfd844040b69c43bc2669ed"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_chat::prompt::type_catalog (cognitive 18): vcad_chat::prompt::type_catalog 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":"crates/vcad-chat/src/prompt.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5b4a5125e76b472b951e61c221d80e74d029f2de419cd371e1a716f3e37161"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::run_dfm_ruleset (cognitive 18): vcad::run_dfm_ruleset has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 4 (5 pts), match/switch 2 (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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fd13db7b50ccdb9260e40d5bca0dadf6106a568438b64c6b278f4a54773d17"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::ui::chat::wrap_text (cognitive 18): vcad::ui::chat::wrap_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), 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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1c10134eb98493404e31cc8b4189f3df307976e8a752acd75b5d449f743705"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_diff::decompose (cognitive 18): vcad_diff::decompose has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (9 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-diff/src/lib.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e7bb25cc6c98b47b946fa762a420ef086c119c71a7728ad9120cf13f242626"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::delta::nets_in_message (cognitive 18): vcad_ecad_fabprep::delta::nets_in_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 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":"crates/vcad-ecad-fabprep/src/delta.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4adbc38d00776f07e92976af05762f5a72682f5e9bd3f64b1986b9726581c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::verdict::rip_up_pass (cognitive 18): vcad_ecad_fabprep::verdict::rip_up_pass has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1a854e26b556504584cb5c7c6ed2cb23b129cc607ce5e682b8a9bdc5dcc13c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_copper_to_edge (cognitive 18): vcad_ecad_pcb::dfm::check_copper_to_edge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6 (8 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"41017c80f5b0278a83b3c5f8ae0fe439d0320fa2240480ae1bd89df4c928c4bb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::drc::build_conn_nodes (cognitive 18): vcad_ecad_pcb::drc::build_conn_nodes has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 3 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc7cf3ab246a860f1d89cd2b9705679c208e35c2581dfe70ba305743e42699d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::complete::max_node_disjoint_flow (cognitive 18): vcad_ecad_pcb::router::complete::max_node_disjoint_flow has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (8 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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a2e9c0c97185656d3804943c3f1c605c9dee96bc406fe10791b1f8a6594fb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::legalize::repair_same_net_bypass (cognitive 18): vcad_ecad_pcb::router::legalize::repair_same_net_bypass 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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"81731f1844d8265b38e4e83b3df8db4e429b067c21315adedb7758eccd6d6c15"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::shove::plan_shove (cognitive 18): vcad_ecad_pcb::router::shove::plan_shove has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, 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":"crates/vcad-ecad-pcb/src/router/shove.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c4a6e4d315587b32f544eda821b4c97b5a63dca94ca9ed95f8604a9819c83b"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctx::elaborate_all (cognitive 18): Ctx::elaborate_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 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":"crates/vcad-ecad-schematic/src/hierarchy.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3f40c5ce653e50ef044d01485823805a887cd8672e58c28251d519bb4c24b5"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::calibrate_rules_from_copper (cognitive 18): vcad_ecad_symbols::kicad_pcb::calibrate_rules_from_copper has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6111a5eca6ebe4202fe0d466b22f50d808c26b768b9e20d17e5e6e33287e52ca"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::train::vcad_train_start (cognitive 18): vcad_ffi::train::vcad_train_start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 3, 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ac5b738ecb65ff135824f2bace93978830b39cd64514b2b1aedb7af2102c1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ir::vcode::from_vcode (cognitive 18): vcad_ir::vcode::from_vcode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74c652b3326fbf9587f9a0a7e11bddd18a6e97f171d87343794fc00ee144273"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel::fillet_aabb_is_reasonable (cognitive 18): vcad_kernel::fillet_aabb_is_reasonable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4, boolean chains 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdc2fcf43422685dc7e0bf656a5198ae140b509b1aab701af6ac5449e42f52e"}},{"ruleId":"D2","level":"warning","message":{"text":"Lu::factor (cognitive 18): Lu::factor has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (7 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":"crates/vcad-kernel-acoustics/src/linalg.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad36f3c7d4c75bda69bfc9fd7243daa68cec08b97c9574ce2f7ea34f5429da1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::receipt::compare (cognitive 18): vcad_kernel_acoustics::receipt::compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e49a07ff521808b3add7cbfc6c9b4bc2ae5272821ed9cd937443d3ff8ade6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_adjoint::validate::fd_sweep (cognitive 18): vcad_kernel_adjoint::validate::fd_sweep has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3, boolean chains 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":"crates/vcad-kernel-adjoint/src/validate.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"04293cc9d8773031732a41d3b1a2e00cb470ee4242a365b9e2f3823bbebface0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::freeze::freeze_arc_chains (cognitive 18): vcad_kernel_booleans::freeze::freeze_arc_chains has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f51464a5675b9269531fdbbd1b3dffa67778c43c309814b6439d8baa21580d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::split::find_circle_polygon_intersections (cognitive 18): vcad_kernel_booleans::split::find_circle_polygon_intersections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd288c6713748abb696c36425afa88856022881f3a9b3a345f6ecef406616a3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::trim::point_in_polygon (cognitive 18): vcad_kernel_booleans::trim::point_in_polygon has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a67a8dcf7e2ff5b21f70d8bbdcc3149f398a8a190c3f87bcac54c7b71c30db6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_calibration::canonical_stringify (cognitive 18): vcad_kernel_calibration::canonical_stringify has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dc00694538c026bc6f9c88eae7842ed77b4fc53acc16cb8bb4b1d1b5b1d003"}},{"ruleId":"D2","level":"warning","message":{"text":"Contour2D::contour_to_points (cognitive 18): Contour2D::contour_to_points has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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":"crates/vcad-kernel-cam/src/operation/contour.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3cfdbfe92478fb4fa6800a26bae4a07209085279440caf96b23f623e6216a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Contour::to_geo_polygon (cognitive 18): Contour::to_geo_polygon has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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":"crates/vcad-kernel-cam/src/operation.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1713ea0740638a9b61ce9abbc1074e3f78470cb89960d0f3b05d49134f8a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"TurnProfile::role_of (cognitive 18): TurnProfile::role_of has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/turning/profile.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95a1d6bfcb5d7417fd6861c74546d5d226bbabadb404d818ca4fb17b9b192fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh::new (cognitive 18): Mesh::new has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"39778cd5ca51246840ee1722e6223218cb110e3c88eb0894fe3be3559e023886"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectroSolution::charge (cognitive 18): ElectroSolution::charge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 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":"crates/vcad-kernel-em/src/electro.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e34da73d102370b766098359cb4ac03cbdc2eb13274de52382ed938f4ff2b1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_em::receipt::compare (cognitive 18): vcad_kernel_em::receipt::compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/vcad-kernel-em/src/receipt.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27d2d5e479092b9692377c6d37f32357bac030c27474a25c4863854a4077411"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_enclosure::fit::check_mounting_holes (cognitive 18): vcad_kernel_enclosure::fit::check_mounting_holes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), 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":"crates/vcad-kernel-enclosure/src/fit.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4752fa663ba35394821aed918d21ba08ccf196941164476c964133b0c403a42"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::rolling_ball::gauss_solve (cognitive 18): vcad_kernel_fillet::rolling_ball::gauss_solve has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 3 (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":"crates/vcad-kernel-fillet/src/rolling_ball.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5a5cb1a69bb1d627296a9908119a964e998499528dc00b2a512fa571e5c57d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_flow::conjugate_adjoint::conjugate_gradient (cognitive 18): vcad_kernel_flow::conjugate_adjoint::conjugate_gradient has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), match/switch 2 (3 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":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f64b52aa8b9f50aa939cf53c545121c0fa06a42cb25a362b6b7222ed1cffee"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_flow::receipt::compare (cognitive 18): vcad_kernel_flow::receipt::compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/vcad-kernel-flow/src/receipt.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0848221a52b87a6ce471183afcc7558603a3a8bd9f69493c0eab517b5fbfc262"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_neutronics::receipt::compare (cognitive 18): vcad_kernel_neutronics::receipt::compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/vcad-kernel-neutronics/src/receipt.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb08fd59711965f4c68a7f9b32a27a90bc7aaf5be7f1e20d221b9698594c981"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_optics::trace::intersect_conic (cognitive 18): vcad_kernel_optics::trace::intersect_conic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"crates/vcad-kernel-optics/src/trace.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4df8047d179f1ee98b90bf52aa536f93006fa3acb12827c8e7f40965e558df4"}},{"ruleId":"D2","level":"warning","message":{"text":"StateVector::to_elements (cognitive 18): StateVector::to_elements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 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":"crates/vcad-kernel-orbit/src/state.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d28e2497850191016cb7a7a7edda38dfd76b0162029e2b350447171a26c77d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_particle::optimize::maximize_with_gradient (cognitive 18): vcad_kernel_particle::optimize::maximize_with_gradient has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 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":"crates/vcad-kernel-particle/src/optimize.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"229c2b17e3e18bbc11a8d8cb854cf41ac88455dafdd1eaf404d5d947b0612f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"PhysicsWorld::enforce_joint_limits (cognitive 18): PhysicsWorld::enforce_joint_limits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aefcc52483e7719cdb27950291def909457570750c393fd04b89e0e2741fd10"}},{"ruleId":"D2","level":"warning","message":{"text":"StepWriter::write_orphan_run (cognitive 18): StepWriter::write_orphan_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"076579039ed044903fbbb034a271a531a121a86526dd42c8162a21b772fbd7ca"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::entities::surfaces::revolve_line (cognitive 18): vcad_kernel_step::entities::surfaces::revolve_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), 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":"crates/vcad-kernel-step/src/entities/surfaces.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbf1e1099f9c2c4aa9fa46205cba85b802f8b510b92357a982e0cddd86ef4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::stitch_ring_to_boundary (cognitive 18): vcad_kernel_tessellate::stitch_ring_to_boundary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b676d97499c5889c7afd8dccf56edf8bcec761bb4a13b0236bd766d1f89dffd1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_thermal::receipt::compare (cognitive 18): vcad_kernel_thermal::receipt::compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/vcad-kernel-thermal/src/receipt.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bdd85d8318efa313dc6e6609d41b5834b296567018db655fe48c0b75270893"}},{"ruleId":"D2","level":"warning","message":{"text":"FeSystem::solve (cognitive 18): FeSystem::solve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (8 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":"crates/vcad-kernel-topopt/src/fea.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fba3f1da3e2dc6e71ffbd0d86548baff91185e332aadbc25df94eb4faec245"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::clip_mesh_solid (cognitive 18): vcad_render::clip_mesh_solid has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d5c5ec2bd04283d3d1896c49416f17d72db7e0e5e1bea05a18a1b5fca4ddef"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::render_raster (cognitive 18): vcad_render::render_raster has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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":"crates/vcad-render/src/main.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"1807a7345ec09198395576be69b8c925104be7495c8d755908913e0010a72927"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::render_one_uncached (cognitive 18): vcad_render::render_one_uncached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 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":"crates/vcad-render/src/main.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2a89751137a09915a516662c96013056b907b7bc2f77a07c0197acf4d33a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::support::detect_overhangs (cognitive 18): vcad_slicer::support::detect_overhangs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/vcad-slicer/src/support.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"47226dc451e0827eb73a9d7139d087cd92c493f47521e06bf270f9ea05fc7d36"}},{"ruleId":"D2","level":"warning","message":{"text":"make_figures.fig_heatmap (cognitive 18): make_figures.fig_heatmap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 5 (7 pts), ternaries 1 (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":"docs/compression-math-survey/paper-draft-figures/make_figures.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd09b7f9dc740f8279e38eb6384170a932171a29b20dc51820236560386d528"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentViewer.filletEdges (cognitive 18): AgentViewer.filletEdges has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8, if/else 5 (6 pts), boolean chains 4 (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":"apple/VcadApp/Sources/VcadApp/AgentResources.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff3b3e9cca09c1eac4f308868ee7582a4199b03841d778ba1c7546a5879f4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClearanceSection.body (cognitive 18): ClearanceSection.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/AnalysisPanel.swift"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d044f9da847ed20b71f15652c2495dd1b0747d0608f43beadb0c3aa087325691"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepLink.gunzip (cognitive 18): DeepLink.gunzip has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, loops 2 (4 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":"apple/VcadApp/Sources/VcadApp/AppInstance.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08f98e6a5b282bbd66c8171b84029a474d0553034f35824a032cf5c9953ee11"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.tessellateDocumentParts (cognitive 18): EditorModel.tessellateDocumentParts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1, ternaries 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90d9c7bd3101603f1f65138088be31898d22b5c223bc62c815afe530097039b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.applyBlend (cognitive 18): EditorModel.applyBlend has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 6, boolean chains 3 (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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"75689aca5333f9d50880e2d3f1ff2e29cd204ed2298e7bbe74e80e6a5d9a3ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.applyHole (cognitive 18): EditorModel.applyHole has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 2 (4 pts), loops 2 (nesting depth added 4). Of this number, 17 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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"990df953089dcefdb6e953256c66ece5672f890f540909f32dd4c76103358876"}},{"ruleId":"D2","level":"warning","message":{"text":"BoardPainter.drawArt (cognitive 18): BoardPainter.drawArt has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 3 (5 pts), boolean chains 4, 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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5811c7ef4b77226ab19fc709bb890a8ee4d835a3f47a0367ca85e405870fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"SchematicPainter.draw (cognitive 18): SchematicPainter.draw has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (6 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). Of this number, 17 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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3a0b3759b59e36c55dd0904f14c31bea5db3798c53d311e39b9f35a90576d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsWorkspace.saveFootprintToLibrary (cognitive 18): ElectronicsWorkspace.saveFootprintToLibrary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, loops 2, match/switch 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 4). Of this number, 15 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"969e5fde07e79b1ab4888be86f89b34ab82701cb578f41119a9de7354e89530e"}},{"ruleId":"D2","level":"warning","message":{"text":"DecodedField.planeCGImage (cognitive 18): DecodedField.planeCGImage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (15 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":"apple/VcadApp/Sources/VcadApp/FieldOverlay.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f08e7c6b8ddc5aacd75798f8081cceb3d147a4d6f8ad8593beb3b335099c707"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedOverlayView.body (cognitive 18): ReleasedOverlayView.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 1 (2 pts), 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"06058e21b6edca3769a836f85b80f587539636e8ac94b23e50549bf51e6073c0"}},{"ruleId":"D2","level":"warning","message":{"text":"DockIcon.contentBounds (cognitive 18): DockIcon.contentBounds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5a876cab2b7ea768537f3900886440abbd0d2dd12ef30be364d11e592354bd"}},{"ruleId":"D2","level":"warning","message":{"text":"SweepPlan.sample (cognitive 18): SweepPlan.sample has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (7 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":"apple/VcadApp/Sources/VcadApp/SweepPlan.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"80392d989b8e2fd00f0a91afffda5e3c2bcb2bd538b353371c88cd07fd0c077f"}},{"ruleId":"D2","level":"warning","message":{"text":"TimelineVideoExporter.export (cognitive 18): TimelineVideoExporter.export has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"apple/VcadApp/Sources/VcadApp/TimelineEditor.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee9eb0897a7d7184f35e0b9d2dbc1a97bc483fe609e7d77b9b0a8b14d11a8ee"}},{"ruleId":"D2","level":"warning","message":{"text":"WelcomeThumbnailRenderer.draw (cognitive 18): WelcomeThumbnailRenderer.draw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (7 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":"apple/VcadApp/Sources/VcadApp/WelcomeWindow.swift"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d19ac79eb54ce328aa39118de4d3290c7f4248db150389b52ff3dbbc94118bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasedDesktop.swift.topologyOverlayEntity (cognitive 18): ReleasedDesktop.swift.topologyOverlayEntity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 4). Of this number, 9 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5518b55a287b386bb2708c16d3a49fd7aed08bb68b485ac4be472e73b0b8d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.tessellateDocumentParts (cognitive 18): EditorModel.tessellateDocumentParts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1, ternaries 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"551af4066c4badc3687e9b7e96a233c946d48394892c74c9586fc3ff64f6dbbc"}},{"ruleId":"D2","level":"warning","message":{"text":"build.toolSummary (cognitive 18): build.toolSummary has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 6). Of this number, 17 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab770cfb3a0a283af102ee442c38cf76de5536cf13c61e0d232ec8af68295e"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedFieldOverlay.planeImage (cognitive 18): CompressedFieldOverlay.planeImage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 3 (nesting depth added 9). Of this number, 13 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":"packages/app/src/components/CompressedFieldOverlay.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"52eb0961419e53eed4a654b006b258b0d4e5c3d71848e3d3530d37c941b8334e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportAllPage.ExportAllPage (cognitive 18): ExportAllPage.ExportAllPage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 4, if/else 2, error handling 1 (nesting depth added 5). Of this number, 11 points are the body\u0027s own statements and 7 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":"packages/app/src/components/ExportAllPage.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa7cd908bb08ff3ef8e2b04475cd71c66dbdea3aa0cdca2ae90c2a6b7501ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"Header.Header (cognitive 18): Header.Header has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 6, boolean chains 3, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 415, a function literal at line 375, handleExport, \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":"packages/app/src/components/Header.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edcbc462aa5a159c1f55cdd55768e18d5c8beb9bed04dade337f049c1e4ca72"}},{"ruleId":"D2","level":"warning","message":{"text":"CircuitAnalysisPanel.CircuitAnalysisPanel (cognitive 18): CircuitAnalysisPanel.CircuitAnalysisPanel has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 13, ternaries 3, if/else 2. Of this number, 13 points are the body\u0027s own statements and 5 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3058c5882110ddaa3030be8dc8c208bda744bf103b38599ec863f2f5d0e56e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"toolbar.MoreDropdown (cognitive 18): toolbar.MoreDropdown has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 7, if/else 2 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 8 belong to 3 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":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5e616e55309eb6b0a79c8aae73e5536e44aaa24e78be510d495cb2e044be63"}},{"ruleId":"D2","level":"warning","message":{"text":"backfill.runIdbBackfill (cognitive 18): backfill.runIdbBackfill has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 3 (6 pts), boolean chains 2, 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":"packages/app/src/lib/backfill.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcb22a1a865f9d3600b8e5c1bf469f1535d9739f28fa6325998cfad09d9756a"}},{"ruleId":"D2","level":"warning","message":{"text":"pcb-interference.aabbOfPositions (cognitive 18): pcb-interference.aabbOfPositions 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":"packages/app/src/lib/pcb-interference.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10c96d5011054c9da2b97bdc59522de960d4bbe4368c6a8f6c116b3f10b3ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"save-load.parseJsonVcadFile (cognitive 18): save-load.parseJsonVcadFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 6, ternaries 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":"packages/core/src/utils/save-load.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8665a41d7b228a76980c8fa9187b70d54d765d49233413fb6077ec0c584e70"}},{"ruleId":"D2","level":"warning","message":{"text":"chat-store.useChatStore (cognitive 18): chat-store.useChatStore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 3. None of this is in the body itself: all 18 points belong to 9 function literals inside it that branch (lines 402, 464, 371, \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":"packages/core/src/stores/chat-store.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d427d30cdbb607dee4a68819694a40b1f1baf29768f40e19a69acade1307f948"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.evaluateDocument (cognitive 18): evaluate.evaluateDocument has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (4 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 159). 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"735cacb2e3d7440f6296614361a333ab8fc347dc088ad4d517db3571e307f1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseLight (cognitive 18): index.parseLight has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), boolean chains 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":"packages/ir/src/index.ts"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc27cb8c4101efbec3adba283ea3e7faf884c9ac8f8357ae686c5ec55d2b2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"app-link.deliverPush (cognitive 18): app-link.deliverPush has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/app-link.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b52773f26b6488a45d70c9ebb1e3660b8cd472b61102e0566b1db4bf96cf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"sweep.withComponentBodies (cognitive 18): sweep.withComponentBodies has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 5 (6 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd7143b470cf92073adbc9d91d2783d0d6ebc15daf76c9d6d9b220a67b4a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"print-check.parseMeasurables (cognitive 18): print-check.parseMeasurables has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 2 (3 pts) (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 one function literal inside it that branches (line 160). 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":"packages/mcp/src/tools/print-check.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"769412d490876dae5ec5f89d1a247450444ca0cbd204e0f44b9b3373cf34acee"}},{"ruleId":"D2","level":"warning","message":{"text":"loon-assets.resolveLoonAssets (cognitive 18): loon-assets.resolveLoonAssets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, error handling 1 (3 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":"packages/mcp/src/tools/loon-assets.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"750e82a5849c824d36f29361bb8d599d3064a1925e6edac8730a30d48693ff05"}},{"ruleId":"D2","level":"warning","message":{"text":"gym.gymStep (cognitive 18): gym.gymStep has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (5 pts), boolean chains 4, error handling 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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8515219f3619de8d344ccb900061c6f02e77c5d52f46b1afa4398d95a044f16b"}},{"ruleId":"D2","level":"warning","message":{"text":"next-actions.enrichSuccessResult (cognitive 18): next-actions.enrichSuccessResult has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, error handling 1 (2 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"99333f788e4bf12c625cf0719f181a3da59c5c53f79adbd23fb8bc5d4c3a3763"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.inspectSchematic (cognitive 18): ecad.inspectSchematic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, ternaries 4, loops 2 (nesting depth added 2). 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: 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d1bbee3cddc4bc2e77e7ebaa10b906f5062e571ed8e3ab4be7faaf05e9d6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.getFootprint (cognitive 18): ecad.getFootprint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 6 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9016}}}],"partialFingerprints":{"codehealthFindingId/v1":"189d59e6d21a2e71cb867b97eb41e5dfa5f412a1df9be3e20b6df1cf5d3f7404"}},{"ruleId":"D2","level":"warning","message":{"text":"splitter.splitWasm (cognitive 18): splitter.splitWasm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (6 pts), boolean chains 1, error handling 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":"packages/wasmosis/src/splitter.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fd96487357a74f25b9685ed7a2820226b251d43af441e698fffb8ffd19b5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.analyzeWasmBinary (cognitive 18): cli.analyzeWasmBinary has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 6 (8 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2e93c2e91ddfaa2ac5eaa7d8754e4ae417db041abb5dfb3585e5dfc6fe9963"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad::kit::check_layout (cognitive 17): vcad::kit::check_layout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 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":"crates/vcad-cli/src/kit.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"373e8ef1f457fd19107cc78799eeb1d29e4fc0f449cac2bc29558196b14de095"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveRouter::tighten (cognitive 17): InteractiveRouter::tighten has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 4 (7 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de65df90af3e42103f4d997101ffc8d790bf2d56c8166410fb3858e81a315d2"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveRouter::shove_victims (cognitive 17): InteractiveRouter::shove_victims has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e25b147ce43003a1757d6d6d0e156b47722a21993a0d0def7b48c2e3a2c92f1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::auto::diagnose_unrouted (cognitive 17): vcad_ecad_pcb::router::auto::diagnose_unrouted has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (7 pts), boolean chains 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f5fa0e25e7353f07e7d698b157076d915fb5f15482844fdf9c24a9c3f70e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::flow::cdt::free_parts (cognitive 17): vcad_ecad_pcb::router::flow::cdt::free_parts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, 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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8157a599f2c7a3f8ddb0991780ea87b627f96a7877ebd9b8c480ed67d7c61d1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::sco::cholesky_solve (cognitive 17): vcad_ecad_pcb::router::sco::cholesky_solve has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 1 (2 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"837d620a45b3bf5f961acc75f96c6339b0199d0503fe1bba869caf657f3e6f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_schematic::erc::check_pin_type_conflicts (cognitive 17): vcad_ecad_schematic::erc::check_pin_type_conflicts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), match/switch 1 (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":"crates/vcad-ecad-schematic/src/erc.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f405027365a125a3bff8c8e28d69828676004d47d81c13a3b38b988911d7703"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_mod::parse_single_footprint (cognitive 17): vcad_ecad_symbols::kicad_mod::parse_single_footprint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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":"crates/vcad-ecad-symbols/src/kicad_mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cb33a52d4f85b1fd8bb21d01c9ef5e490b3b4ff806116f61130e3efe09a17a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::parse_design_rules (cognitive 17): vcad_ecad_symbols::kicad_pcb::parse_design_rules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b147c7c6390576baf1a18262a29158d70c7ab73e0df0cdaaf14efd42373c5f1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_embroidery_pes::pec::read_pec (cognitive 17): vcad_embroidery_pes::pec::read_pec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), 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":"crates/vcad-embroidery-pes/src/pec.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"780e2bf54d037a4187b0e576c750bf25295f8dd3784346df863be13c4071ec3c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sheet_build::build_sheet_metal_document (cognitive 17): vcad_eval::sheet_build::build_sheet_metal_document has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4, match/switch 1 (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":"crates/vcad-eval/src/sheet_build.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca57b7a963f075ed3210d50d5abee97d5cfe14d3457c2f40a88c2d43e099bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::sim_extract::extract_shield_spec_from_scene (cognitive 17): vcad_eval::sim_extract::extract_shield_spec_from_scene has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5, match/switch 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c72d0552ded1e0b7b0f26c9545c058121e1c444b6daf5d6e44a937c70d89164"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::mcp::vcad_mcp_app_start (cognitive 17): vcad_ffi::mcp::vcad_mcp_app_start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 1 (2 pts), match/switch 1 (2 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":"crates/vcad-ffi/src/mcp.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f19c7d8bb63fee77ff4a3af3392c66d661f74db0a739522e7e058e26bb37c"}},{"ruleId":"D2","level":"warning","message":{"text":"GearSpec::profile (cognitive 17): GearSpec::profile has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 6 (8 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":"crates/vcad-ir/src/gear.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eca242e656b6aadecbd496cb4ad91885e9c6160e965fda3c7f288ccc967d48f"}},{"ruleId":"D2","level":"warning","message":{"text":"Solid::edge_blend_reported (cognitive 17): Solid::edge_blend_reported has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8945cb06c343760517ee2763404cbf6f615ecb2e475b52ad3199de76f5f80f66"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_acoustics::linalg::solve_block_tridiag (cognitive 17): vcad_kernel_acoustics::linalg::solve_block_tridiag has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 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":"crates/vcad-kernel-acoustics/src/linalg.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5014c1460f6c6db2b2c30444ce57bc1c7467179906756e1d48e861ac441564bd"}},{"ruleId":"D2","level":"warning","message":{"text":"CouplingLedger::completeness (cognitive 17): CouplingLedger::completeness has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), 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":"crates/vcad-kernel-adjoint/src/ledger.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"400ae1556d49792f11d65bf42f42280a26f1b97ede807f5a30ad119159c053fa"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::cyl_band::profile_from_samples (cognitive 17): vcad_kernel_booleans::cyl_band::profile_from_samples has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), loops 1 (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 one function item inside it that branches (build). 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e348c22ad28257d35522219a5eff7c8f7fbca7e1b30b1c223db1876450e8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::mesh::csg::polygons_to_mesh (cognitive 17): vcad_kernel_booleans::mesh::csg::polygons_to_mesh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae44b8d0509ed8eb6ec8f8230df26bee63246fe8d7a9c72efab3e3f55e7b7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::repair::cleanup_loop_spikes (cognitive 17): vcad_kernel_booleans::repair::cleanup_loop_spikes 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":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eae202d431ccfe0e87cefb11a391c5a709b3d15711e17687c03349ad262dfce"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::ssi::marching_ssi (cognitive 17): vcad_kernel_booleans::ssi::marching_ssi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3136f389bb1d5df5ece5dd3de0542a5febc37a9b0e16b07628a9510028183b3"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::validate::difference_removed_nothing (cognitive 17): vcad_kernel_booleans::validate::difference_removed_nothing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 2 (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":"crates/vcad-kernel-booleans/src/validate.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e75569aaa0b1bbc824639f2089a88f1f51b4c05b24611fa07c93aecbbb9a3a9"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::validate::volume_disagrees_grossly (cognitive 17): vcad_kernel_booleans::validate::volume_disagrees_grossly has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), boolean chains 4, 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":"crates/vcad-kernel-booleans/src/validate.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2917d6a68b739036bf6f6365eab590b3b6485b14d778cc3ca10d7f1f20428815"}},{"ruleId":"D2","level":"warning","message":{"text":"TurnPlanner::bore (cognitive 17): TurnPlanner::bore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1, 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":"crates/vcad-kernel-cam/src/turning/ops.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1477af6bd88c3a618714495d9bbf284eb073d960214fbae1ee87a9a362dd16f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::r4_plate_stock (cognitive 17): vcad_kernel_dfm::rules::hobby_mill::r4_plate_stock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), 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, 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb2685947ee78ea4c3be254b80017bebe463df0e68c4773c794a374009afa3e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::optimize::minimize (cognitive 17): vcad_kernel_diff::optimize::minimize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 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":"crates/vcad-kernel-diff/src/optimize.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0102c0a67674758847f36b2723ff6f52f493bff00492d46f43fa0f139fb43222"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanarMagnetostatics::material_cell_map (cognitive 17): PlanarMagnetostatics::material_cell_map has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (8 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. This shape REPEATS in the file: one other method here (PlanarMagnetostatics::sat_cells) 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":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f2fae9a4c182010bf17b358fe98ed96178e273f0fa9da72e120c1cac247255"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanarMagnetostatics::sat_cells (cognitive 17): PlanarMagnetostatics::sat_cells has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (8 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. This shape REPEATS in the file: one other method here (PlanarMagnetostatics::material_cell_map) 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":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ae96cd18b726fc21fe9995ada6c389ce393f5c0eb18c240af8e6b3b610df0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::convergence::analyze_converged_fields_with (cognitive 17): vcad_kernel_fea::convergence::analyze_converged_fields_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/convergence.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"44295a3220d3da8c3b779aa2e76bdb1a69031806027997ecbf85baa61fff26d7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fea::modal::m_orthonormalize (cognitive 17): vcad_kernel_fea::modal::m_orthonormalize has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd44351332f37a50d290da56755b24f4092b3d7a3f9f9187b710c770b91e911"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_naming::same_surface (cognitive 17): vcad_kernel_naming::same_surface has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, 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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3a39443ae87c7982273d81f0d045ccdda412ddc50466590218e26c4884ae9f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_photon_dose::capture::capture_gamma_reports (cognitive 17): vcad_kernel_photon_dose::capture::capture_gamma_reports has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (4 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":"crates/vcad-kernel-photon-dose/src/capture.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82acf977f80468fe8101e2339380f2e554327c589df7cfde5f7274639d20be4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_physics::diff::rollout_gradient_with_anchors (cognitive 17): vcad_kernel_physics::diff::rollout_gradient_with_anchors has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 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":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c76d6efc4115525adc10b901c9fd8d2f4cdd6e55fd6aafefa70a9cf4ebd7eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"CpuRenderer::render_samples (cognitive 17): CpuRenderer::render_samples has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 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":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8266f08aaba5f980bc1da44d9fcf9e7c144a64fe6825d8c4114e1926d8e79e81"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tolerance::receipt::compare (cognitive 17): vcad_kernel_tolerance::receipt::compare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, loops 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":"crates/vcad-kernel-tolerance/src/receipt.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ed6888a96397fd856f4202a3f50d5161f998bafe8449412c92d02878822111"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_wasm::circuit_sim::circuit_from_schematic_wasm (cognitive 17): vcad_kernel_wasm::circuit_sim::circuit_from_schematic_wasm has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4, match/switch 3 (4 pts) (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":"crates/vcad-kernel-wasm/src/circuit_sim.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"c708f5129c3428ae2c4703b4b7c28d7d78f5eba8b1d9007e8031a8f00eb34796"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::recover::extract (cognitive 17): vcad_loon::recover::extract has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/recover.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d64e28a283e6fcf119e0d26bd8802480f49201c3c66916de4669a08385a41d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::variants::parse_table (cognitive 17): vcad_loon::variants::parse_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (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":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a357a19cc878dbe82596c313cf469fdca1120bf40f2c05beec8a031161cbe7da"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStore::handle (cognitive 17): TaskStore::handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 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":"crates/vcad-mcp/src/tasks.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"301096d2c3f11278c1a2d80cbf19478170f1505b8ae672f54a4d7c5039504b44"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_render::orient_normals (cognitive 17): vcad_render::orient_normals has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (9 pts), if/else 5 (8 pts) (nesting depth added 4). 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, 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55e0c2997b585326d55826a32739c33c25d897588c3051ca47c49331fcac687"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_runtime::evaluator (cognitive 17): vcad_runtime::evaluator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 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":"crates/vcad-runtime/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d11c205271b182f9be77b77380bb0d7945ac04e132c9653973ebb5939359d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_sim::rl::train_curriculum (cognitive 17): vcad_sim::rl::train_curriculum has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-sim/src/rl.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5266b1cc2561747e39e5558c1e243e66a854c3c4668d50bbe6abc6388732b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::slice_with_progress (cognitive 17): vcad_slicer::slice_with_progress has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (7 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":"crates/vcad-slicer/src/lib.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be7e28cb60adaa6acf8ad3da951b8edfb961b8698e864807a094c9867022071"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::fit::check_contact_area (cognitive 17): mecheval_grader::fit::check_contact_area has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 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":"mecheval/graders/src/fit.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bca2ac8d27f48eab78f59222984743e35754d2718be19471e5e723a096dfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentCore.engineTool (cognitive 17): AgentCore.engineTool has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 6). 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":"apple/VcadApp/Sources/VcadApp/AgentCore.swift"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46f33f89dc4d61066918af6e00a84eb98e2a8cfbed8ab07d5a9d4b376cf40c5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.chainLoops (cognitive 17): EditorModel.chainLoops has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"77282248c8044d7bb9e562dff88a208f871ddae9f8a93b7b0485bfe41629213b"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeElectronicsView.body (cognitive 17): NativeElectronicsView.body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, ternaries 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9281abbac198c78960674175e3af9b55744daf32906c2d59405020107456b144"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeElectronicsView.statusPill (cognitive 17): NativeElectronicsView.statusPill has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 4 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b778f2f03ba5a9e59a709b458504a69b6e7a132bcf3660015a3821929d9a99"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsWorkspace.commitRoute (cognitive 17): ElectronicsWorkspace.commitRoute has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), loops 1 (nesting depth added 1). 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d592c7740b546e9153d36e4277a010807625d0a814d99b2f4cb779deb5406e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ElicitationBanner.body (cognitive 17): ElicitationBanner.body has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 2, if/else 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":"apple/VcadApp/Sources/VcadApp/Elicitation.swift"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98b421ea0e953b7c4f6134c426758127fe99db559a1ac61ae880d77b7dfbc18"}},{"ruleId":"D2","level":"warning","message":{"text":"KernelMesh.normalsTrustworthy (cognitive 17): KernelMesh.normalsTrustworthy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87d39307d6f2463ea3fa8caf4263a40a7276c184e90b7e3d1c2f011df4fa4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"KernelMesh.normalsTrustworthy (cognitive 17): KernelMesh.normalsTrustworthy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e614444942ce87baa9427e7789a7c95431254fc0c504d427fbfb31272ad98ef4"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureTree.getPartIcon (cognitive 17): FeatureTree.getPartIcon has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17. 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce34b46fd7a244233b70e8c1c870ffe7ebf9f0576236f314672817fccec3f28"}},{"ruleId":"D2","level":"warning","message":{"text":"EcadFeatureInspector.EcadFeatureInspector (cognitive 17): EcadFeatureInspector.EcadFeatureInspector has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (nesting depth added 4). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccbfefa637c59579d6e08c4973d44ad912ca479677afed74c9ac0770232e145"}},{"ruleId":"D2","level":"warning","message":{"text":"useUrlSync.useUrlSync (cognitive 17): useUrlSync.useUrlSync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 1, ternaries 1. None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 86, 52). 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":"packages/app/src/hooks/useUrlSync.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2a115138d545d764f4b8b611044e23c38df469a4a87db7deb32ecaf03aefe1"}},{"ruleId":"D2","level":"warning","message":{"text":"drawing-sheet.buildDrawingSheetSpec (cognitive 17): drawing-sheet.buildDrawingSheetSpec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, loops 2, ternaries 2, error handling 1 (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":"packages/app/src/lib/drawing-sheet.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd4f2dac7c26b25fc7859dc5bd9f9bb8a0244ed8996d833729b49388d015153"}},{"ruleId":"D2","level":"warning","message":{"text":"lazy-with-retry.lazyWithRetry (cognitive 17): lazy-with-retry.lazyWithRetry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (5 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 37). 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":"packages/app/src/lib/lazy-with-retry.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"399883c4408acd373fe866c0d8c0ea294dc45824df91b4ad297196c7c54e4d86"}},{"ruleId":"D2","level":"warning","message":{"text":"document-store.applyLegacyResult (cognitive 17): document-store.applyLegacyResult has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30e430c6533bad5b2805e7c309d64453d797b85535b6d7b8bd1b6078a93980f"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.expandPartInstances (cognitive 17): evaluate.expandPartInstances has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (5 pts), error handling 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d007fc097b2c9e51838b2c310ea72d4775089433fa4d83fb4d16f154733396ce"}},{"ruleId":"D2","level":"warning","message":{"text":"clearance.clearanceReceiptClaims (cognitive 17): clearance.clearanceReceiptClaims has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 4). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 917). 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa24bf98b8497d7e7d22198e9799191a74fd4d45734829a3def21de22f8979c"}},{"ruleId":"D2","level":"warning","message":{"text":"registry-dispatch.normalizeNodeRefs (cognitive 17): registry-dispatch.normalizeNodeRefs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b16570bfd43070cae93c0ab328420d3da93ece757f000421c633f1e9eac515b"}},{"ruleId":"D2","level":"warning","message":{"text":"FulfillmentBroker.quote (cognitive 17): FulfillmentBroker.quote has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 3 (4 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 4). 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, 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":"packages/mcp/src/fabricate/broker.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f645c5d5871d8710c5ab6888faa6b3565a37d45e83ac794a69a44ad8942d71f"}},{"ruleId":"D2","level":"warning","message":{"text":"preview.sceneBounds (cognitive 17): preview.sceneBounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5725540f585931bb36175ba98e1f766e6737ed0e55fe5c31821ca9a628aa3c09"}},{"ruleId":"D2","level":"warning","message":{"text":"preview.decimateMesh (cognitive 17): preview.decimateMesh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (6 pts), boolean chains 3 (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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba196776939280e58ee696a636cf0aae1b19ac261e96a11e0dcee1190f3585f5"}},{"ruleId":"D2","level":"warning","message":{"text":"joint-range.overlap (cognitive 17): joint-range.overlap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e13fd5d690b5d6e647e520b7daa6fda291fc89c89542347caf6c465f686ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"schematic-hierarchy.flattenSchematic::elaborateAll (cognitive 17): schematic-hierarchy.flattenSchematic::elaborateAll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (5 pts), loops 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. This shape REPEATS in the file: one other method here (schematic-hierarchy.flattenSchematic::elaborate) 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":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cee117a7f961fb752795c6815d610aa29cdfff37b159fd690c5bb731f15c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.addMotorWinding::buildFeed (cognitive 17): ecad.addMotorWinding::buildFeed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, loops 3 (6 pts), boolean chains 2, ternaries 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. This shape REPEATS in the file: 2 other methods here (ecad.addMotorWinding, ecad.addMotorWinding::feedClear) 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12050}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e1e6bd5d62c6f03c6f434ecb1a986299116cf97724871936013cbe3ea96572"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.splitAtRepeatedVertices (cognitive 17): ecad.splitAtRepeatedVertices has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13260}}}],"partialFingerprints":{"codehealthFindingId/v1":"545f2e431f2f4d8910b9ba9eb51ff9cd5b8bf59f0cd9c4257bb2fada2146be5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.copperAreaByLayer (cognitive 17): ecad.copperAreaByLayer has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). 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, 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13895}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3a314d01d321419453d9d427e0ca9aaad4fe6bab8ef9c8a928fd4a377ef1f2"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog.getChangelog (cognitive 17): changelog.getChangelog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 7 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":"packages/mcp/src/tools/changelog.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d7d8133dd4f17517dd94628bd9c54db9a804e2a8884dfa39ed9677cef3590b"}},{"ruleId":"D2","level":"warning","message":{"text":"source-parser.parseFunction (cognitive 17): source-parser.parseFunction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d419248bed1b8b9e3f53824305af9971dc941b3863f095e1276a93c9e8b8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphicsOutput::display_halfblock (cognitive 16): GraphicsOutput::display_halfblock 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. This shape REPEATS in the file: one other method here (vcad_termview::output::buffer_to_halfblock) 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":"crates/termview/src/output.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5144ce89c2f55837e475c21bd9cb409c7485ed5c4f40db15a2520e2da87ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalCaps::detect (cognitive 16): TerminalCaps::detect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 2 (4 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":"crates/termview/src/terminal.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d00a4cf3fd031a55dada581b04b10fef01ed3b0750d3d3d69c101e01012b296"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_termview::output::buffer_to_halfblock (cognitive 16): vcad_termview::output::buffer_to_halfblock 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. This shape REPEATS in the file: one other method here (GraphicsOutput::display_halfblock) 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":"crates/termview/src/output.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"706eb8dd46e0b6b34d60d9572daaaba3c3bb5f64f5ede2fb5e55f859e4c8cc15"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_fabprep::verdict::stitch_zones (cognitive 16): vcad_ecad_fabprep::verdict::stitch_zones has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 5 (7 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e439e65ae9c013b697bbe1a472b388c36d22dd9d70c51f980d88724f2f7a321e"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessMarket::solve (cognitive 16): AccessMarket::solve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 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":"crates/vcad-ecad-pcb/src/router/flow/access.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce2ecfd8234c9f6c0972e4b3586bdb6c7dba86425cc7da045a972d898f2fd1f"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowGraph::log_overflow (cognitive 16): FlowGraph::log_overflow has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 1 (3 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec273831fc3b2ce81884d5e45df40492d2455b79dea1c982e56260d7691edb15"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::copper_pour::same_net_anchors (cognitive 16): vcad_ecad_pcb::copper_pour::same_net_anchors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 5 (7 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":"crates/vcad-ecad-pcb/src/copper_pour.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a61e5bdf1278a03da41826038e4745b76a4890a42ef04b26a24aa42f5ef7bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_min_drill (cognitive 16): vcad_ecad_pcb::dfm::check_min_drill has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a4149c5a8047389939632ce8963c75b6dab4699aeb134a695947cbf17dd9af"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::dfm::check_hole_to_hole (cognitive 16): vcad_ecad_pcb::dfm::check_hole_to_hole has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a695c7dc98d22cd5a7f73ea7bfe802dca8d9251b117250debbeb550f17d8b56"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::complete::bfs_path (cognitive 16): vcad_ecad_pcb::router::complete::bfs_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fae679385362fa09c03feb274ee9261ecc4a27a9de7f4931c48f3aeab17eef7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_pcb::router::global::plan_with_scarcity (cognitive 16): vcad_ecad_pcb::router::global::plan_with_scarcity has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 5 (7 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":"crates/vcad-ecad-pcb/src/router/global.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"622629794d0a80f05389af8baf54cb29455edca1a39d61306f8ae6d5e5f489b1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_pcb::parse_zone_on (cognitive 16): vcad_ecad_symbols::kicad_pcb::parse_zone_on has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts) (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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f300468000ff4d80a6ee6c2013fc761dfd836778e0c346796469ed3b49d54782"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ecad_symbols::kicad_sym::parse_symbol_lib (cognitive 16): vcad_ecad_symbols::kicad_sym::parse_symbol_lib has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 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":"crates/vcad-ecad-symbols/src/kicad_sym.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"29377037e8b3353102da8e0e171b6133bb7743fac113af407df60df8fb6f2c48"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_embroidery::digitize::running::running_stitch (cognitive 16): vcad_embroidery::digitize::running::running_stitch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 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":"crates/vcad-embroidery/src/digitize/running.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6d7d5f8e2b070e5c7d53d6dd2ca2cd1170d06a82631d2131c5f59d3cf8d6c6"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_eval::kinematics::solve_forward_kinematics (cognitive 16): vcad_eval::kinematics::solve_forward_kinematics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 5 (6 pts), match/switch 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":"crates/vcad-eval/src/kinematics.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"07724cec324e17cf0c2c001f17d4dff34b5d70b148d3edf4a477bcda8e4fa24c"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_ffi::dfm::check_document (cognitive 16): vcad_ffi::dfm::check_document has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 4 (5 pts), if/else 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":"crates/vcad-ffi/src/dfm.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ec1d660fe2d9339e86b2efe34d6eaa787e79d3adf5fe1bf2b251d20ae2f04d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel::collect_fillet_target_edges (cognitive 16): vcad_kernel::collect_fillet_target_edges has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fa9d477a89d2257b7672a8ab57882460c7d1e91adb4c9999ff77224bf572e0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_assembly::joint_range::check_joint_range (cognitive 16): vcad_kernel_assembly::joint_range::check_joint_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4, boolean chains 2, match/switch 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":"crates/vcad-kernel-assembly/src/joint_range.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca7d6a60f33080d1eae16ed10b820ba392ecba78adbd950b2f521492f4a43a0"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::mesh::csg::snap_boundary_vertices (cognitive 16): vcad_kernel_booleans::mesh::csg::snap_boundary_vertices 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99bc244d9a84de3accbfc603c55d1d057ec6d6c1f6470f1a525d907cbe4c54a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_booleans::trim::sample_and_trim (cognitive 16): vcad_kernel_booleans::trim::sample_and_trim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9595067f734afbc00a9909fd3d4a4003d5e627e78238315afa8900709af089a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Requirement::ztip (cognitive 16): Requirement::ztip has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"966cc8fe7fa1d3a163b294a642f61af387a3ba74f1f6735bf5033abeaac386de"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_constraints::residual::get_point_coords (cognitive 16): vcad_kernel_constraints::residual::get_point_coords has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ba305faf25775d35a4df56209bdcb1d2d96bb9e079365ead0527d29184a9c7"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_constraints::symbolic::sym_point (cognitive 16): vcad_kernel_constraints::symbolic::sym_point has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/vcad-kernel-constraints/src/symbolic.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e412e15208f901935e719f77b63934162707d1f5a97b356bbd9e3ae165e29f78"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::inside_other_shell (cognitive 16): Grid::inside_other_shell has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"04db661c30e722bcf7a321b765d10648e1c898ce43d6387ac2db69b2307e4987"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_dfm::rules::hobby_mill::concave_runs (cognitive 16): vcad_kernel_dfm::rules::hobby_mill::concave_runs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f99fb6709df16df0c8f29de10dc6f69548b6c7082fa2529109c867822f6306"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::implicit::row_pullbacks (cognitive 16): vcad_kernel_diff::implicit::row_pullbacks has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/implicit.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f417c73150c8c5ed6127d3e6def5484ceb5fdd6723342789d5031f8e2562e7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_diff::seam::carry_rows (cognitive 16): vcad_kernel_diff::seam::carry_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), boolean chains 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":"crates/vcad-kernel-diff/src/seam.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"062cf4583987aa64ec4a6cc4c6ee37c74098eed76172151f63a6007ba70845c1"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::detail::clip_edge_to_rect (cognitive 16): vcad_kernel_drafting::detail::clip_edge_to_rect 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":"crates/vcad-kernel-drafting/src/detail.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc200e30603180efe71ea7a9e81a25047bf56d6174ef07ed9855e89be876c13e"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_drafting::section::clip_line_to_polygon (cognitive 16): vcad_kernel_drafting::section::clip_line_to_polygon has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b68e0c58fff45cb5d1ee55fbda5b98692df02bd2391dae6e6bbc62ffa5418"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_enclosure::mesh::extract_enclosure_features (cognitive 16): vcad_kernel_enclosure::mesh::extract_enclosure_features has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 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":"crates/vcad-kernel-enclosure/src/mesh.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"363a158f3ccbe6b6547e24dc6638cafe5aea637ef697128e5f6412337bd8bee4"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::chamfer::chamfer_all_edges_checked (cognitive 16): vcad_kernel_fillet::chamfer::chamfer_all_edges_checked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, 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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dd6d1a0953329af590b67e7969fabfede55a17444f893229adfd2fa69f9158"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_fillet::closest_point::closest_point_uv (cognitive 16): vcad_kernel_fillet::closest_point::closest_point_uv 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":"crates/vcad-kernel-fillet/src/closest_point.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7aa7d5f9614f9ea74359a5c80440f9624aa5c4bd4bb9e6094f0337d59b555a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_geom::invert_surface_point (cognitive 16): vcad_kernel_geom::invert_surface_point has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, 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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad6fdd8d06d3858887dc9b58d80f08d28bc781eb887c6a747fc25d5dac96e77"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_neutronics::transport::distance_to_boundary (cognitive 16): vcad_kernel_neutronics::transport::distance_to_boundary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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":"crates/vcad-kernel-neutronics/src/transport.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafea42a0aeca12b1a5eaecca113e46bedd9b4cb81f2e1124b97a95f252b5b8d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_optics::spot::analyze (cognitive 16): vcad_kernel_optics::spot::analyze has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), match/switch 1 (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":"crates/vcad-kernel-optics/src/spot.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12877a7f0f483e10db4c3bdb282c3d3ce7feba08fe778a428731035268770d7"}},{"ruleId":"D2","level":"warning","message":{"text":"RobotEnv::apply_episode_randomization (cognitive 16): RobotEnv::apply_episode_randomization has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (6 pts), boolean chains 1 (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":"crates/vcad-kernel-physics/src/gym.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9723bc67ab8e1a1d38951cc653797f76a10341a376588bd5b3f13e525a83740"}},{"ruleId":"D2","level":"warning","message":{"text":"RobotEnv::apply_action (cognitive 16): RobotEnv::apply_action 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":"crates/vcad-kernel-physics/src/gym.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bcf7b4ee5be13ba51d58c94cd89671dae7ddb601ddb772a7b979eabd24790b"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_raytrace::trim::repair_pole_vertices (cognitive 16): vcad_kernel_raytrace::trim::repair_pole_vertices has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 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":"crates/vcad-kernel-raytrace/src/trim.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d72ef5694534177a1c18f24d79fd0f6d0b6b6bd5d4349c1115876a3b0e092"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_raytrace::trim::synthesize_planar_cap_polygon (cognitive 16): vcad_kernel_raytrace::trim::synthesize_planar_cap_polygon has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-raytrace/src/trim.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a614d68ee8f020dee2fd7b6547934fcafacf54b090a5a9d92b897e371ff09f"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_shell::merge_loops (cognitive 16): vcad_kernel_shell::merge_loops has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (5 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b10b31c539fdc61b6fd2e9e936f7f6faef2c83ab204f1e6984d0b8dd9e117a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_step::entities::curves::parse_bspline_curve_any (cognitive 16): vcad_kernel_step::entities::curves::parse_bspline_curve_any has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abe7f7aa74b07d6383e3b8e0d766fd99436846f884542f9a05e5a1c7b357a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::triangulate_polygon_with_holes (cognitive 16): vcad_kernel_tessellate::triangulate_polygon_with_holes has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 2 (5 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3483}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b254a4362e69d82cb59a91839c76dc8d993c7df16ce7d2077d823219bd3565"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_kernel_tessellate::clearance::closest_pt_segment_segment (cognitive 16): vcad_kernel_tessellate::clearance::closest_pt_segment_segment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a5db5d1c7227cfd742b6aa7cf3e253ac68df109680ed2e2f3b389b5ea4e6fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Distribution::check (cognitive 16): Distribution::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tolerance/src/dist.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b95e620b1d1b56c0a41abf030da63f052300f544569e588099f96189be6422"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvertCtx::apply_material_physics (cognitive 16): ConvertCtx::apply_material_physics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 1 (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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e27c9c31c4dadae1f909f647c8d2c2cec424ca275860abbc256a70a55e174"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_loon::variants::parse (cognitive 16): vcad_loon::variants::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2, match/switch 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":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5207775274a82cee6f1147930adf0830a7a2ce49c59fb073ead8029a6b17739d"}},{"ruleId":"D2","level":"warning","message":{"text":"vcad_slicer::slice::triangle_plane_intersection (cognitive 16): vcad_slicer::slice::triangle_plane_intersection has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), loops 1 (nesting depth added 1). 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":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea36742b190be8efdc8af8a3743e27e3a6e58736d62bb7743a3125ef4fa28697"}},{"ruleId":"D2","level":"warning","message":{"text":"PrinterStatus::from_mqtt_payload (cognitive 16): PrinterStatus::from_mqtt_payload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15 (16 pts) (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":"crates/vcad-slicer-bambu/src/status.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e8e83f19e61427c0c36036a7c9c4ddacf14a07542956307a8f14be402a302a"}},{"ruleId":"D2","level":"warning","message":{"text":"mecheval_grader::suite_c::gauss_solve (cognitive 16): mecheval_grader::suite_c::gauss_solve has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"776a557ab4a11492d6afe61da11865c4db7b9f2eedbeb873559c4dbfb8f0f6f4"}},{"ruleId":"D2","level":"warning","message":{"text":"make_demos.at_rate (cognitive 16): make_demos.at_rate has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 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":"docs/compression-math-survey/paper-draft-figures/make_demos.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"560432a8b308bd43b9710e28ed6acf234ecc05aba2c771631ef10588867ea15b"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentEdits.adoptDocument (cognitive 16): AgentEdits.adoptDocument has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 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":"apple/VcadApp/Sources/VcadApp/AgentEdits.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde4d7d3293fa3715d675502016101e565133dbcbe7ce487888daffcc115452b"}},{"ruleId":"D2","level":"warning","message":{"text":"AppStore.selection (cognitive 16): AppStore.selection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 4 (6 pts), loops 1 (2 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":"apple/VcadApp/Sources/VcadApp/AppStore.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ab57955c740139e0404963cbc6a71b8a76664e5e6202e7f2798ae949e56cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"CamJobPanel.body (cognitive 16): CamJobPanel.body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 2 (4 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":"apple/VcadApp/Sources/VcadApp/CamJobPanel.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c125ffe6c4f5e5660678127b242602ba95d52601ff6252d594b65b475d2db1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentEngine.send (cognitive 16): DocumentEngine.send has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 1, ternaries 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":"apple/VcadApp/Sources/VcadApp/DocumentEngine.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"55589d5d829cd70f94018afbccb6c36e3fe91d9e1ec2ae90db90d83841c17da1"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.beginGizmoDrag (cognitive 16): EditorModel.beginGizmoDrag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 2 (4 pts), match/switch 1 (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, 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"089895e41031e1178b49dee977c82fe645e0ba59804d5988dc2476b3be5aa279"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.featureHandles (cognitive 16): EditorModel.featureHandles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 2 (3 pts), match/switch 1 (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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da4c4d897eb8719a562e6a9fb322702fa7e3568fae5a70b7f37f5cb85a83255"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.faceProfile (cognitive 16): EditorModel.faceProfile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6458848c0597f7202855b52eaf4dbbccb1302fc1f6e3f13618fc02735c1f23"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.fillPartMeshes (cognitive 16): EditorModel.fillPartMeshes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 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":"apple/VcadApp/Sources/VcadApp/DocumentRuntime.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b5c0fea47ca12f42e64974366c9efeebaada2b4ae0e823d0fa055b003196fb"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.documentBytes (cognitive 16): EditorModel.documentBytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6 (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":"apple/VcadApp/Sources/VcadApp/PoseStudio.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4b140105e98f1a88f93607b4f4d6fbc2b677a8fcabcfb4d79b852e31c59864"}},{"ruleId":"D2","level":"warning","message":{"text":"BoardPainter.drawRoutePreview (cognitive 16): BoardPainter.drawRoutePreview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (6 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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"235f5bc40d386272f5b8b13875523b2f3dd93dc2645dff3c791b9b3248f750b0"}},{"ruleId":"D2","level":"warning","message":{"text":"SchematicPainter.drawBox (cognitive 16): SchematicPainter.drawBox has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 2 (4 pts), boolean chains 2, 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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbe982e0165b514c441e785b7adf607688f8b77febf3e38495b7d803c92dccd"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsCanvas.bodyAt (cognitive 16): ElectronicsCanvas.bodyAt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d72a1079f4cfbd7a3c0b4ddc4c1bbe8fec74ebc259626aade4abe2d2148c52"}},{"ruleId":"D2","level":"warning","message":{"text":"ElectronicsWorkspace.buildSchematicFromBoard (cognitive 16): ElectronicsWorkspace.buildSchematicFromBoard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 6). Of this number, 14 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa67487316c2a49ef2896c79888b26008a99b66c0b1be7f07cf1737dfb212fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PathTraceNSView.tick (cognitive 16): PathTraceNSView.tick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 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":"apple/VcadApp/Sources/VcadApp/PathTracer.swift"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31642d91e78daf9f5576c6f7851cd68fbcac4b8b391056137c5f3fac19af03c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseWindowController.show (cognitive 16): ReleaseWindowController.show has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 3, match/switch 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62850d8fa7c5a46990c002db7807546199d533afca41a2d49f9fb91076ff0fa"}},{"ruleId":"D2","level":"warning","message":{"text":"SketchSession.filletTap (cognitive 16): SketchSession.filletTap has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, ternaries 4, if/else 3, loops 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35eb44384dfa390970a229f2def11dd399b7b56a134dfdcf4836faa83c4a4bb"}},{"ruleId":"D2","level":"warning","message":{"text":"RingsAtCard.pitchRow (cognitive 16): RingsAtCard.pitchRow has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 5 (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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc2af2b0c17388a01771d26b5bd0065abeee174d387496f246247d2a29d3c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldOverlay.swift.solidMask (cognitive 16): FieldOverlay.swift.solidMask has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), boolean chains 2, if/else 1 (2 pts), ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/FieldOverlay.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf880f4f03a2c5707686644a73bf068fe72478b3016006aa20dc09689e208f64"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldOverlay.swift.makeFieldEntity (cognitive 16): FieldOverlay.swift.makeFieldEntity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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":"apple/VcadApp/Sources/VcadApp/FieldOverlay.swift"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f92e7fe718f3afa9f3956351a506b40d0ea039942bed7134f681576d1dd23"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentVolume.body (cognitive 16): DocumentVolume.body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (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, 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":"apple/VcadVision/Sources/VcadVision/DocumentVolume.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"104bf47610d413f367ce56adcc53a9877c5490068928b5a265f97df17430a07d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorModel.beginGizmoDrag (cognitive 16): EditorModel.beginGizmoDrag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 2 (4 pts), match/switch 1 (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, 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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d341123f814e989956a4d970aad669c2a36290db2f2b558d61fc39bdfdb23ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"launch-animatic.html.stator (cognitive 16): launch-animatic.html.stator has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), ternaries 1 (4 pts), if/else 2 (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":"docs/launch/launch-animatic.html"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8192ddfbea1a23791d00580b6407fec8e864961ee012c11bae42b689d1845ca"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomInstances.AtomInstances (cognitive 16): AtomInstances.AtomInstances has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 4, boolean chains 2, ternaries 2 (nesting depth added 1). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 308, handlePick, a function literal at line 363, \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":"packages/app/src/components/AtomInstances.tsx"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a36c0427800b8ea9f902b0a49193409b97274e6c286a9cc77d0159fe14a9560"}},{"ruleId":"D2","level":"warning","message":{"text":"FeatureTree.FeatureTree (cognitive 16): FeatureTree.FeatureTree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 1. Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (handleDragEnd, a function literal at line 1198, a function literal at line 1210, \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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa629923caa2ac7ed61bfdf64e29dceac62ffb39d17d497ff5db67b038d2af91"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyboardPrefsPanel.KeyboardPrefsPanel (cognitive 16): KeyboardPrefsPanel.KeyboardPrefsPanel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 4 (5 pts), ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 76, 62, 78, \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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"857921af1a197e6f225b1067692dfbb1ed7ffc924260b496b0ca9c89c9b66a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyboardPrefsPanel.CommandRow (cognitive 16): KeyboardPrefsPanel.CommandRow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (6 pts), if/else 1 (nesting depth added 3). 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc75891357d54177ea6c7d375f005f1b746098552ad001832dbf42ba4679897"}},{"ruleId":"D2","level":"warning","message":{"text":"Header.RayTracingSubmenu (cognitive 16): Header.RayTracingSubmenu has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8 (9 pts), if/else 5, boolean chains 2 (nesting depth added 1). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (qualityLabel, a function literal at line 298, a function literal at line 286, \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":"packages/app/src/components/Header.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"792bf32a29ee90e2ddc7c76a243104e91862d2eb600bd77d3f821d19162ed8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineProperties.InlineProperties (cognitive 16): InlineProperties.InlineProperties has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, ternaries 5, if/else 4, 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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4ababf79c4384a6ea0d7d7cd2755ada6c405d7c0de5451fc123ad717cff195"}},{"ruleId":"D2","level":"warning","message":{"text":"ParametersPanel.ParametersPanel (cognitive 16): ParametersPanel.ParametersPanel has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (6 pts), loops 3 (5 pts), if/else 2 (3 pts), ternaries 2 (nesting depth added 6). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 414, 396, 444, \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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b18cd5a7cf4d0e1c5186edac77cd8f6d9d47c5e745b7b4e914baf6539bddbe0"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyPanel.SubFeatureInspector (cognitive 16): PropertyPanel.SubFeatureInspector has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1353, 1365). 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7c56430a3b8b38a217f2cfdb30d1598f71c00dee668c1bb5e8a7a41d53b3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"PcbConstraints3D.anchorPos (cognitive 16): PcbConstraints3D.anchorPos has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 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":"packages/app/src/components/electronics/pcb3d/PcbConstraints3D.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43714e507831d9e1765add8f906772cb0444ff66f7a1d093859e34ff5150879"}},{"ruleId":"D2","level":"warning","message":{"text":"PcbBoardMesh.PcbBoardMesh (cognitive 16): PcbBoardMesh.PcbBoardMesh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 5). 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 20, 66, 57). 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":"packages/app/src/components/electronics/pcb3d/PcbBoardMesh.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6de286425567056018c938029a5a62939c9f35283d204e9edb7f4755073e10"}},{"ruleId":"D2","level":"warning","message":{"text":"NewPcbDialog.NewPcbDialog (cognitive 16): NewPcbDialog.NewPcbDialog has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), ternaries 3 (nesting depth added 1). 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 45, handleCreate, a function literal at line 113, \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":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27325faa52e537af989308580ddadbe4451fa3c3e27a021766fd76d7843fb80"}},{"ruleId":"D2","level":"warning","message":{"text":"Sparkline.Sparkline (cognitive 16): Sparkline.Sparkline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 29). 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":"packages/app/src/components/footer/Sparkline.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a45dd5b66a2e9ce2e4b5372fed9b501d46c40e7a5bdc04d73c1ded6d3147a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"DfmOverlay.DfmOverlay (cognitive 16): DfmOverlay.DfmOverlay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 3 (4 pts), boolean chains 3, error handling 1, match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 43, a function literal at line 74, severityIcon, \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":"packages/app/src/components/print/DfmOverlay.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4647a91d2999b78ffb05a1b29c0f5c432ab6096df3a2f7696d31dea0fad96ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"ActionResultCard.ActionResultCard (cognitive 16): ActionResultCard.ActionResultCard has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (7 pts), boolean chains 6, if/else 3 (nesting depth added 1). 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, 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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da0c94f2c58fb312b0f6d5c631a8271d3d1f27846ed6b1cf2573ba4b831063f"}},{"ruleId":"D2","level":"warning","message":{"text":"useCircuitSim.useCircuitSim (cognitive 16): useCircuitSim.useCircuitSim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, error handling 2 (3 pts) (nesting depth added 1). None of this is in the body itself: all 16 points belong to 5 function literals inside it that branch (lines 41, 78, 62, \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":"packages/app/src/hooks/useCircuitSim.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"413a3b4a8cb788d940ffe269711380516da2865aec3f4e41c24e1fa66a826592"}},{"ruleId":"D2","level":"warning","message":{"text":"circuit-analysis.formatSiValue (cognitive 16): circuit-analysis.formatSiValue has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 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":"packages/app/src/lib/circuit-analysis.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f8a7d0c20fbb5ea4ab2351c86f0cd3b48fd09f98f28c4af99777850a5f1159"}},{"ruleId":"D2","level":"warning","message":{"text":"compressed-field.loadCompressedField (cognitive 16): compressed-field.loadCompressedField has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 1 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 3). Of this number, 14 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":"packages/app/src/lib/compressed-field.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e225dc6e9cd35fb72e449a3641321859cb12fc90b948bde3833ba42f6263c70"}},{"ruleId":"D2","level":"warning","message":{"text":"pcb-autoroute.autorouteRatsnest (cognitive 16): pcb-autoroute.autorouteRatsnest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 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":"packages/app/src/lib/pcb-autoroute.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b17f9e51a9c63282ab175c6b2f3451820492f8507aed77cd70e2848c9427dc"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandRegistry.getTypeCatalog (cognitive 16): CommandRegistry.getTypeCatalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (5 pts), loops 2 (4 pts), ternaries 1 (4 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":"packages/core/src/commands/registry.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4196b727bd1e89bb9c866fc59767594658e615cb0e79f01c5a02ef90af6d87f"}},{"ruleId":"D2","level":"warning","message":{"text":"sketch-store.useSketchStore.addPoint (cognitive 16): sketch-store.useSketchStore.addPoint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0aa9d813659e930c7a8161ee2b74bc7a96f2ecad872e2c5edd04d36c9434ab"}},{"ruleId":"D2","level":"warning","message":{"text":"measure.measure (cognitive 16): measure.measure has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (6 pts), if/else 4 (5 pts), error handling 3, boolean chains 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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77750b352281c394061db28bd91f22b1cc9c7ff1aea18dae1ef8ba57055fd3d"}},{"ruleId":"D2","level":"warning","message":{"text":"claims-ledger.verifyLedgerClaims (cognitive 16): claims-ledger.verifyLedgerClaims has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (5 pts), boolean chains 2, 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"5498b0d3f184fa31f37047a6eb42f710c56748f6cbabe627d5c4e834dbaf4f76"}},{"ruleId":"D2","level":"warning","message":{"text":"batch-edit.resolveSymbolicRefs (cognitive 16): batch-edit.resolveSymbolicRefs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). Of this number, 12 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":"packages/mcp/src/tools/batch-edit.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3a6123339f904932096e5074f946fe961e6be04ea2dcfe6efcd62048babc20"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.lengthMatchTraces (cognitive 16): ecad.lengthMatchTraces has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 5, boolean chains 2, loops 1 (2 pts) (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 3 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a59578ae43ff9a51915d49effe344410ebc64217f99a41b302de3fe383f101"}},{"ruleId":"D2","level":"warning","message":{"text":"ecad.solveDense (cognitive 16): ecad.solveDense has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6793}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bca16a9dac1319fdc70458afd9623cd40178a7d1dd68075198f29343d4e41c"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderRatsnest (cognitive 16): render.renderRatsnest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 5 (6 pts), boolean chains 2, error handling 1, loops 1 (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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"221d9b8e365e3c938a0f38202ac67b2d6558063292854bbe7859cdbbfacb7658"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runBuild (cognitive 16): cli.runBuild has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 2). 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: 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"950627f23c40d4fb8e826de295ee69391c279200bec62757d20f4df42b104f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"pcbFigure (cognitive 16): pcbFigure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), loops 4 (5 pts), ternaries 2 (4 pts), boolean chains 1, error handling 1 (nesting depth added 4). None of this is in the body itself: all 16 points belong to 6 function items inside it that branch (buildBoard, buildBoard::side, wake, \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":"www/public/kit/gallery.js"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"03081612c7f5007fee81728c9382584d4ccde80bb26dfad5ef736bc3f16c9ced"}},{"ruleId":"D2","level":"warning","message":{"text":"hero::onmessage (cognitive 16): hero::onmessage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 1 (2 pts), boolean chains 1 (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, 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":"packages/app/public/launch/launch.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4957912a5f0f764df58cd73ee2d84847e8df207d59fa6ae0352978dd78d26935"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/ecad.ts: FileTooLong \u2014 10824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10324 over it, 21.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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69e875981b41b840d5dea6beb3886c2b7020132472184710945f775d74f9f25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_wasm.__wbg_get_imports: FunctionTooLong \u2014 __wbg_get_imports runs 1423 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1323 over it, 14.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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":9345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bcb144e2e0f3a8c2b3eaf43b5c66e65f3dddb2a9870c4a5d3742204df1153e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 6831 significant 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 6331 over it, 13.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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c775a1715de3f51406a797c002b2cb10fca1f46ff5dd6416c3ae3ed8f82cc571"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorModel: TooManyMethods \u2014 378 methods, declared across 16 files: VcadApp/Editor.swift (228), VcadApp/DirectManipulation.swift (35), VcadApp/AssemblyModel.swift (31), VcadApp/PoseStudio.swift (18), \u002B12 more file(s). The bar is 30 methods; this is 348 over it, 12.60\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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ecc9fcc3433d6575e2b3f44e7c7a8487aaf0994ac823c8548c40e41edfcbd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kernel-wasm/vcad_kernel_wasm.js: FileTooLong \u2014 5762 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5262 over it, 11.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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ab5eb26fb04a6c839b9135764579b4821669de8cc25b192702eb4749f56252"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 5481 significant 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 79 free functions. The bar is 500 significant lines; this is 4981 over it, 10.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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afcb84ce14f507a1437b75d3cf0357eea85ab3a71f949ede0da768256963d13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::materializer::materialize_feature: FunctionTooLong \u2014 vcad_app::materializer::materialize_feature runs 948 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 848 over it, 9.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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b477be811e743ffa45ac59f72c5cd040f8cd136a3813f311be12564b5d282e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/split.rs: FileTooLong \u2014 4176 significant 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 70 free functions. The bar is 500 significant lines; this is 3676 over it, 8.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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa08f97f5ed0982b07b2f7fa6e842a46b7ec0a8642ce7398ed2fe88ed2cf25a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SchematicCanvas.SchematicCanvas: FunctionTooLong \u2014 SchematicCanvas runs 828 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 728 over it, 8.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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"be65869fec302834777170affc96b86e482fcf3f7f3209009233c8fe4517d5d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useToolDefinitions.useToolDefinitions: FunctionTooLong \u2014 useToolDefinitions runs 816 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 716 over it, 8.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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f63ae3e26c347579085cdcfef94f3edfd976e652d8a7cd0c3a0d53d33625c18"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorModel: TooManyMethods \u2014 218 methods. The bar is 30 methods; this is 188 over it, 7.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fabe0a4d56f7a83acf4f8fc5b4b0771402f07d304a6771dcf761a6e86269c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorModel: ClassTooLong \u2014 2840 significant lines (blank, comment-only and punctuation-only lines excluded), 378 methods. The bar is 400 significant lines; this is 2440 over it, 7.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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"965f491708ae152c044f1869a1d184056d7a1aa33be3225fdd66ebcd56200284"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorModel: ClassTooLong \u2014 2840 significant lines (blank, comment-only and punctuation-only lines excluded), 218 methods. The bar is 400 significant lines; this is 2440 over it, 7.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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f486a25dc6a50193bbbf861dc69b6c2551bc0638152cf1184cb46d62ffa28a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 3448 significant 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 2948 over it, 6.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bbe55c4bae234ca629b194aad4df9af6e163b12984f7e47fb2f7ea3a53ad8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3338 significant 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 2838 over it, 6.68\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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9336eadfbf016edacff9716585c0106a71dad7e3c4044e1e05c03703a7a349fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/auto.rs: FileTooLong \u2014 3165 significant 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 2665 over it, 6.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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baff1e3cf4f0e4174e808943e4816be891f2dd363702be52de6cdee932ffbb30"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::pipeline::brep_boolean: FunctionTooLong \u2014 vcad_kernel_booleans::pipeline::brep_boolean runs 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 528 over it, 6.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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"af13ae746716e0269b9259a724f4317b3ecf5a19f34641170d54d5425f2c0708"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/Editor.swift: FileTooLong \u2014 3123 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: EditorModel (292-4788). The bar is 500 significant lines; this is 2623 over it, 6.25\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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20587f98dde811fdf7c353e770dfd0e96943aeeee9af7e7add75c72306b6fe4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Shared/Editor.swift: FileTooLong \u2014 3123 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: EditorModel (292-4788). The bar is 500 significant lines; this is 2623 over it, 6.25\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":"apple/VcadVision/Sources/VcadVision/Shared/Editor.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a909b368a2533260142d046231c1a35d321a8aa3c99c891a7d8dea2a4b8c8cef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::to_loon::op_to_loon: FunctionTooLong \u2014 vcad_ir::to_loon::op_to_loon runs 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) in one body. The bar is 100 significant lines; this is 437 over it, 5.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":"crates/vcad-ir/src/to_loon.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c32f65645f8ec9c82711f7545af6379bcb5d40a7ce59a4a154447b83bd51c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::complete::route_window_complete_islands: FunctionTooLong \u2014 vcad_ecad_pcb::router::complete::route_window_complete_islands runs 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) in one body. The bar is 100 significant lines; this is 434 over it, 5.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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a662b6e6ad665249b99f42244f5e0c402560d0aa860cf0bbe2e1e2e0d95b854"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::evaluate::evaluate_op_timed: FunctionTooLong \u2014 vcad_eval::evaluate::evaluate_op_timed runs 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) in one body. The bar is 100 significant lines; this is 431 over it, 5.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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cf35b7222fac3dc8752959279ae1c5ef6a7f653319063a3872dabc46a62c2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::drafting::compose: FunctionTooLong \u2014 vcad_ffi::drafting::compose runs 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) in one body. The bar is 100 significant lines; this is 424 over it, 5.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":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3f0edaaae8e73d12c741dce90754bf51453d4d07da1bac7e25d7d4bb037879"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::classify::face_sample_point: FunctionTooLong \u2014 vcad_kernel_booleans::classify::face_sample_point runs 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 421 over it, 5.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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d05bc9abf8a594d2728e2805225af1daba0f97b0f5ce53efe5d3461166bb53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::route_all_once: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::route_all_once runs 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) in one body. The bar is 100 significant lines; this is 420 over it, 5.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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5426b19e007679307703e87bad863da2dc48fca677f25e5eef4b5059db2edb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/evaluate.rs: FileTooLong \u2014 2514 significant 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 2014 over it, 5.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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b6d187115b9a4a90f858a31837d08bc95ef7b98b36779d66afdb099189c0d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.createCommandRegistry: FunctionTooLong \u2014 createCommandRegistry runs 497 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 397 over it, 4.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":"packages/core/src/commands.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7b2a6ec4af6952c2dc0ac7ca7c786d8b4297ecb55a3587e900189bf624a9bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::flow::realize::realize_wires: FunctionTooLong \u2014 vcad_ecad_pcb::router::flow::realize::realize_wires runs 468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 368 over it, 4.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":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47e268802cd436d3b9802dd97a7104054d8cf875354b77125af936f13a8d075"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: vcad_kernel_wasm: TooManyFunctions \u2014 137 free functions. The bar is 30 free functions; this is 107 over it, 4.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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aedef548d267bb2d2966ee5529754718a4e34dda9459bfe76beed610cceae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::pair::try_route_pair_reason: FunctionTooLong \u2014 vcad_ecad_pcb::router::pair::try_route_pair_reason runs 452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 352 over it, 4.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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded38fe0205cd4c56cbcc9e4a134c3f7f690121bc276186cdd6b0879c4e69af8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/convert.rs: FileTooLong \u2014 2232 significant 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 1732 over it, 4.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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f4c6035206d7cbc6ce8afefd16c3a04072805d90be752d262cd2daa56fc6cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/drc.rs: FileTooLong \u2014 2186 significant 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 82 free functions. The bar is 500 significant lines; this is 1686 over it, 4.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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d60ac6b667508aecb618132f4c517c327184df8ed862d7d6986494ceaf4180"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::evaluate::evaluate_inner: FunctionTooLong \u2014 vcad_eval::evaluate::evaluate_inner runs 436 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 336 over it, 4.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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3f1a5fd73d6e34eff9990447f69c7e7ce72040321cee4612821d3a1a7c94c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::descent::descend_board_inner: FunctionTooLong \u2014 vcad_ecad_pcb::router::descent::descend_board_inner runs 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) in one body. The bar is 100 significant lines; this is 320 over it, 4.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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4d33fd8fe40c576137d2157724263271619797870d3aa8ea7d4b29f40364e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sketch-store.useSketchStore: FunctionTooLong \u2014 useSketchStore runs 418 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 318 over it, 4.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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c7f323d129800a2063a0c7e565e1f866fcf53fdceabdfb0d00b51f955f88ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::cavity_extract::extract_cavity: FunctionTooLong \u2014 vcad_eval::cavity_extract::extract_cavity runs 408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 308 over it, 4.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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9b7e850b9650e5764bade496911d376f263b1964dc987b0fbe3934398ce12d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/build.ts: FileTooLong \u2014 2006 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1506 over it, 4.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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eb32a063e65f121d94130f3972a4c788b1140fb105e75a2e1500b068a06216"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::antenna_extract::extract_antenna_spec: FunctionTooLong \u2014 vcad_eval::antenna_extract::extract_antenna_spec runs 398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 298 over it, 3.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":"crates/vcad-eval/src/antenna_extract.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9562068e949e705be7b1e9475a05e37c0cd71f4cd79aeb0294ddc8a96c658b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::route_file: FunctionTooLong \u2014 vcad::route_file runs 394 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 294 over it, 3.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00b897748e88ae13b1b2e63d4e97a979afa972d2121ecf69221e991862fc404"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 1945 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1445 over it, 3.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":"packages/engine/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86f530ff462e18244119c9a7dcc383a3b27cb54bdbfa6fb458cc7f19504b275"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/ReleasedDesktop.swift: FileTooLong \u2014 1940 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1440 over it, 3.88\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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e790fa26ef71fcf88fc4872e0b4216cb155d720fb0a15b77a2a98744433ea640"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::render_svg_impl: FunctionTooLong \u2014 vcad_render::render_svg_impl runs 385 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 285 over it, 3.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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2b03384d48567fb3a8c6585cc2cd6a20ff8f26973cabdaf7bd6ce532bc4a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::run_command: FunctionTooLong \u2014 vcad::run_command runs 379 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 279 over it, 3.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc071897474ac234037028eab8231ecec02467179721fe9c875360e37b8982ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vcode.rs: FileTooLong \u2014 1894 significant 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 32 free functions. The bar is 500 significant lines; this is 1394 over it, 3.79\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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eb99a02083f72364cd07904128803ecae01528d426a8177b5573a7b1b8cb98"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CommandPalette.CommandPalette: FunctionTooLong \u2014 CommandPalette runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d012d0e7ca6305fd34a548c475ef54ed230bf35447c48967b4932d4457f24271"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/kicad_write.rs: FileTooLong \u2014 1875 significant 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 79 free functions. The bar is 500 significant lines; this is 1375 over it, 3.75\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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f179bd0254659867d605f4b7e4f74b9f58c1e354db900d875f44e13463b37b74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1869 significant 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 1369 over it, 3.74\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":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e599472abfe150f19847149a7180d36cfa79927f0fa2c5078d0c7fbedfa28e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PrintPanel.PrintPanel: FunctionTooLong \u2014 PrintPanel runs 366 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 266 over it, 3.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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62cf8477ceaa8a439e7f492b3f3caa797d4dcc24ea4b99c4fa786db6f90bac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hero-engine.startHeroEngine: FunctionTooLong \u2014 startHeroEngine runs 366 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 266 over it, 3.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":"www/src/hero-engine.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ed67c44c6a2cb8b54be498c44b6e447a0d70f6d8c19d54bb869775ab55fb60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::footprint::match_family: FunctionTooLong \u2014 vcad_ecad_symbols::footprint::match_family runs 362 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 262 over it, 3.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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d8a988f18c28248038247f4fd32f4d726df39d5028b297b60466a46397ce17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_export::gerber::write_gerber_layer: FunctionTooLong \u2014 vcad_ecad_export::gerber::write_gerber_layer runs 358 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 258 over it, 3.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":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"900aef0ba838425744ba3e39145ca3456babb185bf5c7c15bd41b45d867e70cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConvertCtx.convert_solid: MethodTooLong \u2014 convert_solid runs 351 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 251 over it, 3.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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd678953eed151f4a9b93834c81a10a5c6b8651e4bd88dc4a61e3ed76f3a4860"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel::turning_profile::turning_profile: FunctionTooLong \u2014 vcad_kernel::turning_profile::turning_profile runs 349 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 249 over it, 3.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":"crates/vcad-kernel/src/turning_profile.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2494230a692593ca9c70b9c48634393afa0768d0b48312ae03d2def59de7da6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1744 significant 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 99 free functions. The bar is 500 significant lines; this is 1244 over it, 3.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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7025fdaf0f4b60c46ea4579a32f73782a648f82589d0d1e14a228e458e60aaa9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Repl.execute: MethodTooLong \u2014 execute runs 347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 247 over it, 3.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":"crates/vcad-cli/src/repl.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace8287cfd290a8d7bfe3f0984f332592484787657baec6fb5cf48dcd800db70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render.renderView: FunctionTooLong \u2014 renderView runs 347 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 247 over it, 3.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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"167e6dd75dcdede2392d9e54c47bf6a7ec6eba6e963a351421f39b24f5cfbfb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::trim::point_in_face_inner: FunctionTooLong \u2014 vcad_kernel_booleans::trim::point_in_face_inner runs 341 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c39a77283c8750c52dc8a848b379d8f0fb01df41bb2dad8c72c0049410e583"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_trimmed_region: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_trimmed_region runs 337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 237 over it, 3.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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d948c0d0915547dc1bbc86b42f5eb61b4c957c734d7ef192d9784e4685d06ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::maze::route_net_maze3d: FunctionTooLong \u2014 vcad_ecad_pcb::router::maze::route_net_maze3d runs 333 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 233 over it, 3.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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eea004553d1c49d7733ddbc686e9fdd62a6e84ed2a271377c150a0793a5131f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::altium::build_pcb: FunctionTooLong \u2014 vcad_ecad_symbols::altium::build_pcb runs 333 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 233 over it, 3.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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da3dd2260093d270aa34214af0157c0b3a823bdfbe800f492271606fae754ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Header.Header: FunctionTooLong \u2014 Header runs 332 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 232 over it, 3.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":"packages/app/src/components/Header.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c1b7703e99ae5d2a46c9b8fd58ac766ea0bb09028b8102196c65c3571110d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_particle::chain::predict: FunctionTooLong \u2014 vcad_kernel_particle::chain::predict runs 331 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 231 over it, 3.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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"704754232d7ee266846d87e776cf7c4f995791b18e9e1e3e2b08e5946ebdae29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useAppCommands.useAppCommands: FunctionTooLong \u2014 useAppCommands runs 331 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 231 over it, 3.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":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2901279bcca005c5501ce9dd511c2563991cc00235e3975fddb8432b9786c6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1652 significant 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: Solid (8 blocks, 382-2694). The bar is 500 significant lines; this is 1152 over it, 3.30\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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a32e8cff84f0f950670059e637b79b6471f852ad49fee1f8cfa391d6bfe975"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConvertCtx: ClassTooLong \u2014 1317 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 2 blocks, lines 1122-3073. The bar is 400 significant lines; this is 917 over it, 3.29\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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8911cea964a82f5fae11f75d07c9dbc5308d1e3eaeea96cfea2e2df765c0780c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Solid: TooManyMethods \u2014 98 methods, declared across 3 files: src/lib.rs (96), src/faces.rs (1), src/sweep_rotate.rs (1). The bar is 30 methods; this is 68 over it, 3.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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4120b393fc6054b6b45b4b84b7b352e9b3478678de6f119c462836b6071cb118"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer-app/main.ts: FileTooLong \u2014 1627 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1127 over it, 3.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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85221ea853d4ee32ddb4fdb53446226d9fb211893a7ed621bf33fedb61b025f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/materializer.rs: FileTooLong \u2014 1615 significant 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 1115 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfbefbf36a6af79e8b56699b39c516a0e97ecd93791ff5ab1ebf54e7e9a9749"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stores/document-store.ts: FileTooLong \u2014 1613 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: useDocumentStore (948-2355). The bar is 500 significant lines; this is 1113 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"003044b49edf28b746fe2353c49233d63271e37cb0df62c04b103bb8e45b46ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::vcode::format_op: FunctionTooLong \u2014 vcad_ir::vcode::format_op 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90288ca06b6ff5a018e2ce5000c28f1777f199232c955d210ceaf36c68522c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FeatureInput.to_crdt_params: MethodTooLong \u2014 to_crdt_params runs 319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 219 over it, 3.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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"839756c18e509dc5a03fdfc2367ee033632cb8d364c9d864e770169fbb64ad70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_planar_face_by_circle: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_planar_face_by_circle runs 319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 219 over it, 3.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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77bcb344c20d5c59d056090cfaa9ecf37adfb63edf08f1193763505668f423"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::flow::route::route_flow: FunctionTooLong \u2014 vcad_ecad_pcb::router::flow::route::route_flow 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb0d3bb68c326f738ec11c8d5bac9467fcafd2371344441fab3fb7a6de6fe71"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Engine: TooManyMethods \u2014 92 methods. The bar is 30 methods; this is 62 over it, 3.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":"packages/engine/src/index.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfda42ff018385ad664143c754340209c4747c7cffe01f48709b722c1e469379"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_face_by_curve: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_face_by_curve runs 303 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 203 over it, 3.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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb8de53a4ab4374b35d7af7649d186842bc413e7320ae2197f54de1fcfcff1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sheet::font::glyph: FunctionTooLong \u2014 vcad_kernel_sheet::font::glyph runs 300 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 200 over it, 3.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":"crates/vcad-kernel-sheet/src/font.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb7bbd5baef3c2481fc63bd53c9ce8730478b8edf8bd27321c04159996c04e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: EmbroideryPanel.EmbroideryPanel: FunctionTooLong \u2014 EmbroideryPanel runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1554e4b7ea5771eaf7b6e6333584df78a923d203a21c51eeadf7610aa04552bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/PropertyPanel.tsx: FileTooLong \u2014 1485 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 985 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc9986072fc1c24d24b9183571082d61da4ded81b6a77e27c71773f102ee342"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pipeline.rs: FileTooLong \u2014 1476 significant 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 976 over it, 2.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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"211b7458304abfa1f2666557b0b1d2ab5a5a63697a634d039d6b77f88b17a922"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PcbScene.PcbScene: FunctionTooLong \u2014 PcbScene runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec168c3c29c1db78d2e2fb6e29559964c0a4beceb0ebd3fc88f7d5f2e5a340a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/ViewportContent.tsx: FileTooLong \u2014 1455 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 955 over it, 2.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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1633b198eb4532b77efefe84a4eb41f39cce53cb8f52cf5490feb526fd846a0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_export::build_glb: FunctionTooLong \u2014 vcad_kernel_export::build_glb runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.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":"crates/vcad-kernel-export/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c985cac9d31b31d98cdafe6dd3d4931664e6971335dfeeb4dee9cefa1e2dd77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/footprint.rs: FileTooLong \u2014 1452 significant 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 952 over it, 2.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad62d1e2f7342491b7b130fbd381c22f88e222dcaa2c683fa36af2ef302167c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: evaluate.evaluateOp: FunctionTooLong \u2014 evaluateOp runs 290 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 190 over it, 2.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":"packages/engine/src/evaluate.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a558716446c99e659bf36bfee4857e2cfa3ba9723ac847c94189d0bbf464f0b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: OperationList.OperationEditor: FunctionTooLong \u2014 OperationEditor runs 287 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0b1a5f9c4c81e831b726aeb20e480e29a4b8d0c451c76f150e843849d3806d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::builtin::builtin_symbols: FunctionTooLong \u2014 vcad_ecad_symbols::builtin::builtin_symbols runs 286 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f73926b5fbbad7f2ce7195e7465f9237f8e16388c2698d58e5eb052e70903a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::solve::build: FunctionTooLong \u2014 vcad_kernel_thermal::solve::build runs 286 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"45205a22abf4f6abd4dc0a95f059cd51cbf159ff0f6e258527035ba08c02572d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useKeyboardShortcuts.useKeyboardShortcuts: FunctionTooLong \u2014 useKeyboardShortcuts 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":"packages/app/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"868c1b6f001d55063bab96ffc747144e1f5bd66a429e75ba7119df5b3c19fc09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Solid: ClassTooLong \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), 98 methods, 8 blocks, lines 382-2694. The bar is 400 significant lines; this is 735 over it, 2.84\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9949787d7732c2e3e97ba431aa4eccc1f528f0d06422f2abe7a2f719f2e0746"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::resolve::apply_to_op: FunctionTooLong \u2014 vcad_ir::resolve::apply_to_op 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":"crates/vcad-ir/src/resolve.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da907c870167a8508aca60a06bcab33606d1fdd6af6bf15187eb3363cb9cbdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RayTracedViewport.RayTracedViewportOverlay: FunctionTooLong \u2014 RayTracedViewportOverlay runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"69794b2425126503406b421c3b81aa58440ec553df6c99eba8365eac19eb6107"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::pipeline::apply_splits_to_solid: FunctionTooLong \u2014 vcad_kernel_booleans::pipeline::apply_splits_to_solid runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef9cba54468fff01fd3e79eb17ee52bc5b51f18c00315fa41a3c1e6ef6df8dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::optimize::optimize_document: FunctionTooLong \u2014 vcad_eval::optimize::optimize_document 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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85d8811ef1c30e3688bf0912f88029c8bacb67135e37181187a1da706e319b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CircuitTabTools.CircuitTabTools: FunctionTooLong \u2014 CircuitTabTools runs 279 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"564217dd672ad2883c7fe9cf05ffd47a8533dace91a3f9b125012650f3ab86b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_flow::solve::solve_steady: FunctionTooLong \u2014 vcad_kernel_flow::solve::solve_steady runs 278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 178 over it, 2.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":"crates/vcad-kernel-flow/src/solve.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69e6154803c7a90d522f827ef11dab45e645b69216bbc1fd3c9078a5bdda334"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/hobby_mill.rs: FileTooLong \u2014 1374 significant 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 874 over it, 2.75\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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f1917a596a6f7384813a66f35d8cc1bba5acb0c0e47c32544ac017f0587435"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fea::buckling::buckling_on_mesh: FunctionTooLong \u2014 vcad_kernel_fea::buckling::buckling_on_mesh 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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d4020338e9dd4a74af5dba21efc9902ebc992935a1bb08b0ab427a4da68c5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PhysicsWorld.from_document_with_colliders: MethodTooLong \u2014 from_document_with_colliders runs 270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 170 over it, 2.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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a2fe878b88acd75e26ea53ca560faca95d858774b95f833b63d2fba2bec430"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: electronics-store.useElectronicsStore: FunctionTooLong \u2014 useElectronicsStore runs 269 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 169 over it, 2.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":"packages/app/src/stores/electronics-store.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b057da6ed92e50c4f296e29afe4e67324b16aecdb72fa1bad1680d93ac43d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InlineOnboarding.InlineOnboarding: FunctionTooLong \u2014 InlineOnboarding runs 266 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 166 over it, 2.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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"343a5f1b6f285add4228992c92ced2bebe7ebdb019fa054116d7b09d4cf95854"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SketchSession: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f7aca5582801461d690f66560ca61ffcdba29117d75c95b594bf3dd7ce29f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_torture::fidelity::corpus: FunctionTooLong \u2014 vcad_torture::fidelity::corpus runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.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":"crates/vcad-torture/src/fidelity.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"745f44b614e8d5afda8c7c6d9f1432f10b9b8dfcf63f38b1dafbf5bbe9e669f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/optimize.rs: FileTooLong \u2014 1293 significant 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 793 over it, 2.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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac1e96fe9baf772d3d8918db03ccc9beda34df941f8d2193b817c4596e8299d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::input::handle_key: FunctionTooLong \u2014 vcad::input::handle_key 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24b12081bee9c5ec00c353d50207fe3302eaebd25596dce55bc94c296fac5d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CamPanel.CamPanel: FunctionTooLong \u2014 CamPanel runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"93515b5355f3dfe27409abf67723ceeaa00d1819b53097f66a126fc7e1d26fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::route_pass: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::route_pass 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ec281aebf05a2c65e7fbbc718fd3659afa5dde5215e64ad34f7bfc64c8a588"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::pcb::render_pcb_svg_opts: FunctionTooLong \u2014 vcad_render::pcb::render_pcb_svg_opts 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":"crates/vcad-render/src/pcb.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"5505a761ee9b310efabd8655d9fb2b290cf42c16c5213ab747e8b19ececa5c38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_planar_face_by_arc: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_planar_face_by_arc 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c5fb166eb111e1923d7d01e2fd4ef9cabdba3c319474bdd46a85a31053b27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Embedding.route: MethodTooLong \u2014 route runs 250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 150 over it, 2.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":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae19687db48e43b2b87aa7dabc3dfa05f339c288ba1fc1f25cb13b4fef12b0da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::eagle_brd::parse_eagle_brd: FunctionTooLong \u2014 vcad_ecad_symbols::eagle_brd::parse_eagle_brd runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8514c073fb24a4ebb956b48bc4005648f5084f6e396e99a07aa744a585ab529e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReleasedOverlayView.viewport: MethodTooLong \u2014 viewport 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c342fec55fce63fe7355f502133023180146a62d49007c473117eb734e7a63"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Engine: ClassTooLong \u2014 979 significant lines (blank, comment-only and punctuation-only lines excluded), 92 methods. The bar is 400 significant lines; this is 579 over it, 2.45\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":"packages/engine/src/index.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"421c52348c30db5bb6e001bade7b6a401466947989e60908d3d485009cbeaa2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FeatureTree.TreeNode: FunctionTooLong \u2014 TreeNode runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"45932a0519bb70c243cd381acb30f33c438e0ca0f221561a06343b15fc9de00a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/GlassChrome.swift: FileTooLong \u2014 1214 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 714 over it, 2.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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5897c32ccc4776ac1872059a402339e77c42daa4fd71f5d5444170163946fe43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_photon_dose::transport::run: FunctionTooLong \u2014 vcad_kernel_photon_dose::transport::run 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":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c2fbfee41ecf5809f5971fbd8ca383004488794ebd8c145192bb1adc8226e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::cam_job::job: FunctionTooLong \u2014 vcad_ffi::cam_job::job 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":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f978f10f8398d422f45fbc226192f88d8ff1a26f20bedd7959a1073dadd2a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_flow::adjoint::pressure_drop_gradient: FunctionTooLong \u2014 vcad_kernel_flow::adjoint::pressure_drop_gradient 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d3168fab5904ae940b6649b81cc6c822cea426de48b4ca28baae30af30f479"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_mcp::tools::core::core_tools: FunctionTooLong \u2014 vcad_mcp::tools::core::core_tools 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":"crates/vcad-mcp/src/tools/core.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31e67a9eb1d7c70d56f3210ba546fec0a7651c6ae4dc3953b4ae017fb769a34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chain.rs: FileTooLong \u2014 1196 significant 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 696 over it, 2.39\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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c16f129cb69ec62792b36ee4d8db898006b23aa0f68c5aab524d49dde2088c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_cylindrical_face: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_cylindrical_face 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bece6cabd4762c90aaa3e11cd2c6e33eb4a3197de299626a1a63693b31b83212"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::recon::program_document: FunctionTooLong \u2014 vcad_ffi::recon::program_document runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.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":"crates/vcad-ffi/src/recon.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fbc8a3a352180c6f44fdbbac408fedec3c7a1f8ffcee62551417d95b13bab1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SketchSession: ClassTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded), 79 methods. The bar is 400 significant lines; this is 543 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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f76b6e37b303d52060135e40a8773d2375b9d489d21dcf58b98b45c2d89a28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::raster::draw_annotations: FunctionTooLong \u2014 vcad_render::raster::draw_annotations 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4809}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a1525788cc545bf42de931c63e478569e5d8fddd4be0d1be02976b867c7e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RaytraceChip.RaytraceChip: FunctionTooLong \u2014 RaytraceChip runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2230fc943888de1725eceebf44d72c9207ace0f35801ba06de614d1a94376f4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/complete.rs: FileTooLong \u2014 1173 significant 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 673 over it, 2.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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17d0c3d56ba02fa70b4423db63e9432a41dee0403dc2fefe9ac55178cdc5a0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/pair.rs: FileTooLong \u2014 1172 significant 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 672 over it, 2.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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f3dba7020ed92a0cc6c45d4b22681e3cd54b490e77beb6b572c506bfa928d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/buckling.rs: FileTooLong \u2014 1171 significant 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 671 over it, 2.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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28e3fe4576a336b7989151ebd660aef6195a9c674a8e9000f199d44da883e5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_loon::convert::convert_ecad_value: FunctionTooLong \u2014 vcad_loon::convert::convert_ecad_value runs 234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 134 over it, 2.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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"380d45712abc40b1693d442c0f42df8fcead2236e370d0e93544fefa71019647"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PropertyPanel.PropertyPanel: FunctionTooLong \u2014 PropertyPanel runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbde890958d199cb33171ab66f00c06bf66b4bf16b76907c1f01d82947c4d9e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ElectronicsWorkspace: TooManyMethods \u2014 70 methods, declared across 3 files: VcadApp/ElectronicsWorkspace.swift (56), VcadApp/ElectronicsSchematicLayer.swift (13), VcadApp/ElectronicsView.swift (1). The bar is 30 methods; this is 40 over it, 2.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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ded482cf515fd1d2ba950b206a707f64380aa967a5f7e4cd41cec1cf5516f58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: annotate.generateSyntheticDescription: FunctionTooLong \u2014 generateSyntheticDescription runs 233 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/training/src/annotate.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"910d8dc3e3035b46843473b39ca65b1bf10e903e708b49c760c385a1e4a58b2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_gpu::wavefront::distance_field_compacted_async: FunctionTooLong \u2014 vcad_kernel_gpu::wavefront::distance_field_compacted_async runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.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":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9b850941c93e682d755f960220e68dee90801a58ed7fd91759f4926a43fad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hero-app.init: FunctionTooLong \u2014 init runs 232 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 132 over it, 2.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":"www/src/hero-app.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2a9a3cc4f7836bdaed325f65b5a50f2deb3e63eecf255a1a6a02c64792486f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_dfm::rules::cnc::run: FunctionTooLong \u2014 vcad_kernel_dfm::rules::cnc::run 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":"crates/vcad-kernel-dfm/src/rules/cnc.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6425498ff767a356bc2355eecf8538edbc475e552799e9a81533c90adfbc41b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ecad.ts: FileTooLong \u2014 1149 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 649 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":"packages/engine/src/ecad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e0074319e462e863be9dc75dae06b60fe5c552f10098b4404435022e92a2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Navigation.Navigation: FunctionTooLong \u2014 Navigation runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/docs/src/components/Navigation.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"58249309df960ce106b422555bee9a7ca2bbcb2651b05d7ffeaf7f3a00d9d613"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/SketchSession.swift: FileTooLong \u2014 1140 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: SketchSession (266-1621). The bar is 500 significant lines; this is 640 over it, 2.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d345cab294782568e228b60a8adcd1bab0bee043ab7bc806c3c31ff6dde2567"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_cam::turning::verify::verify_gcode: FunctionTooLong \u2014 vcad_kernel_cam::turning::verify::verify_gcode runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.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":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b86362ec2f8926eeacf9f227e125b41f9484660764cbb13dfef4d3cb209ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssemblyReader.read_structure: MethodTooLong \u2014 read_structure runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.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":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b239734d1b9425ff924aa3ce1736eec890fa82ed4861dd48e2f6730d017eefd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::clip_spherical_face_by_circle: FunctionTooLong \u2014 vcad_kernel_booleans::split::clip_spherical_face_by_circle runs 227 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 127 over it, 2.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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ea7c5706692f56ae724967e0a0381a398dbf006ef6e296a9e047980789403b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_conical_face_by_ruling: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_conical_face_by_ruling 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4795}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf9f9e7c8508a94114ce2b47ea83c5fdba69d1758a1873483099ff536283d33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommandRegistry.tsFallbackTools: MethodTooLong \u2014 tsFallbackTools runs 226 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/core/src/commands/registry.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db7f91cd6a22af26ad4b80648f53709ee0acd1bbf03f38c6d054be97bb1a0ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::sim_extract::em::extract_axisym_mag_spec_from_scene: FunctionTooLong \u2014 vcad_eval::sim_extract::em::extract_axisym_mag_spec_from_scene 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":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0b529e340ffcc4e410797dc3cdb7fab71c2e7854a58fda12e6f38c086b274e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StepReader.read_solid: MethodTooLong \u2014 read_solid 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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5a2df257d1f25a0eb3a1a2d31d22b1d512ff737c79f0346646e76698d863cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/descent.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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a896599724b22cf0cfa430e20fda0b0144ac7d62817eae4f3dc5218c2452ef70"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PhysicsWorld: 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), 49 methods, 2 blocks, lines 138-1975. 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e59c9e9a9817fbbdc6fde52145291f7571cbab48bb35545cb89fbf329c71b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::pair::polish_pairs: FunctionTooLong \u2014 vcad_ecad_pcb::router::pair::polish_pairs runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c2f25187ace44986115b4277d5ea7476641d4b7c2ffbe2dd3cf728bd08701d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_mcp::tools::instrument::instrument_tools: FunctionTooLong \u2014 vcad_mcp::tools::instrument::instrument_tools runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.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":"crates/vcad-mcp/src/tools/instrument.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b5ff94d6c403bb3d056a54bf7ef99d8cf136442ef33b7ee16611e789c94262"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 1099 significant 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 73% of them inside a single declaration: App (2 blocks, 102-1291). The bar is 500 significant lines; this is 599 over it, 2.20\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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb201fbdcc4f274ffa16b0750ccebbe601f7f84b96f7ac20206e04e5d655e44b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_flow::gpu::preview_async: FunctionTooLong \u2014 vcad_kernel_flow::gpu::preview_async 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":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"84934dd5383cf334d266f00c4c8545b373ae416403829d4343deabcc6b7e5629"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DocumentPicker.DocumentPicker: FunctionTooLong \u2014 DocumentPicker runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e9d6b93e5277127f31c462a208ab824c754617fa100b142a7465225c4395d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 1093 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 593 over it, 2.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":"packages/ir/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d246871e4ea65a3682b53c42439ea182cc28f4b99a4dccf874b9031059a2aba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cyl_band.rs: FileTooLong \u2014 1090 significant 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 590 over it, 2.18\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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69987d010cd9a755b2bb04e6837325c78ae911f33f0f734d7f32e6b425ed956"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fillet::fillet_curved::fillet_edges_detailed_inner: FunctionTooLong \u2014 vcad_kernel_fillet::fillet_curved::fillet_edges_detailed_inner runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddeb37aa193a257f5ef27ffdcd4a312b29f724a47404e9c4971460c5136bd4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/verdict.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). The bar is 500 significant lines; this is 583 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"916877d9f5d146280d9af0ec99415fe119cf672cabe9f77a6d79c2e280802bf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ToolPalette.ToolPalette: FunctionTooLong \u2014 ToolPalette runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.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":"packages/app/src/components/ToolPalette.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b4e80568f76cc71d67dacc636c20acc2267f8ec43f75bb853295ad8cd3fc47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usePcbCamera.usePcbCamera: FunctionTooLong \u2014 usePcbCamera runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.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":"packages/app/src/components/electronics/pcb3d/usePcbCamera.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9750b28b08726de6014c8368d4a8c7511bb9b217e34a0c669bad7b93ed06d9f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DocumentApi: TooManyMethods \u2014 64 methods, declared across 4 files: src/document_api.rs (52), src/command.rs (8), src/delta.rs (3), src/history.rs (1). The bar is 30 methods; this is 34 over it, 2.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":"crates/vcad-app/src/document_api.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b0135e5216e5a7f0140abdd68aa4f19e6cb1d08b18d13befd3243592d9d105"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Cli: TooManyFields \u2014 64 stored fields beside 3 methods. The bar is 30 stored fields; this is 34 over it, 2.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":"crates/vcad-render/src/main.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"869d7c721dbb70d23054b09bcf85998f41114eedff495bada6c71c9c7bb35802"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_constraints::symbolic::build_residual_exprs: FunctionTooLong \u2014 vcad_kernel_constraints::symbolic::build_residual_exprs runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.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":"crates/vcad-kernel-constraints/src/symbolic.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec578d0609a4ff7de93bbf635b9aa1042c4c46e2ed7b9d554a65f209a8d859f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.handle_modern: MethodTooLong \u2014 handle_modern runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d707968746161d57e9e33f546f2ccd6f06290b45f067c87326226eb61f81da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_fabprep::run_fab_prep: FunctionTooLong \u2014 vcad_ecad_fabprep::run_fab_prep 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":"crates/vcad-ecad-fabprep/src/lib.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11e481e5ef589d539510bf1cad94f738f1d4432e86996fdc5277318bf246c20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/world.rs: FileTooLong \u2014 1041 significant 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: PhysicsWorld (2 blocks, 138-1975). The bar is 500 significant lines; this is 541 over it, 2.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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ffe1c0d42dc5de5ef58a31e8a4a1b81c786f2d2358fcf6fae57d5b704dfead"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 1040 significant 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 66% of them inside a single declaration: Server (2 blocks, 165-1188). The bar is 500 significant lines; this is 540 over it, 2.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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad0794a9698e70da2d2b1f700cbd4e6ef480850e6289f7a872a0e933a72899c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/FeatureTree.tsx: FileTooLong \u2014 1039 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 539 over it, 2.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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e2cae5d8261806fe5112755f4c28fd9320d97744d558a8e0f7eed0ab09c07"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SchematicCanvas: ClassTooLong \u2014 828 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 428 over it, 2.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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6cbb033b5c6842ebcdb8d30bfec0cfbc604283670d9edce011c03ee5ef42b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::escape::plan_field_escapes_toward: FunctionTooLong \u2014 vcad_ecad_pcb::router::escape::plan_field_escapes_toward 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":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daf3e9234f766e104880dfec845dfcb38e65fdb288c12c4672775baa4b4b9f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_constraints::residual::compute_constraint_residuals: FunctionTooLong \u2014 vcad_kernel_constraints::residual::compute_constraint_residuals 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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caf2f1623a216190282526eff8303485fcdb2c79138ff62c7c9fcd7106b236d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/classify.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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b36dfe81da719cdaea8b0a445d751bdcb29df1d1b56708efe1277a14a3bed1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useToolDefinitions: ClassTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 400 significant lines; this is 416 over it, 2.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985ff3c799a800ab7945767f956280524008c001b90bb851339f73f3ec38523c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::fill_tiny_boundary_loops: FunctionTooLong \u2014 vcad_kernel_tessellate::fill_tiny_boundary_loops runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cf0d382e419bda552a38e8846eb400882359633433470acba97bb38339ec4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.ts: FileTooLong \u2014 1019 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 519 over it, 2.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":"packages/mcp/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5699bac88d9751abb817b49dc2ac47ffacd6e5cb0ae7905a6376109f20dfc560"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/render.ts: FileTooLong \u2014 1019 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 519 over it, 2.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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9c690968257892e715be0a5b6fb9ad32cc29813bae91eff907e0c2601bc3c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.build: MethodTooLong \u2014 build runs 203 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 103 over it, 2.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":"crates/vcad-ffi/src/features.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6312f8c0210654b716e1024877e86616287370ff82483c1bd46e6e42c85969"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::ui::chat::draw_chat: FunctionTooLong \u2014 vcad::ui::chat::draw_chat 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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"551126def814e3ae2ecb7f87ee5134521eed07daf60bf511c29d788ace6db194"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/animate.ts: FileTooLong \u2014 1009 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 509 over it, 2.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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acc185d5338a450c8f5ddda52bf4f8311850b3879e379f57026af30f9b7432a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::thermal_extract::extract_thermal_spec_from_scene: FunctionTooLong \u2014 vcad_eval::thermal_extract::extract_thermal_spec_from_scene 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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d12bfe3bfc8ae210b138c17b5d491ac743b67ad4a5c07e97fe850c14bd3065"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_cam::turning::verify::parse: FunctionTooLong \u2014 vcad_kernel_cam::turning::verify::parse 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":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2af9f63894bc3e1c65c2e78a60ed5084e4f8a80945459327b422592430700be"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 799 significant 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 102-1291. The bar is 400 significant lines; this is 399 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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf52b8417207e5e92bcb89f96c5784db9145ee40cf91412ef8ec69b3816fb5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SketchPlane3D.SketchPlane3D: FunctionTooLong \u2014 SketchPlane3D 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0510019afa9a3bfad3cc48bc3cb0fbd888d0e33e645340228575b35ee4f2d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ecad.rs: FileTooLong \u2014 992 significant 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 492 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/ecad.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd72891af9caccb01a3b475bed98e5dc3e6cab19eef8ed6f6991f7de311ea74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCommands.body: MethodTooLong \u2014 body runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f373569e34a866b686e1227c27db1871a672b6bc1152ec1a2eb1609fa67dc2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCommands.body: MethodTooLong \u2014 body runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a050155c463d4b213d42fce5b0f8f638085f428796d47771318bd029d6518873"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::evaluate::evaluate_node: FunctionTooLong \u2014 vcad_app::evaluate::evaluate_node 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":"crates/vcad-app/src/evaluate.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda6a24fdff5bcb6f109cc6599754bf7e77c5e526e39216ef050650b791bfdbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SketchPlane3D.SketchGeometry3D: FunctionTooLong \u2014 SketchGeometry3D runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a236854c6e61b9acf0b25848c37c61855c7b75514aba330a4876ff099f7d8379"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MaterialSelector.MaterialSelector: FunctionTooLong \u2014 MaterialSelector runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"33814216f550cfe937613c471726ecfc87281382c6c4dffe29545d33818f74d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: protocol-2026.handleModernRequest: FunctionTooLong \u2014 handleModernRequest runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9c0d8e2ff51d87f3508f72b87768eb7989419b3a0284b36025d36d64a4f236"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_calibration::build_calibration_report: FunctionTooLong \u2014 vcad_kernel_calibration::build_calibration_report 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":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a53609857b854e7818f1159deee278362ac7d94a7708602948e62f70abe7d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::fill_closed_boundary_loops: FunctionTooLong \u2014 vcad_kernel_tessellate::fill_closed_boundary_loops 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0586bd5aad609379f1c6b1a2ffa35b7aac86e3d6249d6c852513273dec5a6cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: QuotePanel.QuotePanel: FunctionTooLong \u2014 QuotePanel runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bf538baa114781426ccedc17ae9c1770745012a842ea85fb3d5509c4a4b3f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dfm.rs: FileTooLong \u2014 983 significant 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 483 over it, 1.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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46da32c4f462cdbdbe100e3f0a151a1ee2e8e7cf36d04e19cda71f21050f07f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: electronics/SchematicCanvas.tsx: FileTooLong \u2014 983 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: SchematicCanvas (230-1291). The bar is 500 significant lines; this is 483 over it, 1.97\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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4657229148b39503f248536b66fd54614d51cdd0d0b2f55a8e858b8090f5531"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pcb.rs: FileTooLong \u2014 981 significant 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 481 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":"crates/vcad-render/src/pcb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1418a296ef3b5944393d49899c46065dad53a9a24863777774bd6cff5b932e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DrawingToolbar.DrawingToolbar: FunctionTooLong \u2014 DrawingToolbar 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbbdd917ecef191c31612ad1cbadad89d21a2cb833e1a964f360e104e78d195"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InstanceMaterialSelector.InstanceMaterialSelector: FunctionTooLong \u2014 InstanceMaterialSelector 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":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f743069e79908e7982762f86a49930c22f9ef3422370b1c065fc82e14ba988"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: notification-store.useNotificationStore: FunctionTooLong \u2014 useNotificationStore 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":"packages/app/src/stores/notification-store.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d4dab4886b1457bb7ccb9333e1d5592583a42863c499546cbac444ed5192fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/solve.rs: FileTooLong \u2014 976 significant 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 476 over it, 1.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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79f000396a6ed25824e5b7442bf772a05bb0f93e31f6acc969941dcbd4301ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Problem.sample: MethodTooLong \u2014 sample 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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca11d47f319861dea35fac99daba43a05d8e31eadcf4e8b3242ac26296da3b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::raster::rasterize: FunctionTooLong \u2014 vcad_render::raster::rasterize runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4318}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bba5ff1bcf2e1a7ffc0c7a77e6d4812c0cd684b3a47920fed151500747aa7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scrub-input.ScrubInput: FunctionTooLong \u2014 ScrubInput runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd753cf5acf4b7e51607fd68961b7b729df0898e67d36b319dbcd60e02e97ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SketchPropertyPanel.SketchPropertyPanel: FunctionTooLong \u2014 SketchPropertyPanel runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd319ff7808b9198be8d30f9b45c0fe6956a6644fc78b1560219eaef4058ed9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_neutronics::transport::run: FunctionTooLong \u2014 vcad_kernel_neutronics::transport::run 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":"crates/vcad-kernel-neutronics/src/transport.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3016edf4f2d2c7c5cddd690230128c383ca64184ed7e11657cb0a9e3a8151f04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: NewPcbDialog.NewPcbDialog: FunctionTooLong \u2014 NewPcbDialog runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e572b91764f46ce90c5df55a03787b9072b84010151a010b28a787709638db3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FeatureInput: ClassTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 3 blocks, lines 58-1165. The bar is 400 significant lines; this is 367 over it, 1.92\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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e302bf0db1c1491a486e6f888be74e46086532a498044b4f105608b401b51ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_loon::convert::convert_assembly: FunctionTooLong \u2014 vcad_loon::convert::convert_assembly 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd406e27c499709da923ee5883fb6af4c7ab7f90441b660fb39e0b9939668045"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sheet::poly2d::boolean: FunctionTooLong \u2014 vcad_kernel_sheet::poly2d::boolean 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":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efd4fddf2c4e45681f1364e595a73682f18366ce8a8a5a4b938e239313cdecb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ui-store.useUiStore: FunctionTooLong \u2014 useUiStore runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/core/src/stores/ui-store.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"17501289d85fbdca0e258856bc22dbe0ecd6feed6d7e12b2b0fda0b43db72da9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/useToolDefinitions.tsx: FileTooLong \u2014 946 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: useToolDefinitions (162-1201). The bar is 500 significant lines; this is 446 over it, 1.89\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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13d8e654384525b24abe65cb9e186d8658e8697469c837ae632ace0975f678b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::flow::route::realize: FunctionTooLong \u2014 vcad_ecad_pcb::router::flow::route::realize 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b18ebb8bffabfc1d9e367b57dd4dc1cfce6ef683e503dd9ef1dc024aa5d026"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fillet::blend_loft::loft_blend_edge_keyed: FunctionTooLong \u2014 vcad_kernel_fillet::blend_loft::loft_blend_edge_keyed 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":"crates/vcad-kernel-fillet/src/blend_loft.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a33e5a5dd2ee9f6ca41e68eff84a0b43230324d86d98e6a4c1241d603dc8e7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mecheval_grader::grader::run_check: FunctionTooLong \u2014 mecheval_grader::grader::run_check 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":"mecheval/graders/src/grader.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dac3746155c444d7210fba72cc193e526be1577d2ff63ce09dc56f76789f817"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 939 significant 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 439 over it, 1.88\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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c983c94ac79619d03f0b769c32b1ab2da750497c1a794bcc215fbeb3800981"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/kicad_pcb.rs: FileTooLong \u2014 936 significant 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 436 over it, 1.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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a3db8715388f42a781f9132ec8f0ee79e1e4cff1febfe4620bbcdbb0e717b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::trim::trim_curve_to_face: FunctionTooLong \u2014 vcad_kernel_booleans::trim::trim_curve_to_face 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fa953149d608ee357120d4f5d514751838a643b3842dba11b06e934c4b005d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FeatureTree.SketchTreeSection: FunctionTooLong \u2014 SketchTreeSection runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff124590620474ee8dde144668523630978ae30572efc62bdff8672650e8407"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_fabprep::render::fab_notes: FunctionTooLong \u2014 vcad_ecad_fabprep::render::fab_notes 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":"crates/vcad-ecad-fabprep/src/render.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92b96f1c96fe9f615a6e56721e2ed4acab5b75416159b802403b04f23bc490f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UrdfWriter.node_to_geometry: MethodTooLong \u2014 node_to_geometry 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":"crates/vcad-kernel-urdf/src/writer.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb07eba89ca854652c041ddc3471a30202847dfdb07884692006417c0cb1d0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/DrawingView.tsx: FileTooLong \u2014 927 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8574b1833a4d3a899b72cc8faac5d40e9f230ff404444220a49c5a25d1e681"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AccessMarket.build: MethodTooLong \u2014 build 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":"crates/vcad-ecad-pcb/src/router/flow/access.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"496a3453bf8f66f3dc324c9c0ac58ba1002a7703e24f3ae3547dcce5a3377890"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_process::sim::simulate: FunctionTooLong \u2014 vcad_process::sim::simulate 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":"crates/vcad-process/src/sim.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b874a8cfa4099c4aeae57807b5464572738e1e9804032e484bd28cd8a8abfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/thermal_extract.rs: FileTooLong \u2014 924 significant 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 424 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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eb8029f65f1379f235319c36c7d8d1852236cb0d21bcc66f009eb31527fd0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow/route.rs: FileTooLong \u2014 922 significant 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 422 over it, 1.84\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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b74ac966187b09fad8e84ff15a16b8d6ee0f4fe012d541631fb1b85006cce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow/flow.rs: FileTooLong \u2014 919 significant 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: FlowGraph (2 blocks, 294-1379). The bar is 500 significant lines; this is 419 over it, 1.84\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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"484bc5c27f2f3f2cdf3bfaf7fc26dd0b89438b8a84bf7f535574774917ab30ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_cylindrical_face_by_line: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_cylindrical_face_by_line 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6050}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de6480baab161ae82013b2f1ad87cdb0e290aa9fc2e5fedd9cd0dee87519868"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::vcode::format_scene_settings: FunctionTooLong \u2014 vcad_ir::vcode::format_scene_settings runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0886c28a3a82693b31361d199c8817322faefb3b2e632f2fbf958a6e81a24145"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_flow::adjoint::forward: FunctionTooLong \u2014 vcad_kernel_flow::adjoint::forward runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"12116f5faf5606e808606488583b15a8ec310f17063356673f45961fe9a8cb69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_ruled_two_chain: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_ruled_two_chain runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2bfaf7a24fc2ef5e792f11c1b2f789722a43a589b858f9efeb42a58b3039e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RayTracedViewport.RayTracedViewportSync: FunctionTooLong \u2014 RayTracedViewportSync 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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edad60793d5262c532f5fe5472bfdee2e6aa1034aa674220eb0f4540015bf6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: animate.exportVideo: FunctionTooLong \u2014 exportVideo 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bbb1a27490ffbfddae13d7adae0491b85ee6bc9462d539679e8260fd4fcb4e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReleasedOverlayView: ClassTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 323 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71dbb6f61adf98ac1d7ae45f6a423f4b7fec6e49ccca457a08090f9f41cb458"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_cam::turning::rotary::verify_rotary_gcode: FunctionTooLong \u2014 vcad_kernel_cam::turning::rotary::verify_rotary_gcode 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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b794f1f28561f7172c0686093536d676b17372f7301f955a94d5e741ec82ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: StatusBar.StatusBar: FunctionTooLong \u2014 StatusBar runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d08697e1fa29f83d366cbd6b0715fef1083b3d60ca149065f80d7a803b0910a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InteractiveRouter.shortest_path: MethodTooLong \u2014 shortest_path runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8683e1a10aa4714e0c204a04efb3eb506e735305f2ec835ee1a3987ce1125e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::joint_window_repair: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::joint_window_repair runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f33131859682431420a9dd175223be4ba296aecb6d6fd78fda51d52b320f42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayerCdt.build: MethodTooLong \u2014 build runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a4d65b94ba9113e8a203e05c913a55f1216759facb8658b7b29313a16083e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_gpu::wavefront_batch::distance_fields_batch_async: FunctionTooLong \u2014 vcad_kernel_gpu::wavefront_batch::distance_fields_batch_async runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront_batch.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6187d54747af5c3e0c494a97b1084588deee3353e9ff8cf0d4916ba24ca07ec3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_dense_conical_band_by_circle: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_dense_conical_band_by_circle 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1399a5a5bd963062326f7bdabc59e39f60ba2abfddfc56597003e33d64e20d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::torus_two_chain_rotated: FunctionTooLong \u2014 vcad_kernel_tessellate::torus_two_chain_rotated 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6849}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5619b5e2e71aeb75f3ace1493361e9334032fe7b648eb98613a67dfc4468b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_gpu::normals::compute_creased_normals: FunctionTooLong \u2014 vcad_kernel_gpu::normals::compute_creased_normals 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":"crates/vcad-kernel-gpu/src/normals.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f60dc7b646fa797e1173f74a2d0f378b77f06f11ae955bd1e2ee19920e3f63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_gpu::wavefront::distance_field_async: FunctionTooLong \u2014 vcad_kernel_gpu::wavefront::distance_field_async 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":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfdb25f18fe3f5f76238352c54893dbd327430a00a649667d65b88d9539c2ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: claude-mcp.makeClaudeMcpSolver: FunctionTooLong \u2014 makeClaudeMcpSolver runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb66ea80a9a35c7a05dc66f48986cdc2c6bc9637bff176037743360cca5c9e1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DfmDrawer.DfmDrawer: FunctionTooLong \u2014 DfmDrawer runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c21a9025da308704f0de362b839f191282938d1910543775c13a742993ced29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sketch::revolve::revolve: FunctionTooLong \u2014 vcad_kernel_sketch::revolve::revolve runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.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":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ac4208ea755c624d9c7fd9c804ffc6dada700635d21714daf114faeddf8cd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fea::graph::device_assembly: FunctionTooLong \u2014 vcad_kernel_fea::graph::device_assembly 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":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d80f39ad9b5843974acbd011591c00d2720e7c6f8cf1f20dac21c6f74cdf3ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReleasedARView.rebuild: MethodTooLong \u2014 rebuild 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cf95ad045a0e182e39df6e7f28d6d88db243336d83dd5ab4ba18774207e670"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useCameraControls.useCameraControls: FunctionTooLong \u2014 useCameraControls 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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1051cf03fcc4c8964f59f50dbf5b099be0f516cfa4d69448c99fbb119b2f31d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/maze.rs: FileTooLong \u2014 869 significant 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 369 over it, 1.74\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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97866208fc88f92557e4d722b89488e3bdf5d0a30e28220183f2efc37db4bd80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/drafting.rs: FileTooLong \u2014 869 significant 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 369 over it, 1.74\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":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc7be52c4deebffbeb08bcd174964e51eaea5278187beffce69545f6f3cfab2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_particle::bem::solve: FunctionTooLong \u2014 vcad_kernel_particle::bem::solve runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/bem.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07eab239b39b50755f17563686616641aa063cebe60f9129846d4174d073703"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/instrument.rs: FileTooLong \u2014 864 significant 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 364 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82559cc9eea8c8ce3e2bd25d10aa4d352546697ab2a8f8ff4a720ff1b57491b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Server: ClassTooLong \u2014 689 significant 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 165-1188. The bar is 400 significant lines; this is 289 over it, 1.72\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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c8399b1a701d5fc2b06e9ca54836bcff06d4ad4c841a336f045485a631952b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sheet_json.rs: FileTooLong \u2014 860 significant 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 360 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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f642539268871e2c6fb7a5ba60de63a31ee02116dfc3a2408fccc187cb3593d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_gpu::decimate::decimate_mesh: FunctionTooLong \u2014 vcad_kernel_gpu::decimate::decimate_mesh 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":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7291ab79c37d55c6ffb6506cccd10fef3a766150ce4df083be299261e7d8af0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::graph::assemble: FunctionTooLong \u2014 vcad_kernel_thermal::graph::assemble 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":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6608bd69d2d5d2c4eed526cceb122116b0fbdb7dc869ef67df551175b6ed02cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/Shell.swift: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 358 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"693e466d6f72cb56f017e6b4fd241544ccec64da53b5718cfa177642f0b2fe4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Shared/Shell.swift: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 358 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":"apple/VcadVision/Sources/VcadVision/Shared/Shell.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f852b6bf41ee7c30bcff945508a3171c1304c693a77374db643a9111cac7ca5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::legalize::merge_same_net_vias: FunctionTooLong \u2014 vcad_ecad_pcb::router::legalize::merge_same_net_vias runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f48a4e25eba0aee74f49d2b6ae64631cb67772fc7930eba9e00e306a2e4f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: EmbroideryProperties.EmbroideryProperties: FunctionTooLong \u2014 EmbroideryProperties 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":"packages/app/src/components/embroidery/EmbroideryProperties.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c097f747a5565d7e0c5e31c2c6a77bfe9bd6488f3cb3da7196f014029a2bd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/writer.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 76% of them inside a single declaration: StepWriter (2 blocks, 319-1292). 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":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0373e9404ce5d1e1834a9aa7c0bdb348135140d0d39600529a8c2771faf212"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Solid: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dc5eeeb7dbffa82732e6b90659809814294fae352d2d5fe0866d8264c2513a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_diff::lift::lift_surface_second: FunctionTooLong \u2014 vcad_kernel_diff::lift::lift_surface_second 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":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec2c0085f382433c575d4ceac85063cee30a00a914dfd034ed1864a77e2d8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AtomInstances.AtomInstances: FunctionTooLong \u2014 AtomInstances 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":"packages/app/src/components/AtomInstances.tsx"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf13100483a21962f87680376e0a967ea9b825daf7069b6c67f17dd95947006"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PcbFootprintGroup.PcbFootprintGroup: FunctionTooLong \u2014 PcbFootprintGroup 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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed68c836c2272fcfc90be4e8d4f26251c36a9fbf4ed24d3a7582e597b9343e2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PrinterSelect.PrinterSelect: FunctionTooLong \u2014 PrinterSelect 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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3fba169c558a201c510747153cb10046cb9dbe668d1d5dc7ad34a9048f1c61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trim.rs: FileTooLong \u2014 842 significant 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 342 over it, 1.68\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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe215d1d7f224368ea0471bb167ef0861a6fdfe40cde98531858fec8839d47b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/clearance.ts: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 342 over it, 1.68\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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b0ab3545c9c45b5dc6b4589cb9dffa8de9337c3c9eb1dd67f5ba1751b5768d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extrude.rs: FileTooLong \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). The bar is 500 significant lines; this is 339 over it, 1.68\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe027ce4acae8ce40ddcd7ede3b6670b50636751fc11aaa5ec11e29ab4dca4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/modal.rs: FileTooLong \u2014 838 significant 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 338 over it, 1.68\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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82350c7c2aea6e9777792ca496f06e9fb98e81bcdf5cb3431c173ee41586aa06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::cyl_band::split_cylindrical_face_by_patch: FunctionTooLong \u2014 vcad_kernel_booleans::cyl_band::split_cylindrical_face_by_patch 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96cd5fe2a50af624dcd1e210f07576151ac6ca47105b3c8b3f7896916262bd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_loon::fastener::plan: FunctionTooLong \u2014 vcad_loon::fastener::plan 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":"crates/vcad-loon/src/fastener.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f4afc8e9bad05c53d2af446d07563a13d6f8856c2d7e8a9947bec7c28280e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: record.recordSimulation: FunctionTooLong \u2014 recordSimulation 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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac42f70344010d7e22f146985e1a620a11266916dbc4f3a267ae6638997df3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Solid: 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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d54f69b58d41f17e77cf7ed346f064269a6c97c1902add71b4adbb682a8e07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::api::boolean_op_reported_untimed: FunctionTooLong \u2014 vcad_kernel_booleans::api::boolean_op_reported_untimed runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8b8e620caa6aec8bb01e56e34b1eb11f0b973d336b7ef980b5150a09ee23e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LinearDimension.render: MethodTooLong \u2014 render runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-drafting/src/dimension/linear.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ed146904050f90464b542cb59ee835bd85b5f4fc2c5d6e809c18553e4a9da2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_shell::shell_brep_analytical: FunctionTooLong \u2014 vcad_kernel_shell::shell_brep_analytical runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82ff6bfbf45268525b97b17db914a5700a3840d1d55bbaabed99c7abf30e832"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: claude-mcp.makeClaudeMcpSolver.solve: FunctionTooLong \u2014 makeClaudeMcpSolver.solve 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a3772869532ef45ee09d8ed75b3b710336e5c2770851fa31ba05f5a26a7c21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flatten.rs: FileTooLong \u2014 825 significant 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 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"400b15887cfe65e7f35ead6ff900ad06f4cebd5a82fb87780977b83542020a41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_dfm::rules::hobby_mill::r7_threads_and_gears: FunctionTooLong \u2014 vcad_kernel_dfm::rules::hobby_mill::r7_threads_and_gears 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d0eac3210e4885c349862d72ba6f8a72dabaf5293f09ed5ae1e1a41d0e901f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fillet::revolved::extract_profile: FunctionTooLong \u2014 vcad_kernel_fillet::revolved::extract_profile 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0e0a91c44253139ab2608cc4b3fb2a0331f6187372e21da0a4f1a671b0b664"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gateway-mcp.makeGatewayMcpSolver: FunctionTooLong \u2014 makeGatewayMcpSolver 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":"mecheval/harness/src/solvers/gateway-mcp.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8eee4589fec6f14e3deff3082d8ad61347fdf4ca9eb273da552b7cec6368c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: integrity.computeIntegrity: FunctionTooLong \u2014 computeIntegrity 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":"packages/mcp/src/tools/integrity.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"19009c0a1b9d90db6995ab4cb40326ed9e7b870801e09438e896fd87919ec89b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useCanvasRecorder.useCanvasRecorder: FunctionTooLong \u2014 useCanvasRecorder 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":"packages/app/src/hooks/useCanvasRecorder.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd27fcb26ec81d515d51b86ae356d4a449c0a18e9f23cffe2efdeb400a5194a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cavity_extract.rs: FileTooLong \u2014 817 significant 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 317 over it, 1.63\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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8547d931b93654763f1855440af4200346b019abb28982986aa98a1d860ed2f0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PhysicsWorld: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d081f0590e411f3bd5cfc97707622107a892afdb88a9cd6370b931b5d5566832"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConvertCtx: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b0d8eeef8fdefd49dcbd184a89cd38821bce2ae40bfe4595199edd8ec4bdf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/evaluate.ts: FileTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 315 over it, 1.63\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":"packages/engine/src/evaluate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9aca8f428a868ccf0f47d910b3224945dadb22256e53292774a6ada9c11f4a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_antenna::receipt::predicted_claims: FunctionTooLong \u2014 vcad_kernel_antenna::receipt::predicted_claims 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":"crates/vcad-kernel-antenna/src/receipt.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8425402c104607c4e29192d8010617d2b511e9a47b37d94aa8c700c52ab11685"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: OperationList.OperationList: FunctionTooLong \u2014 OperationList runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d83b84cf4a20e7a93190a01a0a1124c625d1568057b1f33567b1385668c6770"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/claims-ledger.ts: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 314 over it, 1.63\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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24d59b1a30d5c8e462410d4630176532ffed26b020a3ac0043c1a35cc3eeff1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StepWriter: ClassTooLong \u2014 650 significant 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 319-1292. The bar is 400 significant lines; this is 250 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acb350ff4f199052b38d01ac7f6ba9b334f4b8da5388bcef15be75436d87b78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/circuit_sim.rs: FileTooLong \u2014 812 significant 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 312 over it, 1.62\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":"crates/vcad-kernel-wasm/src/circuit_sim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6268eb96e035e68279ba985c8d44b2db7a9b715e8be1c383b64d7ab950455b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/feature.rs: FileTooLong \u2014 811 significant 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: FeatureInput (3 blocks, 58-1165). The bar is 500 significant lines; this is 311 over it, 1.62\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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be545ab8271618fa275eb3f1c172613722621e5e8b7480074ba04997c535c2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/migrate.rs: FileTooLong \u2014 810 significant 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 310 over it, 1.62\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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e9923243a5b0d4514979833fb262e444df846ab2d436bc5f799610a33e6272"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlowGraph.shortest: MethodTooLong \u2014 shortest 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a425642171da74b2c7f435dc2fb8b858d65b8044b63fda7419a4b9dfca7e81cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FeatureInput.from_crdt_params: MethodTooLong \u2014 from_crdt_params 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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2259c94069c7cfc1202ff013bd7e5a699388799afc238af4f00c49bb9dcbd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_shell::shell_brep_open: FunctionTooLong \u2014 vcad_kernel_shell::shell_brep_open 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbce335e7f839dc6671528b0e8dab383bce0deaff9d351b043552adf1d6c7aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::adjoint::smooth_max_gradient: FunctionTooLong \u2014 vcad_kernel_thermal::adjoint::smooth_max_gradient 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":"crates/vcad-kernel-thermal/src/adjoint.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5b67314df50b0df943bb950d386f5091c80970b3cc2b8486998fd6a7bc6d41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fillet_curved.rs: FileTooLong \u2014 802 significant 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 302 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f8428ea32122281696108bbe32148fc4a0f6b1eccb399368bf239e16e3f8e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/grader.rs: FileTooLong \u2014 802 significant 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 302 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/grader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa29538724b96f13aad33fca12a54a562b92fb5cab9f488d664b6ca6e021e03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/frozen.rs: FileTooLong \u2014 801 significant 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 301 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e5257d4576f06985c0b9a8b5d6b587e05f8a8d50135f3d3af3186645152cde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: vcad_kernel_wasm::ecad_wasm: TooManyFunctions \u2014 48 free functions. The bar is 30 free functions; 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17bb6ba97143571af543af87550c51e508ae103b8fb8020ba9b649f1dc74f1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \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). The bar is 500 significant lines; this is 300 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d8f91d9e22fb7f55b3e4205696793955fd9b48b32f080b818c6b8f6cecf8b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::ui::toolbar::sub_tools: FunctionTooLong \u2014 vcad::ui::toolbar::sub_tools 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":"crates/vcad-cli/src/ui/toolbar.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c621857d11264882c4d4ddf02c1b531b065b159a7ba922bb940cc06acc6fc86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_planar_face_by_multi_arc: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_planar_face_by_multi_arc 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deb941a8eb5c2dde4a182d5b72be5f81558a89effddab168b29abf7837b46fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli.ts: FileTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 298 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/training/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a988a93bd55abfa54f21f2e3f5ab46502dc8868052b56cdd704acfd66ee7ace3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: entities/surfaces.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), declaring 40 free functions. 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":"crates/vcad-kernel-step/src/entities/surfaces.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fa8f4d3a2dca886cfa0ccca32f84e49fb461d06df35e7b4b5345c78ccd7ad3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::sim_extract::tolerance::extract_stackup_spec_from_scene: FunctionTooLong \u2014 vcad_eval::sim_extract::tolerance::extract_stackup_spec_from_scene 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":"crates/vcad-eval/src/sim_extract/tolerance.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4226b1961192a96a08cdcd22b7d726ebfaaf3ca34b9b94387ce604eba7c88a0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::build_gripper_slice1: FunctionTooLong \u2014 vcad_ffi::build_gripper_slice1 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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"48001580f44cc5aef17c0af1521f448385b7faec0d1871f9cd7a56e8b8ebcaba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/SceneMesh.tsx: 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39cb02640be426933c74234b3386fee5ddaa0bb4e375be54e3cd7c7e3260ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FlowGraph: 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), 19 methods, 2 blocks, lines 294-1379. 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca18cc7130ab87a1d28e16b20d7c7e907ee4731847140058344fbd6fbe9a876a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::vcode::parse_joint: FunctionTooLong \u2014 vcad_ir::vcode::parse_joint runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"7516b9d0ae5b9e1340989656564735c6c67f1313d31e2486dc64fbba83ff9acf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Proxy.spawn: MethodTooLong \u2014 spawn runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.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":"crates/vcad-mcp/src/proxy.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81c8ecfe51059f9fbdba89ddbdef0a1260d27efa9849fcbeb92ad8426c9a442"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: save-load.derivePartFromRoot: FunctionTooLong \u2014 derivePartFromRoot runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.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":"packages/core/src/utils/save-load.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f1bd1daae940af21ee6ce7599756636368c5e33238fe883f64abb0882a8ea2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/App.tsx: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"packages/app/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f544f0d50e8eda1bfe3003bca66d42d54afbe121e92d37df94ddcb0d5547c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reader.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 280 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":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"495c8a8ca7efbacfd1495bbdcd3f71e17c9234067c4c491298fb1c0a4276825f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_atoms::optimize::optimize_parameters: FunctionTooLong \u2014 vcad_atoms::optimize::optimize_parameters 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":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5c0ef66dd29ea4aa32f0412414e97c9804f804805177e611648804c6e4ed66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::route_batch: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::route_batch 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"965ac5373b6e15983d2ae08189304410e100f5923c64127b6b54e0553dec7224"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fillet::fillet_curved::plan_convex_junction_blends: FunctionTooLong \u2014 vcad_kernel_fillet::fillet_curved::plan_convex_junction_blends 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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"a428ca126e794c2ee7c680db67de66b624a8880e591e3a0905f37426f7a0ce7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fillet::fillet_subset::fillet_plane_chain_edges: FunctionTooLong \u2014 vcad_kernel_fillet::fillet_subset::fillet_plane_chain_edges 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":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fff3c35904bf62411b51fe1d252373166e5ef374268ca3bc682b7574dac581"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::file_io::derive_part_from_root: FunctionTooLong \u2014 vcad_ir::file_io::derive_part_from_root runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.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":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f974bc6ba2e351524e07bff1597f49f4393d6be7e63b7655330f2ad6b1a215"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::bbox::face_aabb: FunctionTooLong \u2014 vcad_kernel_booleans::bbox::face_aabb runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.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":"crates/vcad-kernel-booleans/src/bbox.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0362222ebd98adb6b32a7efe9a943e4b41a5b7c537892c1777b18401a2e01f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_cam::turning::rotary::plan_rotary: FunctionTooLong \u2014 vcad_kernel_cam::turning::rotary::plan_rotary runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daf41d79ea6fecab4e6cff5b7fd032043e46e31e2cdb01e996bdfee63308f86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_flow::conjugate_adjoint::conjugate_gradient: FunctionTooLong \u2014 vcad_kernel_flow::conjugate_adjoint::conjugate_gradient runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.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":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"2516a43ebcc8e982e1d9e1f46fb635686115d033d5249abfab2c4fddcfb73848"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::slice_file: FunctionTooLong \u2014 vcad::slice_file runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":3562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2eea3c13e6f5c45e8c32f5b6e40f92cc1f40ec9f29ebcdd40e50e934af79e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_acoustics::helmholtz::solve_driven: FunctionTooLong \u2014 vcad_kernel_acoustics::helmholtz::solve_driven runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/helmholtz.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a12dd14ac791640b33ff602458262df7328f9734980a17c49eae666583f0574"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InteractiveRouter: 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), 20 methods, 2 blocks, lines 570-1411. 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5abf74a40a4ad5c36a33d08fed06ffb16eacd3fea9f1cd1f5565f7f34c0eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: altium/mod.rs: FileTooLong \u2014 765 significant 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 265 over it, 1.53\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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51743b494f4f7c3faa2931c91e67cb3c4f6a12e115c1bc66228df7bd608bb2c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fea::modal::lobpcg: FunctionTooLong \u2014 vcad_kernel_fea::modal::lobpcg 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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf400707d4a3e88278f0e34e6feb81e5500c933828432ae53275ab8adf974b70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_flow::solve::finish: FunctionTooLong \u2014 vcad_kernel_flow::solve::finish 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":"crates/vcad-kernel-flow/src/solve.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb16a5449353ba20949ace9263774fd3e2ebac6984bab86c69666bd6951ad73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GpuScene.from_brep: MethodTooLong \u2014 from_brep 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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1c508b2b6df7847e00378b56a175d388c68bf47f63446f681f8dc4497bdc3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CameraSettingsPanel.CameraSettingsPanel: FunctionTooLong \u2014 CameraSettingsPanel 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":"packages/app/src/components/CameraSettingsPanel.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15b98f7a7d2e6d87dbfa0cbfcb41586e100091b6a485424d198d13628be93e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LogViewer.LogViewer: FunctionTooLong \u2014 LogViewer 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":"packages/app/src/components/LogViewer.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b65119cf0cbfe7778f21c9cb78f7d31e70849ef50a1ebf5aeb955b0027fca9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/to_loon.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). The bar is 500 significant lines; this is 260 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":"crates/vcad-ir/src/to_loon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59051ec191d45d5fedc291718dcdd2df7c2f836eff9e8ab13d00f1cadb8c33b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlowGraph.build: MethodTooLong \u2014 build 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fe077b6e73c231dff1a4510305d5ddfb995075c85b5a57024dcebdcd8a55d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sheet::flatten::flatten_solid: FunctionTooLong \u2014 vcad_kernel_sheet::flatten::flatten_solid 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b15d69894cca2531c9c9ab20e4e0caec32c9d409e9419c4e2864d09f7261c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_spherical_region: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_spherical_region 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5596}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd9ae1c4790f1ee962cf599f28097916ba126b2f9874084172e0c7250c211f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Viewport.Viewport: FunctionTooLong \u2014 Viewport runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba820c307424f51b2143f46e228a9ed7ef15ee159fecf148152c4fcdb852c363"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: receipt-art.init: FunctionTooLong \u2014 init runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"www/src/receipt-art.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8372269500280b14a5aee7a62786bd883ef1dff83dec1549cc4dad1eaf329e96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/buffers.rs: FileTooLong \u2014 759 significant 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 259 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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9058031799d8145369318e9c7c6e09cd1cd7d0b2e4699b1606b38df5f93d9c89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sim_extract.rs: FileTooLong \u2014 758 significant 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 258 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"192dabb5632ac9e89e4aaa7f34392382fd4817c9e83ae53bd527b4e937fe8f66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_sim::circuit::transient_adjoint::transient_sensitivities: FunctionTooLong \u2014 vcad_ecad_sim::circuit::transient_adjoint::transient_sensitivities 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":"crates/vcad-ecad-sim/src/circuit/transient_adjoint.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a553d15faaa76e2b83c7732d239e3f75c66965c8eb42b556918391ef10f11db2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::pcb_preview::pcb_preview_meshes: FunctionTooLong \u2014 vcad_eval::pcb_preview::pcb_preview_meshes 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":"crates/vcad-eval/src/pcb_preview.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e41f368bbf017a7e2928c26712d41fdee727a13d03e37edd638d8af4abe41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Profile.properties: MethodTooLong \u2014 properties 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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4e2c0256b356a2ce8f6e555000199edda468e6e69a2fcd3a24b822ec40139a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gateway-mcp.makeGatewayMcpSolver.solve: FunctionTooLong \u2014 makeGatewayMcpSolver.solve runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mecheval/harness/src/solvers/gateway-mcp.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4da6474b60fc32556e1053ace3e932cb771b99d015b11a5089b96908dde8b29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usePhysicsSimulation.usePhysicsSimulation: FunctionTooLong \u2014 usePhysicsSimulation runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a0963bf9f5789e237e56fb3dbf2227dba9aeb035580e2bb41eab6b0b4e6701"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/gym.ts: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"807f84119eb88a018c0200f4ddf3e46086a14726a0494a5f04a1946a868938fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::input::handle_mouse: FunctionTooLong \u2014 vcad::input::handle_mouse 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d4040845e18a55fbb78cea3cccebd8d947f0e1e1a1ce818d7f2e99fcf02c7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::frozen::evaluate_plan_impl: FunctionTooLong \u2014 vcad_kernel_tessellate::frozen::evaluate_plan_impl 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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44848e86c3a8b77e75ce6431a686b074a5dddba4d0a6dd8ad914447d86f9374"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/SketchPlane3D.tsx: FileTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fb812d3d0a01708d2d4966ec9a643c787be9a42313f5ddf3417aa58cc56824"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reader.rs: FileTooLong \u2014 748 significant 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: StepReader (2 blocks, 493-1285). The bar is 500 significant lines; this is 248 over it, 1.50\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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20079c057f3d28a43437f7c876a4e9d6e3490934d3a2c12eb71f34b4bba56135"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tracer.trace_impl: MethodTooLong \u2014 trace_impl 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":"crates/vcad-kernel-particle/src/trace.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1ccf07cfe7d7f2e7f16b13721ab1554dac35d551dc2cd0773f63ea98d14a8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: animate.buildSequenceGlb: FunctionTooLong \u2014 buildSequenceGlb runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83c7c4a0202e4101b9755d12a2ca850dde7005b3e45a3b6c2a305be6da8193f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gym.rs: FileTooLong \u2014 742 significant 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 242 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":"crates/vcad-ffi/src/gym.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f9c3695a9e1416c7808fb8ee89577b570eac2757b594d7b0d4d0cf42be223"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PcbKernelBoard.PcbKernelBoard: FunctionTooLong \u2014 PcbKernelBoard 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":"packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9ce573b4e0f1833c7944ae26b973fddb580a322bfbf767aa0778a0fa160fd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schematic-hierarchy.flattenSchematic: FunctionTooLong \u2014 flattenSchematic 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":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc44e05a80f320f7d975e4b023f6e8a8817892eaa12029789168b5686a4ce9f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 738 significant 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 238 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":"crates/vcad-render/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"832586946976d14118c7ef37ea32a45c4fe9344f54b734f7890951570599da3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.process_command: MethodTooLong \u2014 process_command 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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1997363760c3540ee318cd4b95441546033ed0288470d4d243740cec3288c30"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fea::adjoint::shape_gradient: FunctionTooLong \u2014 vcad_kernel_fea::adjoint::shape_gradient 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":"crates/vcad-kernel-fea/src/adjoint.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e00f759127cc8d602b65d4109911150e57a04d3023508e107021b67586aa36b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_particle::chain::trace_ion: FunctionTooLong \u2014 vcad_kernel_particle::chain::trace_ion 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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b48128b2e32a615040904f4a2ca37a5a096518a6a5271a0397cda7e219f9ab5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tolerance::allocate::allocate: FunctionTooLong \u2014 vcad_kernel_tolerance::allocate::allocate 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":"crates/vcad-kernel-tolerance/src/allocate.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa40b506b3c36e88533b61a58a526bb727bddbd6cfc054ef7bb30323a830944"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SketchSession: 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":"crates/vcad-kernel-constraints/src/session.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc5c159b010a2a3a1edf4c237d83ed5ee388d199dc0d068371dad665925f60c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::gpu_bridge::gpu_search_batch_inner: FunctionTooLong \u2014 vcad_ecad_pcb::router::gpu_bridge::gpu_search_batch_inner 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":"crates/vcad-ecad-pcb/src/router/gpu_bridge.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3bd55fadbdc457fe72fba2406398c61ad6cc8c5f21fc131ed1eb6effe20c55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::frozen::capture_plan: FunctionTooLong \u2014 vcad_kernel_tessellate::frozen::capture_plan 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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b00b6cc2ee8d2657d3a9e0aebcf4f656a6e613953b86ef28142a3dd1adae88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: XRGestures.XRGestures: FunctionTooLong \u2014 XRGestures runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/xr/XRGestures.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebd657dc91a00698c62e980ee6e541fdb49e689a82d4586ea03aab643623e79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/DrawingWorkspace.swift: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 229 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":"apple/VcadApp/Sources/VcadApp/DrawingWorkspace.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f384caf1796e3b0c6abda50925f7a0ad26ece93db4714dcc3265b62dea2da51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::kit::build_3mf: FunctionTooLong \u2014 vcad::kit::build_3mf 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":"crates/vcad-cli/src/kit.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67898305e27707b21cfe3fd142a61d4505ef153743dbbd66e3920e1e8f6b2a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::validate_and_commit: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::validate_and_commit 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2936}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4b5fc7c454dbb0ae28f9348f2ebfdae3f850c20f27c9169feb1c6d65dedcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fea::shell::check_shell: FunctionTooLong \u2014 vcad_kernel_fea::shell::check_shell 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":"crates/vcad-kernel-fea/src/shell.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a3865517e35dd8d2cdd79c8b1fc721aee9d8169653e9bc0f67d65287243995"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_toroidal_face: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_toroidal_face 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177407475a8dbc4b1754e7965697f79793ea3f612ce0ea62e68dd50550635a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SketchPlane3D.SketchCursor3D: FunctionTooLong \u2014 SketchCursor3D runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8368681e0fa8cf737cda0df1b56735ae122b954f1cc97491674b8159f421e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::topology::analyze: FunctionTooLong \u2014 vcad_ffi::topology::analyze 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":"crates/vcad-ffi/src/topology.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9ae4929bf6858b39768aa41c9ce270bbc0646b7c54fbc45eab9d0d2ee39e67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::cyl_band::try_parse_two_chain: FunctionTooLong \u2014 vcad_kernel_booleans::cyl_band::try_parse_two_chain 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e480c45bb726c1bd7c2b22b5e6570849ba569d0ff1421cd8f2238e17fdc4af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: expression-input.ExpressionInput: FunctionTooLong \u2014 ExpressionInput 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":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5014c621e296f94bd96e7e40b145db4264e4ff2b9bb2e131f383b59998f003b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diff.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":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecaca96d9e7ccd682aa121d11ea917925c62c54c38f328a72fb62b5465417d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WasmDocumentEngine: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f7eee79d1e89d874f81e41f89861f62f86bfa32332e67f2ac0eefe0b63fbd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_sim::circuit::netlist::circuit_from_netlist: FunctionTooLong \u2014 vcad_ecad_sim::circuit::netlist::circuit_from_netlist 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":"crates/vcad-ecad-sim/src/circuit/netlist.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd4e499c27bee9a387ef858b57392079c5dd09995ad21c9b15195719b91f021"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CircuitAnalysisPanel.CircuitAnalysisPanel: FunctionTooLong \u2014 CircuitAnalysisPanel 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46cbcfb0dcbe3d71d410a6f57ed165e85814ff88a1468cc7a9ec520ea4e0d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::kicad_board::board_from_sheet: FunctionTooLong \u2014 vcad_ecad_symbols::kicad_board::board_from_sheet 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"456fa8f2354e93e210e7ec192c6414bc12c25614986b148a809f3d53bed5e30e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PropertyPanel.SweepProperties: FunctionTooLong \u2014 SweepProperties 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8363e39d8fe5ca5f584e8c04b593658526dd1e3e9e44f12b306ce072bd59cb2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_conical_face: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_conical_face runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6323}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf33dfccea9ffc61d47bddced08de924c1b2d142b0ee3596561970d6bb0887a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_printcheck::checks::check_columns: FunctionTooLong \u2014 vcad_printcheck::checks::check_columns runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"09890c4dfc3cc32735aaa961185fcb55503404625d8b92bb86ae959caaa53673"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fit.rs: FileTooLong \u2014 704 significant 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 204 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":"crates/vcad-kernel-enclosure/src/fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e13cc018d67a928b704b60789bc38a48419b3823e35f6c0683b41dae859523"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/protocol-2026.ts: FileTooLong \u2014 704 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 204 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdea7fafd3012d095f5980ac9345cdbc5e178eea41564ff8a0220d32dd491a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WasmDocumentEngine: 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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d3aad6fbbbd72acb22d1c759b41a483c780aa0a2a94d57f49caf1e3a0fd6ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DocTitle.DocTitle: FunctionTooLong \u2014 DocTitle runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"848b66fe9e5d6e93fa6459566137196bd74c7e2729e1328b55f9d5a0a6e774f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/api.rs: FileTooLong \u2014 697 significant 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 197 over it, 1.39\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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2bd514583d25571bb6cde36381e3345fdd44aa8422a4b427e81868e987fa2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlanarMagnetostatics.build_system: MethodTooLong \u2014 build_system runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27de76c73c4d3069558e3caf30f7dd9ac852e50d1d603450d0ca8099a193a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sweep::sweep::build_swept_solid: FunctionTooLong \u2014 vcad_kernel_sweep::sweep::build_swept_solid runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sweep/src/sweep.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"730c6effbcbc4a89ef1b38bd40f79a66ef77d4bba014cafc3652fcffc136d189"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tools.rs: FileTooLong \u2014 690 significant 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 190 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a62bfdc825942883f0c2cae793a8cd39f4a741ca2f0c3d2a00fbd7bc1b2c53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::pour_synth::synthesize_outlines: FunctionTooLong \u2014 vcad_ecad_pcb::pour_synth::synthesize_outlines runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d817c0605aa1f24affab854fef10bbf460a991ac59d0d042c716eb8e15cfb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 688 significant 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 188 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1f5553618f913cdf3679774674b7b0e3c5cad1ae0ba1385e74027275486196"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/ElectronicsWorkspace.swift: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a7176a3501f1d971917fd5a7b2f46424a671370dbaaf6f62af35c79a26d4d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/section.rs: FileTooLong \u2014 686 significant 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 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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8037488e163d942165dd38223c4aebf3362debd9e1ef0b97c9ff228456b18714"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/ElectronicsView.swift: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 185 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d07787f97526d07de2b0408f54d4376680bca1e4aac886c85a6de19db19d19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow/cdt.rs: FileTooLong \u2014 685 significant 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 185 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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d85bc069f9b7978c7f68e84b81f9418ca56382079f002a96dbf988e5c90db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::flow::route::try_commit: FunctionTooLong \u2014 vcad_ecad_pcb::router::flow::route::try_commit 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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"14714c731504c7885f1e0d0cb328b69b69a700bbe0190ec951a8d6f1177229c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::kicad_board::place_footprint: FunctionTooLong \u2014 vcad_ecad_symbols::kicad_board::place_footprint 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b7f7b8ca663718d72f6e5c1b551ff594ea15bd44601c67464c5c1a0a241057"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_particle::electrode_opt::optimize_electrodes: FunctionTooLong \u2014 vcad_kernel_particle::electrode_opt::optimize_electrodes 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":"crates/vcad-kernel-particle/src/electrode_opt.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbb2b4a5c6f9b8ffbc3b109c92cb06dc9d73422c0048897da222f5e9d5cfcfe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::pour_synth::decide_pours: FunctionTooLong \u2014 vcad_ecad_pcb::pour_synth::decide_pours 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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b71ddf9c691b6cc5a5832058f1350b5350b9ab5a9838a5f4b7680c5df4ffe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze-store.useAnalyzeStore: FunctionTooLong \u2014 useAnalyzeStore 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":"packages/app/src/stores/analyze-store.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf99acd303cbd20e87f1f58512b8dd92e671d55654189583b4a766085996e2f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Simulation: ClassTooLong \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), 36 methods, 2 blocks, lines 131-955. The bar is 400 significant lines; this is 143 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c4593f35a70f1f3191b19693b45286a918307f0f96160990a2db6a86aa3edc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/input.rs: FileTooLong \u2014 675 significant 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 175 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":"crates/vcad-cli/src/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00549f0913bf13f1cf8e182e3ed76bf690d1430f93c762f3758829d0aec8ce9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::stitch_to_planes: FunctionTooLong \u2014 vcad::stitch_to_planes 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbdb4756aa158d7a207cebc70b21433da470c8dc34e91aecdb2dc3ac2783aa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::sheet_build::build_sheet_metal_document: FunctionTooLong \u2014 vcad_eval::sheet_build::build_sheet_metal_document 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":"crates/vcad-eval/src/sheet_build.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdfc304ae3d801da41cd848780e88adfc14e3eb5263cd142489734aed359586"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::ui::command::render_palette: FunctionTooLong \u2014 vcad::ui::command::render_palette 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":"crates/vcad-cli/src/ui/command.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a611bcc5604e17339d21cbcb3a5b78cc4296b08a72a04b9743214861598b0ba4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::heal_t_junctions_pass: FunctionTooLong \u2014 vcad_kernel_tessellate::heal_t_junctions_pass 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dc8899eb805a859ea25728739fd7e703462cddf5351db9c418b1971c2d2a75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: matrix-cli.main: FunctionTooLong \u2014 main 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":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"da358931635687ae178343503cabb641d479d724d800f25a3dce408df396d3e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AboutModal.AboutModal: FunctionTooLong \u2014 AboutModal 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d032ff2b7222fddc39260d611a816213602c343bf46c7b7ddd4462bcf501970"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: chat-store.useChatStore: FunctionTooLong \u2014 useChatStore 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":"packages/core/src/stores/chat-store.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"772c6a9db6c4366e1edefa32366bc5b19fc3f690fab728e65ed31e5acaad924c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gerber.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":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a3389931ccbdc98ae6a8874b300b2eebe8e49f8910628a89831db75698d7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TransformGizmo.TransformGizmo: FunctionTooLong \u2014 TransformGizmo 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":"packages/app/src/components/TransformGizmo.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b9c029965396c97c343f15d2bae92ce4a2a97bb1cbe5a00d3c369d936e9ac5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: GizmoView.swift.buildGizmo: FunctionTooLong \u2014 buildGizmo runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apple/VcadApp/Sources/VcadApp/GizmoView.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"df46b85a9ed45e9c6bcc776289db7970d294c56b8cc145c44bc77b33968f8f75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::length_match::match_lengths_runs: FunctionTooLong \u2014 vcad_ecad_pcb::router::length_match::match_lengths_runs 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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4e00cc80b84c7b697c833cbcbea088d411800c0b71ff8fb745abaa14ff610b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fea::section::check_beam: FunctionTooLong \u2014 vcad_kernel_fea::section::check_beam 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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fde11a8d76399efb69fa22d76deb0d786c7832d83b8dcf176d0fe16f9ce62a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sheet::flatten::detect_bend: FunctionTooLong \u2014 vcad_kernel_sheet::flatten::detect_bend 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"770becc8f53864044ce5b6d2362a93422d47077af9695d44f86d0f656bf2ec10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::raytrace::rasterize_rt_scene: FunctionTooLong \u2014 vcad_render::raytrace::rasterize_rt_scene 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9301012c3fcc2fa0355e9943651605a3c212bcab2dfc6696f42b3f77260de359"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ToolLibrary.ToolLibrary: FunctionTooLong \u2014 ToolLibrary runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0d4401a311091ee9c431b5d5f172bf370eba1ecc0551e64a0ab89094aee606"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Problem: ClassTooLong \u2014 522 significant 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 771-1529. The bar is 400 significant lines; this is 122 over it, 1.31\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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de09d5f7fbb326c311be2e00187f6136b8b9fdd7c74d2aced78c0480d0dbfe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::pair::realize_legs: FunctionTooLong \u2014 vcad_ecad_pcb::router::pair::realize_legs 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dc4ba2fb35b7c668bc2d8f6fbe66974d36bc160c9a10e0fd23dd5b68f0f549"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: StitchDialog.StitchDialog: FunctionTooLong \u2014 StitchDialog 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":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d561ad5fb3e7bdad15968e9135bd662576cd12f3a73f4a03b0d229f94676dad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.TutorialPage: FunctionTooLong \u2014 TutorialPage 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":"packages/docs/src/app/tutorials/[...slug]/page.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b232bd07fbcba828baa3b7f3b3ee0eca527175b96ae46d05e05bc6d4e5ade9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sketch::extrude::extrude_with_arcs: FunctionTooLong \u2014 vcad_kernel_sketch::extrude::extrude_with_arcs 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7982cf965e2f00e61be9ca598af631af72630b63d2bcfa1ec7759a240c791bb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel::sheet_json::tessellate_model: FunctionTooLong \u2014 vcad_kernel::sheet_json::tessellate_model 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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"09729e381ea52e45efe8f0f5cea0a83cbb58ff4ad9891ffca76dd24a62c54131"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_sim::rl::train_curriculum: FunctionTooLong \u2014 vcad_sim::rl::train_curriculum 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":"crates/vcad-sim/src/rl.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b125ee9d09d07af5570671368aaf92bea443348e75cb8ee4eb75c15cae8a3b31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: og.generateOgImage: FunctionTooLong \u2014 generateOgImage runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/docs/src/lib/og.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08c91212dc3b7b4d9bef1692affb9c992c6c5c60b94072d7145afee9cd826dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower.rs: FileTooLong \u2014 642 significant 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 142 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6b41226f57e1a5cd320ad5f777a3e6e72d1a1d0efc67f95664e8070718ec97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow/realize.rs: FileTooLong \u2014 642 significant 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 142 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":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b4c6d2ba36761d49a98d99c7569f5ab14789911f2ee310dd374c89874d4f44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::compensate_run: FunctionTooLong \u2014 vcad_ecad_pcb::router::compensate_run 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":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78abf6811e815e654f021cb482a9932018cc9ce75ead2120f1ef700fa7ffca4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_topopt::analyze::analyze_fields_thermal_warm: FunctionTooLong \u2014 vcad_kernel_topopt::analyze::analyze_fields_thermal_warm 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":"crates/vcad-kernel-topopt/src/analyze.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe0b762bd03efff025c4d291d3f5ad573d5ce3903cbfcc71bc145d4974ba0b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_receipt_verify::verify: FunctionTooLong \u2014 vcad_receipt_verify::verify 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":"crates/vcad-receipt-verify/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0a6266b415c1902de42f0324b4273956b215a837e4d048902c5585a15e9cda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ContextMenu.ContextMenu: FunctionTooLong \u2014 ContextMenu 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7ae3d8d82e02b6cbacc6fd1325b7dba1b85422bb4c6a476845ae97ddb804be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: crate-generator.generateTypeScriptLoader: FunctionTooLong \u2014 generateTypeScriptLoader 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":"packages/wasmosis/src/crate-generator.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5127cab2bbabcf14170241b6a02ddcfaf96e69f87e5da234ecdc0bfbf2c6722"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_io.rs: FileTooLong \u2014 636 significant 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 136 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":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65421996f5c640da03af4944a313d60e7fa5728c764c885092c8387a3f2d2e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_design_constraints::lower::run: FunctionTooLong \u2014 vcad_design_constraints::lower::run 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3cd88529f4b7d1424fce421511bac88d0e74faf6b346cb4e6e7a86d4e768c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_drafting::dxf::sheet_to_dxf: FunctionTooLong \u2014 vcad_kernel_drafting::dxf::sheet_to_dxf 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":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1169bbb45d68be9c194be9537b2222b24b57083b94716f62eeda754e4f5c829"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mecheval_grader::grader::check_step_roundtrip: FunctionTooLong \u2014 mecheval_grader::grader::check_step_roundtrip 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":"mecheval/graders/src/grader.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"632f449322edb134fbf2d36b89cf7c3805bde542d2fbbff0a7d0e7783bbe2aaf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Sketch2D: TooManyMethods \u2014 38 methods, declared across 2 files: src/sketch.rs (36), src/export.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":"crates/vcad-kernel-constraints/src/sketch.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"17669808729fb1952767527fe5ac8cae7fb693a2e6b6fcaa8bd95e191346c3f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/PrintWorkbench.swift: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 132 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":"apple/VcadApp/Sources/VcadApp/PrintWorkbench.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eec629c5d94fe46a8c8d29e0d2f09b3a1b6a61983dafdcb6631b217da2ab88f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::merge_circle_with_crossing_hole: FunctionTooLong \u2014 vcad_kernel_booleans::split::merge_circle_with_crossing_hole 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ded0ebe10c24d609b3a6babc04339b9782ea28330340da11a86060c857d70a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::solve::assemble_solution: FunctionTooLong \u2014 vcad_kernel_thermal::solve::assemble_solution 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a3b54d721169d79f975cced73cd9b2c24e1557c4192bc9e5033f041344c604"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MaterialEditor.MaterialEditor: FunctionTooLong \u2014 MaterialEditor 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":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9fe4f7be5baaec55883b93ebe11ff7d2b608989c8cfeca5d24bcf2d70c6c55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SearchDialog.SearchDialog: FunctionTooLong \u2014 SearchDialog 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":"packages/docs/src/components/Search/SearchDialog.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb3a2d7fd822add9911f98478dcb96e74891621c0a26132ba5358170fb9ba4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/WelcomeWindow.swift: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"apple/VcadApp/Sources/VcadApp/WelcomeWindow.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb34ca94808c4334dc79e3b480e48fb95f5964c3149f8cc2dba2462193db9dc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.ts: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: createCommandRegistry (180-834). The bar is 500 significant lines; this is 126 over it, 1.25\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":"packages/core/src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7adcf4643eaf1edf2c21885436a114f88278d4608c7377deeea7a1e5c00fc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::freeze::freeze_circle_loops: FunctionTooLong \u2014 vcad_kernel_booleans::freeze::freeze_circle_loops 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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b17170d562c270dd968a0369100dc3cab7b2af1b84d55d6c6beebfaae79eb61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_features::build_pattern: FunctionTooLong \u2014 vcad_kernel_features::build_pattern 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":"crates/vcad-kernel-features/src/lib.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a511b92193a63cacb484fc8e0886d35a404acbca09472537647ee363b8c15d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_wasm::circuit_sim::circuit_from_schematic_wasm: FunctionTooLong \u2014 vcad_kernel_wasm::circuit_sim::circuit_from_schematic_wasm 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":"crates/vcad-kernel-wasm/src/circuit_sim.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f31a17520fc73d0b483f699fd37026b0854aaa0a5da5069b10f618ee1f493b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ParametersPanel.ParameterRow: FunctionTooLong \u2014 ParameterRow 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c98d98d411f14641f14268c98431de3badb49b00af883e36dec9f4b25859f16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SceneInspector.SceneInspector: FunctionTooLong \u2014 SceneInspector 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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"74679188034ac5d3ec510dc6142d17f05b8a1de92174d77cef495f8c1d4fc2fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PatternDialog.PatternDialog: FunctionTooLong \u2014 PatternDialog 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":"packages/app/src/components/dialogs/PatternDialog.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e0b46dfb252f58c201bd53e48f5e55156bfc45e2791153c54298cd8204f674"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CsgOp: ClassTooLong \u2014 499 significant 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 815-1688. The bar is 400 significant lines; this is 99 over it, 1.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":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ee4f78755cf54bfca32f533dafe8651f162e92480ec946890af26879ff6b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/Document.swift: 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5a617115d8468fa8b174aacf4ccb501a755e03d3fabdfc339da2a6f3149d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Shared/Document.swift: 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":"apple/VcadVision/Sources/VcadVision/Shared/Document.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"172a9811dd47290392295c8ae8db9848b9e3562fa4c0d3d01dfa571cfe6de471"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/sco.rs: FileTooLong \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), about 65% of them inside a single declaration: ResidualSystem (2 blocks, 119-694). The bar is 500 significant lines; this is 120 over it, 1.24\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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac6d08aacf70cc17c848ac6af7371507f419fa178424232bd47e853b1503082"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::evaluate::build_sheet_model: FunctionTooLong \u2014 vcad_eval::evaluate::build_sheet_model 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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fea6258b3f65c0e8abb10ee41a1f973fff961579d46c544600e917ba1ff3770"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_step::reconstruct::plan_edge_merges: FunctionTooLong \u2014 vcad_kernel_step::reconstruct::plan_edge_merges 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":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c86da9c2438e3f2b0ed57ad5b748a1614ea5ed3f77f65b8bdd464b384d62e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_slicer::analyze::analyze_for_printing: FunctionTooLong \u2014 vcad_slicer::analyze::analyze_for_printing 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":"crates/vcad-slicer/src/analyze.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd97a64ae527eec537f20f64b33e2095ee1728ca864ca3a32b81463041251c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CNCController: 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":"apple/VcadApp/Sources/VcadApp/CNC.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92b733374d306b03d8dbe79e8f829c63f91652fe29b84bc41322290254e3027"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: 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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"068d1e5d06dbeddf183c1e8392ecdb96cabf1d9f1d6a3116c73f903d6bb04d52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::train::vcad_train_start: FunctionTooLong \u2014 vcad_ffi::train::vcad_train_start 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"6938c0ea114d15664ba327dd4d33bb99de27d3dffc2763574aaeaabccc7d44e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FeatureTree.FeatureTree: FunctionTooLong \u2014 FeatureTree runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac8907d340474204127f80c2ee3af7e1b1f586e99adabdb8d6bd5163002952"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cam_job.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). The bar is 500 significant lines; this is 113 over it, 1.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":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c1cc6b41da3c1a63b5869226475dbfa18b29cb4171860d72ff4293a8ae41e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/core.rs: FileTooLong \u2014 610 significant 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 110 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":"crates/vcad-mcp/src/tools/core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93acf1962c41b22af5b10e0fcb9a5261c5ce75e9c338713d27fba3f96efb4fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_design_constraints::lower::lower_anchor: FunctionTooLong \u2014 vcad_design_constraints::lower::lower_anchor 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8988d74d15bcfbdfd7d8b8c2e61470f6a57d157c9a5ad87d7ac804b36e88cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResidualSystem.solve_lm: MethodTooLong \u2014 solve_lm 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a88b8f69f3ed53e36af8241a70828f292f36b6530b876c1eda93c8c7f704c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sketch::extrude::extrude_with_holes: FunctionTooLong \u2014 vcad_kernel_sketch::extrude::extrude_with_holes 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6150dc7e8a3372218aef32f6b0d4e3d0dd57eaa9dfe7035bce9abbeeda2b59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/kicad_board.rs: FileTooLong \u2014 608 significant 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 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e9e6943bf67cc2e8d68a9e4d47d5e4e3d57832085ac8974b59f6b0e83dbbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bem.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). 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":"crates/vcad-kernel-particle/src/bem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"559e95c13e42f31ca970e6577dbe14b569a0db89e52e85dcc06f464c0b4f6733"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sheet-metal.ts: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/sheet-metal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"372b2e82a074473005f4cf94302de1e31c756cb5a0e451d41afbfc99fc3a97aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/recon.rs: FileTooLong \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). The bar is 500 significant lines; this is 106 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":"crates/vcad-ffi/src/recon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b77b5840942ebd0c42c37e9fead7a806c8a3fd4f93fe2c0c3783fb67a307209"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RouteSession.from_pcb: MethodTooLong \u2014 from_pcb 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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a4d54c0e9ddcb310dcbbb4effabd81d70f01a8cdf17334804ec6cb1520fdf8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AxisymMagnetostatics.build_system: MethodTooLong \u2014 build_system 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dee0be0f86ddc8f6a8ff0b60a853a97a5fc2f1b5fc323e25604a2f710ce24d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fillet::fillet_planar::fillet_all_edges_checked: FunctionTooLong \u2014 vcad_kernel_fillet::fillet_planar::fillet_all_edges_checked 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":"crates/vcad-kernel-fillet/src/fillet_planar.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8272a021454d5611f3e75b12ee59515e6eb8d47fe46ceb8d3f5b7e1fd7c8bc3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MobileShell.MobileShell: FunctionTooLong \u2014 MobileShell runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37514fea5c1ecbfe12aba820c0dadac19d6f3ab5e73765dab513f17fc1c70a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Simulation: 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa383941c479d7e3152e71575827fb215bc92476c16cff32679283c21bb01433"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentTools.call: MethodTooLong \u2014 call runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apple/VcadApp/Sources/VcadApp/AgentBridge.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ed725e6572c9b3cf253006beda27e38a755e920ea034683f74167f97309dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::ring_escape: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::ring_escape 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ce368d3428480866fcc3f30bda3629b827a22a9e9224d3209f5822d6ff3e77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sheet::flatten::assemble: FunctionTooLong \u2014 vcad_kernel_sheet::flatten::assemble 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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d736af4b88e40e5c328cb025cd855c936e0b07b1040c6b72f17568dd216e31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_cone_sector_two_chain: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_cone_sector_two_chain 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6536}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f44fa2f126074f9194999b93edd5a7407891df888cbaab17079512755f59c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::thermocouple::reduce_log: FunctionTooLong \u2014 vcad_kernel_thermal::thermocouple::reduce_log 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":"crates/vcad-kernel-thermal/src/thermocouple.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac74d28ec520ca042d5552ce7c26ee2c235b89e0431287600eee74b030a76fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: import-urdf.importUrdf: FunctionTooLong \u2014 importUrdf runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/mcp/src/tools/import-urdf.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bcbf827d1ee89bee744147667c0c0e2946dc3273fc2843d0ff62384baa82ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: inspect.computeInspection: FunctionTooLong \u2014 computeInspection runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/mcp/src/tools/inspect.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23a5f2b6dcb7888f917f366b91edf55644195b4acb7009c6fbc9dee344c7406"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/Header.tsx: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 96 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b368604ba3db469fbf2070a7deb629d9f9f79694fc023fc3a45a6c5f10702c54"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StepReader: 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), 9 methods, 2 blocks, lines 493-1285. 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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d59df82cd73d9f101c3746a5acd448e177b39f6402e6b35fd8d2038701a7e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::plan_bga_escapes: FunctionTooLong \u2014 vcad::plan_bga_escapes 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"d186182e61149cc6e3425826201fc9abb76ece027a46528287d0c2f2f3aba34e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlowGraph.negotiate: MethodTooLong \u2014 negotiate 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb426f309cc582640145d642fc7e7ba451f9166fc744d6f518314d5e488cc88c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::train::run_training: FunctionTooLong \u2014 vcad_ffi::train::run_training 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"89695389633724e5068822bef5eb8383085c59e7d69465d98221c9ac55f6d21a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_acoustics::instrument::tune_bar: FunctionTooLong \u2014 vcad_kernel_acoustics::instrument::tune_bar 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872857cbcd0835b17973910be80e654b4c6baf49b009f47338e5db49e321e75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::clip_spherical_face_multi: FunctionTooLong \u2014 vcad_kernel_booleans::split::clip_spherical_face_multi 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e29aabd8f32a96d8e11d0705bab560ce39f46c7e733ef4801afebba87a49a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_step::pmi::extract_pmi: FunctionTooLong \u2014 vcad_kernel_step::pmi::extract_pmi 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":"crates/vcad-kernel-step/src/pmi.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a2f0a74f5559d8a9ff9dec6b624fb2674f3dc527184e8ca9819b703bcc04e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel::hull::convex_hull: FunctionTooLong \u2014 vcad_kernel::hull::convex_hull 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":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7030bba48534c66cdc5a7b4d3d1f4aaf1a844a9640b5c4cc31de89b626f9b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.handle_legacy: MethodTooLong \u2014 handle_legacy 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b930ecbce90ced9baacb3b759b0b13c30fbe6230784f4a769a0b403768a09e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slicer-worker.onmessage: FunctionTooLong \u2014 onmessage 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":"packages/app/src/lib/slicer-worker.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a669bd2e82d0125826e2d68188782a9b09e5fe072bbecd46f21113909ff13d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/train.rs: FileTooLong \u2014 593 significant 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 93 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30e99f57e28ebdd3c24ef60fec04f0615c46150952c41fcf3556cff5b4064d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sim.rs: FileTooLong \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), about 92% of them inside a single declaration: Simulation (2 blocks, 131-955). The bar is 500 significant lines; this is 92 over it, 1.18\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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9fa7200b626a2818dee7ede48b77134f1d8877e85e3034e37c026156fd34ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_chat::tools::anthropic_tools: FunctionTooLong \u2014 vcad_chat::tools::anthropic_tools 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":"crates/vcad-chat/src/tools.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ef66b377d065c54f75a9e13ad1dc059820ef0dfb309da2e3767ef33891e5b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResidualSystem.solve_sqp: MethodTooLong \u2014 solve_sqp 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"70684e06ab512063471ce2cc7f3588b1235d5396a72e7e713d88e2c2ba5e5eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_schematic::generate_netlist: FunctionTooLong \u2014 vcad_ecad_schematic::generate_netlist 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":"crates/vcad-ecad-schematic/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d6789bef2253dad4830d5f326eed44c7eecf1b477c5f9dafc747a01d878bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeviceSpec3d.resolve: MethodTooLong \u2014 resolve 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":"crates/vcad-kernel-particle/src/spec3d.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e846a8a7dd936405a8084527955cea6074b424a1c4e03543a264747b33199c85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: KeyboardPrefsPanel.KeyboardPrefsPanel: FunctionTooLong \u2014 KeyboardPrefsPanel 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3ae735acae5b9f5792ac8d48de868fbdead299340ff3484c78ef8a7e6e645e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SketchPlane3D.SketchGrid3D: FunctionTooLong \u2014 SketchGrid3D 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cabe6c61a01ed0b634c71184165b041dd40bb525bcea9be9614e0fff8b9241e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: toolbar.MoreDropdown: FunctionTooLong \u2014 MoreDropdown 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":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b451165756b98e59b1779480ec963020e441c0d43b52d03441a0f80354924baa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 589 significant 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 89 over it, 1.18\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":"crates/vcad-app/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f9bcd03791da358cefed26cc9e2f9424680c605d41e7e31c3cdc5c37e8596b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TurnPlanner: ClassTooLong \u2014 470 significant 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 28-655. The bar is 400 significant lines; this is 70 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":"crates/vcad-kernel-cam/src/turning/ops.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a2bccd21ef11ca83503963597284bdeaa993b9b2f66754c5332557d826d0a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/section.rs: FileTooLong \u2014 587 significant 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 87 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd8a4c2655cec345de0b48de2b6bea3b0f7b37cb91ead58533964dda11ea2c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_fabprep::verdict::route_remaining: FunctionTooLong \u2014 vcad_ecad_fabprep::verdict::route_remaining 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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"968e2ad656ec3f60cd8c1acfe1e0679621a41b026e9a4005e2407167e90a230e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::cam::generate: FunctionTooLong \u2014 vcad_ffi::cam::generate 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":"crates/vcad-ffi/src/cam.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7751d0bd419d396cde01a6cf90e8f5681041d58c4f4e98a4100096e0d1153a8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::prune_redundant_patches: FunctionTooLong \u2014 vcad_kernel_tessellate::prune_redundant_patches 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"df56ab742446a48c7fd33ae6ed5c4488cfdf9a2d3abf6e5a10e6d8763e29a71a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::solve::solve_field: FunctionTooLong \u2014 vcad_kernel_thermal::solve::solve_field 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b54a47c9a7d6304e572bb984b61fbf06c71c3f649866ed64223df9a2ec4c34b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TermsGate.TermsGate: FunctionTooLong \u2014 TermsGate runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/TermsGate.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3035124ee6d177da9b48b17b6fdccf3617dfc17acf741ac2de54405b24b367"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Viewport.BoxSelectHandler: FunctionTooLong \u2014 BoxSelectHandler runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6454ba9385a4dbb7b065ddb97ecdd59bbf609e2a79b9be7544495c1d670c4ebe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 35 stored fields beside 37 methods. The bar is 30 stored fields; this is 5 over it, 1.17\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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f947680f752cddf4908b2b92c2c027848de38b6f1422fb92ac8694690368ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReleaseWindowController: TooManyMethods \u2014 35 methods, declared across 2 files: VcadApp/ReleasedDesktop.swift (34), VcadApp/GizmoView.swift (1). The bar is 30 methods; this is 5 over it, 1.17\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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4fe8873608c02f22b695f47988888c4e6f901e55a676e54c5fc4be8e70846f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/registry-dispatch.ts: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de73e757ea8ccf625f772a0466af8f4bbfc22c8783df882100cca9cc09f53e32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sketch_session.rs: FileTooLong \u2014 581 significant 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 81 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":"crates/vcad-kernel-wasm/src/sketch_session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d432c5cc626dfff882c9bb9ba624c2b4bfd3d6d4e97d90501ab5ddb64f56c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::tools::lower_geometry: FunctionTooLong \u2014 vcad_app::tools::lower_geometry 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":"crates/vcad-app/src/tools.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"63df72c8160f97059cd633f6000fd6476e6103c1a4d0f10d01fb610847d1563f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::transient::solve_transient_schedule: FunctionTooLong \u2014 vcad_kernel_thermal::transient::solve_transient_schedule 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":"crates/vcad-kernel-thermal/src/transient.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc9ca5f0c0bc66bf362d42739aea6e5a6015b7f6eea437d1435c6a09fbf5a96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::evaluate_assembly_instances: FunctionTooLong \u2014 vcad_render::evaluate_assembly_instances 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dabd6140f229d380dd31f8dcdda27cfdc8bc98b97abbe47d044ca6074dc1374"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InlineMaterial.InlineMaterial: FunctionTooLong \u2014 InlineMaterial runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/tree/InlineMaterial.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2db54e7d38b13c851c9dbfda090b66b30d1c67f0bb5ef160b72063bbafb37ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/materials.rs: FileTooLong \u2014 577 significant 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 77 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":"crates/vcad-ir/src/materials.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8a2ba0e24798bb12411c168680dd40a9b4d787f3a7d2e36d84b8cc54574bde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vacuum/mod.rs: FileTooLong \u2014 576 significant 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 76 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":"crates/vcad-parts/src/vacuum/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec6cf7c72f7ccc2e31d0de1413f7431605ff6449cc9d44f047357e31759fa92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ssi.rs: FileTooLong \u2014 575 significant 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 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":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2de2ef2e8e30bfd462c61badcbaf4a9912b20a4f6d99326abc162a51bc009c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeElectronicsView.inspector: MethodTooLong \u2014 inspector runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"95137e23bf19d477e160d277abe487c81cfb7b7b003e00da59b308c52d2ecd16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::flow::flow::choose_sites: FunctionTooLong \u2014 vcad_ecad_pcb::router::flow::flow::choose_sites 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"832aec2fe2e262f7865f6ac9e1c4e27b6f3d6195d960419338616d808cf93d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/sheet-metal.ts: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 73 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":"packages/mcp/src/tools/sheet-metal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3ef3cbd8d000a513165fb848daf5141c880b9ccf7560c8007a58376189f913"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trim.rs: FileTooLong \u2014 572 significant 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 72 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":"crates/vcad-kernel-raytrace/src/trim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754cae605c58b91920f53d29947e02da481d791a07a0f994af1c6af7c096d52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 571 significant 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 71 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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df756f347b8536476a1f1c93f4b1c0a88dd5f9439e5ecab0050b0e65dae404d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ElectronicsCanvas.body: MethodTooLong \u2014 body 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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7054e8e4d6953125591d0117c8d890620ff825fea4f0197d9bdebe08487827f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mecheval_grader::suite_c::solve_ik: FunctionTooLong \u2014 mecheval_grader::suite_c::solve_ik 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":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a70c3b4c9dedaf9fa0fe1c4d98e263954a6e7d4280eeb5e80aeb2af24de470f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fidelity.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":"crates/vcad-torture/src/fidelity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed9488a39233ed3d378f86dd82ce2cb83dce4aca3fc291fea308974c87b8b73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_shell::logical_faces: FunctionTooLong \u2014 vcad_kernel_shell::logical_faces 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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6530f97d942953d4150e39c112f8ebdaff9016ae8d7fffd7607d0062169d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel::sheet_json::build_model: FunctionTooLong \u2014 vcad_kernel::sheet_json::build_model 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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9c73a9c2a81d065f8d6cc487cc9111366f35a49472822f203770c92fef0fda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InlineProperties.InlineProperties: FunctionTooLong \u2014 InlineProperties 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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9d21434efa582d5aa4704fd0c2f9f29474f08ec1c0501a8affc6b1127844f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: EcadFeatureInspector.ComponentFootprintPanel: FunctionTooLong \u2014 ComponentFootprintPanel 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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c3a51160115212d9a39712c9ec62f10fda103dbfba094489ff4373c31828a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/bom.ts: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78325fcf3279c9a7f92e7897e6497be5cc0c0c0c308c6c17413cdb9527117508"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/DirectManipulation.swift: 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8e5b3cb407deef81610e8fd5be0553f4e870e3c91676f133f0ea3ef08a37dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/part-stock.ts: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 60 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"540f2df94247cb794cc87b945a24e7671b6b99cb6f460d8a5da8afc610b5d30c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::split::split_circular_face_by_line: FunctionTooLong \u2014 vcad_kernel_booleans::split::split_circular_face_by_line 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c32b2e96ef470cc158d1a16e6e5274237634e233ec07e95424eb76720d31592"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_fillet::revolved::build_revolved: FunctionTooLong \u2014 vcad_kernel_fillet::revolved::build_revolved 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b62970df805a98a41a642f0d247079e24d6330de8459424625346b3d4c26338"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_photon_dose::capture::capture_gamma_reports: FunctionTooLong \u2014 vcad_kernel_photon_dose::capture::capture_gamma_reports 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":"crates/vcad-kernel-photon-dose/src/capture.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb263e1c2464223bf79aafd6e15a10cfcbb644ea03ce778e4caf5756b3824d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_sketch::extrude::extrude_with_options: FunctionTooLong \u2014 vcad_kernel_sketch::extrude::extrude_with_options 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"704efbe06e622be00be683977ca71881c2826a92b987edb932c137c902990764"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AnalyzePanel.StructuralEditor: FunctionTooLong \u2014 StructuralEditor 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a5773e18f1126260890638aaf78a57de64a261285ac7bd36931f1b85f6f109"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: source-parser.parseRustSourceContentWithInference: FunctionTooLong \u2014 parseRustSourceContentWithInference 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"66822bcc310ba7c51c5907a3b551abeac04cf3482098f2b43a4c17f07df5aee2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/clearance.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":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b56af7e5e50ad92c5e4a323951d02092cc6a902c1d29fdc846b932d79be41f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: VcadApp/SoundPanel.swift: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b220b75c097d4d2acb960c5e64f065decb075dc9637fed5c6c79927954029f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReleaseWindowController: ClassTooLong \u2014 446 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 46 over it, 1.12\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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ab27c4e03f64293eecb3e2be92e866a73039455eb00360e696e0eb0c824fbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turning/verify.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 55 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":"crates/vcad-kernel-cam/src/turning/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c62abf53fdf3eb51dd336ccbd28aaf5be432ab656d9b9dd70b660b5a17b02a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_mcp::tools::loon_carry::carry_electronics: FunctionTooLong \u2014 vcad_mcp::tools::loon_carry::carry_electronics 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":"crates/vcad-mcp/src/tools/loon_carry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c4c0e382ae650ed85dbe634cd140503c2f98721741a65c7a5d83fe98b34f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DocumentPicker.DocumentRow: FunctionTooLong \u2014 DocumentRow 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e5de086189b29193577c5e3f5a559f5f86f451d91ea0caa3e226cd2f048d10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: KernelPulseChip.KernelPulseChip: FunctionTooLong \u2014 KernelPulseChip 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":"packages/app/src/components/footer/KernelPulseChip.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38781c789c2ef4ce0572eb78a44b98a978ededa4c13bd295a24ad5afdfa073e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DecisionCard.DecisionCard: FunctionTooLong \u2014 DecisionCard 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":"packages/app/src/components/ui/notifications/DecisionCard.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed350f89c4d7439ad0a253380322aa76fab2303584011468508947dc0e092089"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 551 significant 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 51 over it, 1.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":"crates/vcad-diff/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d932fa3b0c74b0221086c801828df21ced5170d6e5f11a35f100f962add165"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/antenna_extract.rs: FileTooLong \u2014 551 significant 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 51 over it, 1.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":"crates/vcad-eval/src/antenna_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"421fba564430eb7e178e8f36c3810d4b3518505252de2dbfcfb7df33837cdfe1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::agent::tools: FunctionTooLong \u2014 vcad_app::agent::tools 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":"crates/vcad-app/src/agent.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8abe5eae93cdf173a87b87312d3506bb52d2f32a4d9ed97d73ce9f543235baa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_acoustics::ported::analyze: FunctionTooLong \u2014 vcad_kernel_acoustics::ported::analyze 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":"crates/vcad-kernel-acoustics/src/ported.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207bfa82dc6659b4d37a969bdca3f224e2c0ea7e41a2d24d06e1244cc4bdae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tolerance::economics::economics: FunctionTooLong \u2014 vcad_kernel_tolerance::economics::economics 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":"crates/vcad-kernel-tolerance/src/economics.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"963fd75a6e566445f0b790724472642b2f7a241bdafe1cb6d27c4be2047b63f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_slicer_gcode::lint::lint: FunctionTooLong \u2014 vcad_slicer_gcode::lint::lint 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":"crates/vcad-slicer-gcode/src/lint.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"751c30221acb6bcdbd3ae7fcc95f080348b0e04c969dfa737a1a408bbfa66bb4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Embedding: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 2 blocks, lines 138-738. The bar is 400 significant lines; this is 38 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":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"313d022b4ae84f90c4a85d54dbc925ae3d37efb9fe7e56c19820dc0f5e36a968"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/wavefront.rs: FileTooLong \u2014 545 significant 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 45 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":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9ad0b976c17328aafb6fe19baa37ae07b8b12f7d9cb76720f2b08ab8c7e884"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/AnalyzePanel.tsx: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a826a4ed35cdd68dbaa085868d6cc150f7d44e687a50e7547325291f162d9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::kicad_pcb::infer_rule_areas: FunctionTooLong \u2014 vcad_ecad_symbols::kicad_pcb::infer_rule_areas 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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3b95d9d79faf33be9399078dbd174e04f5e2d25d4a2e6cf212f7a5b23c2bfd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::kicad_write::write_library_body: FunctionTooLong \u2014 vcad_ecad_symbols::kicad_write::write_library_body 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"7653440303773eacbcbccba05819d084a9da521f01ac547322f20ced2b9a491c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::vcode::format_joint: FunctionTooLong \u2014 vcad_ir::vcode::format_joint 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dda013d9cebb405c696af579a5ada3ed945242f4f93b7f94b3361c300e2b1e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_particle::chain::run_from: FunctionTooLong \u2014 vcad_kernel_particle::chain::run_from 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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"80056198b3bfca24a72dceec79071ef33227468f021cf2a1620f03c6ae169cfb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_small_spherical_cap: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_small_spherical_cap 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5921}}}],"partialFingerprints":{"codehealthFindingId/v1":"427bfc192e1a27eda4d144600b0722b8d4c5477094ed94cb62388e062494c960"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_large_spherical_cap: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_large_spherical_cap 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb397f62d2bf174e132bf770397e61c2c5b15963056a91a33c21d6e0f2163958"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_brep_with: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_brep_with 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8523}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a87d87575f18c491c25160799694dc69f4ba2796c104e79e5e0edab8138a601"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::build_artifacts: FunctionTooLong \u2014 vcad_render::build_artifacts 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"174706af2d0f947d1c04f7f94331a5f35db20a3ad006b3cd6282852de6d979ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::sheet::raster_sheet::render_sheet_jpeg_str: FunctionTooLong \u2014 vcad_render::sheet::raster_sheet::render_sheet_jpeg_str 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":"crates/vcad-render/src/sheet.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd66d6a0cb031dbf22a014bafec381f24da3afb4e9e4840593ef12e14514bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PcbGettingStarted.PcbGettingStarted: FunctionTooLong \u2014 PcbGettingStarted runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/components/electronics/PcbGettingStarted.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93823cc668f906ddd1bf9dfa9ab58a2111189626e1890d3cbdcec347c75b892"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useOperationPreview.useOperationPreview: FunctionTooLong \u2014 useOperationPreview runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/app/src/hooks/useOperationPreview.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c4ada2c8f07bdbd2982c204fab7db8dfa58f8bbe6722215e83f86c44f2d1e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/axisym.rs: FileTooLong \u2014 544 significant 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 44 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dec8da1577de48e3c7dd0a34fb38c87f3cec4f45418f3e9badbaa9b5e9ef4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \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), about 74% of them inside a single declaration: RouteSession (2 blocks, 198-940). The bar is 500 significant lines; this is 42 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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da54d5e62b611ae546c1a8320834034897f72bb04edfa034e4ecb37462ca8d6c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DocumentApi: ClassTooLong \u2014 433 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 2 blocks, lines 119-848. The bar is 400 significant lines; this is 33 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":"crates/vcad-app/src/document_api.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"17065cda4c55717a03cb7ccbbd4dbf2c450aed2bb8c28d5a1e4b837ca2d0e774"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pcb_preview.rs: FileTooLong \u2014 541 significant 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 41 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":"crates/vcad-eval/src/pcb_preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4c19ee22af5486bbc1ffe24318ba1ee6731ae6153c6f4c54bc2f83fbb66935"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turning/rotary.rs: FileTooLong \u2014 541 significant 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 41 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":"crates/vcad-kernel-cam/src/turning/rotary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"518a19c2c8b6209578a62a1286809b1f98dd5d0d2daddae9a2ec8224e089cc77"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SceneMesh: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cb5d48e5209f323ecd7b1b1fbe4fe6cc4a4b24716387ded8f525d9c7095eed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::materializer::materialize: FunctionTooLong \u2014 vcad_app::materializer::materialize 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e6bbf0ba603a2a0b89b6d9673f39f440ec16296c0272d1d789f36d33b35b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::si_claims::si_claims: FunctionTooLong \u2014 vcad_ecad_pcb::router::si_claims::si_claims 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":"crates/vcad-ecad-pcb/src/router/si_claims.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50d687470d98d4af7c38580615e886d4fddc864bcddb5ad7ed6b44f7f67391d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_step::entities::surfaces::parse_bspline_surface: FunctionTooLong \u2014 vcad_kernel_step::entities::surfaces::parse_bspline_surface 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":"crates/vcad-kernel-step/src/entities/surfaces.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af10257954aef74ec65590d123dfe51b8e72c748c1e56469d7788c2642802bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: InlineDimensions.InlineSweepProperties: FunctionTooLong \u2014 InlineSweepProperties 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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6723c676f3e082de0e650ac16745c63695b652f0ee1a7ad07a8d5ae9c017bc63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/variants.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). The bar is 500 significant lines; this is 39 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":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe9d0e4b93d96e6629b2555571544a6a293ef62b09697a9f784da5678f20e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shell.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":"crates/vcad-kernel-fea/src/shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fa9a68b43b1376254214774b36af90c835a14b859662f2a316ab7081c951a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stores/sketch-store.ts: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: useSketchStore (178-797). The bar is 500 significant lines; this is 36 over it, 1.07\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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b838c2582f64f1cb308383de27d273c356fd7720a0e750d41fd356384ee6a1a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/document_api.rs: FileTooLong \u2014 535 significant 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: DocumentApi (2 blocks, 119-848). The bar is 500 significant lines; this is 35 over it, 1.07\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":"crates/vcad-app/src/document_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c2fc88d485915ac9c7db7b41c64779920072cd84e2a89e51f01a8da58fc179"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::ecad_tools::sync_schematic_data: FunctionTooLong \u2014 vcad_app::ecad_tools::sync_schematic_data 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":"crates/vcad-app/src/ecad_tools.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e24505d11ac5ea58297051bfe8a17b689c2cc18048bc54c39f3cedb28df22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_symbols::kicad_write::write_fp_graphic: FunctionTooLong \u2014 vcad_ecad_symbols::kicad_write::write_fp_graphic 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"3709ceab2a6aa3c25991343ec247d7f901845c75b86f641d98e65ad6583997e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ffi::fea::prepare: FunctionTooLong \u2014 vcad_ffi::fea::prepare 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":"crates/vcad-ffi/src/fea.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c97171efb982a2684371b9238f0fd3e50af4f423bcd806c96f305d377285cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_render::callouts::plan: FunctionTooLong \u2014 vcad_render::callouts::plan 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":"crates/vcad-render/src/callouts.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"608559d681e81e3a96d32ee3dd584ded3035456539982bace6dabbd3a58abce4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parameters.setParameters: FunctionTooLong \u2014 setParameters 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":"packages/mcp/src/tools/parameters.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a8b0d125a68077fdc8d4120ddd0642ee5642b5ba49b3bb28ba2744575acf7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render.renderPcb: FunctionTooLong \u2014 renderPcb 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09bee6f6033cf644584e2d7cd152339a084011a3e2e40e62bde3f0792215395"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RobotEnv: 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":"crates/vcad-kernel-physics/src/gym.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aaaab4d8c94060e155ac30fdff6d4b4f8a034f1787d1c93ae69fb507b8d035"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.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), about 66% of them inside a single declaration: SketchSession (2 blocks, 305-884). The bar is 500 significant lines; this is 30 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":"crates/vcad-kernel-constraints/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87c7f12edfe1b405a6370c0d0703b18d65c287a58e42d3874d59b581598060f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::tools::lower_update: FunctionTooLong \u2014 vcad_app::tools::lower_update 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":"crates/vcad-app/src/tools.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c824aabb6686945a868e8ca56eb14a52763486573327b54234a2c1d2290aa94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ctx.elaborate: MethodTooLong \u2014 elaborate 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":"crates/vcad-ecad-schematic/src/hierarchy.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfe5d19ee1f03ece7dfe2bdbb95ac7e1383f2efdd14bac8fc640b77691826c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_adjoint::couple::solve_coupled: FunctionTooLong \u2014 vcad_kernel_adjoint::couple::solve_coupled 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":"crates/vcad-kernel-adjoint/src/couple.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"031e54c92aef9c6383f2f59c20eb62f5f62e3c3bb2a3d543af069038ecffa1bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_dfm::rules::hobby_mill::r5_min_wall: FunctionTooLong \u2014 vcad_kernel_dfm::rules::hobby_mill::r5_min_wall 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"da678da32ed280418239ae9076f0a75222abac36ab212ce4f9c8a521b16c84e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_thermal::receipt::predicted_claims: FunctionTooLong \u2014 vcad_kernel_thermal::receipt::predicted_claims 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":"crates/vcad-kernel-thermal/src/receipt.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619de900b347e6231035349a4f077843729aa2f60140857674030756dfcf70e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_topopt::extract::extract_mesh: FunctionTooLong \u2014 vcad_kernel_topopt::extract::extract_mesh 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":"crates/vcad-kernel-topopt/src/extract.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f54b950d34937a7ccb2e9fac09e20d74397e17c4de482a3cc0f47d0a2a5984a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConvertCtx.convert_sheet_metal: MethodTooLong \u2014 convert_sheet_metal 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c635c026d408630b928542eb8e2542fc6eabcb6ab9bc133b0ce4c496bbf346"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_slicer::smart_defaults::recommend_settings: FunctionTooLong \u2014 vcad_slicer::smart_defaults::recommend_settings 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":"crates/vcad-slicer/src/smart_defaults.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"312a876e37bb0b9adcb9cc219e669f8b2582aaa34b9d0db95aae31bc3c3bfe1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ParametersPanel.ParametersPanel: FunctionTooLong \u2014 ParametersPanel 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c6da91a1127e0ba42993abca40eb6bdcf3a3e9d5711316333c9f4c6f8bd967"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SceneMesh.ImportedMesh: FunctionTooLong \u2014 ImportedMesh 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a03e2e962d4bde7ef8d635b03fc24fcecca52c38608def9fc87f21fdb81c92f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: EcadFeatureInspector.EcadFeatureInspector: FunctionTooLong \u2014 EcadFeatureInspector 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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd71e942709ab893527ac8524df762407650efe86888ee0f88f39040482b0ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ElectronicsPanelHeader.ElectronicsPanelHeader: FunctionTooLong \u2014 ElectronicsPanelHeader 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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"903057f38b106771c4f99f61ac8438f41ab69006c4b2b75c1bb587e618877628"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: topopt.topologyOptimizeTool: FunctionTooLong \u2014 topologyOptimizeTool 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":"packages/mcp/src/tools/topopt.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afd19a4d4479cd1aed34b3c310ad839aadc8dadbecc8da66a2240a5813e3f8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/adjoint.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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfea8e1843c313f341ed5ce725b4f26e1477949d05b211877471576e2a7b57a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/escape.rs: FileTooLong \u2014 525 significant 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 25 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":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ea4d631b47fd0f1b6237d5a85727118a4c8155275c825523f7ea2f63742c04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 525 significant 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 25 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":"crates/vcad-kernel-features/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d75398ca935e130188f9b1f81ff83b7c461dc4265965e934c43d8e8dc6a849"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::step_doc::step_assembly_document: FunctionTooLong \u2014 vcad_eval::step_doc::step_assembly_document 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":"crates/vcad-eval/src/step_doc.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"891433eb290df0625220d2c06b7f8ba3622556278315be88db8e7efc250d42ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ir::vcode::parse_light: FunctionTooLong \u2014 vcad_ir::vcode::parse_light 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6b922dfbb61a165b027408faf171b527d04671bf026c9937f2935ce17020e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::tessellate_spherical_face: FunctionTooLong \u2014 vcad_kernel_tessellate::tessellate_spherical_face 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5139}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb7084d4f5937d191e9171c11f8f3ae6eaef41f888df322467d149a2bc05d23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clearance.computeInterferenceAudit: FunctionTooLong \u2014 computeInterferenceAudit 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"85761c36e1c2856ef1b206774cd92036d6b637524c0745b13427c86f2a5d92d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clearance.checkClearance: FunctionTooLong \u2014 checkClearance 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"da793b3908f6025eb0baf494d9022ce4e3764eb37085d97f88bcbfb55983f758"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kit/gallery.js: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). 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":"www/public/kit/gallery.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c45bdd5df14227e0ec07d385a4e2705932573d2fae10a66f801ec278e0b21a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/SketchPropertyPanel.tsx: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccde331ca3e2131d4728ce9ff63bfd0f522da6b97c5b35a07bae029f53a871b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vacuum/flanges.rs: FileTooLong \u2014 521 significant 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 21 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":"crates/vcad-parts/src/vacuum/flanges.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d78e25724000a077477a35193d3cab01a39f08770b10831bda6d815f3b4f7cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_app::doc_edits::lower: FunctionTooLong \u2014 vcad_app::doc_edits::lower 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":"crates/vcad-app/src/doc_edits.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf07bc679fb41c78bb9ed51728898cec60bd14607830d8b9f6d88887283e9d4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_eval::sim_extract::extract_device_spec_from_scene: FunctionTooLong \u2014 vcad_eval::sim_extract::extract_device_spec_from_scene 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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c8d5c520dd0482ba3872d83ae6d71c570bd2ab9636f1c5ab933d5fb4390c73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_loon::recover::recover: FunctionTooLong \u2014 vcad_loon::recover::recover 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":"crates/vcad-loon/src/recover.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8f5f3d27191c61cc53d2fa7853c3783acdea4e651e1780b7e58fdb01f0e727"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/optimize.rs: FileTooLong \u2014 519 significant 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 19 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":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e7da1b9e3c77db724baa1d553a88b7074bc6bf3828f4a83589b4fe62c16665"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mesh.rs: FileTooLong \u2014 519 significant 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 19 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e9757fca45ae4f20aac3973785e8269febc2541dd2b244c5ec476f664aaae0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/session.ts: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafcf1bbd0b3296ecf09eb5787e9c31656bb8398406a2d23577f8c59443994fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Palette: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\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":"crates/vcad-render/src/pcb.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"998cacba04116f216578b991b27e1b917408e9abd2da9995c9b60a91aae5ec90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad::direct_links: FunctionTooLong \u2014 vcad::direct_links 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7359afe869fe651af9bc117cd1b5e833a369a7d54da674fe5b4e678c5abdace1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::srj::srj_to_pcb: FunctionTooLong \u2014 vcad_ecad_pcb::srj::srj_to_pcb 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":"crates/vcad-ecad-pcb/src/srj.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"556bea53cfb685bd94a66b324a398cdf01d4a5576deefd7662373724b913b064"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlowModel.validate: MethodTooLong \u2014 validate 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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa58bb99f74f42a5f7b4d5d911ced2353f0ed0fc207cec5719298ad7d3e27f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_particle::poisson::solve_with_chamber: FunctionTooLong \u2014 vcad_kernel_particle::poisson::solve_with_chamber 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":"crates/vcad-kernel-particle/src/poisson.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef394b1ff80c3ee59c1112a4732ec187c088a480944efb3a6293e6cfdd5e5a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DimensionOverlay.DimensionOverlay: FunctionTooLong \u2014 DimensionOverlay 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":"packages/app/src/components/DimensionOverlay.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b2c257729c1cf4ad5ad72bdf657db8090a73a3188759f0de790c8f613ae53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TextDialog.TextDialog: FunctionTooLong \u2014 TextDialog 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":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6953ebde4c3c102cb82301f8b156b37d1b3d6c286b3ddf32d45d356a95aa7319"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ElectronicsPanelHeader.BoardSizeControl: FunctionTooLong \u2014 BoardSizeControl 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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd09798d12ae26d164fffc3c68779dbf17b1ae74c8f8d39cd4b0ff954e7a413f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AIProgressCard.AIProgressCard: FunctionTooLong \u2014 AIProgressCard 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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6500b5e47e2aeaf1f4b90f4e8d62360763652c9e44242947ac47ed0576e2dd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: atoms.renderMolecule: FunctionTooLong \u2014 renderMolecule 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":"packages/mcp/src/tools/atoms.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a38a8f07d1e06cff0500679809ac5cd1a387b4d3410d73f9d9ac6c7bb251c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flat-pattern.flatPatternFromSolid: FunctionTooLong \u2014 flatPatternFromSolid 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":"packages/mcp/src/tools/flat-pattern.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fea64a74985d1f477b618acb7f43172e2b4ab0f2254026d928e3d0c3614c520"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cam/OperationList.tsx: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"749f0d4fc7d6e606b0b79d36413cdebb7a206d0b3b32f04db11b65d82004cb83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow/embed.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 86% of them inside a single declaration: Embedding (2 blocks, 138-738). 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":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31014f2a0c9fd52a11af493f7ac8b9b72d9f44a3d913a1450e255cea24a068e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builtin.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). The bar is 500 significant lines; this is 10 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":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e0f46dd28b02f733ebb043bcde6dad55b6e587732f439a496ec9306b7541e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mesh/csg.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). The bar is 500 significant lines; this is 10 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c24668085b28cae8ed26aea791ddc010319f6cdff629511291aea20c5780bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/revolved.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). The bar is 500 significant lines; this is 10 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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"151cdb9646003ff4240d4f74a9e7885b83626897f1972dbbf28ffdaeb4e82d8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/solve.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). The bar is 500 significant lines; this is 10 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":"crates/vcad-kernel-flow/src/solve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24c2ca08638367b95f0323d89f6339ac912e6902578ee591ac96abe8bae3930"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Simulation.step_tm: MethodTooLong \u2014 step_tm 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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc650276696d88bc535f49b98589db70826be76ffaa25fc6aeeed538df56085f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GpuSurface.from_surface: MethodTooLong \u2014 from_surface 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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9be7b8b3983a8c737ae9c93b20b6cec2d0583303f11e611a629103a3a33eb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_tessellate::triangulate_circular_cap_with_holes: FunctionTooLong \u2014 vcad_kernel_tessellate::triangulate_circular_cap_with_holes 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"179248ab59b52caf1faf3fe99f28456a2db66a343b6e4917e8f47a59aca461f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VariantSet.resolve: MethodTooLong \u2014 resolve 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":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e238c6b5b574d98cfb671c5fb5994c66d999d8b6c22ee5866bf139abca7634"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mecheval_grader::suite_c::check_task_success: FunctionTooLong \u2014 mecheval_grader::suite_c::check_task_success 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":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac34b9a93cb377c5fe80bcae83bc463fadb0598425da140b9dec075b48db4b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CompressedFieldOverlay.CompressedFieldHud: FunctionTooLong \u2014 CompressedFieldHud 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":"packages/app/src/components/CompressedFieldOverlay.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4535ea3decc6b0bfa7adf0ce9dbaf1f6266167949ca5624e1c2919c7943b1ea2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/component_mesh.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":"crates/vcad-ecad-pcb/src/component_mesh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0720ef170294be21d3cc60a85f298083af9ca46846577292d653d0299faaeaec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_design_constraints::lower::lower_constraint: FunctionTooLong \u2014 vcad_design_constraints::lower::lower_constraint 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"de27d91bc43fbf154506a43cb777d48b70040b6fcf537dd04fdf5448aefa134c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::search_route: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::search_route 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0992c21d564b1bf6627a4e62b1f88d950e0449cb3a79fb1de8f861b81e2ff64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::auto::escape_endpoint: FunctionTooLong \u2014 vcad_ecad_pcb::router::auto::escape_endpoint 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3605}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a74aefb320e0d56e64a42f1e723c10798d028585310c83edb3604792b3df8cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_pcb::router::shove::try_route_shove: FunctionTooLong \u2014 vcad_ecad_pcb::router::shove::try_route_shove 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":"crates/vcad-ecad-pcb/src/router/shove.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edc43c061505426085393793304c7e9e7469be709c2ab7c8fd3aa4deade6dad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_ecad_sim::circuit::adjoint::ac_sensitivities: FunctionTooLong \u2014 vcad_ecad_sim::circuit::adjoint::ac_sensitivities 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":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b400c625e788380c602ab1e502c83b3b97936c2593cff75e4a5f877d0f1f2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_kernel_booleans::trim::project_point_to_uv: FunctionTooLong \u2014 vcad_kernel_booleans::trim::project_point_to_uv 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f6459f2519cd7e05c6476393eac32273831a7ebb2e18c0dd84c729ec005588"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Regions.new: MethodTooLong \u2014 new 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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf62815bfb83363a2e4fa3627bf46232831b00596654d4d07c392eca443151e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vcad_loon::convert::value_to_document_in: FunctionTooLong \u2014 vcad_loon::convert::value_to_document_in 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc77cb83384c67ff56a2e38531ebbe6fc4264ea65c3a03b68cd96ded0e5bd016"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: KoanChip.KoanChip: FunctionTooLong \u2014 KoanChip 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":"packages/app/src/components/footer/KoanChip.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"803da10dbeb24e9fd08b5f46d11db081c668bd55bbaa08c6e36ae8b8bbe427b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useEngine.useEngine: FunctionTooLong \u2014 useEngine 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":"packages/app/src/hooks/useEngine.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0680215bed79328358cd0b7e28549d78f7e86b215db8903fba939af416389134"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/RayTracedViewport.tsx: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c0e9966b030f0909f5aff419891abeed676bf04dfd5aea787c6feaee23b446"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RouteSession: ClassTooLong \u2014 403 significant 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, 2 blocks, lines 198-940. The bar is 400 significant lines; this is 3 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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6620972f4b4a008c8547e5f78af6465ffa0a5f93ebf216927ded62ca5082a878"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/gen-task-refs.mjs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: TASKS (194-696). The bar is 500 significant lines; this is 3 over it, 1.01\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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f901a46612b78b7719ec673b2aa0ec8f975e7155949978694a36fb98fbad7ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ResidualSystem: ClassTooLong \u2014 401 significant 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 119-694. The bar is 400 significant lines; this is 1 over it, 1.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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"723ad5d4f8bb164e1b632a98e7a9e9ef4244eafcb8c09f9314a56fde67875c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 47 shared lines): crates/vcad-kernel-acoustics/src/receipt.rs:260-312 | crates/vcad-kernel-em/src/receipt.rs:369-421 | crates/vcad-kernel-flow/src/receipt.rs:283-335 | crates/vcad-kernel-thermal/src/receipt.rs:423-475 \u2014 These 4 members are variants of one another: a block of 47 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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3425c40a5beadf26d733623fbdf4d6c544bb94eb2b96423179fa3cd5567334"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 26 shared lines): apple/VcadApp/Sources/VcadApp/Editor.swift:2771-2822 | apple/VcadApp/Sources/VcadApp/Editor.swift:4721-4774 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2771-2822 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4721-4774 \u2014 These 4 members are variants of one another: a block of 26 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6229c2f85824a0c0eca017e37e4ba4e5fa693aedb5bbe3680976f80700657d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 11 shared lines): crates/vcad-kernel-raytrace/src/cpu.rs:81-152 | crates/vcad-kernel-raytrace/src/cpu.rs:177-232 | crates/vcad-kernel-raytrace/src/cpu.rs:342-409 | crates/vcad-kernel-raytrace/src/cpu.rs:485-582 \u2014 These 4 members are variants of one another: a block of 11 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":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a88039b4bdcf17d30d6100f41a5cb356892ca9f79bccf218206668f5e768481"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 8 shared lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1206-1218 | apple/VcadApp/Sources/VcadApp/Editor.swift:4681-4693 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1206-1218 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4681-4693 \u2014 These 4 members are variants of one another: a block of 8 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b903f381111fb6d6ee4a385c387f250f0fdc1b16693ea494dd35ae0cc6a6fa43"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 6 shared lines): apple/VcadApp/Sources/VcadApp/Editor.swift:797-803 | apple/VcadApp/Sources/VcadApp/Sim.swift:59-65 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:797-803 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:59-65 \u2014 These 4 members are variants of one another: a block of 6 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"e841644dfaeadce3374b38f1d46367af225fe9d725e1a0f7ea107698da376a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 23 shared lines): crates/vcad-kernel-diff/src/adjoint.rs:269-391 | crates/vcad-kernel-diff/src/seam.rs:366-461 | crates/vcad-kernel-diff/src/second_order.rs:172-282 \u2014 These 3 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 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/adjoint.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"41504cb1ab95d92d9727dcc70fc20fd7e65a1bc0f98688c32da6f0dc9b0e1afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 11 shared lines): crates/vcad-kernel-booleans/src/mesh/mod.rs:97-170 | crates/vcad-kernel-drafting/src/section.rs:119-152 | crates/vcad-kernel-shell/src/lib.rs:1253-1327 \u2014 These 3 members are variants of one another: a block of 11 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 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca502009369632bea47442660d06608b82adb11e31a915fbd2c2d985c1ef3448"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (112 shared lines): crates/vcad-kernel-cam/src/post/grbl.rs:112-258 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:164-324 \u2014 These two members are variants of one another: 112 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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfe70a1cf9f5d52aaaeacb5eef6b17a18f790f7c1a0a637c22e8c3a3522eaf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): packages/training/src/lambda/distill_lambda.py:91-415 | packages/training/src/modal/distill.py:83-425 \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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b22e8481f8da90a76266d858374f67a507f7b3f5a099c1fab778ac24916a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (65 shared lines): crates/vcad-kernel-em/src/axisym.rs:658-751 | crates/vcad-kernel-em/src/planar.rs:562-656 \u2014 These two members are variants of one another: 65 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"b613613c120a94b88570ee42fced864cfd6b5ab6bd9f59dd8da2d612a0419c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (49 shared lines): crates/vcad-kernel-primitives/src/lib.rs:429-516 | crates/vcad-kernel-primitives/src/lib.rs:594-716 \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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c0c554f26f7ddb3bb4623d9a268b088879bd9a95c0711ce5d3c6c2ff52212"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (47 shared lines): crates/vcad-render/src/animate.rs:550-636 | crates/vcad-render/src/animate.rs:654-735 \u2014 These two members are variants of one another: 47 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":"crates/vcad-render/src/animate.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e7380ff47c982c86c5a2eb21b45e6e5c21cf5911c673a0eed5e80b5fa821b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): crates/vcad-kernel-wasm/src/lib.rs:8259-8312 | crates/vcad-kernel-wasm/src/lib.rs:8451-8502 \u2014 These two members are variants of one another: 45 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8259}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cfbcc62db9bd8e104d2610895eb25b2056a374e2cc19fbf75d9c2d1103665e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (43 shared lines): crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:51-139 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:126-219 \u2014 These two members are variants of one another: 43 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":"crates/vcad-kernel-raytrace/src/intersect/bilinear.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce75b2d1d2f584aa2881000a7712e1140678171acbfd87bdb1ff7890b98000e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): crates/vcad-ecad-pcb/src/router/length_match.rs:231-342 | crates/vcad-ecad-pcb/src/router/length_match.rs:708-869 \u2014 These two members are variants of one another: 42 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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dec9b95eb92d69a496303f13d8f566170888affb27353521beb2990ccf6dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (39 shared lines): apple/VcadApp/Sources/VcadApp/Document.swift:560-625 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:560-625 \u2014 These two members are variants of one another: 39 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb215815f2791cc782897e65cf14718e6fe324f9900faba44f2e7452035ffb03"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): crates/vcad-kernel-particle/src/poisson.rs:173-306 | crates/vcad-kernel-particle/src/space_charge.rs:168-228 \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":"crates/vcad-kernel-particle/src/poisson.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"08db1f9113a3ebece0845279f193fc6fa7c63447ce10a96f221fcb02e1d56392"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (28 shared lines): crates/vcad-kernel-fea/src/buckling.rs:459-507 | crates/vcad-kernel-fea/src/modal.rs:142-268 \u2014 These two members are variants of one another: 28 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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2320805cb23ad098b901248cd6a28d561a564d8f189ae8eb164d7de6b76afe6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (25 shared lines): crates/vcad-kernel-particle/src/wire3d.rs:593-633 | crates/vcad-kernel-tessellate/src/clearance.rs:450-494 \u2014 These two members are variants of one another: 25 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":"crates/vcad-kernel-particle/src/wire3d.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b48e4a6a8753608bae8b2e19a22e64079f7929229f194a3a5ea49eb2e59581d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): crates/vcad-kernel-acoustics/src/instrument.rs:491-541 | crates/vcad-kernel-fea/src/modal.rs:310-366 \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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b4046a13fbbbb1125392f47d40ee6754848646444cd26af82307511328aee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-fea/src/mesh.rs:784-797 | crates/vcad-kernel-topopt/src/domain.rs:173-187 \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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"512fa76cfe2384e73987bb287b24f1bf6d8f59813b090ce7868ebb827ed23d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/vcad-kernel-cam/src/operation.rs:238-285 | crates/vcad-kernel-cam/src/operation/contour.rs:285-329 \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":"crates/vcad-kernel-cam/src/operation.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea42fad1328c08bd608773a38cf550e4fdeaafecdfb95dba7dfa7fc2e03657e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:2095-2109 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2095-2109 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a36ec48dc2da78a9b7e6a20fe7b3dbb64d78c9da1d8cc8cd4b481239ca6b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/termview/src/output.rs:103-147 | crates/termview/src/output.rs:202-243 \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":"crates/termview/src/output.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3266ead9efc53cc51ff7559e3cd3fddf99c1b15c1af9b3a75e47596ccbadec49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-kernel-em/src/axisym.rs:858-879 | crates/vcad-kernel-em/src/axisym.rs:888-908 \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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7ebefd439039897f3b77a556ea9d5146e803e65a6628cc1a39dc3712cbbf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:771-779 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:771-779 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee7385d839ae4525fd178957a3a226821120b31b3860271d98e7d39cdc04798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/vcad-kernel-text/src/glyph.rs:72-99 | crates/vcad-kernel-text/src/glyph.rs:101-134 \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":"crates/vcad-kernel-text/src/glyph.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3804a4d31bddb166d7dcb0e56dd5cc9af7b4a40847946e877e456a9f198271d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/vcad-kernel-fea/src/buckling.rs:408-438 | crates/vcad-kernel-fea/src/modal.rs:142-268 \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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"68720b807e1d25138c82e051a55b2520be8d9c13ea772c864534e298f90c38ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-cli/src/tui/sketch_mode.rs:92-122 | crates/vcad-kernel-wasm/src/sketch_session.rs:185-233 \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":"crates/vcad-cli/src/tui/sketch_mode.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f463f7198272727c4717efc583761eb0a5e5094a2446df5c8ef194d4344c8c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:578-590 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:1686-1696 \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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dad1cd705dd2799d9afb3f173711cfc7d214c31f564cda9460f8865bcf4821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-render/src/lib.rs:5118-5140 | crates/vcad-render/src/sheet.rs:412-428 \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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5118}}}],"partialFingerprints":{"codehealthFindingId/v1":"89063c089a9f4d695a63f715650b161a56412ef266a43fe51e060af91d296515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-render/src/photoreal.rs:792-814 | crates/vcad-render/src/photoreal_gpu.rs:344-470 \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":"crates/vcad-render/src/photoreal.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cdf712dddafe330e01d84629433a40ded228519e83589f438ed4acf4feac20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-kernel-sketch/src/extrude.rs:1351-1368 | crates/vcad-kernel-sketch/src/extrude.rs:1382-1408 \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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7291b5163d4cad642a1bab8c10514d741f2ba6550d1d1142e010d0564501734c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-ecad-pcb/src/router/grid.rs:61-70 | crates/vcad-ecad-pcb/src/router/grid.rs:76-89 \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":"crates/vcad-ecad-pcb/src/router/grid.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9f9d2029c1fb3934c61c2822ed3a47c36005ca64d1e7bcbe1483dd4c57ad76"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (22 members, 50\u002B identical tokens): crates/vcad-app/src/camera.rs:84-119 | crates/vcad-atoms/src/optimize.rs:612-719 | crates/vcad-cli/src/main.rs:2442-2525 | crates/vcad-kernel-cam/src/dropcutter/mesh_accel.rs:20-50 | crates/vcad-kernel-export/src/lib.rs:651-701 | crates/vcad-kernel-tessellate/src/creased_normals.rs:172-229 | crates/vcad-kernel-tessellate/src/creased_normals.rs:239-248 | crates/vcad-kernel-tessellate/src/lib.rs:312-432 | crates/vcad-kernel-tessellate/src/lib.rs:704-746 | crates/vcad-kernel-tessellate/src/lib.rs:1384-1425 | crates/vcad-kernel-tessellate/src/lib.rs:1432-1721 | crates/vcad-kernel-tessellate/src/lib.rs:1787-1968 | crates/vcad-kernel-tessellate/src/lib.rs:2185-2484 | crates/vcad-kernel-tessellate/src/lib.rs:8773-8893 | crates/vcad-kernel-tessellate/src/lib.rs:8901-8973 | crates/vcad-kernel-tessellate/src/manifold.rs:177-186 | crates/vcad-kernel-tessellate/src/manifold.rs:631-667 | crates/vcad-kernel-tessellate/src/mesh_props.rs:44-129 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:54-128 | crates/vcad-kernel-topopt/src/extract.rs:228-264 | crates/vcad-mcp/src/tools/core.rs:307-377 | crates/vcad-mcp/src/tools/core.rs:379-409 \u2014 These 22 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 22 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 22 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/camera.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cce163ebba4eb5314c1f6e3eed1da29271946e4cc331f8562f8e9e27ae9433"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (17 members, 50\u002B identical tokens): crates/vcad-eval/src/sim_extract/em.rs:433-447 | crates/vcad-eval/src/thermal_extract.rs:615-623 | crates/vcad-ffi/src/print.rs:358-379 | crates/vcad-ffi/src/sheet_metal.rs:160-178 | crates/vcad-kernel-booleans/src/mesh/csg.rs:916-937 | crates/vcad-kernel-booleans/src/validate.rs:30-44 | crates/vcad-kernel-diff/src/mass.rs:54-116 | crates/vcad-kernel-fea/src/mesh.rs:67-70 | crates/vcad-kernel-fea/src/solve.rs:532-535 | crates/vcad-kernel-tessellate/src/lib.rs:922-938 | crates/vcad-kernel-tessellate/src/manifold.rs:189-201 | crates/vcad-kernel-tessellate/src/mesh_props.rs:44-129 | crates/vcad-kernel/src/lib.rs:2993-3010 | crates/vcad-kernel/src/lib.rs:3048-3114 | crates/vcad-render/src/report.rs:307-336 | crates/vcad-typst/src/lib.rs:270-320 | docs/videos/every-physics/poc/src/main.rs:46-64 \u2014 These 17 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 17 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 17 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"99091be44632aa69bd10d621072ca390f68746dbd51ca7e0fff5dba90450112b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): crates/vcad-ecad-fabprep/src/verdict.rs:112-301 | crates/vcad-ecad-pcb/src/copper_pour.rs:163-265 | crates/vcad-ecad-pcb/src/drc.rs:257-299 | crates/vcad-ecad-pcb/src/drc.rs:1536-1552 | crates/vcad-ecad-pcb/src/pour_synth.rs:309-520 | crates/vcad-ecad-pcb/src/pour_synth.rs:639-661 | crates/vcad-ecad-pcb/src/router/auto.rs:1591-1966 | crates/vcad-ecad-pcb/src/router/complete.rs:443-1266 | crates/vcad-ecad-pcb/src/router/complete.rs:1624-1695 | crates/vcad-ecad-pcb/src/router/congestion.rs:143-153 | crates/vcad-ecad-pcb/src/router/legalize.rs:719-740 | crates/vcad-ecad-pcb/src/router/maze.rs:1442-1452 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4572e0e241633806f68fc93402833dbf548c1a7623493498f36b4aee004ab0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/vcad-kernel-tessellate/src/lib.rs:2840-2897 | crates/vcad-kernel-tessellate/src/lib.rs:4192-4623 | crates/vcad-kernel-tessellate/src/lib.rs:4635-4734 | crates/vcad-kernel-tessellate/src/lib.rs:4757-5053 | crates/vcad-kernel-tessellate/src/lib.rs:5145-5300 | crates/vcad-kernel-tessellate/src/lib.rs:6329-6526 | crates/vcad-kernel-tessellate/src/lib.rs:6540-6704 | crates/vcad-kernel-tessellate/src/lib.rs:6854-7116 | crates/vcad-kernel-tessellate/src/lib.rs:7127-7349 | crates/vcad-kernel-tessellate/src/lib.rs:8108-8170 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96d0ed97d47d830a751b357e66ff02f9e0e9f039520deabe709aaeec70e4611"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/vcad-atoms/src/fab.rs:225-235 | crates/vcad-ffi/src/fea.rs:256-278 | crates/vcad-kernel-assembly/src/pose.rs:304-317 | crates/vcad-kernel-fea/src/modal.rs:1142-1174 | crates/vcad-mcp/src/tools/core.rs:307-377 | crates/vcad-render/src/animate.rs:512-532 | crates/vcad-render/src/report.rs:307-336 | crates/vcad-sound/src/lib.rs:431-440 | crates/vcad-typst/src/lib.rs:270-320 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/fab.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1943bab91e875427dbfb85cf7b69dc5e50054bfd846cd8a99a5139cd74e22f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/vcad-kernel-booleans/src/split.rs:340-852 | crates/vcad-kernel-booleans/src/split.rs:1350-1902 | crates/vcad-kernel-booleans/src/split.rs:2713-3165 | crates/vcad-kernel-booleans/src/split.rs:4802-5123 | crates/vcad-kernel-booleans/src/split.rs:5148-5386 | crates/vcad-kernel-booleans/src/split.rs:5394-5527 | crates/vcad-kernel-booleans/src/split.rs:5560-5733 | crates/vcad-kernel-booleans/src/split.rs:6055-6350 | crates/vcad-kernel-booleans/src/split.rs:6685-6883 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbf08659857abc43a10d25e04b6971ea8932505bfc4e7a4c6fe4117bd587e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/vcad-cli/src/app.rs:552-587 | crates/vcad-cli/src/app.rs:590-625 | crates/vcad-cli/src/app.rs:628-664 | crates/vcad-cli/src/app.rs:667-704 | crates/vcad-cli/src/app.rs:707-742 | crates/vcad-cli/src/app.rs:745-783 | crates/vcad-cli/src/app.rs:786-824 | crates/vcad-cli/src/app.rs:827-868 \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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7906b1730c8c4fd92b258e9894d07c559b3eafcce5c2145addcbdce91b977630"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/vcad-kernel-booleans/src/mesh/csg.rs:90-111 | crates/vcad-kernel-fillet/src/fillet_planar.rs:255-282 | crates/vcad-kernel-shell/src/lib.rs:903-914 | crates/vcad-kernel-sketch/src/extrude.rs:1317-1337 | crates/vcad-kernel-sweep/src/loft.rs:329-349 | crates/vcad-kernel-sweep/src/sweep.rs:408-428 | crates/vcad-kernel-tessellate/src/lib.rs:2902-2911 \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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"56421ddd802c97a5d40ce4a4af79d157365484398b87c42e75cd5399996e6993"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/vcad-kernel-sketch/src/extrude.rs:178-365 | crates/vcad-kernel-sketch/src/extrude.rs:552-746 | crates/vcad-kernel-sketch/src/extrude.rs:778-952 | crates/vcad-kernel-sketch/src/extrude.rs:1075-1261 | crates/vcad-kernel-sketch/src/revolve.rs:65-331 | crates/vcad-kernel-sweep/src/loft.rs:128-241 | crates/vcad-kernel-sweep/src/sweep.rs:127-336 \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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"417054a6b03255262a72a8229e285de008e8a4f534b58070be98ce0a823c8f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/vcad-ecad-pcb/src/drc.rs:1570-1591 | crates/vcad-ecad-pcb/src/router/auto.rs:1591-1966 | crates/vcad-ecad-pcb/src/router/maze.rs:961-975 | crates/vcad-ecad-pcb/src/session.rs:282-441 | crates/vcad-ecad-pcb/src/spatial.rs:178-199 | crates/vcad-slicer/src/infill.rs:222-236 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"980b15f57a0f9519e1eea59a18e4369950a6e2f218c63836f90255a3083014df"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/vcad-ecad-pcb/src/drc.rs:2913-2995 | crates/vcad-ecad-pcb/src/session.rs:282-441 | crates/vcad-kernel-cam/src/turning/geom.rs:162-176 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:468-557 | crates/vcad-process/src/masks.rs:31-56 | crates/vcad-process/src/masks.rs:94-124 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b271fb42a782e51c5053de4d1f763e91656189a764c45517da1b294648376f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/vcad-kernel-fillet/src/chamfer.rs:37-167 | crates/vcad-kernel-fillet/src/fillet_curved.rs:706-751 | crates/vcad-kernel-fillet/src/fillet_curved.rs:880-985 | crates/vcad-kernel-fillet/src/fillet_curved.rs:1085-1177 | crates/vcad-kernel-fillet/src/fillet_planar.rs:52-250 | crates/vcad-kernel-fillet/src/fillet_planar.rs:365-442 \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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0d542bbf2a999121f09b9cbe47a768721850f3677aeb47995beab638d992b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): apple/VcadApp/Sources/VcadApp/Shell.swift:905-915 | apple/VcadApp/Sources/VcadApp/Shell.swift:926-936 | apple/VcadApp/Sources/VcadApp/Shell.swift:938-948 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:905-915 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:926-936 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:938-948 \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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028dcc315dca2ddde4ecdd001d5292915c50f26bb7ee85b83efff2f9fcc1879"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/vcad-eval/src/evaluate.rs:2685-2738 | crates/vcad-eval/src/kinematics.rs:22-37 | crates/vcad-ffi/src/lib.rs:820-830 | crates/vcad-kernel-assembly/src/pose.rs:44-70 | crates/vcad-typst/src/lib.rs:228-252 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83e184c68a4d6871b47934ac64f162aa6ae234d9c374541de29ef7914d54783"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/vcad-kernel-acoustics/src/optimize.rs:57-141 | crates/vcad-kernel-optics/src/optimize.rs:61-166 | crates/vcad-kernel-particle/src/optimize.rs:60-148 | crates/vcad-kernel-particle/src/optimize.rs:163-226 | crates/vcad-kernel-particle/src/optimize.rs:339-442 \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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db9430e91db525acb4530cd1150d1262479674a0f1d9a4bf338d73245c3d948"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/vcad-kernel-fea/src/mesh.rs:124-219 | crates/vcad-kernel-fea/src/mesh.rs:415-512 | crates/vcad-kernel-fea/src/mesh.rs:556-655 | crates/vcad-kernel-tessellate/src/clearance.rs:140-176 | crates/vcad-kernel-topopt/src/domain.rs:89-168 \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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc488bbf3296019d058fa925a0790cb916870af4aad8f48260be3f15bf15658c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/vcad-kernel-gpu/src/decimate.rs:351-369 | crates/vcad-kernel-gpu/src/normals.rs:30-276 | crates/vcad-kernel-gpu/src/wavefront.rs:101-341 | crates/vcad-kernel-gpu/src/wavefront.rs:371-696 | crates/vcad-kernel-gpu/src/wavefront.rs:698-715 \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":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7e81b80b509d79bb09958e987497c2e1081e2e96d8866063597ad11d2a29d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/vcad-kernel-sketch/src/extrude.rs:977-993 | crates/vcad-kernel-sketch/src/extrude.rs:1273-1315 | crates/vcad-kernel-sketch/src/extrude.rs:1421-1459 | crates/vcad-kernel-sweep/src/loft.rs:253-289 | crates/vcad-kernel-sweep/src/sweep.rs:348-393 \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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b91fb082e9864758ec6fd33f07669aa9628771036c278f3272bc881315afe09"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/vcad-kernel-tessellate/src/lib.rs:5145-5300 | crates/vcad-kernel-tessellate/src/lib.rs:5928-6105 | crates/vcad-kernel-tessellate/src/lib.rs:6115-6255 | crates/vcad-kernel-tessellate/src/lib.rs:6329-6526 | crates/vcad-kernel-tessellate/src/lib.rs:6715-6790 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ce9d766c797499984a65246367887f36bfa880a70cc3a82ac1aa01e63be44b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-app/src/engine.rs:236-275 | crates/vcad-cli/src/app.rs:745-783 | crates/vcad-cli/src/app.rs:786-824 | crates/vcad-cli/src/app.rs:827-868 \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":"crates/vcad-app/src/engine.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a961f868b7c311b2e2d70476b37c267998b38cce99e6f1dc8dd8da3c3ce7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-cli/src/app.rs:315-336 | crates/vcad-cli/src/app.rs:339-362 | crates/vcad-cli/src/app.rs:365-387 | crates/vcad-cli/src/app.rs:412-436 \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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1737df69da6c1f646d23abd4b7098a7df91d99d0a701e1957c89dfc8366637"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-cli/src/ui/chat.rs:165-459 | crates/vcad-cli/src/ui/command.rs:43-232 | crates/vcad-cli/src/ui/menu.rs:396-524 | crates/vcad-cli/src/ui/tree.rs:43-178 \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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a844a5e699010b59cc2d28564455c877e258485d7a3d7201a0ece0feb439d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-ecad-pcb/src/router/descent.rs:920-1523 | crates/vcad-ecad-pcb/src/router/mod.rs:434-573 | crates/vcad-ecad-pcb/src/router/pair.rs:1492-1597 | crates/vcad-ecad-pcb/src/router/pair.rs:1605-1925 \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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d29ac5aeea57ea91af8a5f8ece81390d070a3fbf7c638189945d5affc3abfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-ecad-pcb/src/spatial.rs:304-322 | crates/vcad-kernel-drafting/src/section.rs:639-662 | crates/vcad-kernel-sketch/src/profile.rs:469-492 | crates/vcad-slicer/src/perimeter.rs:139-161 \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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0c4141efe75a61cef20a6b24870b6ce4c66638adfb668143003778e915395a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-ecad-pcb/src/spatial.rs:579-627 | crates/vcad-ecad-symbols/src/kicad_write.rs:1099-1129 | crates/vcad-ffi/src/lib.rs:2169-2188 | mecheval/graders/src/pcb.rs:130-169 \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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80eb86be50fa373a9d254d32a6add4a0502bb00e1e0117a82d86a1a528003ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-ecad-sim/src/circuit/adjoint.rs:170-211 | crates/vcad-ecad-sim/src/circuit/dc.rs:194-237 | crates/vcad-ecad-sim/src/circuit/devices.rs:559-641 | crates/vcad-ecad-sim/src/circuit/transient_adjoint.rs:407-452 \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":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfadc77ee9ad0fcdc1a44ff40937403ac9920ff0e7727030d961c712e8dad15"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-eval/src/kinematics.rs:22-37 | crates/vcad-eval/src/placement.rs:68-77 | crates/vcad-ffi/src/lib.rs:820-830 | crates/vcad-loon/src/convert.rs:3235-3243 \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":"crates/vcad-eval/src/kinematics.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d1344f4345505bed7b2aa48b10eeeb976a505b0f1892165718af7a1a66b2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-gdsii/src/bridge.rs:228-242 | crates/vcad-kernel-raytrace/src/gpu/buffers.rs:1149-1165 | crates/vcad-process/src/bridge.rs:122-135 | crates/vcad-process/src/masks.rs:70-86 \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":"crates/vcad-gdsii/src/bridge.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"30108453d2a98e4d1352dc18eb8c6d5ddea26a3da1c6fe56caefb7bc0453b8bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-booleans/src/split.rs:340-852 | crates/vcad-kernel-booleans/src/split.rs:1350-1902 | crates/vcad-kernel-booleans/src/split.rs:2713-3165 | crates/vcad-kernel-booleans/src/split.rs:3456-3527 \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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c958278cce71dd2f97cdf11835d0ceede83d05ae07a4cbe65499fddaad375d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-booleans/src/ssi.rs:1082-1126 | crates/vcad-kernel-booleans/src/ssi.rs:1129-1154 | crates/vcad-kernel-booleans/src/trim.rs:863-890 | crates/vcad-kernel-fillet/src/closest_point.rs:81-120 \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":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab243e8eb3066c1a5247c953a18aa382929e47ddaf9dd537f42ab5c12ddfe44"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-fillet/src/chamfer.rs:37-167 | crates/vcad-kernel-fillet/src/fillet_curved.rs:880-985 | crates/vcad-kernel-fillet/src/fillet_planar.rs:52-250 | crates/vcad-kernel-fillet/src/trim.rs:309-428 \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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"46848907cfadc6b02e159949f8f185090d2e500b75e99ccba3419f88dbcb4fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-flow/src/adjoint.rs:129-361 | crates/vcad-kernel-flow/src/adjoint.rs:373-697 | crates/vcad-kernel-flow/src/solve.rs:172-575 | crates/vcad-kernel-flow/src/solve.rs:589-795 \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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4867a698c087f25f7e147de41b5059aa03a271d73c309521b40f53586ad70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-physics/src/colliders.rs:151-173 | crates/vcad-kernel-physics/src/world.rs:269-717 | mecheval/graders/src/fit_physics.rs:558-592 | mecheval/graders/src/fit_physics.rs:600-639 \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":"crates/vcad-kernel-physics/src/colliders.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d079945a8881eca4416003ffad3d2056de34637d3776b2e376642151e47883f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-qcd/src/analysis.rs:121-160 | crates/vcad-kernel-shell/src/lib.rs:921-980 | crates/vcad-kernel-tessellate/src/frozen.rs:726-754 | crates/vcad-render/src/callouts.rs:245-282 \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":"crates/vcad-kernel-qcd/src/analysis.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0401c0a6f1f4f9ed047ee7aa3448240c13be56212455b07b4abb9b093ba0e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-raytrace/src/intersect/cylinder.rs:59-84 | crates/vcad-kernel-raytrace/src/intersect/torus.rs:66-93 | crates/vcad-kernel-raytrace/src/trim.rs:781-799 | crates/vcad-kernel-raytrace/src/trim.rs:871-902 \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":"crates/vcad-kernel-raytrace/src/intersect/cylinder.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06aa182876f8bcbc1309f01d0401dce7dc4c3634beaa7be53691f7726208d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-tessellate/src/lib.rs:833-920 | crates/vcad-kernel-tessellate/src/lib.rs:940-975 | crates/vcad-kernel-tessellate/src/lib.rs:1787-1968 | crates/vcad-kernel-tessellate/src/lib.rs:8723-8763 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a462dc6dbd6f38bc03f71a3ecfc4a53e07032d7f004092d760aba09cb0d421d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-tessellate/src/lib.rs:978-1200 | crates/vcad-kernel-tessellate/src/lib.rs:1232-1323 | crates/vcad-kernel-tessellate/src/lib.rs:1432-1721 | crates/vcad-kernel-tessellate/src/lib.rs:8773-8893 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"359ea43bb368c4f094000dfb68efc997151bb4637ced71b3d58fb69d4eac8606"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-kernel-tessellate/src/lib.rs:5309-5403 | crates/vcad-kernel-tessellate/src/lib.rs:5419-5492 | crates/vcad-kernel-tessellate/src/lib.rs:5601-5799 | crates/vcad-kernel-tessellate/src/lib.rs:7428-7929 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44a7946f1fd4b34e0d7e830e25bd44ef0205e12b3248193ea0a9778eb6c911b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/vcad-loon/src/convert.rs:20-167 | crates/vcad-loon/src/convert.rs:193-277 | crates/vcad-loon/src/convert.rs:367-621 | crates/vcad-loon/src/convert.rs:650-955 \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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db175f793d2af1156d84b939703d395fb14ea0db120c48d5a1ac0d89f2b1b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apple/VcadApp/Sources/VcadApp/AssemblyModel.swift:255-269 | apple/VcadApp/Sources/VcadApp/Editor.swift:779-794 | apple/VcadApp/Sources/VcadApp/PoseStudio.swift:151-165 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:779-794 \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":"apple/VcadApp/Sources/VcadApp/AssemblyModel.swift"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d6ece5843b6158305fb64b9cc408b621ff2573048435193db533b59f485330"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apple/VcadApp/Sources/VcadApp/Document.swift:501-516 | apple/VcadApp/Sources/VcadApp/Document.swift:518-556 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:501-516 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:518-556 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2089d8262f6e62df0a81c1164160c9846d47a6dd71ced2e3553de24b3e5431"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apple/VcadApp/Sources/VcadApp/Editor.swift:853-871 | apple/VcadApp/Sources/VcadApp/Editor.swift:2925-2952 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:853-871 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2925-2952 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b82198d6253e434bd48dfb27c0f80f3085844d10581cb0d74591c113443e305"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apple/VcadApp/Sources/VcadApp/Kernel.swift:63-82 | apple/VcadApp/Sources/VcadApp/Kernel.swift:93-219 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:63-82 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:93-219 \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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f512c444942a5411b1489998e129b7690aa0443853909e93d7dce9d4084ad310"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apple/VcadApp/Sources/VcadApp/Kernel.swift:245-284 | apple/VcadApp/Sources/VcadApp/Kernel.swift:300-379 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:245-284 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:300-379 \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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b59b9d0497a26508165d11307019fdf677dba5cd3a52f191ad7e36c4b15f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:87-103 | apple/VcadApp/Sources/VcadApp/SceneAssets.swift:105-140 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:87-103 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:105-140 \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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b475eae753000b516e037a70827a9c6800595ddccd6d4a8a10c12aa64cd135d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): apple/VcadApp/Sources/VcadApp/Shell.swift:620-691 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:620-691 \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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f6116826ccb35647394a251e6c0c12a490ecb8854574473e90111dfa5ae305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (110 corresponding lines): crates/vcad-kernel-primitives/src/lib.rs:37-163 | crates/vcad-kernel-primitives/src/lib.rs:172-281 \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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90a0db01e23367bac7fa8a96790138ba2e339dda0c3e822b4f581a5579388ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (97 corresponding lines): crates/vcad-kernel-em/src/ac.rs:129-225 | crates/vcad-kernel-em/src/grid.rs:405-507 \u2014 These two members are one piece of code written twice and then edited apart: 97 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/ac.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4f5d4b880826ea72a48e6e8e29dd7d7fa3cdbf96cd22372d4ee48e60d8b6be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/vcad-render/src/lib.rs:2357-2407 | crates/vcad-render/src/lib.rs:4686-4754 \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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b57fc0b140592d638c70328470066df0abdebc5d752fbfa1e38c016b396901"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): crates/vcad-kernel-diff/src/synthesize.rs:237-321 | crates/vcad-kernel-diff/src/synthesize.rs:355-426 \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":"crates/vcad-kernel-diff/src/synthesize.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cac01ef4a7332c49aecbbab023670154ce6b299fd913067a710c50d4c95b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 49\u002B corresponding lines): crates/vcad-eval/src/cavity_extract.rs:284-355 | crates/vcad-eval/src/sim_extract.rs:319-383 | crates/vcad-eval/src/thermal_extract.rs:542-590 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 49 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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4705aae771c7daedb5f66a80f7a6efa8db79c5160a8e43b2b93d3f943612ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): crates/vcad-ecad-diff/src/design.rs:55-123 | crates/vcad-kernel-constraints/src/symbolic.rs:70-136 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-diff/src/design.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccea7779d4c2e140fc4f89cf59692c0b19a157b52b5cdc43f9822fd4d2b4772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/vcad-ecad-symbols/src/altium/mod.rs:1019-1050 | crates/vcad-ecad-symbols/src/eagle_brd.rs:363-395 \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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3660ddf2f9e866e5251d1c8bc93644865466e99ece3de970f2817b3f90486235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/vcad-parts/src/vacuum/chambers.rs:220-270 | crates/vcad-parts/src/vacuum/chambers.rs:370-416 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-parts/src/vacuum/chambers.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b4e30a9e7b6976754218d18787612636ed00093bdd0e6b9b38c0e494c1ef0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/vcad-ecad-sim/src/circuit/ac.rs:134-184 | crates/vcad-ecad-sim/src/circuit/linalg.rs:13-64 \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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9dcefbb27ad8f6f2ce908a4dfbb10ab31d07aed1ee05532f2e833756e053fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/vcad-ecad-symbols/src/altium/binary.rs:318-347 | crates/vcad-ecad-symbols/src/altium/binary.rs:349-390 \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":"crates/vcad-ecad-symbols/src/altium/binary.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f6b01cb100227e30a5c768c4815e388a15c1fbaed1c87740aca52af8e0cc22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/vcad-kernel-em/src/ac.rs:243-294 | crates/vcad-kernel-em/src/ac.rs:305-342 \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":"crates/vcad-kernel-em/src/ac.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2460247af71826aa28eef24302aef0a7816fdbe5e717a9b73347aacf49a0894"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/vcad-torture/src/lib.rs:343-405 | crates/vcad-torture/src/lib.rs:519-567 \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":"crates/vcad-torture/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5c8160fbfec5dcdf534fb97047a00446537d188a77f1e34cf6c5cfb9cd91e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/vcad-slicer/src/path.rs:298-339 | crates/vcad-slicer/src/path.rs:342-381 \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":"crates/vcad-slicer/src/path.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b838c07bb081919e393c216e1ab89cc100675b390d74d26f17a0f64fd04d83a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 54\u002B corresponding lines): crates/vcad-kernel-neutronics/src/receipt.rs:304-357 | crates/vcad-kernel-particle/src/receipt.rs:377-440 | crates/vcad-kernel-tolerance/src/receipt.rs:286-343 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/receipt.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6a0d041a7f0dd92ac2fe07efff0212c9fd823383f8b390911cc5fc92516e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/vcad-kernel-booleans/src/classify.rs:1654-1696 | crates/vcad-kernel/src/lib.rs:3153-3183 \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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec24bef4cbcbf6bad0270703a4daecd58da4447b08e478518f8affd7b12a3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:400-426 | crates/vcad-kernel-nurbs/src/lib.rs:798-832 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68b88c60396650bfc29f6d5beb79cc85931437c527ca023a110e33cebf64689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:211-243 | crates/vcad-kernel-nurbs/src/lib.rs:682-714 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5b1c1332fa91c1c5c80900445a2aae62da27e4ff779c95d9f2ac9e1b255f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/vcad-kernel-acoustics/src/receipt.rs:368-411 | crates/vcad-kernel-particle/src/receipt.rs:519-560 \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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba2580836d9c54e0bab3d62492c227ce8e3cd5877c13cc6f0dff968145607d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/vcad-ecad-pcb/src/teardrop.rs:155-183 | crates/vcad-ecad-symbols/src/kicad_mod.rs:552-578 \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":"crates/vcad-ecad-pcb/src/teardrop.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa938d7d378014870905f665336339243270029d91f85c304c0a00061a92a16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/vcad-kernel-constraints/src/residual.rs:310-349 | crates/vcad-kernel-constraints/src/symbolic.rs:541-580 \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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f38cd6a14c783be14827d42769fe41415221afa51dba2d7fc4d8325db127b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/vcad-kernel-acoustics/src/linalg.rs:42-81 | crates/vcad-kernel-antenna/src/linalg.rs:61-101 \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":"crates/vcad-kernel-acoustics/src/linalg.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ae52509797a04daefc6a8bcf1a819d97db785d5ef444692361c00e679fcda6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-ecad-symbols/src/kicad_board.rs:40-72 | crates/vcad-ecad-symbols/src/kicad_board.rs:76-99 \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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7346456a370332c882b09e03e65c65521222171ef5faa01820c73c60aa555e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/vcad-kernel-primitives/src/lib.rs:526-586 | crates/vcad-kernel-primitives/src/lib.rs:730-778 \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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e673382b0f7d140f1065bf8b1cd1ef05cfb92a7cb6c0eab7be22b0b772789e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): apple/VcadApp/Sources/VcadApp/VisionShell.swift:94-120 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:94-120 \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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff9b42f3719a1d2bd80ff56d754043330d5984b84a3cf3e43e15d7a2a6c96b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/vcad-kernel-constraints/src/gpu.rs:56-101 | crates/vcad-kernel-constraints/src/gpu.rs:113-161 \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":"crates/vcad-kernel-constraints/src/gpu.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5e6e7f5f516b4cfe871d6f9c22307cd42e7ad6fc27c5ec63b4feab6a30b42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:9955-9978 | crates/vcad-kernel-wasm/src/lib.rs:9996-10019 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":9955}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27b384f626a8aa760798085564f17dd99b7f0efed6187b10c54c4715b7dc36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/vcad-ecad-diff/src/design.rs:151-178 | crates/vcad-kernel-constraints/src/symbolic.rs:186-229 \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":"crates/vcad-ecad-diff/src/design.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6bf7bee1b9ce9b987749170c9471532613dcf0b5e15dd5732435db0853c93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): crates/vcad-cli/src/app.rs:439-475 | crates/vcad-cli/src/app.rs:478-512 | crates/vcad-cli/src/app.rs:515-549 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"926c267ee57056899bcc1f373371ecca8b173bdbb694f9be55f706c52bb6ed5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/vcad-kernel-cam/src/dropcutter/ball.rs:82-121 | crates/vcad-kernel-cam/src/dropcutter/bull.rs:195-235 \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":"crates/vcad-kernel-cam/src/dropcutter/ball.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c02562e97c5437528f34fde4fb821697d8e5d9d62e47b9dd4b91cbdb2d2620a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/vcad-kernel-raytrace/src/intersect/cylinder.rs:12-56 | crates/vcad-kernel-raytrace/src/intersect/sphere.rs:13-45 \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":"crates/vcad-kernel-raytrace/src/intersect/cylinder.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1170ad0c6ac918122e555cebc83fca070ed3f59c7dd3bc7f3f15fc7fdbc4c7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/vcad-kernel-acoustics/src/instrument.rs:1123-1163 | crates/vcad-kernel-acoustics/src/instrument.rs:1179-1222 \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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e017a9200b5450b5c885c8293bdb7b6b23b0ffb614ea2e7fe7d16c594926f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-kernel-raytrace/src/gpu/buffers.rs:580-603 | crates/vcad-kernel-raytrace/src/gpu/buffers.rs:1340-1356 \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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84c7343548049ab6bd48b7faaf42c9774560e432116d4851e60678d5e17e33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): crates/vcad-ir/src/lib.rs:1533-1579 | crates/vcad-ir/src/lib.rs:1585-1631 | crates/vcad-ir/src/to_loon.rs:920-953 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"1738de035f2e4d6ee50213878f375d6ebaf724c49dd822ecb3f03cb04ad460f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): mecheval/graders/src/fillets.rs:46-80 | mecheval/graders/src/holes.rs:64-106 \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":"mecheval/graders/src/fillets.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8176b2f5779825b3b0d57fcbc1b05c753c0d4b1be3df70b524dca6c7eb1f222a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/vcad-kernel-fillet/src/closest_point.rs:130-169 | crates/vcad-kernel-raytrace/src/trim.rs:905-945 \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":"crates/vcad-kernel-fillet/src/closest_point.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"52752afe64af89bf6024c069eb13f68f1cee7e66cbd6c3b30d4d5f14050cafec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/vcad-ecad-symbols/src/altium/binary.rs:297-316 | crates/vcad-ecad-symbols/src/altium/binary.rs:392-411 \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":"crates/vcad-ecad-symbols/src/altium/binary.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cc3807b1a004bdc398fe8fb5c7b0149d76d2cfa53391f6f7d1242d46c7bc63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/vcad-kernel-booleans/src/mesh/mod.rs:173-203 | crates/vcad-kernel-fillet/src/topology.rs:178-202 \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":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"02874ce56165bf603c65fe9aca8d1d02cf15bcb99f19414b51f9364525ac46f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:3425-3445 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3425-3445 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda9939f84a21e32bd0c855341866672c6efe9af658693e16ceddc7983aacb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/vcad-ffi/src/engine.rs:61-86 | crates/vcad-ffi/src/engine.rs:94-123 \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":"crates/vcad-ffi/src/engine.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a844a5b09654af56c76a55993932e216d8e04d70cd0c802e4c870fee4f7ea51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/vcad-kernel-qcd/src/lattice.rs:176-199 | crates/vcad-kernel-qcd/src/lattice.rs:206-228 \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":"crates/vcad-kernel-qcd/src/lattice.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e821dd82ee8b1b37731b4687dcf964663705ce614f04fc4e419e7ac0b3c7e2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 51\u002B corresponding lines): crates/vcad-ecad-pcb/src/dfm.rs:575-625 | crates/vcad-ecad-pcb/src/dfm.rs:697-754 | crates/vcad-ecad-pcb/src/dfm.rs:756-811 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 51 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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad2a9939201645de020bb07f74a90d081be3051dc967fd1e822ca57eef4f95a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/vcad-kernel-neutronics/src/diffusion.rs:291-317 | crates/vcad-kernel-neutronics/src/diffusion.rs:323-345 \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":"crates/vcad-kernel-neutronics/src/diffusion.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e139ba73c3afb8081a3f2b242ca81d4ca0ae8a0e61c15d04164defb68cc956a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/vcad-kernel-tessellate/src/lib.rs:8181-8212 | crates/vcad-kernel-tessellate/src/lib.rs:8222-8252 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ef56a1b5df7ba070a8dc62678762d2910b19141b51569b1d48895770a32987"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/vcad-kernel-drafting/src/hidden_line.rs:395-413 | crates/vcad-kernel-drafting/src/hidden_line.rs:424-446 \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":"crates/vcad-kernel-drafting/src/hidden_line.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a991585823b0decd1bcfa877f1701ced65692011aed62c4740a8b09d59a101"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/vcad-ecad-pcb/src/router/flow/cdt.rs:204-235 | crates/vcad-ecad-pcb/src/session.rs:970-994 \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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa9cae8d53f72419f2a7f6a21cb0decdba8f5451179afb3869b2ef7ce3e43a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/vcad-ecad-symbols/src/builtin.rs:129-153 | crates/vcad-ecad-symbols/src/builtin.rs:206-242 \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":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"791f98abacd38dd153601ce18481c678d5cc1cffe7bf31dc565a5bd84f622b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/vcad-ecad-symbols/src/footprint.rs:1286-1304 | crates/vcad-ecad-symbols/src/footprint.rs:1314-1335 \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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9f4514f0b9bfabb9717116c882c0814898bdbe846ebcce1f60d07efaa29839"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/vcad-kernel-cam/src/dropcutter/bull.rs:97-125 | crates/vcad-kernel-cam/src/dropcutter/flat.rs:56-85 \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":"crates/vcad-kernel-cam/src/dropcutter/bull.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1880084dd50bb102031fd2a959b737f8f1185e9aa11fbf7f58c79ecb041060b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/vcad-kernel-em/src/axisym.rs:371-393 | crates/vcad-kernel-em/src/axisym.rs:396-418 \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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9d4f561a404f9defd83b4e7e4a3862801752b7555871e1c63066aac283075e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/vcad-kernel-drafting/src/edge_extract.rs:146-179 | crates/vcad-kernel-drafting/src/edge_extract.rs:231-275 \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":"crates/vcad-kernel-drafting/src/edge_extract.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd1c37e1496cf2424e7f059256acc47ae380b0304ec3856273840f04c903f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/vcad-kernel-diff/src/seam.rs:302-340 | crates/vcad-kernel-diff/src/second_order.rs:125-157 \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":"crates/vcad-kernel-diff/src/seam.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb6cb237c3f89f73de7166960a4679271fc73770701261b8c50ac05f80cdf70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/vcad-ffi/src/lib.rs:481-512 | crates/vcad-ffi/src/lib.rs:550-577 \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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba768fb556f6a8a437b28ef70ba91ccce3f9b87eca1046d3893e0590e9d12ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:2606-2637 | crates/vcad-kernel-wasm/src/lib.rs:2876-2902 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90efa57abb4649bd900c88a1748e5f91eb6bca8e57a6077ef2d8ca413a8d9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:4546-4554 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4546-4554 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"74629364c293db27f1314ac3afd1cf233afd823445ddfff69da5c675c7dad1d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-app/src/keybinding.rs:82-102 | crates/vcad-app/src/keybinding.rs:105-125 \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":"crates/vcad-app/src/keybinding.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b8d0ca9abacbbcaf659a86e737e4f828ca41bcf556abf6b87a1c9304192d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/vcad-kernel-step/src/entities/curves.rs:268-296 | crates/vcad-kernel-step/src/entities/surfaces.rs:442-472 \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":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4460e8e2d6faed15b1a3e15d8ab14517c449ca05b654b17e16615179ce30f0fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:1324-1357 | crates/vcad-kernel-wasm/src/lib.rs:1376-1402 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c08e7f2e09eeb70a00e65289eb3c9327ceeb8ad8ae83ec47f56c3938d025e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): apple/VcadApp/Sources/VcadApp/AgentInstall.swift:146-161 | apple/VcadApp/Sources/VcadApp/ConnectClaude.swift:49-64 \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":"apple/VcadApp/Sources/VcadApp/AgentInstall.swift"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b924f5d4c2a1d84eaf2a5945ed8f3ea8fa513d30a005d4b19237e99f2f4409"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-ecad-symbols/src/kicad_write.rs:1153-1163 | crates/vcad-ecad-symbols/src/kicad_write.rs:1165-1177 \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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9617d2f3e59342969aa60f37cd1f19d3422be777263faaf169bf8da8d2512058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-kernel-em/src/planar.rs:253-276 | crates/vcad-kernel-em/src/planar.rs:280-303 \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":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe5c7c2bafa69036d064d88b9cd1ec3d9571e9b94c06ab0fd77a03a26959198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apple/VcadApp/Sources/VcadApp/SketchInference.swift:288-299 | apple/VcadApp/Sources/VcadApp/SketchInference.swift:314-327 \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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b42ee4426854e06a24a0a92d028fa26626e21f8cb497605c858da05b636b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-kernel-raytrace/src/bvh.rs:157-186 | crates/vcad-kernel-raytrace/src/bvh.rs:188-211 \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":"crates/vcad-kernel-raytrace/src/bvh.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d85118ecb076552bf38e3abb62fa3e2dcb4d4239268258d874aafdd837652ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-render/src/lib.rs:4180-4198 | crates/vcad-render/src/lib.rs:4216-4230 \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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e590c2ca38dfbadf35ebbe34484c80c4a00adda5f0762ac488e5d4705fb8e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/vcad-kernel-wasm/src/expressions.rs:87-108 | crates/vcad-kernel-wasm/src/expressions.rs:114-139 \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":"crates/vcad-kernel-wasm/src/expressions.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa082c10ff2cf46e84cc660c00416f81ebf21d8be0b53819bc3521ff089907a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-ffi/src/lib.rs:347-384 | crates/vcad-ffi/src/lib.rs:445-468 \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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce05962d4d2214684bc44c001484a06870b1d01c9471270b4600e3b09698732"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:5636-5660 | crates/vcad-kernel-wasm/src/lib.rs:5666-5692 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5636}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d94c897c4f47cfa8c093af840b45fcc4706c017c7deb29c66f6e69615630ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/vcad-app/src/document_api.rs:851-880 | crates/vcad-ffi/src/train.rs:263-293 \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":"crates/vcad-app/src/document_api.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6270e008d97758a453da8585bfdb9358bb6bb10083b81e9d17db7b87825c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:4030-4073 | crates/vcad-kernel-wasm/src/lib.rs:4087-4110 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd50d24e3cc5ce44e08e20b7ba69a28c1d24f46a2ec2b853b9371626282e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/vcad-ecad-symbols/src/builtin.rs:278-307 | crates/vcad-ecad-symbols/src/footprint.rs:609-643 \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":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcbbdc5b6b389ae4694e8fd1c3474571bf1f0df52b73b24ab0d6633068406a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/vcad-ecad-sim/src/circuit/receipt.rs:218-249 | crates/vcad-kernel-photon-dose/src/receipt.rs:356-390 \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":"crates/vcad-ecad-sim/src/circuit/receipt.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f6dc2e9a862f4080d4b79870dcd6068d8aced233c7bf31caf7a726b759a134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-ffi/src/lib.rs:1427-1450 | crates/vcad-ffi/src/lib.rs:1463-1489 \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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"44849f237e4cf35f61b09cbb327525d1a924345612357bf2f8091a541748017a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/vcad-gdsii/src/bridge.rs:182-210 | crates/vcad-process/src/bridge.rs:93-119 \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":"crates/vcad-gdsii/src/bridge.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1220310643404491b6a26fbd7bff19f9c2425d49f8efd9dacf98ce99a85d69d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/vcad-kernel-em/src/receipt.rs:448-478 | crates/vcad-kernel-thermal/src/receipt.rs:598-632 \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":"crates/vcad-kernel-em/src/receipt.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d644c7399c90a1ec8f2a6ff27bbc300ac571b0fb43e1c672258fe281a0786a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/vcad-kernel-stocksim/src/verify.rs:262-282 | crates/vcad-kernel-tessellate/src/clearance.rs:414-441 | crates/vcad-kernel-tessellate/src/clearance.rs:756-785 \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":"crates/vcad-kernel-stocksim/src/verify.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d0e0d7d7c9d83aa6ba5be3e763e65bc7f773407019488a3404ab5ecfb495f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apple/VcadApp/Sources/VcadApp/Shell.swift:895-903 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:895-903 \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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d554921d841baf4904655111f6061f309bb279a1f2420744139e508358853f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/vcad-eval/src/evaluate.rs:2192-2211 | crates/vcad-kernel-raytrace/src/gpu/buffers.rs:556-574 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca427261c8f4b416c2d30bd8fed33be6c66ec8239d9eea9a9adeb9f37df7b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/vcad-eval/src/evaluate.rs:1942-1969 | crates/vcad-kernel/src/sheet_json.rs:156-180 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9425c1f030b7a79bdfbddb1aab17784cb6cfaa887b1fe17dbf427150d04bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/vcad-kernel-cam/src/turning/ops.rs:323-350 | crates/vcad-kernel-cam/src/turning/ops.rs:354-375 \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":"crates/vcad-kernel-cam/src/turning/ops.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a072e557bc9e8a3b8c5c47dee937c465290213b0fded022d026d8f8412594d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-kernel-booleans/src/no_crossing.rs:232-252 | crates/vcad-kernel-booleans/src/no_crossing.rs:449-474 \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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d555faecf493f9982398958ae7c2853d1f4df31c2fe339b5182624ed93811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/vcad-parts/src/vacuum/instruments.rs:91-113 | crates/vcad-parts/src/vacuum/instruments.rs:593-612 \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":"crates/vcad-parts/src/vacuum/instruments.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e1991f563fa08e81cf6c11388de34dd24e121890f8218a653eef109db7585c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:2127-2135 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2127-2135 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86a9f46b3aa8ac1acb897bde1e13a4a1848cc74c739572f903cd4525d71d48f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/vcad-kernel-dfm/src/geom/probe.rs:340-361 | crates/vcad-kernel-raytrace/src/intersect/triangle.rs:47-80 \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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3525c62cb2d130fc572f290d7d3c2066d4b71e0865d57a207fc1051f84f3762a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:3072-3096 | crates/vcad-kernel-wasm/src/lib.rs:3257-3287 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":3072}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1d95eea80b4cd489e8418f3049e2765345cecd249314ea27fa3e28783d77f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:8059-8074 | crates/vcad-kernel-wasm/src/lib.rs:8086-8102 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8059}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf35f8b7526315dbf1e0cbc1e5ae63a583ba391e9f7e980d2ce99b488f49bd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-ecad-pcb/src/session.rs:262-278 | crates/vcad-kernel-booleans/src/trim.rs:690-708 \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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea4955c46c85cb3ab1c96f03c72115a495458ae563f9562849920c3d1558773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:1232-1252 | crates/vcad-kernel-wasm/src/lib.rs:1264-1280 | crates/vcad-kernel-wasm/src/lib.rs:1291-1310 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62d00b8e5180167206a20400880dfb64abbcf78f679f0e2f728c743745eb39c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-app/src/tools.rs:869-876 | crates/vcad-app/src/tools.rs:879-886 \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":"crates/vcad-app/src/tools.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb715ac7b31ce40ad5015dc65bcff83c587edf5d52194de67e4a016e62e6a2a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-kernel-wasm/src/document_engine.rs:466-481 | crates/vcad-kernel-wasm/src/document_engine.rs:486-509 \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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f04ca3129fc4762bfe24c1a78f3f8070c98255ac738971cb4c162b079f77cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/vcad-ecad-pcb/src/dfm.rs:516-537 | crates/vcad-ecad-pcb/src/drc.rs:1447-1471 | crates/vcad-eval/src/evaluate.rs:3477-3500 \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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97f71b57b0943b1e0e2fefc5546b55cefb759975a2ed9db7ac718aa5bc6ec61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/vcad-chat/src/executor.rs:554-578 | crates/vcad-chat/src/executor.rs:584-610 \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":"crates/vcad-chat/src/executor.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"609db1abaf22518c6f97e4d38c8062d574acd6ec92f61aa7179309ed20ad2a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-ecad-pcb/src/pour_synth.rs:528-542 | crates/vcad-ecad-pcb/src/pour_synth.rs:550-564 \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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2db015b5640b9166f8dc4067371cff432f2aa3994a80c95d0543f0e607a7e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): crates/vcad-kernel-raytrace/src/intersect/cone.rs:88-116 | crates/vcad-kernel-raytrace/src/intersect/sphere.rs:50-78 | crates/vcad-kernel-raytrace/src/trim.rs:804-832 | crates/vcad-kernel-raytrace/src/trim.rs:837-866 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-raytrace/src/intersect/cone.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3f21600eda0fb466f35dc7dd6f9ee2e814547721ba13531708e34c87446aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:10826-10836 | crates/vcad-kernel-wasm/src/lib.rs:11202-11211 | crates/vcad-kernel-wasm/src/lib.rs:11220-11229 | crates/vcad-kernel-wasm/src/lib.rs:11240-11249 | crates/vcad-kernel-wasm/src/lib.rs:11259-11269 | crates/vcad-kernel-wasm/src/lib.rs:11286-11301 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10826}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfc56c361dcaa2de66b017f8693b4d63babfa9897b7fa6cebcf6e735fcf5e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/vcad-kernel-fea/src/buckling.rs:1769-1790 | crates/vcad-kernel-fea/src/section.rs:1009-1030 | crates/vcad-kernel-fea/src/shell.rs:845-873 \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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1e183b7ea556794ce9e8fba5fe16777089190a03953567e414467bc7b735e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/vcad-kernel-tessellate/src/clearance.rs:613-641 | crates/vcad-kernel-tessellate/src/clearance.rs:688-715 \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":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9112b6b7906a60851f3ffeb3ffb2bb944500f6e819e1036c58b4d45bb99056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): mecheval/graders/src/pcb.rs:76-96 | mecheval/graders/src/pcb.rs:101-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":"mecheval/graders/src/pcb.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"795ad3e78e602c4baa451702e43236e345ba893c890f02c18c737c9dcaee5ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/vcad-kernel-geom/src/lib.rs:402-421 | crates/vcad-kernel-geom/src/lib.rs:585-604 | crates/vcad-kernel-geom/src/lib.rs:756-775 | crates/vcad-kernel-geom/src/lib.rs:944-964 \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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b82e5d4d492285dcc260a817a6019c7bb23b9b8aebf97e8e9c295870799f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-kernel-sheet/src/unfold.rs:128-148 | crates/vcad-kernel-sheet/src/unfold.rs:156-178 \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":"crates/vcad-kernel-sheet/src/unfold.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f17be4648573df9ff178f7dab426d7e4654a8c2e5a3c05405aa1420360749e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/vcad-ecad-pcb/src/dfm.rs:489-499 | crates/vcad-ecad-pcb/src/router/congestion.rs:130-141 | crates/vcad-kernel-booleans/src/split.rs:2550-2562 \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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b4b9457ac710f50ed4ef62317927af5855ec007376d986075c3a2281032b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-ecad-sim/src/circuit/ac.rs:98-109 | crates/vcad-kernel-antenna/src/complex.rs:103-114 \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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d646cbd6f30a22f359f4b9c542fb84750271f0209bcc6e2d9d27b14a1f1401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-kernel-fea/src/buckling.rs:224-244 | crates/vcad-kernel-tessellate/src/clearance.rs:788-808 \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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c187720be5ed83481024ad9b1df9e8fab2a37af5ef0b8458490a1ed07b07ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): apple/VcadApp/Sources/VcadApp/CNCWorkspace.swift:276-287 | apple/VcadApp/Sources/VcadApp/CNCWorkspace.swift:383-393 \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":"apple/VcadApp/Sources/VcadApp/CNCWorkspace.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"129fcf256b0ee5f353df36b7c1677e7a1d0c03e53a4a39c42cc428f34861451c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 26\u002B corresponding lines): crates/vcad-kernel-acoustics/src/receipt.rs:333-360 | crates/vcad-kernel-antenna/src/receipt.rs:463-495 | crates/vcad-kernel-fea/src/receipt.rs:255-280 | crates/vcad-kernel-neutronics/src/receipt.rs:384-411 | crates/vcad-kernel-optics/src/receipt.rs:248-278 | crates/vcad-kernel-photonics/src/receipt.rs:306-335 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0b9c77809472b981b022aa0f790c852bf74e097801457a795315c5dabdc43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): crates/vcad-kernel-cam/src/dropcutter/ball.rs:23-49 | crates/vcad-kernel-cam/src/dropcutter/bull.rs:29-62 | crates/vcad-kernel-cam/src/dropcutter/flat.rs:22-53 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/dropcutter/ball.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdeac0bcca4697916eb73410ee006473affc7a895d7d4a26fbbe1efdd5be8dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:5949-5961 | crates/vcad-kernel-wasm/src/lib.rs:5983-5995 | crates/vcad-kernel-wasm/src/lib.rs:6016-6028 | crates/vcad-kernel-wasm/src/lib.rs:6059-6077 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5949}}}],"partialFingerprints":{"codehealthFindingId/v1":"de10e3f36bc7f70ae187dc7cd0e4210f5d3564b8b3d09cae99f3476fd6a1890e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): apple/VcadApp/Sources/VcadApp/GlassChrome.swift:904-923 | apple/VcadApp/Sources/VcadApp/SketchViews.swift:128-144 \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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e10ed9e89f008ff99d3ab8b271c1d544e0a3984dbbf40f07093c90048b9f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): apple/VcadApp/Sources/VcadApp/GizmoView.swift:44-55 | apple/VcadApp/Sources/VcadApp/SceneAssets.swift:46-55 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:46-55 \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":"apple/VcadApp/Sources/VcadApp/GizmoView.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8427d71f3f5f193d0ce879499adad2a502fbf9c58f479e0442731a2218001cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-sheet/src/dxf.rs:122-134 | crates/vcad-kernel-sheet/src/dxf.rs:136-155 \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":"crates/vcad-kernel-sheet/src/dxf.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f885146d8a7e91c895f6478b4d02e6198ad193f933d0593c28b6024dd0576b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/vcad-ecad-pcb/src/router/auto.rs:5015-5033 | crates/vcad-render/src/pcb.rs:1035-1057 \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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":5015}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abbecc62e688bcfe2ac77cd9cd70742a78e6c3ee0f4e3cab35410f49c30bb8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-kernel-assembly/src/pose.rs:96-101 | crates/vcad-kernel-fea/src/buckling.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":"crates/vcad-kernel-assembly/src/pose.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb5adb7ec242a8729680ce628c969a86179b378aa12cdc16489e30b1dc15d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/vcad-ffi/src/instrument.rs:151-168 | crates/vcad-ffi/src/print.rs:458-479 | crates/vcad-ffi/src/sound.rs:168-185 \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":"crates/vcad-ffi/src/instrument.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dedefb0fcb6bb5fc65c0054722ae92338d1213c9cf24316ef308b486aca969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-ffi/src/engine.rs:217-236 | crates/vcad-ffi/src/engine.rs:276-291 \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":"crates/vcad-ffi/src/engine.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b17ffbc62b6925f3fd19e5d30bf10f58f7e01c65e7cfb00bbc1eaf4b39a5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/vcad-ffi/src/engine.rs:131-146 | crates/vcad-ffi/src/engine.rs:154-173 | crates/vcad-ffi/src/engine.rs:325-344 \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":"crates/vcad-ffi/src/engine.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"65adccff5fd703039b49e3de3df2572b020f112dc0a2be4af0c27a5d0b344cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/vcad-ir/src/vcode.rs:1587-1607 | crates/vcad-ir/src/vcode.rs:1610-1630 | crates/vcad-ir/src/vcode.rs:1633-1653 \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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f447b75c3661df0733cb95c0aedba58a401e1d90b5d9a1d3675d35842aa869e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:453-460 | apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:628-635 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"156e2887c737d602fb7ea818adfd89b695264b3d8bba6bb979c81feb1e306760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/vcad-kernel-cost/src/lib.rs:375-413 | crates/vcad-kernel-cost/src/lib.rs:418-445 | crates/vcad-kernel-cost/src/lib.rs:453-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 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":"crates/vcad-kernel-cost/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7b1308db15b4c3c81da3c3ab66b24bc195b0cffb27435de9ef1386f8c9186b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:2778-2797 | crates/vcad-ecad-pcb/src/drc.rs:2876-2894 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"994e51d3afe33b86fed96dd7eb01a4842b1af8a29007c4f5563767a10e7e976f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/vcad-kernel-acoustics/src/strike.rs:204-221 | crates/vcad-kernel-fea/src/modal.rs:270-289 \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":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8e52f16d8978f3d7d9d381e940badea4946b9c3c5c946921bb566811657c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-kernel-fea/src/adjoint.rs:497-503 | crates/vcad-kernel-fea/src/buckling.rs:353-359 \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":"crates/vcad-kernel-fea/src/adjoint.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"80221a87cafe042ec946ac8483431adc48483f6919c0ff10e51385b0eeef9279"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-kernel-step/src/entities/geometry.rs:118-141 | crates/vcad-kernel-step/src/entities/geometry.rs:146-176 \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":"crates/vcad-kernel-step/src/entities/geometry.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8900e33855cf3966446d3277eecd20a7853d3e6b3b96ee9af98fb0e35c66aeac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-ecad-symbols/src/footprint.rs:1506-1522 | crates/vcad-ecad-symbols/src/footprint.rs:1527-1549 \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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e69ef72b065b136a3ae754411774514e5881130b638db60a197a543107a9388"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-eval/src/sim_extract.rs:301-313 | crates/vcad-eval/src/thermal_extract.rs:527-538 \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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"83347d96a70b45295a4fccf775477d4a494d03805b92789f9ec9c9ca37c65af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-ffi/src/import.rs:213-233 | crates/vcad-ffi/src/lib.rs:3614-3634 \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":"crates/vcad-ffi/src/import.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c47f190b10cea22413feaec505289a08d305c551e8406f3d03644b15a98f926"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-kernel-fea/src/buckling.rs:315-326 | crates/vcad-kernel-fea/src/solve.rs:538-550 \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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80548e189c3ad93d1aac2b46c93c72bbbe993cee83a768362f7496f3335afb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/vcad-parts/src/fasteners/nut_hex.rs:47-64 | crates/vcad-parts/src/fasteners/washer_flat.rs:53-72 \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":"crates/vcad-parts/src/fasteners/nut_hex.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2554522942e192f9f5656bcd2e921045883ae7a2abf855ec5e2d22429a6e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/vcad-parts/src/vacuum/fittings.rs:172-190 | crates/vcad-parts/src/vacuum/fittings.rs:229-248 \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":"crates/vcad-parts/src/vacuum/fittings.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d93135ec2dc937326b33482e2513e8fd332fd2c161210a7132ded5b9bfa15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-ffi/src/drafting.rs:260-277 | crates/vcad-kernel-drafting/src/dimension/placement.rs:88-104 \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":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8e995e56daf2329a40891ccab2b22a258e00a5e21f3fd9114b8fdbfecc79f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-eval/src/step_doc.rs:246-259 | crates/vcad-parts/src/vacuum/mod.rs:598-610 \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":"crates/vcad-eval/src/step_doc.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"494e4752f1ee72fd4412972e2d8d7c7b0f7e8afc41db218220ae51b29e92f808"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-geom/src/lib.rs:1230-1238 | crates/vcad-kernel-geom/src/lib.rs:1241-1249 \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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"50770c296d5fb8fd7cf2b8fcc9a64b6c77a70958d50ad1952efe191253285a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/vcad-kernel-sketch/src/extrude.rs:1461-1476 | crates/vcad-kernel-sketch/src/revolve.rs:635-655 | crates/vcad-kernel-sweep/src/loft.rs:291-306 \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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"317f30cf85c6192e8c9124b9ea693ea8fb5c8cb12caf0917da18810892bcb478"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/vcad-crdt/src/lib.rs:338-359 | crates/vcad-crdt/src/lib.rs:362-383 \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":"crates/vcad-crdt/src/lib.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"af35b849c82cc333182e3309be1a679a2adc35152d4ba62ccc9129e00f6a85ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/vcad-kernel-urdf/src/writer.rs:125-148 | crates/vcad-kernel-urdf/src/writer.rs:154-185 \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":"crates/vcad-kernel-urdf/src/writer.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc34b08d2ba34856028bc58dfb8a9dd3f7f9c70f681711d3052a1f7b7e22ddd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:6095-6105 | crates/vcad-kernel-wasm/src/lib.rs:6296-6308 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6095}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6a4e99f194e0312299d62a17e22b3ebf2c77cc38b659c57faa89729a721250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-ecad-symbols/src/footprint.rs:565-580 | crates/vcad-ecad-symbols/src/footprint.rs:585-603 \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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"2959085a73ddbeb57df529a6c919807adcf906012c299b0f327eab27a3a9be8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/vcad-kernel-step/src/entities/geometry.rs:11-28 | crates/vcad-kernel-step/src/entities/geometry.rs:33-53 \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":"crates/vcad-kernel-step/src/entities/geometry.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"651840e6b600ea8d2226b24c8c46c38dd27a5f103e1bb16bea674af8e63cc21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:410-414 | apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:415-419 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddf5cf3cceb2959f580bda9f9d24280c4b2cdd1301ff6eefbb1fd2ddd8a9407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/termview/src/protocols/sixel.rs:159-176 | crates/vcad-embroidery-pes/src/palette.rs:22-40 \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":"crates/termview/src/protocols/sixel.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5cb85d53f4ab8b118ad8270fa33e9cc8607edcffcae06fa0211f22d87789e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-ecad-pcb/src/router/claims_ir.rs:303-316 | crates/vcad-ecad-pcb/src/router/claims_ir.rs:398-411 \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":"crates/vcad-ecad-pcb/src/router/claims_ir.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"924658170b9437e2438652e023328fdf1f458c90706e6345aaa51c362a5d9308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-kernel-diff/src/mass.rs:165-180 | crates/vcad-kernel-diff/src/seam.rs:469-484 \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":"crates/vcad-kernel-diff/src/mass.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e987253e9c629c6a5183b2c36792b24abcae9e5ab8a9389c1b89b3f4d4237d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-ecad-fabprep/src/verdict.rs:506-516 | crates/vcad-ecad-pcb/src/router/flow/realize.rs:226-235 \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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3110c467c43efea549a93d0b31f1e20a8424aa03e3fc36f52ba2ac604bface"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-ecad-symbols/src/kicad_write.rs:2535-2548 | crates/vcad-ecad-symbols/src/kicad_write.rs:2742-2754 \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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c198f21153c9f43ec754c167d002ecedaee4400656159c57fbbd8cbcb0a8712"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-cli/src/main.rs:1377-1391 | crates/vcad-render/src/main.rs:1062-1076 \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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"263d3bb6605779de9a875cba73cf3645e69f167ba904c3087a7d2ec63c9cc491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel/src/lib.rs:2463-2473 | crates/vcad-kernel/src/lib.rs:2479-2491 \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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"215403bba88b88f709732d547d07c3c915757873cdc4bd2c893023211b7190df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:48-58 | apple/VcadApp/Sources/VcadApp/ElectronicsView.swift: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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"583da09c3cdefaa08e531e2bd1e9f2f994b578f306e2eacc597d0ca9a2a9e7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): packages/training/src/modal/eval.py:148-173 | packages/training/src/modal/train.py:281-319 \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":"packages/training/src/modal/eval.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd71e0a16fbdd9fc4a9c140d86aaed8872f6eeff60fac2a7761dde5267bfcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-ecad-pcb/src/session.rs:570-592 | crates/vcad-ecad-pcb/src/session.rs:624-635 \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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdf0b9e066ed95795a3aebe88c18b96890b90c3b2a683c984de2b436f909091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-kernel-booleans/src/cyl_band.rs:133-149 | crates/vcad-kernel-neutronics/src/dose.rs:45-59 \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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4508a35c386fdf2a41781f4aeeffd3b2aa9c2b515f8ae9e73ca0454abb7336f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-ffi/src/pcb.rs:1083-1097 | crates/vcad-ffi/src/pcb.rs:1104-1119 \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":"crates/vcad-ffi/src/pcb.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded12fdb237f560672847196fe29755dde09ec17be4110da90edba9d39358492"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:234-253 | crates/vcad-kernel-drafting/src/section.rs:615-636 \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":"crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7d97a6b2ae156ceaa92d96b8f3650c8136fe06d75006f639c6c5ecf977a6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-ffi/src/gym.rs:1070-1090 | crates/vcad-ffi/src/lib.rs:1325-1340 \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":"crates/vcad-ffi/src/gym.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"622192d02a99d08e305a340173ac311dee2effb12756ec20fa5169eaf9516ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-atoms/src/homogenize.rs:382-395 | crates/vcad-kernel-atoms/src/inverse.rs:48-61 \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":"crates/vcad-kernel-atoms/src/homogenize.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"739237c92ce87e5b319df53ea62cf4db9eb5f15d1efb3bb08a0fbd1b5519ba40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-em/src/axisym.rs:354-367 | crates/vcad-kernel-em/src/planar.rs:236-248 \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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"61739dd06fe9fcbb9b9147b9afcf36f1158fad3b6b24e1767012fd557eb7e898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-ecad-pcb/src/router/complete.rs:245-254 | crates/vcad-ecad-pcb/src/router/legalize.rs:244-254 \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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df15dcf4ce5bfb13b41c45d9aede2911048c761dd313ac7f43cc5fd120f536d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:774-783 | crates/vcad-kernel-wasm/src/lib.rs:869-878 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"47083ffc231408b84fc83834bb9c62a8bf8c70de27ae50eb6ff4afa09e81e3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): apple/VcadApp/Sources/VcadApp/GlassChrome.swift:525-535 | apple/VcadApp/Sources/VcadApp/GlassChrome.swift:959-968 \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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd613b2bc8dcc98703364d805c4c6764c730a35bff04f3aba753c24754e21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-ecad-pcb/src/component_mesh.rs:489-509 | crates/vcad-ecad-pcb/src/component_mesh.rs:512-534 \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":"crates/vcad-ecad-pcb/src/component_mesh.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"acba234d98ac3511a24c6ecc14bd67bc5b54df81adf1e0ee8b07d993d297098e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-booleans/src/split.rs:2526-2540 | crates/vcad-kernel-photonics/src/material.rs:132-145 \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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eb07daae7a76c605dbc55d22e6b749354f7170c102128a1b37d4d70dbe3760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:6433-6439 | crates/vcad-kernel-wasm/src/lib.rs:7194-7201 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6433}}}],"partialFingerprints":{"codehealthFindingId/v1":"56032ba0fd077442ec1adea4a99bff3dda373bd0f003db670c8865bb21dfa8ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:6740-6753 | crates/vcad-kernel-wasm/src/lib.rs:6774-6790 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6740}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f85808bfe362ab5507ebce7304532088808d61838109330e759c7d9aa7ee2eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsTools.swift:113-122 | apple/VcadApp/Sources/VcadApp/ElectronicsTools.swift:163-169 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsTools.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10af8ca0b3e245fb45c1f31b08a8e9b1a7aa74811b425faaebb5d0a0e2560d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/vcad-ecad-pcb/src/router/sco.rs:916-931 | crates/vcad-kernel-acoustics/src/instrument.rs:458-473 | crates/vcad-kernel-fea/src/modal.rs:291-306 \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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb30466d96014df47a8883a3c9e496d45154706f58bd0a0fd34e7f30608836b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/vcad-eval/src/thermal_extract.rs:598-613 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:133-148 | crates/vcad-slicer-bambu/src/job.rs:91-113 \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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"703a6c0852de43c0dad1b72aacc08d2bed4a7eee9a6ab78785ee05f99690ed3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-kernel-physics/src/diff.rs:152-167 | crates/vcad-kernel-physics/src/diff.rs:172-187 \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":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6f55f64fa455e5d5fc2ccc4366bf2402864a33f5e56c4dffa99a71f1abe2c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): docs/compression-math-survey/paper-draft-figures/make_figures.py:118-125 | docs/compression-math-survey/paper-draft-figures/make_figures.py:168-175 \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":"docs/compression-math-survey/paper-draft-figures/make_figures.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b8bdc23b418f99722e609db805faf4aa5cf54535a7f1693fb1d73c5360042"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/vcad-eval/src/convert.rs:29-47 | crates/vcad-kernel-wasm/src/lib.rs:920-938 \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":"crates/vcad-eval/src/convert.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c408b8035332e442a9e05fdef1d7b426c629d710493081534e9be5aabc398ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:3026-3035 | crates/vcad-ecad-pcb/src/router/escape.rs:186-194 | crates/vcad-ecad-pcb/src/spatial.rs:222-233 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"060cf9bea0cec11079e5646d2fbd29afda5e1ff309e4e218387d770dbc44e1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-kernel-booleans/src/mesh/csg.rs:211-222 | crates/vcad-kernel/src/faces.rs:620-634 \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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9658e5af46b819c3447d7d78334f781712046277b448e1f92b736b656f805d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-cli/src/main.rs:5085-5095 | crates/vcad-kernel-sheet/src/poly2d.rs:93-107 \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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":5085}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4cb00ffeda5542389b2a017b3d9e47ca62ff9e0634acaf88758018d12bf9d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-parts/src/vacuum/flanges.rs:272-289 | crates/vcad-parts/src/vacuum/flanges.rs:708-722 \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":"crates/vcad-parts/src/vacuum/flanges.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a81b0355a49bdf13add9ae78ce426883d682899da4215f8ec48dd169cce8cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:399-405 | apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift:181-189 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f790afc277e8710777d9255fcbb7632c019d4911539d11fd12139479577829b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-ecad-sim/src/circuit/devices.rs:665-675 | crates/vcad-ecad-sim/src/circuit/devices.rs:678-688 \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":"crates/vcad-ecad-sim/src/circuit/devices.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"065f1f089c00ea68840fd57199cbf41991f1d5f827d81c59ee6a503e26985c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:2914-2929 | crates/vcad-kernel-wasm/src/lib.rs:2949-2964 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2df67cc738fa54b297849b5d7c48e9b05e11bb49174e32a9fac6bad81cd0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-kernel-antenna/src/geometry.rs:117-131 | crates/vcad-kernel-antenna/src/geometry.rs:141-157 \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":"crates/vcad-kernel-antenna/src/geometry.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c11da579a6628968111cae555ea5f7a9dc0085dbce6487b685375feb4a4fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apple/VcadApp/Sources/VcadApp/PrintWorkbench.swift:276-284 | apple/VcadApp/Sources/VcadApp/SheetMetalWorkbench.swift:68-75 \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":"apple/VcadApp/Sources/VcadApp/PrintWorkbench.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2e87d951e83f57d639155052b7cbc6632dbc96cfb1f0058032cb2cd1d24b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/vcad-ecad-pcb/src/router/auto.rs:3861-3878 | crates/vcad-ecad-pcb/src/session.rs:945-967 \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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec777a84428af6789975d35defd4a4e522357dfddb913a8e5fde748b5519a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/vcad-ecad-pcb/src/router/gpu_bridge.rs:50-80 | crates/vcad-ecad-pcb/src/router/gpu_bridge.rs:84-103 \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":"crates/vcad-ecad-pcb/src/router/gpu_bridge.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d641539b6cf7fb6f95d4d75a1add4aeb35f47bad58913e999e6cacc42c65e51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): crates/vcad-kernel-geom/src/lib.rs:785-793 | crates/vcad-kernel-geom/src/lib.rs:796-803 | crates/vcad-kernel-geom/src/lib.rs:814-820 | crates/vcad-kernel-geom/src/lib.rs:974-982 | crates/vcad-kernel-geom/src/lib.rs:985-991 | crates/vcad-kernel-geom/src/lib.rs:1003-1010 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09eb7ee7dc035f890a18be26331fe1e33e9a079e0f1f849263cb860d196a913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-ecad-pcb/src/router/complete.rs:1955-1959 | crates/vcad-ecad-pcb/src/router/maze.rs:1247-1251 \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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8e80756dc9713612ecb77fed96ab0710e24212c63f5318f23f6a9d0a0a2091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-kernel-em/src/planar.rs:722-738 | crates/vcad-kernel-em/src/planar.rs:740-754 \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":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d16fe739f882501a600c98923d71f9cf1cbcb084ed6ce20c07e7d41e37f82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/vcad-kernel-neutronics/src/materials.rs:389-404 | crates/vcad-kernel-neutronics/src/materials.rs:410-425 | crates/vcad-kernel-neutronics/src/materials.rs:428-443 \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":"crates/vcad-kernel-neutronics/src/materials.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d0ffdbded7442a121bba38e23ceb0b6f101d9c559b94d3bbaea4ed86ff2565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/vcad-kernel-sketch/src/extrude.rs:49-71 | crates/vcad-kernel-sketch/src/profile.rs:261-291 \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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c142f6b0fe9a91400b4eb8960e75be52a60cf8e5f4eef8e6b8c78873f588b9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:1108-1121 | crates/vcad-kernel-wasm/src/lib.rs:1125-1136 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b15b89de9ccc104456a13df8ed7ca8a8d942303cf548f7a3653bef192595b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apple/VcadApp/Sources/VcadApp/ContactShadow.swift:170-177 | apple/VcadApp/Sources/VcadApp/FieldOverlay.swift:167-173 \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":"apple/VcadApp/Sources/VcadApp/ContactShadow.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2dd825b81c56648e46e971fd45787883b1f7765fcc60982a22ab7993e35451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift:657-664 | apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift:665-672 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5a2716d47122a5ea36cabed13fbf79f2e63a8c5ccb356317674998fe69a3c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-slicer-gcode/src/gcode.rs:222-245 | crates/vcad-slicer-gcode/src/gcode.rs:247-267 \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":"crates/vcad-slicer-gcode/src/gcode.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"628fb28b49aa4b99d947dff9c74939f56cf110ce92afb33e0ff3ab8cfc6bae44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/vcad-eval/src/evaluate.rs:4081-4101 | crates/vcad-eval/src/evaluate.rs:4111-4135 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":4081}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1716850b45125d9b36ec6d5ec8582430130b0b7966c9f9c7ad77c6836d8adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/vcad-ir/src/expr_parser.rs:359-376 | crates/vcad-ir/src/expr_parser.rs:378-396 \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":"crates/vcad-ir/src/expr_parser.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1a61219b3509d59285e15418047ce169a45c99c9f2680edb94ffde226cb1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:144-160 | crates/vcad-kernel-step/src/entities/surfaces.rs:1120-1132 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9ccb534de96092e3d16b16158999930cde2f3a120f97d5a3bce32d843a97f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/vcad-kernel-step/src/entities/topology.rs:124-144 | crates/vcad-kernel-step/src/entities/topology.rs:192-210 | crates/vcad-kernel-step/src/entities/topology.rs:213-236 \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":"crates/vcad-kernel-step/src/entities/topology.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff27fec2824c0939b5187f84183d6e4d7de3f616a5e962ad4fc0993d227649d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:7799-7805 | crates/vcad-kernel-wasm/src/lib.rs:7812-7818 | crates/vcad-kernel-wasm/src/lib.rs:7843-7851 | crates/vcad-kernel-wasm/src/lib.rs:7863-7876 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":7799}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9b77686d4fcd14aefec480a4c727e3a1ebb154be9874bc09d99418460dbdc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apple/VcadApp/Sources/VcadApp/DocumentEngine.swift:306-313 | apple/VcadApp/Sources/VcadApp/DocumentEngine.swift:316-325 \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":"apple/VcadApp/Sources/VcadApp/DocumentEngine.swift"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f073e43e5ba08e925f35fada22e2a9eced0f1bf944e746764bf9bc711c1c473b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apple/VcadApp/Sources/VcadApp/PcbFFI.swift:74-78 | apple/VcadApp/Sources/VcadApp/PcbFFI.swift:80-84 \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":"apple/VcadApp/Sources/VcadApp/PcbFFI.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d146616ef65285e86d49afe8d5cc58941923489f7984163fc73ae797a9590b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-cam/src/turning/envelope.rs:59-72 | crates/vcad-kernel-raytrace/src/intersect/torus.rs:243-259 \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":"crates/vcad-kernel-cam/src/turning/envelope.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b507370cdd144c562ce75f0f91ab4fda870d5269405b5e41e936307e0dd3a97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): crates/vcad-kernel-step/src/entities/curves.rs:110-130 | crates/vcad-kernel-step/src/entities/geometry.rs:59-71 | crates/vcad-kernel-step/src/entities/surfaces.rs:131-150 | crates/vcad-kernel-step/src/entities/surfaces.rs:190-209 | crates/vcad-kernel-step/src/entities/surfaces.rs:214-235 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd30c256d40f2ca5bf3d381db553373a3ed5104d320f635022d8317c784aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-urdf/src/reader.rs:684-694 | crates/vcad-kernel-urdf/src/reader.rs:1159-1176 \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":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99c1f5615cc000a8b145e244cd5709a46089196ba8263e287ffddc65ce63a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-ecad-pcb/src/dfm.rs:502-513 | crates/vcad-ecad-pcb/src/router/escape.rs:86-100 \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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a6b72ee93e462d0fbf8dcf84d190b0ed8b3681c882a31f87b9286661b6260b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-ecad-pcb/src/router/descent.rs:1713-1721 | crates/vcad-kernel-sheet/src/manufacturability.rs:482-492 \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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"562de1dd51368a0a607a1accd83c3f3fa567c3c78e9dc2c9078643b172cd4084"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-ecad-sim/src/circuit/ac.rs:188-198 | crates/vcad-ecad-sim/src/circuit/devices.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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdf1b710c65d09c804c7f78d9867dc59c5ac96da109eebd30aa7e3652d823e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-step/src/assembly.rs:172-180 | crates/vcad-parts/src/vacuum/mod.rs:649-657 \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":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"537f2b3ad753d28bad20bb5bc660d3ed2cda530a1a54397b4359fb8065592f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:754-764 | crates/vcad-kernel-wasm/src/lib.rs:850-860 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d024f0a5e974593a5c02749eeac1700d5f9cf32bbf844bdd483281018c4a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:2099-2118 | crates/vcad-kernel-wasm/src/lib.rs:2130-2143 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4c13b52cb773fddcfaf3fabcb0a2eb4a2b99a079d9f636534ca23f13fc4dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/vcad-ecad-pcb/src/pour_synth.rs:289-301 | crates/vcad-ecad-pcb/src/router/auto.rs:3941-3953 | crates/vcad-ecad-pcb/src/router/flow/access.rs:130-144 \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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5009b63b8dfd10445ba27283be9f2751fd1542f9b387ceff71faab982e11072"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-eval/src/thermal_extract.rs:772-784 | crates/vcad-printcheck/src/mesh.rs:100-112 \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":"crates/vcad-eval/src/thermal_extract.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"0830e9af900fab8829cc94c92bcbf88bb04cba84be7093550ea0ce0a176f187c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:590-598 | apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:600-608 \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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9040d0695c20991469cb1f6c6bd72d0bc4277863da8d77f3fdebe6c1731c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:477-492 | crates/vcad-kernel-nurbs/src/lib.rs:983-998 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43afe79caaabc82ed8e67886d8eb3200b0b281e8394a71757fdc86c53ce9ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-particle/src/adjoint.rs:250-257 | crates/vcad-kernel-particle/src/field.rs:188-196 \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":"crates/vcad-kernel-particle/src/adjoint.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcc3db761fa065971f460f6376cce47222c7d21b3dfac9492bd3af9693b1673"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-runtime/src/history.rs:113-124 | crates/vcad-runtime/src/history.rs:127-138 \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":"crates/vcad-runtime/src/history.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c04a3a4a2490cd4acb6920170ab39a4b9ba73ca9a75e9a166fbf2642358a7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 23\u002B corresponding lines): crates/vcad-slicer-gcode/src/printer.rs:58-80 | crates/vcad-slicer-gcode/src/printer.rs:83-105 | crates/vcad-slicer-gcode/src/printer.rs:108-130 | crates/vcad-slicer-gcode/src/printer.rs:133-155 | crates/vcad-slicer-gcode/src/printer.rs:158-180 | crates/vcad-slicer-gcode/src/printer.rs:183-205 | crates/vcad-slicer-gcode/src/printer.rs:208-230 | crates/vcad-slicer-gcode/src/printer.rs:233-255 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/printer.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d6061cdf0281c1a34fae791fb74d5786f65e09c3e8cda7bb285be4af5bb291"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apple/VcadApp/Sources/VcadApp/IntentBar.swift:119-123 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:119-123 \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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2670ffcedad2c47725019719c0bac963124ca0c25d8febb809108d05e257b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-cli/src/ui/command.rs:13-24 | crates/vcad-cli/src/ui/command.rs:250-258 \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":"crates/vcad-cli/src/ui/command.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6bc479d700235ac761ad0c6898015e251f0da4b377e28245e729e0e8bc485d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/vcad-ffi/src/clearance.rs:253-268 | crates/vcad-ffi/src/dfm.rs:429-444 | crates/vcad-ffi/src/fea.rs:619-636 \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":"crates/vcad-ffi/src/clearance.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1797fbeaeffab94a163b9519009af4016ae0d380534bcbe80e1b8ff40d5dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-cli/src/ui/tree.rs:19-33 | crates/vcad-cli/src/ui/tree.rs:204-216 \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":"crates/vcad-cli/src/ui/tree.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf6fc4d4f27f6916375765ebc51cbb1b15994ee745053d7a885460da63da863"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-ecad-pcb/src/impedance.rs:225-231 | crates/vcad-ecad-pcb/src/impedance.rs:235-248 \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":"crates/vcad-ecad-pcb/src/impedance.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd28d83dc2bb1d767bafda63d9a00da1818067d48f87f092288fcb57342e191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/vcad-kernel-geom/src/lib.rs:614-622 | crates/vcad-kernel-geom/src/lib.rs:625-632 | crates/vcad-kernel-geom/src/lib.rs:643-649 \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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f2c076acce00e5cd976ea1b6d4c759bfb2f764592fcc0cd3224dbc28dbdc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-ecad-symbols/src/builtin.rs:29-44 | crates/vcad-ecad-symbols/src/footprint.rs:100-123 \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":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9296a841500db19eaaf01c1749957a5c04666443df8ead0540493bbcc6b88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-topopt/src/analyze.rs:402-410 | crates/vcad-kernel-topopt/src/lib.rs:191-199 \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":"crates/vcad-kernel-topopt/src/analyze.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"561ebfd544aad00f3062813588dd3263a13573a2fed029ca413ea767b161d787"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apple/VcadApp/Sources/VcadApp/AssemblyEdit.swift:108-113 | apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:329-334 \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":"apple/VcadApp/Sources/VcadApp/AssemblyEdit.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57cd1db0db7c8d13a9ffeaa54285d43bbcc2e2eb3e19b49b265a4a98d569e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:1555-1559 | crates/vcad-ecad-pcb/src/drc.rs:1562-1566 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5520e4936e2d5812c36709bd763d722b1220a41c7d765e5461144c8d89cbea7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/vcad-ffi/src/pcb.rs:678-686 | crates/vcad-ir/src/gear.rs:359-371 | crates/vcad-parts/src/builder.rs:162-173 \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":"crates/vcad-ffi/src/pcb.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"1501a93f99a6546c6ede7c103a226ed07b45e77350b78a36f0010c566671d34e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/vcad-kernel-drafting/src/sheet.rs:327-346 | crates/vcad-kernel-drafting/src/sheet.rs:416-435 \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":"crates/vcad-kernel-drafting/src/sheet.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1e0d1c6ba7e55202416b64052b06aeff65a7ef36eafafd4c6c2ef1d80e331d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-ecad-sim/src/impedance.rs:88-104 | crates/vcad-ecad-sim/src/impedance.rs:123-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":"crates/vcad-ecad-sim/src/impedance.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee5473e0f5ecd927d0a7ae3f29ead0400013b4589900bb5215b39ab4cc29591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-ffi/src/gym.rs:578-596 | crates/vcad-ffi/src/gym.rs:676-692 \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":"crates/vcad-ffi/src/gym.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e386688a1ba710bb0e2516bcb8d1fc95b764eb47709a61d2a8da192c5f7b578c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): crates/vcad-ffi/src/gym.rs:1212-1227 | crates/vcad-ffi/src/lib.rs:789-806 | crates/vcad-ffi/src/lib.rs:885-902 | crates/vcad-ffi/src/lib.rs:911-928 | crates/vcad-ffi/src/train.rs:913-934 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/gym.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c46f412d24936a8497d4ea3c6884957741111ece0dc2d69ee60b08d99528b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-cam/src/dropcutter/ball.rs:124-134 | crates/vcad-kernel-cam/src/dropcutter/bull.rs:238-256 \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":"crates/vcad-kernel-cam/src/dropcutter/ball.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c99cc89e13efe2f3e6fd3860521812d1113d1ea7bc7b4aab79921df1cd0b4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/vcad-kernel-diff/src/implicit.rs:407-418 | crates/vcad-kernel-diff/src/implicit.rs:425-438 | crates/vcad-kernel-diff/src/implicit.rs:445-456 | crates/vcad-kernel-diff/src/implicit.rs:463-474 \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":"crates/vcad-kernel-diff/src/implicit.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d7e160cc51f71f8ebe00f82ef27bfcdbc6649a0b68374a040977ce3033e638"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/vcad-kernel-geom/src/lib.rs:208-224 | crates/vcad-kernel-geom/src/lib.rs:385-399 | crates/vcad-kernel-geom/src/lib.rs:926-941 | crates/vcad-kernel-geom/src/lib.rs:1458-1474 \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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0c7c458aea06a944f75f34f69844bfcab0264090beb1b61e5a5cd2b0b1ed3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:7119-7125 | crates/vcad-kernel-wasm/src/lib.rs:7268-7275 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":7119}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f68de6a9af79f397d20d7d6b7c2cdfee590249a3d4f7ae58eefd0e847373fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-eval/src/evaluate.rs:2829-2843 | crates/vcad-eval/src/evaluate.rs:2918-2933 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"faec7e4fe41c742f228ead2113e1bac9df8b311db2db10cde8b173efa1f7666b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-ffi/src/clearance.rs:34-43 | crates/vcad-kernel-shell/src/lib.rs:890-900 \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":"crates/vcad-ffi/src/clearance.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fef97c981ad5570e014676e80030b2e4bb0d6b1be575feafddb46dadbe486a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-constraints/src/residual.rs:356-364 | crates/vcad-kernel-constraints/src/symbolic.rs:585-593 \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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"02531affae911ca5e21d96616bcd282fcd39ab0aac77d8c2cf0440f4f2746787"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-constraints/src/session.rs:573-580 | crates/vcad-kernel-constraints/src/session.rs:617-625 \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":"crates/vcad-kernel-constraints/src/session.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"34569f83def6f9e5c55fe776f107da15ffdd5da4590f7b8f520aefdc00e69da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-constraints/src/session.rs:890-897 | crates/vcad-render/src/lib.rs:2068-2075 \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":"crates/vcad-kernel-constraints/src/session.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"3580db6f392c70eac3bf5b8dad82331a1cfc4fbcf5439a0eef49f251181a8d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-kernel-step/src/entities/curves.rs:90-105 | crates/vcad-kernel-step/src/entities/topology.rs:110-121 \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":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a586f8a6466985731675c529842317be305c41d5b0be8638408bded7a490e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:319-327 | apple/VcadApp/Sources/VcadApp/Document.swift:841-849 | apple/VcadApp/Sources/VcadApp/Document.swift:850-857 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:841-849 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:850-857 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5ca711bc2ec2c9f4f13dacdbba4878e8e75e5a41f21d87bcd0abb828922fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apple/VcadApp/Sources/VcadApp/DocumentEngine.swift:290-297 | apple/VcadApp/Sources/VcadApp/ReceiptStore.swift:73-80 \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":"apple/VcadApp/Sources/VcadApp/DocumentEngine.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"35985879d8750bef3e1537508ff116eb3e8de139a461d89ebd6e8f1f64d667f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-ffi/src/pcb.rs:769-777 | crates/vcad-ffi/src/pcb.rs:847-855 \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":"crates/vcad-ffi/src/pcb.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a34bdcc1f21980112fdabcc2f06ae15cf8ecafdedcdb17cb8dcf3d578d7791"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-naming/src/lib.rs:694-702 | crates/vcad-kernel-naming/src/lib.rs:705-715 \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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f178675243dfd14cf5fcd6f64ed51c51f779938df8f0c9785bd3ad8510a6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-neutronics/src/materials.rs:531-543 | crates/vcad-kernel-photon-dose/src/materials.rs:232-246 \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":"crates/vcad-kernel-neutronics/src/materials.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8a415252dfbc3d91a13ebd6c94c3ee2b52563937628199a2cfbbaae0433acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:181-197 | crates/vcad-kernel-wasm/src/lib.rs:213-229 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9459a8af1e444c514e6c10474c4b9659c47927b1d3c419d2846d50739095d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:665-669 | apple/VcadApp/Sources/VcadApp/DocumentEngine.swift:77-81 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:665-669 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f2bd76d5491beac9d72acbd1ac5d7e3921a6da69f0d6abcb08b6f2e670634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsToolsViews.swift:355-357 | apple/VcadApp/Sources/VcadApp/ElectronicsToolsViews.swift:418-420 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsToolsViews.swift"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcefed7a9fd777fe344f4d4002af712cf82c7e9d560bcfae40a39745028373b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:3398-3405 | crates/vcad-kernel-wasm/src/lib.rs:3431-3448 | crates/vcad-kernel-wasm/src/lib.rs:3467-3474 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1835c29fedb802822b13fa586ddcc5b71eb18c0f46dcd3fd992a7a35dafc9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mecheval/graders/src/eval.rs:75-91 | mecheval/graders/src/eval.rs:94-110 \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":"mecheval/graders/src/eval.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf08dc8abf2cf7f8620a21f000749e1cce8a6cd3f54c0360d18f25407d82fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-ffi/src/import.rs:96-108 | crates/vcad-ffi/src/import.rs:239-251 \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":"crates/vcad-ffi/src/import.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"721cf8dd5eeb622a058106d147cb48553e54d0084b5bdfc5b6aae7d933093e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-assembly/src/mate_check.rs:158-168 | crates/vcad-kernel-assembly/src/mate_check.rs:246-256 \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":"crates/vcad-kernel-assembly/src/mate_check.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ca2a3cd6344aca4fdcffdeebd6bfe0af87c41a60fe7600d527f3f2fd26a74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:184-193 | crates/vcad-kernel-nurbs/src/lib.rs:722-729 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929d8c8c0302671d5f2a27422c73af70bc8dc7a810f12f3001922938f8a796f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-sketch/src/profile.rs:417-433 | crates/vcad-slicer/src/path.rs:30-42 \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":"crates/vcad-kernel-sketch/src/profile.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a766bf5d4666ae8b1b642154584e9edbef0abb6bd94fb557666bb102cee77a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-render/src/lib.rs:4203-4210 | crates/vcad-render/src/lib.rs:4255-4262 \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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9933e6b6217ea73943c7450729600af9718ca8aada42fd5f1eba556e74d4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:2117-2120 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2117-2120 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"14104128735220280e6ed5d42f61c782fb772072cc69c43f7fe18012d349df22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift:559-563 | apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift:755-759 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"829b30f151e66380686afdad38bf2dbd867ba3cdf5830f885c0a7289a45b5073"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-booleans/src/classify.rs:1617-1629 | crates/vcad-kernel-booleans/src/classify.rs:1636-1651 \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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f223bab203e719f17a751dfe449f8880d03abb505d6e880515eeaf89314736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:765-767 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:765-767 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c682140ece3f63349632682c1844f6c751cc8c9e820522c44e45f448076ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): apple/VcadApp/Sources/VcadApp/DocumentExport.swift:204-215 | apple/VcadApp/Sources/VcadApp/PhotoImport.swift:389-400 \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":"apple/VcadApp/Sources/VcadApp/DocumentExport.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"61183f88419a4f05f2007ec6bf41de13463d9941ae8b1026b2157a82a68bde60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2707-2713 | apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2726-2732 \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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"f650d42d621828cc3fdb73cb07f196d1240678e8fa700727177c1749416b6d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-cli/src/ui/toolbar.rs:589-602 | crates/vcad-cli/src/ui/toolbar.rs:605-622 \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":"crates/vcad-cli/src/ui/toolbar.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4074aebd6925ad16e563fb64b2b0bdcb481b93bfa6c82730b52a71e074dbc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/vcad-ffi/src/lib.rs:261-278 | crates/vcad-ffi/src/lib.rs:282-296 | crates/vcad-ffi/src/lib.rs:745-757 \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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd900819ca81a08881c5000201041746e62cdf8a448c95ff24c1b6d286bfc39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-ffi/src/recon.rs:721-733 | crates/vcad-ffi/src/recon.rs:875-887 \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":"crates/vcad-ffi/src/recon.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"3261047bfceeb18de2e742402fc1291a8d569af705e460f8dc5467401f930ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/vcad-ir/src/file_io.rs:466-481 | crates/vcad-ir/src/file_io.rs:484-501 \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":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ee48c5b39c3f325657f1c988aa0bd4b59832e8ddd7a4b586cf85ac626c1cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:7224-7229 | crates/vcad-kernel-wasm/src/lib.rs:7244-7249 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":7224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c42968303332786b4b6b9a4286851da02d0b74511001b8732cedc7db89e4662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:7605-7610 | crates/vcad-kernel-wasm/src/lib.rs:7955-7960 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":7605}}}],"partialFingerprints":{"codehealthFindingId/v1":"40976b156664cfaf0730a69ffd63b2a318abe393b999e0fc4fabc332e6ec6a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apple/VcadApp/Sources/VcadApp/SketchInference.swift:132-136 | apple/VcadApp/Sources/VcadApp/SketchSession.swift:1584-1589 \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":"apple/VcadApp/Sources/VcadApp/SketchInference.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9907eaa1bfc7737f1a71d44aed484b13933f88f1d5135eae26a45e043b1caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-ffi/src/lib.rs:768-780 | crates/vcad-ffi/src/lib.rs:866-875 \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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a148e1a29c155f356f542e6263801a3b1041d5a95e5845fcc78772db2a27183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-ffi/src/sketch.rs:256-265 | crates/vcad-ffi/src/sketch.rs:294-302 \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":"crates/vcad-ffi/src/sketch.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37d52ab42c1495627e774028b5c95758cafea5efb197e97c14a77339a3ad5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:357-362 | crates/vcad-kernel-nurbs/src/lib.rs:365-370 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7f70da190d952701112e77ff5bca9931f62f7f678615e661ebb6385ebc1f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): apple/VcadApp/Sources/VcadApp/DocumentExport.swift:167-177 | apple/VcadApp/Sources/VcadApp/DrawingWorkspace.swift:602-612 \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":"apple/VcadApp/Sources/VcadApp/DocumentExport.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb63c65ea177f4e76f3ead3a63586e11a9677c0aba21730df2f1561c0fba697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/vcad-kernel-booleans/src/split.rs:5758-5769 | crates/vcad-kernel-booleans/src/ssi.rs:323-334 \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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5758}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea68fabe939e3746af58ce14aa917af009c113d6e8eb52831287d854b0a1d3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-kernel-cam/src/tool.rs:74-83 | crates/vcad-kernel-cam/src/tool.rs:100-109 \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":"crates/vcad-kernel-cam/src/tool.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"313caee258f0bbd184fbb0a2ae42fc05ffd46af8cd699fea2e634e7e691c560e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/vcad-kernel-geom/src/lib.rs:492-503 | crates/vcad-kernel-geom/src/lib.rs:685-695 | crates/vcad-kernel-geom/src/lib.rs:856-867 | crates/vcad-kernel-geom/src/lib.rs:1046-1058 \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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae819e0035adc419f22befab833240604efbf7d524062ad47b1959914954ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:6449-6453 | crates/vcad-kernel-wasm/src/lib.rs:6474-6482 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1273e68463a617bced0fee9a8091c84b47b1c7a44c7106245a72956574b4ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:6571-6575 | crates/vcad-kernel-wasm/src/lib.rs:6583-6587 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a7267c077c1a8eacc9e4244fe14722a0c3b49d6b575919756bee86da472021"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apple/VcadApp/Sources/VcadApp/AssemblyEdit.swift:181-186 | apple/VcadApp/Sources/VcadApp/AssemblyEdit.swift:294-299 \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":"apple/VcadApp/Sources/VcadApp/AssemblyEdit.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84dcc82a6a826d8bf72ecf933bd9d87e86e0caaabe454159d0b8807c7e5f250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-constraints/src/session.rs:50-66 | crates/vcad-kernel-particle/src/wire3d.rs:649-661 \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":"crates/vcad-kernel-constraints/src/session.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"68689d182149997ffb317b05b7e9136159dc1f6f2e2e6c21a0d9e8387103adf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/vcad-kernel-geom/src/lib.rs:635-640 | crates/vcad-kernel-geom/src/lib.rs:806-811 | crates/vcad-kernel-geom/src/lib.rs:994-1000 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c2a93823ac1defa0a25fd1ed33aea5d7ce48bd9b12651ef57984ce97bc96c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:6594-6599 | crates/vcad-kernel-wasm/src/lib.rs:6616-6621 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94abbd26dd4c78506b348cb24c3ac11c43acb0118362fa30a1766fd0b9b5d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel/src/lib.rs:1766-1780 | crates/vcad-kernel/src/lib.rs:1792-1802 \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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d28bcbd08b49498e41072c3991f223aea47e2bc2adda79c10bddcaddfc98bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apple/VcadApp/Sources/VcadApp/NavigationViews.swift:287-291 | apple/VcadApp/Sources/VcadApp/NavigationViews.swift:534-538 \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":"apple/VcadApp/Sources/VcadApp/NavigationViews.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"20170ea8a82c205b24a27ab7ee1b98ee6587d54ce66bd951a9eb8074954ea49f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/termview/src/buffer.rs:60-71 | crates/termview/src/buffer.rs:80-91 \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":"crates/termview/src/buffer.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fc45697d9473b42bdbf67c0a3f1292ea223bda6d4b514a97f411ecb838e343"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-ecad-export/src/bom.rs:80-85 | crates/vcad-ecad-export/src/pick_place.rs:51-56 \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":"crates/vcad-ecad-export/src/bom.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"20157d7c9809ee24422c896785c9d1ce23d6e12892b7bbed080f1e28ace42d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/vcad-ecad-pcb/src/router/claims_ir.rs:435-447 | crates/vcad-ecad-pcb/src/router/claims_ir.rs:457-470 | crates/vcad-ecad-pcb/src/router/claims_ir.rs:473-486 \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":"crates/vcad-ecad-pcb/src/router/claims_ir.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"147212022339f20cf7d86a061bdf02f553541a5d56507e996a15937055d72da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-step/src/entities/mod.rs:123-136 | crates/vcad-kernel-step/src/entities/mod.rs:138-151 \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":"crates/vcad-kernel-step/src/entities/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aa59c5439c9bca8c9de3b24a411d88fd793df0d2920899c8ba2be87f197855"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:6631-6636 | crates/vcad-kernel-wasm/src/lib.rs:6646-6651 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6631}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2302dc31bfd0b7753987f896caf35b63fb3f11b64da39058897aec3588e4eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-app/src/context.rs:219-231 | crates/vcad-app/src/context.rs:233-245 \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":"crates/vcad-app/src/context.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02b71f9b51f6f0ef13fbf9aa9b044f5fa7913f45cc1793a06b8e44afc5efbaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:1667-1676 | crates/vcad-ecad-pcb/src/drc.rs:1708-1717 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0842771d678ce5e75efb26baef488a993453f9e210ed1ea1a8960031889a517d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:3063-3068 | crates/vcad-ecad-pcb/src/session.rs:997-1002 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2378ef92cf3d0f28719279ce2e9a9b2f817a68287223932cb9ab52c01618014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-ffi/src/err.rs:74-93 | crates/vcad-ffi/src/gym.rs:758-771 \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":"crates/vcad-ffi/src/err.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe83a792931bb352b2b23cccb06d1facabde6db4424fe058af8e635dbdc35c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:955-959 | crates/vcad-kernel-nurbs/src/lib.rs:961-965 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beebcc3f61f87a824b3050bdc1b10d1f5427ede05ed770d07a914b00a3a4956"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:3524-3534 | crates/vcad-ecad-pcb/src/drc.rs:3621-3631 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfce1cd07252a0e9cddc36df822e1b1a79a463512de7b1fa8ac00c1301f1565c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-ecad-pcb/src/impedance.rs:128-138 | crates/vcad-ecad-symbols/src/kicad_write.rs:135-148 \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":"crates/vcad-ecad-pcb/src/impedance.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b3aaa739c747688d1cc86d847943b678d86e1afb890d0b29a6ae56c2987aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-ecad-symbols/src/kicad_pcb.rs:36-45 | crates/vcad-ecad-symbols/src/kicad_sch.rs:34-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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb731f6e0726e155ed4d057cf1fe25f7c8d819d8a43950cb5829ebce73ad2056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/ElectronicsToolsViews.swift:153-156 | apple/VcadApp/Sources/VcadApp/ElectronicsToolsViews.swift:358-360 \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":"apple/VcadApp/Sources/VcadApp/ElectronicsToolsViews.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"651105466136603f300c5269f3fe749ed93a79b2db6326b43568c777ef2a380d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/vcad-ecad-pcb/src/router/auto.rs:4295-4303 | crates/vcad-ecad-pcb/src/router/auto.rs:4309-4317 | crates/vcad-ecad-pcb/src/router/maze.rs:100-108 \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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70f80830dacb6e206f079e9590679edfdb6917e6d8d3822ddc89de8e842aeac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-ecad-symbols/src/kicad_mod.rs:156-164 | crates/vcad-ecad-symbols/src/kicad_sym.rs:127-135 \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":"crates/vcad-ecad-symbols/src/kicad_mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6733b8d37078ed93e6acb3a4c42a1d4f100b06e3816e94e42d75577c8b6cd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-eval/src/cache.rs:352-362 | crates/vcad-eval/src/cache.rs:363-373 \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":"crates/vcad-eval/src/cache.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea6f87ca51286e8f0577d8d1213c75cac2bcec0d88a2b210de9b7ef058c6f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-em/src/axisym.rs:333-346 | crates/vcad-kernel-em/src/planar.rs:203-221 \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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8fa2773a11a4f736799c5e4f838ab0a4f70d9aa6f86debf7f413cc7976bd40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/vcad-kernel-qcd/src/update.rs:20-28 | crates/vcad-kernel-qcd/src/update.rs:31-39 | crates/vcad-kernel-qcd/src/update.rs:45-53 \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":"crates/vcad-kernel-qcd/src/update.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7f60561db5fb3155def92c5a1d255b7d0ec31794ce66a67c6b186b0658a5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-app/src/keybinding.rs:228-241 | crates/vcad-app/src/keybinding.rs:260-273 \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":"crates/vcad-app/src/keybinding.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a8db1c7761dd56cde959d4f9ffb15b704a2c1715edba00810b160d13a2ed9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-acoustics/src/instrument.rs:172-182 | crates/vcad-kernel-acoustics/src/strike.rs:95-105 \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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"07824adb9739f7a9f3b32114951c6270ea80fb296e207b2330614000a38bc377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-cam/src/turning/geom.rs:46-54 | crates/vcad-kernel-particle/src/wire3d.rs:636-645 \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":"crates/vcad-kernel-cam/src/turning/geom.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5b3b9c2504ac7ebf25e92fdc3c7ff1fa9a1cf84d532d282c902380e18a5d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/vcad-kernel-drafting/src/sheet.rs:768-773 | crates/vcad-kernel-drafting/src/sheet.rs:776-784 | crates/vcad-kernel-drafting/src/sheet.rs:790-798 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/sheet.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e1ce4d6cf6ce0296e52acd415652911eb1f642c6f1f7e997223e057e6540de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-flow/src/model.rs:311-318 | crates/vcad-kernel-thermal/src/model.rs:354-361 \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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"7763ed3d9a9e0fecae767fd78c78a87eb9fa0de719ef0ff2bc3b853789c97b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-kernel/src/lib.rs:2427-2436 | crates/vcad-kernel/src/lib.rs:2447-2456 \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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9169994f9c9bbc5d337b873ee5597c5181a6766b8d83319b3e3356e759c6995"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/vcad-parts/src/types.rs:243-254 | crates/vcad-parts/src/types.rs:257-268 | crates/vcad-parts/src/types.rs:271-283 | crates/vcad-parts/src/types.rs:286-297 \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":"crates/vcad-parts/src/types.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ece830cfeda8f97fe93eb2dbb1dd816aff7e4d97123c271e58806fd54c74b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Shell.swift:1095-1098 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1095-1098 \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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"49797033e4401954995c0c8c72200730ecae1907a9894d4cd2f1de1ae64f56ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-cli/src/app.rs:919-928 | crates/vcad-cli/src/app.rs:932-941 \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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"061e024eae69dee4693523993dc6fd8a565bad023cf21b835996d479699e7c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:1937-1949 | crates/vcad-ir/src/ecad.rs:1568-1579 | crates/vcad-kernel-raytrace/src/trim.rs:532-543 | crates/vcad-kernel-sheet/src/poly2d.rs:110-121 | crates/vcad-kernel-sheet/src/unfold.rs:361-372 | crates/vcad-render/src/pcb.rs:768-777 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aea113969ec1e13a749c90b27de93ab535a3c6945d927da391d9a487aadbbe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-kernel-physics/src/diff.rs:1016-1020 | crates/vcad-kernel-physics/src/diff.rs:1094-1098 \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":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"406cfde738d1155ab69f35cdcf277de3ae11947ff34164c7fec73b010e5a35ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-thermal/src/adjoint.rs:386-397 | crates/vcad-kernel-thermal/src/adjoint.rs:400-408 \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":"crates/vcad-kernel-thermal/src/adjoint.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d440e6239ac8b0d7be15074ead43d3f8ad6bac382a8eac58bae0fbfb4d524c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-wasm/src/document_engine.rs:52-59 | crates/vcad-kernel-wasm/src/document_engine.rs:113-120 \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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6351c356a75ab3d59d1416c1a2711e66025053240c540b16220a36da3766099a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-loon/src/params.rs:170-178 | crates/vcad-loon/src/variants.rs:299-307 \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":"crates/vcad-loon/src/params.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ac7defa4ce7ecfbd11c25f18aebff924837b9676304ef3b41cc737602441fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/vcad-slicer-gcode/src/gcode.rs:343-359 | crates/vcad-slicer-gcode/src/gcode.rs:361-377 \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":"crates/vcad-slicer-gcode/src/gcode.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a254b3105b49748d1d760a6e2943a4b512e99546212cbe2964f45463a1b63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/vcad-ecad-package/src/derive.rs:99-113 | crates/vcad-ecad-symbols/src/builtin.rs:13-27 | crates/vcad-ecad-symbols/src/footprint.rs:147-158 \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":"crates/vcad-ecad-package/src/derive.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef0ac93f872767d0fb80c9602bdbc7fc7b0a44e10deb721641247477ab95bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-ecad-pcb/src/drc.rs:170-175 | crates/vcad-ecad-pcb/src/router/auto.rs:412-418 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"854644d67f391767771ef3a792ece02ac90f1855cefac6c872031873911c1978"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-ecad-pcb/src/geometry.rs:59-67 | crates/vcad-ecad-pcb/src/router/auto.rs:3263-3271 \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":"crates/vcad-ecad-pcb/src/geometry.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de1e34e5db27a6fbf628ef5640e550d8c5c514a0fd77119ad23a507a32eb158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-kernel-nurbs/src/lib.rs:328-354 | crates/vcad-kernel-nurbs/src/lib.rs:777-790 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eeef09642ad8cca3d6cd528918d186443170591ab9ba7d729015c1e9ca26f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-kernel-tessellate/src/lib.rs:246-255 | crates/vcad-kernel-tessellate/src/lib.rs:439-448 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36b61e912fed28076f3407de8feeec5caa6cf6297f1807bd7415898ef3d9f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/vcad-kernel-tessellate/src/manifold.rs:211-214 | crates/vcad-parts/src/vacuum/mod.rs:499-504 \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":"crates/vcad-kernel-tessellate/src/manifold.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1a71e4444b7bc3279164e069495dde2fb97eb3d01b91edb22108c20f7bfa55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel/src/lib.rs:2072-2084 | crates/vcad-kernel/src/lib.rs:2091-2103 \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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"579fe7894384d925e9ad9754cd982910ed63aee0273611175d965297e9791188"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-ecad-pcb/src/component_mesh.rs:262-266 | crates/vcad-ecad-pcb/src/component_mesh.rs:269-276 \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":"crates/vcad-ecad-pcb/src/component_mesh.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4150f8cc6a86fbdc2dd3d95746f218896460a7dad1a49976dacfe46cf92d2633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-enclosure/src/fit.rs:410-418 | crates/vcad-kernel-enclosure/src/pcb.rs:81-88 \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":"crates/vcad-kernel-enclosure/src/fit.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a96bd581d81008f8e885472f1a4429aa875d42d26ad0520e4fb562a2a5648d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-tolerance/src/gdt.rs:389-401 | crates/vcad-kernel-tolerance/src/gdt.rs:418-431 \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":"crates/vcad-kernel-tolerance/src/gdt.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a51a4ae3ead2e287e26481a3b84ca9ed769b7444d1b21bb82c7f01772416672"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:2138-2141 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2138-2141 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b0b93bbfce7788ed78d1d7a50f2e3487b19c2ee0798352801eb1cdd469a370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:3808-3811 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3808-3811 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93c10adc3185bf532419dcf0b3fb4979c4aa92fb1363d179ef274df50373f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-embroidery/src/hoop.rs:34-47 | crates/vcad-embroidery/src/hoop.rs:50-70 \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":"crates/vcad-embroidery/src/hoop.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4bd9ca1440774e258f2f77d269e3e4627df93012a3d06949e9019c89c3f310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-assembly/src/pose.rs:73-81 | crates/vcad-kernel-assembly/src/pose.rs:84-92 \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":"crates/vcad-kernel-assembly/src/pose.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55e97e904fe618ff83b3840d5e21329c2683e5d53b6fed0d1766793d740c0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-dfm/src/rules/mod.rs:89-99 | crates/vcad-kernel-dfm/src/rules/mod.rs:102-112 \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":"crates/vcad-kernel-dfm/src/rules/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc6cb55cbd9a6948e2418f02073b2cf1cd8f5e7313fe53c2d84e45e8dec33e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apple/VcadApp/Sources/VcadApp/SketchSession.swift:340-345 | apple/VcadApp/Sources/VcadApp/SketchSession.swift:346-351 \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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"699370a70222091e1eeb502fcfa05328953fa30bbe2003907e7c1d742d5ba29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/termview/src/rasterize.rs:26-32 | crates/vcad-kernel-magnetostatic/src/vec3.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":"crates/termview/src/rasterize.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d847d74f5ebbfb538e2c799f14e0c5a356def05bb0a17fde8d1f75d8408e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-ecad-symbols/src/kicad_board.rs:23-37 | crates/vcad-loon/src/convert.rs:959-973 \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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc639e426a7ca8ddfcc4a8742736e953df19d97b1b8e615406a6c06b8785f849"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-booleans/src/repair.rs:484-495 | crates/vcad-kernel-booleans/src/sew.rs:393-401 \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":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"027c4c61ef6c5b0949824ac2984b8960966d13da3ac8b22083b9f47dc048de01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-kernel-cam/src/post/grbl.rs:260-274 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:326-343 \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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b24b574f8dfef6102321c979431a85a93b6e00a640956c606060cba60ec3375"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-kernel-geom/src/lib.rs:431-437 | crates/vcad-kernel-geom/src/lib.rs:447-451 \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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbb3c46828d87be2a6520cc9e3e934ddf1ecda21c7aff9ea7fa248cf7c24631"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-kernel-wasm/src/document_diff.rs:57-62 | crates/vcad-kernel-wasm/src/document_diff.rs:67-73 \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":"crates/vcad-kernel-wasm/src/document_diff.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"40651889e043ce8d4d5ece7ba7e9e71f69c4523632922c804bd2ee8ebf2cb7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apple/VcadApp/Sources/VcadApp/AgentInstallUI.swift:118-125 | apple/VcadApp/Sources/VcadApp/ConnectClaude.swift:175-184 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/AgentInstallUI.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fef81a5a54114b3ad11e07556231953dccbe771bfa9c2af5d469d5e4076c727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1754-1757 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1754-1757 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2f175a953306e8b53d9ff10e6ad1abf68ccd35bb013d928d87056834f910f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:3037-3040 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3037-3040 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3037}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc6caa00ff7ada73b7089034e4a5f2edd1aadc6baeb44a94534912ff4c68b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Sim.swift:92-95 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:92-95 \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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ba47a7f9eb121a197239f6b5aafdbb2439e9f90f1576d94d1fc517168c6506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): apple/VcadApp/Sources/VcadApp/AssemblyPanel.swift:300-307 | apple/VcadApp/Sources/VcadApp/FeatureTreeParameters.swift:66-72 \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":"apple/VcadApp/Sources/VcadApp/AssemblyPanel.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e265312c093ef7c25b21978180743a49140f0e2a5387f7ec4f9d32b17517171d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1908-1908 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1908-1908 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71cfa669a2697cda6b9db8918fdf8329d97b27a88fdde9ee729e57b822f5573"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-chat/src/executor.rs:488-497 | crates/vcad-loon/src/convert.rs:3146-3159 \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":"crates/vcad-chat/src/executor.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86375774e820a16991d7b8d397af61f8db3109d4b4eb98ce96cbec447da6dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/vcad-kernel/src/lib.rs:2305-2314 | crates/vcad-kernel/src/lib.rs:2341-2354 | crates/vcad-kernel/src/lib.rs:2365-2374 | crates/vcad-kernel/src/lib.rs:2401-2414 \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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca28445758b1a7b233d67e7f68152e992ad2c72660c2b8cd3e650b3096f3151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): apple/VcadApp/Sources/VcadApp/LoonLoop.swift:174-181 | apple/VcadApp/Sources/VcadApp/PoseStudio.swift:266-273 \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":"apple/VcadApp/Sources/VcadApp/LoonLoop.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8d97b8dc3d6e157d0cdff716ef3009b821e3c36fcdac8e655ce2c388bda15a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-app/src/document_api.rs:144-152 | crates/vcad-app/src/document_api.rs:199-207 \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":"crates/vcad-app/src/document_api.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd0095e8bc8b833d8b6aed8ade72a266d6e9f25e2db01baf65d10b99a588d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/vcad-kernel-neutronics/src/rng.rs:12-18 | crates/vcad-kernel-qcd/src/rng.rs:10-16 | crates/vcad-torture/src/lib.rs:292-298 \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":"crates/vcad-kernel-neutronics/src/rng.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a72841f9f6d48b1b0a66d8bb0eceb0738ad9cc590c78cd18817611fd4d4f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/vcad-ecad-symbols/src/footprint.rs:227-241 | crates/vcad-ecad-symbols/src/builtin.rs:112-126 \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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94f87bf304957ee79e67f757915d6bbce68974df6fe706290161b7f65a8a6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:241-243 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:241-243 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"804e16676a5568f3406afa03983de2917765801b8d1f07085973be8472e1aadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:244-246 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:244-246 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"389531429ae2c02393e82f6698476d7432865785dd4da82186bcd02ccc8e6ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:247-249 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:247-249 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ceb957c2e1a1167aec5b2ac7332a30b27e5533d4a3c5ed592f79910603708b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1856-1859 | apple/VcadApp/Sources/VcadApp/Editor.swift:3818-3821 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1856-1859 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3818-3821 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee972d510a31554a0d8de6766ca1884bec395a0c12cecfe3c367ca483f0c91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): crates/vcad-kernel/src/lib.rs:502-510 | crates/vcad-kernel/src/lib.rs:513-522 | crates/vcad-kernel/src/lib.rs:525-534 | crates/vcad-kernel/src/lib.rs:537-546 | crates/vcad-kernel/src/lib.rs:564-572 | crates/vcad-kernel/src/lib.rs:578-586 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cacfad09c920f1985533788f08d8bc03c7f138d047cd0ce2df193ae0a501acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 10\u002B corresponding lines): crates/vcad-kernel/src/sheet_json.rs:287-296 | crates/vcad-kernel/src/sheet_json.rs:365-374 | crates/vcad-kernel/src/sheet_json.rs:439-448 | crates/vcad-kernel/src/sheet_json.rs:491-503 | crates/vcad-kernel/src/sheet_json.rs:535-547 | crates/vcad-kernel/src/sheet_json.rs:591-600 | crates/vcad-kernel/src/sheet_json.rs:1422-1431 \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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2604d09dbb1a55f5860d876fa872a365f84d37eb3530d09021a8768d693d9942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1377-1380 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1377-1380 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bc8395a1ca712bd541bc525cbb21b5b11a75ce6b3c2582b1e1a62e5af7a9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apple/VcadApp/Sources/VcadApp/SketchSession.swift:334-339 | apple/VcadApp/Sources/VcadApp/SketchSession.swift:352-357 \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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b2c83bb8aebc7ff4aa3332bbb76fcf7fda0956a91b964262016c8b7da7255c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-ecad-pcb/src/pour_synth.rs:69-77 | crates/vcad-ecad-pcb/src/pour_synth.rs:84-91 \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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7c5b35b6223f5ffa789c341c229f6d317aa9a12e6d2b28c5248876d30f25ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-kernel-fea/src/modal.rs:827-836 | crates/vcad-kernel-fea/src/modal.rs:845-855 \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":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85c7cec34d7397e0816d15960488fb9a1b6263fc38a6dad89742059f71985a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-kernel-photonics/src/design.rs:146-152 | crates/vcad-kernel-photonics/src/design.rs:155-162 \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":"crates/vcad-kernel-photonics/src/design.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8630681578831719855cf9f3b8bf43a3e762bf76819818b265d98fa7fb7984"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-kernel-wasm/src/expressions.rs:154-159 | crates/vcad-kernel-wasm/src/lib.rs:535-539 \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":"crates/vcad-kernel-wasm/src/expressions.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0058da3871ad85c1b2e11163230da6aa8acad3aaf6397088cf7c630ad23f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Theme.swift:183-185 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:183-185 \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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab2e24c928bfe04faec5207666c18c61ec175d0f97adfe66d9610ce5d0b818b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-app/src/feature.rs:1176-1182 | crates/vcad-app/src/materializer.rs:2101-2107 \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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"631f78ff13dc5f378d2b98a48e16c51abbd33a18f414e7f60e80d6fe820532f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:3921-3936 | crates/vcad-kernel-wasm/src/lib.rs:4011-4021 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":3921}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fce166c7a59cb8e8d107f9fa0083e55729337a2e498a59acb1538b950bb252"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:4477-4483 | crates/vcad-kernel-wasm/src/lib.rs:4519-4532 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":4477}}}],"partialFingerprints":{"codehealthFindingId/v1":"896b66a795b8750e8e32d852aa6c245c7ed363d0c5e94025bb258871908ee65b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1513-1516 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1513-1516 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7161ae28e71178d0bc6d6636fe6431cf19b84b78a2f8fd2919ec50854dbbba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-eval/src/kinematics.rs:92-99 | crates/vcad-kernel/src/faces.rs:557-563 \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":"crates/vcad-eval/src/kinematics.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727f6607b641402446749cbd71428ffa6d075085b33b07eba3f7a643912f36b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apple/VcadApp/Sources/VcadApp/AnalysisFFI.swift:30-34 | apple/VcadApp/Sources/VcadApp/DocumentExport.swift:41-45 \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":"apple/VcadApp/Sources/VcadApp/AnalysisFFI.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5226514fc1d7b80f2118635ba3d7d926732fb528c5d27815342daebb6bcd9471"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-app/src/agent.rs:51-60 | crates/vcad-mcp/src/tools/core.rs:165-167 \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":"crates/vcad-app/src/agent.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b839d78263717dc1f479d162986de74cd84bb469aae12c4f7f54ff47f6f3098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1501-1504 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1501-1504 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cdb9a5aa41c0d21486b61b39bb776ca1932332ffd69c61c6a1967b6099c44c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:4776-4779 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4776-4779 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4776}}}],"partialFingerprints":{"codehealthFindingId/v1":"52abffa3deeb709d863af1a978a9d022a8d8ec65688a7dec197f10e8a38056fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/FabricatePanel.swift:104-107 | apple/VcadApp/Sources/VcadApp/FabricatePanel.swift:109-112 \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":"apple/VcadApp/Sources/VcadApp/FabricatePanel.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"44db13b60f9ddf4e9eea95595b504efc93fc61bcd0cb216c2a843932aa95fe39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/vcad-embroidery-dst/src/writer.rs:298-311 | crates/vcad-embroidery/src/stats.rs:116-129 \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":"crates/vcad-embroidery-dst/src/writer.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"92411da1d4f4261556cf5392bb5c7619b20ef9062b5ca78bba11841e30797fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:166-169 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:166-169 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"181e6d5b2404a47919a4cb014edfd658133114fe75b4dfcdfb42294bd5a1c633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:199-202 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:199-202 \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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"459a08ff0ea19e9efe49e3bdd455ce79470519ef6309fb1a6034803f4d493bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-chat/src/executor.rs:478-484 | crates/vcad-render/src/web.rs:246-251 \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":"crates/vcad-chat/src/executor.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40b65863bb93f32dcd96db8a013cd2de594bfad67e94d7d6c0cf72e045a344c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): apple/VcadApp/Sources/VcadApp/GlassChrome.swift:1157-1159 | apple/VcadApp/Sources/VcadApp/Shell.swift:1061-1063 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1061-1063 \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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ee5a3438875a5ddd89e0f30626d2fde49722934781bea82a89f019dfc0e4c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:1824-1834 | crates/vcad-site-wasm/src/lib.rs:158-166 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"82137f5fa77f4d6c2e6ad2b092adcc98a6a6112c802d47d8dee4bc6523ad22cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:867-869 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:867-869 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b3c443e5b7e44b9879a0d6c5372ae8f3d555a058aeda26925434b9e544dbf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:883-885 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:883-885 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"7211f5be771898f1ee525b6e55210c8db96f16c6564c9a61a22bc09711f6c51f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1039-1042 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1039-1042 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"9686da6f4b1f193910a573f43a53ddb69d11fbf532b551e938aecdf58ab30f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:3110-3113 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3110-3113 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3110}}}],"partialFingerprints":{"codehealthFindingId/v1":"606a322a621ea63035a5d903b22470e7bd442de0e18386b37dadb28fac19f6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-app/src/ecad_tools.rs:67-74 | crates/vcad-atoms/src/fab.rs:245-253 \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":"crates/vcad-app/src/ecad_tools.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2166611b59c497a6ed25befbee1ffc8f792b6572171abc77089779ecb23c7ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1426-1429 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1426-1429 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"693b7808dfbfd23f7058f85f62e53ad6cef5107a611b57702c19be16d1fa91ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/SimController.swift:456-459 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:456-459 \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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8b17e0c659ec8f5cc172924a1392b6cd7bda36db235949297c1e02830b02d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-ffi/src/mcp.rs:84-93 | crates/vcad-mcp/src/tasks.rs:55-66 \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":"crates/vcad-ffi/src/mcp.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e1f32c260cc11a1bd533443d94fd034ed5e43cc5c4065cada9e1f52ba185cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-parts/src/vacuum/mod.rs:979-986 | crates/vcad-render/src/exact.rs:262-269 \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":"crates/vcad-parts/src/vacuum/mod.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6e8965774b4c76f6e9b81a51aaa7bceea6d601b833b815b09a48b5d726465"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): apple/VcadApp/Sources/VcadApp/AgentInstall.swift:89-94 | apple/VcadApp/Sources/VcadApp/AppInstance.swift:169-175 \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":"apple/VcadApp/Sources/VcadApp/AgentInstall.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483fc544c60c44a2f3f2aa26130b169feecefd51c92003e4036fc4cbf059db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Shell.swift:807-810 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:807-810 \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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"848e999b2559cb778cfc03e6ad0b01e0a1db9a9685bf087c9570f6c9e7025192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/vcad-ecad-pcb/src/dfm.rs:162-166 | crates/vcad-kernel-dfm/src/rules/mod.rs:81-86 \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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"01525ac0861a5cbd7f065de5a306d9117a6a2265ca09043eaea3f75c312aa707"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/vcad-kernel-booleans/src/no_crossing.rs:220-228 | crates/vcad-kernel-features/src/lib.rs:489-498 | crates/vcad-kernel-step/src/entities/surfaces.rs:1266-1273 \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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d48b124c38b3cc19226857206abd392c1a319dc09e1e22de1991044538878e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-kernel-neutronics/src/geometry.rs:105-111 | crates/vcad-kernel-photon-dose/src/capture.rs:200-206 \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":"crates/vcad-kernel-neutronics/src/geometry.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0402161429a015e3bcacc0c827e951c6c59d6c9f56da83c03da3b3108b35a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): crates/vcad-ecad-pcb/src/router/auto.rs:3960-3963 | crates/vcad-ecad-pcb/src/router/maze.rs:60-63 | crates/vcad-kernel-booleans/src/cyl_band.rs:95-98 | crates/vcad-kernel-booleans/src/split.rs:122-125 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a10e701054d9318a03e39573b24535f78e8b7f957b75f766ac2d7a987f66dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:653-655 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:653-655 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ca4480c929a56df995057d42106db6bb630a523e56e3458272b50b59811239"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1850-1853 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1850-1853 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba5f4b57a9fc1d2ce06ca1270df4e40d39d708c727eb15ded2fdf4898cd45d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/VisionShell.swift:122-125 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:122-125 \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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f522591f7c8850b528dcbcac2b1fa25284fcbfe905de7bb8d04e76cae0ec7d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): crates/vcad-ecad-pcb/src/router/flow/embed.rs:124-126 | crates/vcad-ecad-pcb/src/router/flow/flow.rs:364-366 | crates/vcad-ecad-pcb/src/router/flow/realize.rs:189-191 | crates/vcad-ecad-pcb/src/router/flow/route.rs:141-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 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b68ed7c9f915256d8ec514fcbe191bedce5e97bd59c1d74973846e225b820c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-ecad-pcb/src/router/push_shove.rs:45-47 | crates/vcad-ecad-symbols/src/altium/mod.rs:462-464 \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":"crates/vcad-ecad-pcb/src/router/push_shove.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d557b8ad075cc4a9f97793d04c86aa6684a477f7dc821862ac9769065a51f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1199-1202 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1199-1202 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2b01c19ff4994b60bf41d8ab9ec918d117632efaf7499ca587ed1e3d958c60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:3875-3878 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3875-3878 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"8809d0091c1c7ad66219561fe8cded681729e525803fa645b97ccc533dd9002f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/FabricatePanel.swift:79-81 | apple/VcadApp/Sources/VcadApp/PcbFFI.swift:27-29 \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":"apple/VcadApp/Sources/VcadApp/FabricatePanel.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b177dd687e5a841e67727cd5969609723aadebf9356dc2aecbf2b83b995666d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Theme.swift:201-203 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:201-203 \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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4d9c661717e6c1ebc6ec7fb8de321dd708326584efbe01ae5fe549f1f577d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/UsdzExport.swift:25-27 | apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift:25-27 \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":"apple/VcadApp/Sources/VcadApp/UsdzExport.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2660d3da030601811ac7d6f26a63a984afaf99d40d949f879c73e08569f2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:5337-5349 | crates/vcad-slicer/src/lib.rs:72-84 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"421aea19f1060630799cfa84bf28d581cab0ff6c4753cc65ce25dcccd3eb4c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Sim.swift:339-342 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:339-342 \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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ec31b12273374a0722609cdf1ffb4615e756f30c06054df8ae97cad34adb0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/vcad-mcp/src/tools/docs.rs:27-36 | crates/vcad-mcp/src/tools/proof.rs:73-82 \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":"crates/vcad-mcp/src/tools/docs.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0ef749b062578688a41a8b80c3b9f01306fa5d6e54b63fdc0476a11e03c161"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/UsdzExport.swift:28-30 | apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift:28-30 \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":"apple/VcadApp/Sources/VcadApp/UsdzExport.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fff3b3701ea0aa29c655aab4b85909ba147c5cc1840eded4e24df2455934b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1452-1455 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1452-1455 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a6f6797284ce03276af5bed0be15187cab228b45652e26e434d9c712b5bf9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/IntentBar.swift:89-92 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:89-92 \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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"999c26983455f91a70a02b49c7c98c16d75104c98721645576947d1460d6ca80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 3\u002B corresponding lines): crates/vcad-app/src/tools.rs:852-854 | crates/vcad-kernel-antenna/src/geometry.rs:37-39 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:253-255 | crates/vcad-kernel-flow/src/model.rs:620-622 | crates/vcad-kernel-tolerance/src/loops.rs:110-112 | crates/vcad-printcheck/src/checks.rs:777-779 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/tools.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"21679de62febd098f8412f7331b0313cb18eae8b691a9978dc3ae29c762f5c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-ecad-fabprep/src/verdict.rs:67-74 | crates/vcad-ecad-pcb/src/router/flow/route.rs:650-657 \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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb90d6f4c00622081af0580906cc40f4e3938e2060826b05907ddf558305148"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 3\u002B corresponding lines): crates/vcad-ecad-pcb/src/critique.rs:100-102 | crates/vcad-ecad-pcb/src/router/auto.rs:5035-5037 | crates/vcad-ecad-pcb/src/router/escape.rs:181-183 | crates/vcad-ecad-pcb/src/router/si_claims.rs:121-123 | crates/vcad-ecad-pcb/src/teardrop.rs:185-187 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/critique.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"967f3d6f5aab476d850e3d8d3875997b034b1448b720bfca9f61b5a43b231c86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-ecad-pcb/src/spatial.rs:248-250 | crates/vcad-kernel-raytrace/src/trim.rs:983-985 \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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9096864abd8a3248de7ac531800a9eb321b2279cb35df633737ef3a7ed2cb120"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-mcp/src/tools/core.rs:598-603 | crates/vcad-mcp/src/tools/instrument.rs:132-137 \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":"crates/vcad-mcp/src/tools/core.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"658ee48e5b58e271da47f8dcfb1bfc91e3c10a14b61ebf74fa7609c8677d7b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-ffi/src/features.rs:246-252 | crates/vcad-parts/src/builder.rs:30-35 \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":"crates/vcad-ffi/src/features.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86feba4558fc31ad2270e4ecb63e848a14389cd86bba1c26526d866c0cdb9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/vcad-kernel-drafting/src/types.rs:170-180 | crates/vcad-kernel-naming/src/lib.rs:503-510 \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":"crates/vcad-kernel-drafting/src/types.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ed9896bb7a10938e137c53cd797299bbe8fc1c2f3f1e9ce3115bc7f55c4f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-kernel-sheet/src/edge_flange.rs:263-265 | crates/vcad-kernel/src/sheet_fold.rs:394-396 \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":"crates/vcad-kernel-sheet/src/edge_flange.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acd823dd37f5cba16ac509acd8f773672724304763ecf8e7f2c956271093b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:161-164 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:161-164 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7175c27fc3e2a6a4f9674883abb05b983ba62430b7f85d4181c971d497ae9e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Document.swift:649-651 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:649-651 \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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"2204fce428cfc835042505326ddf4b0a8724bd02ecf550751006dd4389734d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:428-431 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:428-431 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe847cba89465c9948256942d8d587cd2fb01a55e2b824414d6979fff06ec43b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/PhotoImport.swift:216-219 | apple/VcadApp/Sources/VcadApp/WelcomeModel.swift:195-198 \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":"apple/VcadApp/Sources/VcadApp/PhotoImport.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc5d1959996b2c7eb26a468a4987e82616760d37779f802bb798d1933e3594e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:998-1001 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:998-1001 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"8731887739c1467470a7b1cad0eb5c06203cda19d2b31db7fafa0ed60e301127"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apple/VcadApp/Sources/VcadApp/AnalysisPanel.swift:37-37 | apple/VcadApp/Sources/VcadApp/FabricatePanel.swift:129-129 \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":"apple/VcadApp/Sources/VcadApp/AnalysisPanel.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9185d868eb31962624b390c4aae6e44e26f539d09ea5f49da781e2363ff09bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1795-1798 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1795-1798 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"91974863ce3b6173892bcc6a153cb1732137e4d497defbea61f95fa220b71e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-eval/src/optimize.rs:427-432 | crates/vcad-parts/src/types.rs:235-240 \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":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2764e134d5cecb8989ecee65ed39974ec9fad49395505ab326592824be471865"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-ffi/src/recon.rs:863-868 | crates/vcad-runtime/src/lib.rs:539-545 \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":"crates/vcad-ffi/src/recon.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"97062ae733bce09747bbcba0aaf5a38fd9531a8e9822940ef609b22ebbfadb63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-parts/src/vacuum/mod.rs:639-641 | crates/vcad-slicer/src/orient.rs:57-59 \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":"crates/vcad-parts/src/vacuum/mod.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"302c1f8cbf866da811713cd9e186c2f99c9ce817cd1fa50bd359d38796a72936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1068-1070 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1068-1070 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"56129cdadda6331347a4e146e57daf3d937e2454f779cd96752e669a1b191401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/SimController.swift:166-168 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:166-168 \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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"227848855a65cad49a92e45c66c395024172bcacb0936c3db8fe63f181fdc36a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-app/src/feature.rs:1169-1174 | crates/vcad-app/src/materializer.rs:2094-2099 \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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"60804a1702e29f138c4a8336155de25d2183cd770b18a3c3983636b52ddfa135"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-app/src/feature.rs:1184-1189 | crates/vcad-app/src/materializer.rs:2109-2114 \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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31b74e80453acd28e5df7d7369d6b474a91537cfdfdc0ca327541b0821d5959"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/vcad-app/src/feature.rs:1191-1196 | crates/vcad-app/src/materializer.rs:2116-2121 \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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7129b59f3ba91356bdddbc117d78ec7d2a83072fddd631e056e18ac3309d9cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/vcad-ecad-sim/src/circuit/receipt.rs:73-81 | crates/vcad-kernel-flow/src/receipt.rs:88-96 | crates/vcad-kernel-particle/src/receipt.rs:102-111 | crates/vcad-kernel-tolerance/src/receipt.rs:103-112 \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":"crates/vcad-ecad-sim/src/circuit/receipt.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"026cea44b86c02c4c4ee28c3db7e9e3c49a4067aacd45f7af1e808ee5d5ea537"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:250-250 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:250-250 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2fd80d5e8ef2ffd254791c4a8bcb14d1d1ddeb9c6fd7da64138ecd7f3dd3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:251-251 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:251-251 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1b5d18fc6f46d7e26fb5e6dc40a8c26de1024d2996984fc29f3785de6703e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:252-252 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:252-252 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5490b36d07927bd0ea885a303794cd67ba9097f3c4dd7e0afc8552a96e9544f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:505-508 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:505-508 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a202da7343afc8f1a010babbea11f8508b41dca7a872ebdc6f7f97ac326f177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:660-663 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:660-663 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6cf361be4857e77a9fbe9a31896a1e6baec6f1ed50ca2c5b1e375c24da5e8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1005-1008 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1005-1008 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ebb224ff359d79743d40a02053d5d58eca86c80f8aa0e1fcace4ae14d8c544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:2580-2582 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2580-2582 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"27360d92084178d1bc57a51c637bc6747a2d8e6ee418e69c9499301d7f617616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:347-349 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:347-349 \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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"53597a130d53ac68b736f12dc44a651b4efaa8d5263b83bd2ec3ece273d6b434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/vcad-eval/src/cavity_extract.rs:103-106 | crates/vcad-eval/src/sim_extract.rs:114-117 \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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"548f75dddc93d02ef33e91fffd12bd218f9b40e361c2451cbd7373dd6c614fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/vcad-kernel-geom/src/lib.rs:242-245 | crates/vcad-kernel-sheet/src/flatten.rs:786-789 | crates/vcad-kernel-sketch/src/profile.rs:245-248 \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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfe3a0c400a9e915793f966db32e891116d8a2e7292b9a747e1b1da0795bade"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/vcad-kernel-wasm/src/lib.rs:1795-1802 | crates/vcad-site-wasm/src/lib.rs:137-143 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb9289e8931d64458a93ef117a4468965d11f318fbd05528a6b3e15e07afd4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1080-1080 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1080-1080 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6f89046476f3ca3cba2cc86f2a8a0c9999c0830ca2c6e68135f81f6f7aed11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:1335-1338 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1335-1338 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"979edc21aedac9920a224184da4744c752cae46f8e44410b09e7beec056ed935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/Editor.swift:2739-2742 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2739-2742 \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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf78c305a7582f5773bd705aabea7c09f458365cd8d5182f9309e55e5c6d2a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): apple/VcadApp/Sources/VcadApp/SimController.swift:81-84 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:81-84 \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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b8002bdbd057603e6672989f256aeb62f8bd42f1f8a005f25b938f36a70558"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-ecad-pcb/src/dfm.rs:453-455 | crates/vcad-ecad-pcb/src/router/diff_pair.rs:195-197 \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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c098e4dc7cb403e907dbad7d9e5f514519230c640918639881a9e55d1a765305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-eval/src/kinematics.rs:84-86 | crates/vcad-ffi/src/features.rs:225-227 \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":"crates/vcad-eval/src/kinematics.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4300af9de59631449d30b168c8d7737ba87e09065903795b16338630d33257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 3\u002B corresponding lines): crates/vcad-eval/src/optimize.rs:1532-1534 | crates/vcad-kernel-acoustics/src/instrument.rs:485-487 | crates/vcad-kernel-em/src/axisym.rs:840-846 | crates/vcad-kernel-fea/src/modal.rs:456-458 | crates/vcad-kernel-fea/src/solve.rs:552-554 | crates/vcad-kernel-topopt/src/fea.rs:388-390 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"3146aa711605fdf09cb596b07221befcef809834e23586903424313e23d2423d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55\u201375 lines \u00D7 2): crates/vcad-kernel-sheet/src/font.rs:76-130 | crates/vcad-kernel-sheet/src/font.rs:165-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sheet/src/font.rs:76\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-sheet/src/font.rs:240\u0060 calls \u0060g\u0060 and \u0060crates/vcad-kernel-sheet/src/font.rs: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":"crates/vcad-kernel-sheet/src/font.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"69390509ea1828f3d0879aab1765a921dd4aab3f5ec7eff9c845eca45ea64296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67\u201371 lines \u00D7 2): crates/vcad-kernel-acoustics/src/optimize.rs:70-136 | crates/vcad-kernel-particle/src/optimize.rs:73-143 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-particle/src/optimize.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-acoustics/src/optimize.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02f50aced9bad983d932a913dd93e3c0424f78ee18109d148d4ba0fdd309b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64\u201369 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:8430-8498 | crates/vcad-kernel-tessellate/src/lib.rs:8595-8658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:8430\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b55c059231bd81d633efd16923d4631c0798596aa5782474d104b91d15bbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201364 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5475-5512 | crates/vcad-kernel-booleans/src/split.rs:5649-5712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:5475\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cfedd524024ef7ac61f43dc05cc3fdbabed01df0b304655c34c365935471e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55\u201363 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:1821-1883 | crates/vcad-kernel-booleans/src/pipeline.rs:1887-1941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:1821\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6165b1379714004f70cbe856b7092a24fe6d4674877e36379fa0c549c7c3a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201353 lines \u00D7 2): crates/vcad-kernel-sheet/src/font.rs:160-194 | crates/vcad-kernel-sheet/src/font.rs:338-390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sheet/src/font.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. 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":"crates/vcad-kernel-sheet/src/font.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f27b82724553d2ee44a18c5adae0a4f194fb8ffaef33fc34bc8a7b816720d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201350 lines \u00D7 3): crates/vcad-kernel-sheet/src/font.rs:101-134 | crates/vcad-kernel-sheet/src/font.rs:190-239 | crates/vcad-kernel-sheet/src/font.rs:266-314 \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 \u0060crates/vcad-kernel-sheet/src/font.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. 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":"crates/vcad-kernel-sheet/src/font.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1bab4125afadfbd671d6c086aedb3252b15f038f9ec1be6f9505490feefa63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201350 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:6473-6522 | crates/vcad-kernel-tessellate/src/lib.rs:6745-6787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:6473\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-tessellate/src/lib.rs:6524\u0060 calls \u0060align_winding_to_normals\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs:6789\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6f099f030b860fb524bd3d09dbea78b36042789455825335cabdf8ac370370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201349 lines \u00D7 4): crates/vcad-kernel-sheet/src/font.rs:55-92 | crates/vcad-kernel-sheet/src/font.rs:102-133 | crates/vcad-kernel-sheet/src/font.rs:191-239 | crates/vcad-kernel-sheet/src/font.rs:266-305 \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 \u0060crates/vcad-kernel-sheet/src/font.rs:55\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-sheet/src/font.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13377730b801855dc9813a0996a21173a4610639a0ab165303a258ddd0de973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:3389-3433 | crates/vcad-eval/src/validate.rs:170-214 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":3389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baab05d46cff8c8df71e9897b27f123b063505095fd52b53289df47d6ef7624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201344 lines \u00D7 2): crates/vcad-ecad-diff/src/design.rs:81-120 | crates/vcad-kernel-constraints/src/symbolic.rs:91-134 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-diff/src/design.rs\u0060 and \u0060crates/vcad-kernel-constraints/src/symbolic.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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 \u0060crates/vcad-ecad-diff/src/design.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-diff/src/design.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad495ff71009b14e486cac6131ed9fe2cba7b634700c758089db5324b2d7bef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/vcad-cli/src/ui/chat.rs:167-204 | crates/vcad-cli/src/ui/command.rs:44-81 \u2014 before extracting anything, compare \u0060crates/vcad-cli/src/ui/chat.rs\u0060 and \u0060crates/vcad-cli/src/ui/command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 105 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 \u0060crates/vcad-cli/src/ui/chat.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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca0ca96b074fa9a74fcf425189f264d999ba01e811d5f7f439c6dfbd41d677f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 4): crates/vcad-cli/src/ui/chat.rs:184-220 | crates/vcad-cli/src/ui/command.rs:61-97 | crates/vcad-cli/src/ui/menu.rs:420-455 | crates/vcad-cli/src/ui/tree.rs:61-97 \u2014 before extracting anything, compare \u0060crates/vcad-cli/src/ui/chat.rs\u0060 and \u0060crates/vcad-cli/src/ui/command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 105 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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7b0ae86ec769e3ada46e7c62439f86e749265ecadd8d255d0a27ea8050b46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 4): crates/vcad-kernel-acoustics/src/receipt.rs:271-307 | crates/vcad-kernel-em/src/receipt.rs:380-416 | crates/vcad-kernel-flow/src/receipt.rs:294-330 | crates/vcad-kernel-thermal/src/receipt.rs:434-470 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-em/src/receipt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 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 \u0060crates/vcad-kernel-acoustics/src/receipt.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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"352defbfe017eee294475200a1c4d61295e8fe96e87d4634b63e64344005708f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/vcad-kernel-stocksim/src/verify.rs:296-341 | crates/vcad-kernel-tessellate/src/clearance.rs:499-544 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-stocksim/src/verify.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/clearance.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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":"crates/vcad-kernel-stocksim/src/verify.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebe8ccbf1140eab3387cf0ca88b8925334e863b3b4fb12629a6c933782a18ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:5253-5288 | crates/vcad-kernel-tessellate/src/lib.rs:6191-6225 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5253}}}],"partialFingerprints":{"codehealthFindingId/v1":"378c6d7c1cd6441df8ab5ecb29ef72cd127468d0ccb6732b8748ccbc579b20b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 2): crates/vcad-embroidery-pes/src/pec.rs:128-162 | crates/vcad-embroidery-pes/src/pec.rs:165-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":"crates/vcad-embroidery-pes/src/pec.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a488ab887dea3b2ec92700f425283ecba4a409beea8e9ebda692594ff0a25b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/vcad-kernel-booleans/src/trim.rs:434-468 | crates/vcad-kernel-booleans/src/trim.rs:556-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/trim.rs:434\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7e2c6758759bc05c4dcafb6236417febf1ce35176e3ee76a4c8686c072cac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201334 lines \u00D7 2): crates/vcad-kernel-booleans/src/repair.rs:93-116 | crates/vcad-kernel-booleans/src/sew.rs:468-501 \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 \u0060crates/vcad-kernel-booleans/src/repair.rs:93\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":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"34278d4728f0354f67eb5721a17a37c2fd2eaffdb857ec9a320e4fd4d6d2b91b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/vcad-kernel-cam/src/post/grbl.rs:155-186 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:207-238 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-cam/src/post/grbl.rs\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-cam/src/post/grbl.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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"01adc18e366ff58dbba96a7bd645c2e896b603b1d82162003a4dc948ea04a668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): crates/vcad-ecad-sim/src/circuit/ac.rs:135-163 | crates/vcad-ecad-sim/src/circuit/linalg.rs:14-44 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-sim/src/circuit/ac.rs\u0060 and \u0060crates/vcad-ecad-sim/src/circuit/linalg.rs\u0060 as WHOLE FILES: this scan already matched 5 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. 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 \u0060crates/vcad-ecad-sim/src/circuit/ac.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060\u0026mut [Cplx]\u0060 in one and \u0060\u0026mut [f64]\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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"602d6b6a2b8d756a67a55cf32f30e58d21e91b2270cf1b493516f0862a0db455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201331 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:328-358 | crates/vcad-kernel-sketch/src/extrude.rs:714-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a8667f7a8eb5188ae5cadb209643e3a7f37b0ae7c07c8b2f6d6cf8e9b3d25c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): crates/vcad-kernel-cam/src/operation/roughing3d.rs:198-227 | crates/vcad-kernel-cam/src/operation/roughing3d.rs:251-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 \u0060crates/vcad-kernel-cam/src/operation/roughing3d.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/operation/roughing3d.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9987b4629b6e1b45e0d8b57c387c795db8e2dc38567d8e11317e1a2e2da178a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201345 lines \u00D7 3): crates/vcad-kernel-primitives/src/lib.rs:119-163 | crates/vcad-kernel-primitives/src/lib.rs:238-281 | crates/vcad-kernel-primitives/src/lib.rs:375-418 \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 \u0060crates/vcad-kernel-primitives/src/lib.rs:119\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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"89477543f4c35e4b0acec8cb3dea5ffdb1fcf4a5f56743291982326b9af2e2f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:2865-2892 | crates/vcad-kernel-tessellate/src/lib.rs:8142-8170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:2865\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d384a03653ecc825d23f7ad17abac946167598ed5a13f52e5eea935b5371a56a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/termview/src/output.rs:107-134 | crates/termview/src/output.rs:205-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/termview/src/output.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":"crates/termview/src/output.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee93ac2fff2b79e08e9858d9f0556d35dd7923f77462959c0656ee2b02a46471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:3483-3509 | crates/vcad-ecad-pcb/src/router/auto.rs:3511-3537 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3483}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb623786dd9de6f428e14f64b64c73365b6d96116354a7fbfa3882691e78f206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): mecheval/graders/src/suite_c.rs:196-221 | mecheval/graders/src/suite_c.rs:327-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 \u0060mecheval/graders/src/suite_c.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0240152c9f4d028732a7f33335de1aa098f5698a3de21664ee672d3aee3886c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/vcad-kernel-fea/src/buckling.rs:411-436 | crates/vcad-kernel-fea/src/modal.rs:177-202 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/buckling.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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 \u0060crates/vcad-kernel-fea/src/buckling.rs:411\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"40537268f8fc99b0fedab38b23df0b96b82dd6b4f2c650b14611c483fe796016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201325 lines \u00D7 4): crates/vcad-kernel-physics/src/colliders.rs:153-156 | crates/vcad-kernel-physics/src/world.rs:471-473 | mecheval/graders/src/fit_physics.rs:561-585 | mecheval/graders/src/fit_physics.rs:603-627 \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 \u0060crates/vcad-kernel-physics/src/colliders.rs: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. 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":"crates/vcad-kernel-physics/src/colliders.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c237150eedd49b226f516a19f3f90ddaf79e8e7dac9c2f90f32ef90a83b079d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): crates/vcad-kernel-acoustics/src/optimize.rs:118-141 | crates/vcad-kernel-optics/src/optimize.rs:143-166 | crates/vcad-kernel-particle/src/optimize.rs:125-148 | crates/vcad-kernel-particle/src/optimize.rs:203-226 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-optics/src/optimize.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. 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 \u0060crates/vcad-kernel-acoustics/src/optimize.rs:118\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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce41600ffdbbc1f4eadce3ebf36829b5c8c8bef276e4ca2521bb3e332c60cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): crates/vcad-kernel-booleans/src/freeze.rs:250-273 | crates/vcad-kernel-booleans/src/freeze.rs:490-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/freeze.rs:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dfe9a61ce7dc72329147af560bb75ec9dcbfca6c2fb684400eabd1b8c151e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:1587-1611 | crates/vcad-kernel-booleans/src/pipeline.rs:1613-1637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:1587\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9035855036acc523980c8f03a3184a3fa8a8185c2575f442cd2ab744ca2d362b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:673-696 | crates/vcad-kernel-em/src/planar.rs:581-604 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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 \u0060crates/vcad-kernel-em/src/axisym.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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"75037d2238931be4929678bf8aab281ce13ad9a3e35bc2f80e4592187af4cfbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:709-733 | crates/vcad-kernel-em/src/planar.rs:616-638 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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 \u0060crates/vcad-kernel-em/src/axisym.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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecfab2947349d547dc4f78f643cb2693f6d9a778209f3f3c3a26cd80e2924c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/vcad-kernel-fea/src/section.rs:537-560 | crates/vcad-kernel-fea/src/spec.rs:122-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-fea/src/section.rs:537\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b506bbb897a01c78f89ff029206325cab5abd30ae18b970490b5d2d8bd5aa700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5089-5108 | crates/vcad-kernel-booleans/src/split.rs:6307-6329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:5089\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5089}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c59236a702c836d15af4794cab4c4d88d147b949b072568642d4a9facecaa6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/vcad-kernel-cam/src/post/grbl.rs:221-243 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:282-304 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-cam/src/post/grbl.rs\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 152 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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"df115fdeb9bd4982f9f3ddf4dfbc8f3865a852f7bdd184c0a359d44f29f4c4f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/vcad-kernel-em/src/ac.rs:201-223 | crates/vcad-kernel-em/src/grid.rs:479-501 \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 \u0060crates/vcad-kernel-em/src/ac.rs:201\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-em/src/ac.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"930407d6def08b4c0b0e16054a7348032acf84d366668e706a8a974fa45e8719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/vcad-kernel-tessellate/src/clearance.rs:619-641 | crates/vcad-kernel-tessellate/src/clearance.rs:694-715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/clearance.rs:619\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":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ada4c9b4ab5b2c36c3f7dc923a7898f8357daebd5dedd25abda2b85e5244eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:842-864 | crates/vcad-kernel-tessellate/src/lib.rs:948-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fc362c8535d8368e2af9dfd4072f06de01a369d8ecffee86f237d313433bcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): crates/vcad-app/src/evaluate.rs:360-381 | crates/vcad-eval/src/evaluate.rs:2772-2793 | crates/vcad-kernel-wasm/src/lib.rs:8767-8788 \u2014 before extracting anything, compare \u0060crates/vcad-app/src/evaluate.rs\u0060 and \u0060crates/vcad-eval/src/evaluate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 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":"crates/vcad-app/src/evaluate.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ea80b4b81a0c50aa43adb3dd8ece57184292c12eb0a4cd4551e5e3d3a6f9fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201322 lines \u00D7 4): crates/vcad-kernel-fillet/src/chamfer.rs:60-81 | crates/vcad-kernel-fillet/src/fillet_curved.rs:216-237 | crates/vcad-kernel-fillet/src/fillet_planar.rs:96-117 | crates/vcad-kernel-fillet/src/trim.rs:311-314 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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 \u0060crates/vcad-kernel-fillet/src/chamfer.rs:60\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-kernel-fillet/src/chamfer.rs:60\u0060 calls \u0060quantize\u0060 and \u0060crates/vcad-kernel-fillet/src/trim.rs:311\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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4144e4792d0dac4e4fb984b6b448090b0d4e5e9f955293abbf394dcf504516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 3): crates/vcad-kernel-primitives/src/lib.rs:485-506 | crates/vcad-kernel-primitives/src/lib.rs:680-695 | crates/vcad-kernel-sketch/src/extrude.rs:507-526 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-primitives/src/lib.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/extrude.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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee64f2803001a17c55b303b7066749bb60d2db03469ef79a20d7920a32918d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/vcad-ecad-pcb/src/copper_pour.rs:368-389 | crates/vcad-ecad-pcb/src/spatial.rs:540-561 \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":"crates/vcad-ecad-pcb/src/copper_pour.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f042f5e81ca9888cdf457e040599cec42007877a513c38a6c2f478823dbfe675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/vcad-ecad-pcb/src/drc.rs:1722-1743 | crates/vcad-ecad-pcb/src/spatial.rs:122-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/drc.rs:1722\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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f12e614a20b79ee1f9775cf7658a3ce1b079cf3eba2edd7ce876e7c5afa12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201324 lines \u00D7 4): crates/vcad-kernel-cam/src/operation.rs:252-275 | crates/vcad-kernel-cam/src/operation/contour.rs:296-318 | crates/vcad-kernel-wasm/src/lib.rs:8273-8287 | crates/vcad-kernel-wasm/src/lib.rs:8465-8478 \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 \u0060crates/vcad-kernel-cam/src/operation.rs:252\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-cam/src/operation.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eba24c0e8f9e40e8ba7737d6e35e7819dd69930b1291ac85d9e7ebeb7dbb41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/vcad-kernel-constraints/src/gpu.rs:66-87 | crates/vcad-kernel-constraints/src/gpu.rs:124-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-constraints/src/gpu.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":"crates/vcad-kernel-constraints/src/gpu.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8fbc93db131a69183cb07d2350b706ef8f7575c47d8aa3414883499320b6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/vcad-kernel-fillet/src/fillet_curved.rs:296-317 | crates/vcad-kernel-fillet/src/fillet_curved.rs:326-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 \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs:296\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4872cd7031ef64f6d843853267191a661a9f8d05022c8212f656fb61657ee23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/vcad-kernel-sweep/src/loft.rs:205-226 | crates/vcad-kernel-sweep/src/sweep.rs:301-322 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sweep/src/loft.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/sweep.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 82 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":"crates/vcad-kernel-sweep/src/loft.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa5182bd0314c4c66454d40fca76c5cb9e96e8259fc0af5db6782e21be2f8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): crates/vcad-ffi/src/lib.rs:1585-1605 | crates/vcad-ffi/src/lib.rs:1616-1636 | crates/vcad-ffi/src/lib.rs:1638-1657 \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 \u0060crates/vcad-ffi/src/lib.rs:1585\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cbade51a3f05ee8b1a500276b06faadad0eae5b72f32b66a55a32fc61f428a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201321 lines \u00D7 4): crates/vcad-kernel-cam/src/post/grbl.rs:124-144 | crates/vcad-kernel-cam/src/post/grbl.rs:145-148 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:176-196 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:197-200 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-cam/src/post/grbl.rs\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-cam/src/post/grbl.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. 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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ec05dc99ca75f22f3661e732a13fb06c0630f15b3525092c58fbe3d195d277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/vcad-app/src/engine.rs:250-267 | crates/vcad-cli/src/app.rs:840-859 \u2014 before extracting anything, compare \u0060crates/vcad-app/src/engine.rs\u0060 and \u0060crates/vcad-cli/src/app.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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":"crates/vcad-app/src/engine.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb2047950df22488de804295d1bb84f8bb9f9c507b664495f4ca49b69079bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/vcad-cli/src/ui/command.rs:162-180 | crates/vcad-cli/src/ui/menu.rs:498-517 \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":"crates/vcad-cli/src/ui/command.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8443ddd84cab2d48f9a9680a187827a6991d8909d95ee3f7c004a23bdd364bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/vcad-ecad-export/src/gerber.rs:937-955 | crates/vcad-ecad-export/src/gerber.rs:978-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 \u0060crates/vcad-ecad-export/src/gerber.rs:937\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76182373d16e6e3501023dff1963c46acab2758a5408e1a61c7f5afa3737a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/vcad-embroidery-dst/src/writer.rs:75-94 | crates/vcad-embroidery-dst/src/writer.rs:113-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-embroidery-dst/src/writer.rs:75\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-embroidery-dst/src/writer.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f0d2495000fac0369a61000ff1aa67a630b704e0a980fcedfd7c8a0cebdc66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:259-278 | crates/vcad-kernel-booleans/src/classify.rs:467-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/classify.rs:259\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d35d587ac58912651279b2e6c5b02224412d068d69df84882baa60579094875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201357 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:460-516 | crates/vcad-kernel-flow/src/adjoint.rs:593-646 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c18fda85cfb65a3437c3e435b67c2756142e76413f9bb6ca19a0383e1d4596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:51-70 | crates/vcad-kernel-sketch/src/profile.rs:264-282 \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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:51\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"442c1205ded207fd982330955fb0c34cb3aa8d46c1cf9600e3cc6d2e6d62b0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/vcad-kernel-sketch/src/revolve.rs:245-264 | crates/vcad-kernel-sketch/src/revolve.rs:270-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sketch/src/revolve.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":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78103be027b2f1ac8981c925af509b6fd9f2713c534cec1f6006b3678ca8234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:1085-1104 | crates/vcad-kernel-wasm/src/lib.rs:5179-5198 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cd1c0736f3a49b460a5164e18467da855eec5908d368dbb62e6c2d8b822ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/vcad-kernel-sketch/src/extrude.rs:347-365 | crates/vcad-kernel-sketch/src/extrude.rs:1243-1261 | crates/vcad-kernel-sweep/src/sweep.rs:318-336 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/sweep.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:347\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6ff1404a7662c6945e16215fe07cf777744841e89d4e9022acc18b248f6a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/vcad-cli/src/ui/chat.rs:381-399 | crates/vcad-cli/src/ui/command.rs:165-183 \u2014 before extracting anything, compare \u0060crates/vcad-cli/src/ui/chat.rs\u0060 and \u0060crates/vcad-cli/src/ui/command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 105 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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e697605d255de95b45d07a7abab3b1463df8e301e84dc03669270538bc08cdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:361-379 | crates/vcad-ir/src/vcode.rs:384-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/vcode.rs:361\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8825b219f0c26220d45dbc6bd97baacdfcc8e315ea7ccf273d22bae6e9ea9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/vcad-kernel-fillet/src/chamfer.rs:149-167 | crates/vcad-kernel-fillet/src/fillet_planar.rs:232-250 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/vcad-kernel-fillet/src/chamfer.rs:149\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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6220a23c4a8534dc5b12bebf827ef17397843c1d1c3dafbdddcafde937855e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:52-70 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:128-146 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-raytrace/src/intersect/bilinear.rs\u0060 and \u0060crates/vcad-kernel-raytrace/src/intersect/bspline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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 \u0060crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:52\u0060 it does not close everything it opens, so those exact 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 \u0060surface\u0060 to \u0060\u0026BilinearSurface\u0060 in one and \u0060\u0026dyn Surface\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":"crates/vcad-kernel-raytrace/src/intersect/bilinear.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0297bac12af842cac6cc59146d95550f552d30d57928fa3a0b6439196f8f6c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/vcad-kernel-sketch/src/revolve.rs:313-331 | crates/vcad-kernel-sweep/src/loft.rs:224-241 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/loft.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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 \u0060crates/vcad-kernel-sketch/src/revolve.rs:313\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":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"56212152796434719204dbf32d94317840678cec728f695f31628e5928c9a019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:8867-8893 | crates/vcad-kernel-tessellate/src/lib.rs:8947-8973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:8867\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8867}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c89cbb3e76632fd1032dab979333e2a1aa2eadaabc9e516bb5405e036e3b63f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:5068-5086 | crates/vcad-kernel-wasm/src/lib.rs:5127-5144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:5068\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"0105c432f5d3740102d2a791e1b8d9963ca975e39781150e0ab7aa0eeaccb9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:10334-10353 | crates/vcad-kernel-wasm/src/lib.rs:10438-10457 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dabc1d79409f4b96224af8845e9dce8e93da5e0f4b022e5ff1e3b3eff0f964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): crates/vcad-app/src/evaluate.rs:337-354 | crates/vcad-eval/src/evaluate.rs:2748-2766 | crates/vcad-kernel-wasm/src/lib.rs:8724-8741 \u2014 before extracting anything, compare \u0060crates/vcad-app/src/evaluate.rs\u0060 and \u0060crates/vcad-eval/src/evaluate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 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":"crates/vcad-app/src/evaluate.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac3defe0d649beb7659fa3471ab9c5775a6869a5cae743b08039f64cc13a673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/vcad-ffi/src/lib.rs:405-422 | crates/vcad-ffi/src/lib.rs:3481-3498 | crates/vcad-ffi/src/session.rs:96-113 \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, \u0060crates/vcad-ffi/src/lib.rs:404\u0060 calls \u0060catch_unwind\u0060, \u0060AssertUnwindSafe\u0060 and \u0060crates/vcad-ffi/src/lib.rs:3480\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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f451dc78921466348d2110b6d24e1f8c9e681c56c104afcfc86138cc7e716da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/length_match.rs:233-250 | crates/vcad-ecad-pcb/src/router/length_match.rs:710-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/length_match.rs:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f616eda6136570a454b870c19cfa9025af16edbb803992a86a485564060531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:176-193 | crates/vcad-ir/src/vcode.rs:227-239 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c54d865c89b63e6df6d90b9256c28f4d46ee80e986374fff0371d28d20c6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:626-643 | crates/vcad-kernel-tessellate/src/lib.rs:8930-8946 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs:626\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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa20cc12765df61a14a74a916f392160825f6f63461c6520ed8b49e3a89f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/vcad-kernel-nurbs/src/lib.rs:212-229 | crates/vcad-kernel-nurbs/src/lib.rs:683-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 \u0060crates/vcad-kernel-nurbs/src/lib.rs:212\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1be62606a8a055da662a501c43cdb4dc22be04cb9dd53841c937dd1d6cdf75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/vcad-kernel-raytrace/src/trim.rs:815-832 | crates/vcad-kernel-raytrace/src/trim.rs:849-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 \u0060crates/vcad-kernel-raytrace/src/trim.rs:815\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":"crates/vcad-kernel-raytrace/src/trim.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd34e99e4416c2d786bedbe0e2aa9ea1335dd6e580c6411a6ca8534425fe404b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:6278-6295 | crates/vcad-kernel-tessellate/src/lib.rs:6306-6319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:6278\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6278}}}],"partialFingerprints":{"codehealthFindingId/v1":"657054d4d64eaf2869e4de3412377c8e9e1fdbf37bf6767e5cfa698a3dd307bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201318 lines \u00D7 4): crates/vcad-loon/src/convert.rs:64-81 | crates/vcad-loon/src/convert.rs:237-253 | crates/vcad-loon/src/convert.rs:437-440 | crates/vcad-loon/src/convert.rs:704-707 \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 \u0060crates/vcad-loon/src/convert.rs:64\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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2c465913171f73011ef4e30650f9dc1aad9161d26507e1a4a624529aa1013e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/vcad-render/src/animate.rs:598-615 | crates/vcad-render/src/animate.rs:696-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-render/src/animate.rs:598\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/animate.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c0c9498fc32e9ca35470183f0f6f65633f07d2cb9a95d819d6594b1e2a6f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): crates/vcad-kernel-flow/src/adjoint.rs:245-261 | crates/vcad-kernel-flow/src/adjoint.rs:474-490 | crates/vcad-kernel-flow/src/adjoint.rs:607-623 | crates/vcad-kernel-flow/src/solve.rs:381-397 | crates/vcad-kernel-flow/src/solve.rs:446-462 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d34212e8401d75946e5ba3d3d38eab09d624e85c2a2e13d4ae1f236182daa52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201317 lines \u00D7 4): crates/vcad-kernel-primitives/src/lib.rs:488-504 | crates/vcad-kernel-primitives/src/lib.rs:639-647 | crates/vcad-kernel-primitives/src/lib.rs:683-694 | crates/vcad-kernel-sketch/src/extrude.rs:509-525 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-primitives/src/lib.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/extrude.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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e6d01302642e0801dccb2be237ccb0cf3c3e828fc25073b78e34d550f66bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): crates/termview/src/braille.rs:23-39 | crates/vcad-cli/src/ui/viewport.rs:48-59 \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 \u0060crates/termview/src/braille.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/termview/src/braille.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef68f6f1f68c9080ce3567b580432ec1947742b6fc30be1d32334e6703b8230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-ecad-pcb/src/drc.rs:2781-2797 | crates/vcad-ecad-pcb/src/drc.rs:2878-2894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/drc.rs:2781\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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fbececd3490081d104ebb81a741544c9061dd5fbf022a167cb7d2ee76e9503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/vcad-ecad-symbols/src/footprint.rs:80-95 | crates/vcad-ecad-symbols/src/footprint.rs:107-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/footprint.rs:80\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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e39f6c21750757588b1d95d66fce6a30d607308b23ab92b476c29006951e09f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/mod.rs:178-193 | crates/vcad-kernel-shell/src/lib.rs:1336-1352 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs\u0060 and \u0060crates/vcad-kernel-shell/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d90e088830c676d28eedb2a694facec8635579f1ce56d503093b5ec94a3f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/vcad-kernel-cam/src/dropcutter/bull.rs:112-125 | crates/vcad-kernel-cam/src/dropcutter/flat.rs:69-85 \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 \u0060crates/vcad-kernel-cam/src/dropcutter/bull.rs:112\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":"crates/vcad-kernel-cam/src/dropcutter/bull.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f88418f3eb96e21a1f12e9e5829cc333002ffd8b8199452c01c45d9b2ab770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-kernel-em/src/planar.rs:474-490 | crates/vcad-kernel-em/src/planar.rs:493-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":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6637c8934e074685acf5b449906cd896d123863a7b6bfa08ae01759a58c09e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:130-144 | crates/vcad-kernel-flow/src/solve.rs:173-189 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdc85ad604faab8c41f121ddbdd3a254e126570c769153d9872fb3631452713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201317 lines \u00D7 2): crates/vcad-kernel-primitives/src/lib.rs:554-570 | crates/vcad-kernel-primitives/src/lib.rs:747-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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd6061caffb383819fd7ed0f092fba361aff214849ff00037a37411801d9d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/vcad-kernel-raytrace/src/intersect/cone.rs:101-116 | crates/vcad-kernel-raytrace/src/intersect/sphere.rs:62-78 \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 \u0060crates/vcad-kernel-raytrace/src/intersect/cone.rs:101\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":"crates/vcad-kernel-raytrace/src/intersect/cone.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa8620c88970a5b0d7e88df7b3a4d997374e06607bf7235d2a91dfc0b98c864"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-kernel-raytrace/src/intersect/cylinder.rs:33-49 | crates/vcad-kernel-raytrace/src/intersect/sphere.rs:22-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-raytrace/src/intersect/cylinder.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-kernel-raytrace/src/intersect/cylinder.rs:29\u0060 calls \u0060abs\u0060 and \u0060crates/vcad-kernel-raytrace/src/intersect/sphere.rs:20\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":"crates/vcad-kernel-raytrace/src/intersect/cylinder.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43794323d2067046d02e0581a8bc61bd9cf637f4cbb716de789134d8c7e26f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): crates/vcad-kernel-raytrace/src/intersect/cylinder.rs:61-77 | crates/vcad-kernel-raytrace/src/trim.rs:785-795 \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 \u0060crates/vcad-kernel-raytrace/src/intersect/cylinder.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. 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":"crates/vcad-kernel-raytrace/src/intersect/cylinder.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3158fc076db3bd85897422553a145b9b5d428a565e4c61b410fa5ddddf673876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/vcad-kernel-step/src/pmi.rs:127-143 | crates/vcad-kernel-step/src/pmi.rs:147-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-step/src/pmi.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/pmi.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f55ea51e958038692cf0ce73c25121fd1c13c18628737c228fb0891d6a466d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:3077-3093 | crates/vcad-kernel-wasm/src/lib.rs:3261-3277 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":3077}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf6921f6dd44c702011d414c0570735f8675c98988c79c7d5c59d8477dc85ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:5640-5656 | crates/vcad-kernel-wasm/src/lib.rs:5672-5688 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c541e4cb32eeceac4511f24c17dff4cdff5baf3fa55e9bd465cfe113bf507a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): crates/vcad-cli/src/app.rs:555-570 | crates/vcad-cli/src/app.rs:593-608 | crates/vcad-cli/src/app.rs:631-646 | crates/vcad-cli/src/app.rs:670-685 | crates/vcad-cli/src/app.rs:710-725 \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 \u0060crates/vcad-cli/src/app.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d5cd82cd10ca49001b3c7de1de5b8ed3959f0eb36bcbb0869065febf7336f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/vcad-cli/src/app.rs:457-472 | crates/vcad-cli/src/app.rs:495-509 | crates/vcad-cli/src/app.rs:532-546 \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 \u0060crates/vcad-cli/src/app.rs:457\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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c21c311aade7b44481bc8e9729f987a59ed3b319416beb93e0fa6399a4bd61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): crates/vcad-kernel-fillet/src/fillet_curved.rs:266-281 | crates/vcad-kernel-fillet/src/fillet_curved.rs:301-314 | crates/vcad-kernel-fillet/src/fillet_curved.rs:330-343 \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 \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs:266\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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1cb004787dc01ba1e045fe29776f54b41ed0194475b6607ebdd829d05dc70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/termview/src/braille.rs:52-67 | crates/vcad-cli/src/ui/viewport.rs:69-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 \u0060crates/termview/src/braille.rs:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/termview/src/braille.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef1661a219fcd685342762459e6a7e957b75ef4c2d2eacc491f68c4f9df85d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-cli/src/app.rs:752-767 | crates/vcad-cli/src/app.rs:793-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 \u0060crates/vcad-cli/src/app.rs:752\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8796cdeb9820ef04f2f2b8cdd75abe8b4c28345fbd0dd055db7c318d30dd4602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/flow/funnel.rs:56-71 | crates/vcad-ecad-pcb/src/router/flow/funnel.rs:75-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/flow/funnel.rs:56\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/funnel.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2077cce04f30c6c81d6403db7eda17da32e61f7fc875d663c90c2f1d2168381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/maze.rs:410-452 | crates/vcad-ecad-pcb/src/router/maze.rs:1294-1336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/maze.rs:410\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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58bd85b17384063c10a5f1bbdad56a4b1ad1db0ea15f848d23355804817e824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:2989-3004 | crates/vcad-kernel-booleans/src/split.rs:3028-3036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:2989\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9cbde3b3e967396c5c6070bd6cf11d2ff5132809546006d05d6d23338246c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/vcad-kernel-booleans/src/trim.rs:784-798 | crates/vcad-kernel-booleans/src/trim.rs:822-837 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28353abb3fc92887580904e8469f9271ae0ca2ad9c6b3ce1c72224b224b901f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-kernel-sheet/src/font.rs:112-141 | crates/vcad-kernel-sheet/src/font.rs:143-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sheet/src/font.rs:112\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":"crates/vcad-kernel-sheet/src/font.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae624ca3b7c0b2f2d029dfdbd3c4c6bd96cae8bf82befef0982a6018c079055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-kernel-sheet/src/font.rs:160-181 | crates/vcad-kernel-sheet/src/font.rs:241-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sheet/src/font.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. 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":"crates/vcad-kernel-sheet/src/font.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2606abec9fbb502f5bea1abe385af4c46a0f090bd59b69bbc3f70dc4d001c176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:2537-2552 | crates/vcad-kernel-tessellate/src/lib.rs:8385-8396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:2537\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b195e95bbd79a2759ac3b74b296aabdb32e54c2dfa1a397e0f40ee06089d77f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201316 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:8737-8740 | crates/vcad-kernel-tessellate/src/lib.rs:8855-8870 | crates/vcad-kernel-tessellate/src/lib.rs:8935-8950 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edbea9c940d6f6b5de360033901e53620f64f29c703dca1ed5862cee62f7aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-kernel-urdf/src/writer.rs:133-148 | crates/vcad-kernel-urdf/src/writer.rs:170-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-urdf/src/writer.rs:133\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":"crates/vcad-kernel-urdf/src/writer.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9d3ce31b22a17b8e1fde0fe33de369006ded0e90d237b0d8dde276976e5e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:8296-8312 | crates/vcad-kernel-wasm/src/lib.rs:8486-8502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:8296\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0a6b414ed0df6e4a9c8c79b68fa527cb313407727d69325608f537db9cd775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-render/src/callouts.rs:59-75 | crates/vcad-render/src/exact.rs:103-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. 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":"crates/vcad-render/src/callouts.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48ec8eca4bde3363594b8322b2925ee1133b6b77010e98da7cc926c9fa22a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-render/src/lib.rs:2364-2380 | crates/vcad-render/src/lib.rs:4688-4704 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cf26895fb4c3e23d13de0298f7723890356e2059be91f88b4cb19b4a9d837c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-slicer-gcode/src/gcode.rs:223-238 | crates/vcad-slicer-gcode/src/gcode.rs:248-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/vcad-slicer-gcode/src/gcode.rs:241\u0060 calls \u0060extrude_to\u0060 and \u0060crates/vcad-slicer-gcode/src/gcode.rs:266\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":"crates/vcad-slicer-gcode/src/gcode.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1dd4a284783cbbabac4621351b2452f354aed0247ee78f8c2e22c919af1443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): mecheval/graders/src/fit_physics.rs:144-159 | mecheval/graders/src/fit_physics.rs:225-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mecheval/graders/src/fit_physics.rs:144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/fit_physics.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5871cb2793cc7699e3d9b9d3c25bcdb7de8da4a240bbdd48ac6cc452d569523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 6): crates/vcad-kernel-booleans/src/split.rs:1888-1902 | crates/vcad-kernel-booleans/src/split.rs:5112-5123 | crates/vcad-kernel-booleans/src/split.rs:5376-5386 | crates/vcad-kernel-booleans/src/split.rs:5516-5527 | crates/vcad-kernel-booleans/src/split.rs:5719-5733 | crates/vcad-kernel-booleans/src/split.rs:6336-6350 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:1888\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac40e354b3937bbf2f2ea9ce951041917e729980de38559c917a48949913b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/vcad-kernel-tessellate/src/lib.rs:1953-1967 | crates/vcad-kernel-tessellate/src/lib.rs:8748-8762 | crates/vcad-kernel-tessellate/src/lib.rs:8877-8891 | crates/vcad-kernel-tessellate/src/lib.rs:8957-8971 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:505-519 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-tessellate/src/lib.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/mesh_ray.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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 \u0060crates/vcad-kernel-tessellate/src/lib.rs:1953\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddb83637b7ccc2d64fcf8854c07b930174350c3e10363384c9d41854b161aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/vcad-app/src/evaluate.rs:313-327 | crates/vcad-eval/src/evaluate.rs:3324-3338 | crates/vcad-kernel-wasm/src/lib.rs:8747-8761 \u2014 before extracting anything, compare \u0060crates/vcad-app/src/evaluate.rs\u0060 and \u0060crates/vcad-eval/src/evaluate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 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":"crates/vcad-app/src/evaluate.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f30c1c5999754a076b8a629045290e2067f4733a3a01705969777df8afb6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 3): crates/vcad-kernel-diff/src/adjoint.rs:356-365 | crates/vcad-kernel-diff/src/seam.rs:424-438 | crates/vcad-kernel-diff/src/second_order.rs:243-252 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-diff/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-diff/src/seam.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 \u0060crates/vcad-kernel-diff/src/adjoint.rs:356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/adjoint.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"062e6a4eed0c9bbd1b6ace772600d949b917d1cdf4583480f8d672d886f1eff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): crates/vcad-kernel-wasm/src/lib.rs:2608-2622 | crates/vcad-kernel-wasm/src/lib.rs:2651-2665 | crates/vcad-kernel-wasm/src/lib.rs:2878-2891 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d86b947be8200aee5ce73cb063da615164bda6d68cb1b12930092e1beb9e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-app/src/materializer.rs:674-688 | crates/vcad-app/src/materializer.rs:750-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 \u0060crates/vcad-app/src/materializer.rs:674\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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4cd21b399b39cdd8d80e16ff283b77e8d5a40132bdc5a4ce2cc6be673714e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-ecad-export/src/gerber.rs:945-959 | crates/vcad-ecad-export/src/gerber.rs:1021-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 \u0060crates/vcad-ecad-export/src/gerber.rs:945\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a8233a29dc8df10dfa9c41f6bbc3407247e24a3654a095abb94e95a9024258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/complete.rs:1311-1325 | crates/vcad-ecad-pcb/src/router/complete.rs:1356-1369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/complete.rs:1311\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-ecad-pcb/src/router/complete.rs:1326\u0060 calls \u0060insert\u0060 and \u0060crates/vcad-ecad-pcb/src/router/complete.rs:1370\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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab117758327fea6a6a1b3e531dbcb77c79f363d94b16f8aa448d29ab9894a745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:428-443 | crates/vcad-ecad-pcb/src/router/sco.rs:612-627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/sco.rs:428\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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba3f5b36209276be96453ac94882a8b521e768a7e826962912fb516431daa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-acoustics/src/receipt.rs:369-383 | crates/vcad-kernel-particle/src/receipt.rs:520-534 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-particle/src/receipt.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. 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 \u0060crates/vcad-kernel-acoustics/src/receipt.rs:369\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d776268ecba87343aeeb85851750a462de220188397621738db62380ac5a6bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201315 lines \u00D7 3): crates/vcad-kernel-booleans/src/mesh/mod.rs:154-165 | crates/vcad-kernel-primitives/src/lib.rs:634-638 | crates/vcad-kernel-shell/src/lib.rs:1308-1322 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs\u0060 and \u0060crates/vcad-kernel-shell/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 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 \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs:154\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87de32b3a917659d943d871ff6ebf969b7a3b496ae0a9fb89b6b59f6987287c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1468-1482 | crates/vcad-kernel-booleans/src/split.rs:1677-1689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:1468\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"060f97e80a74a63f4aee46d32d11c2720f9ce7a1b7ec5bdd110eca2964a7541e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1590-1602 | crates/vcad-kernel-booleans/src/split.rs:1867-1881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e188b098ac9516ef15aa0110ba2536da90c5e42505a00bf309ca309f7e41c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-diff/src/lift.rs:337-351 | crates/vcad-kernel-diff/src/lift.rs:352-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a825b5d8c803e0d1c8aea65203a1e8d0151c9110868b5a0ca0ac3bd2fa4d8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-diff/src/lift.rs:374-388 | crates/vcad-kernel-diff/src/lift.rs:396-410 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0079e17393f496cab4dd0afeb5409f5cb53c2d1d40fd54dcdb0118201f6afbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:200-214 | crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:236-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d71fffef51b8ad461cdb4988d08ae67707120eea0d0429a24f9117136c4c1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-fea/src/buckling.rs:491-505 | crates/vcad-kernel-fea/src/modal.rs:252-266 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/buckling.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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 \u0060crates/vcad-kernel-fea/src/buckling.rs:491\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c4853b884208b38a475824442e60c48fc5e1d04d105627b469fb36501150c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-kernel-gpu/src/narrowphase.rs:178-193 | crates/vcad-kernel-gpu/src/wavefront_batch.rs:339-354 \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":"crates/vcad-kernel-gpu/src/narrowphase.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba76f5a8db775266172e0e5dfdf89a7f590c38547361ae0d4eb80594fab5218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:1354-1368 | crates/vcad-kernel-sketch/src/extrude.rs:1394-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sketch/src/extrude.rs:1394\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"600f0117ded96651bafad6fafffafbc2a007737f449d5adba612447a8fa95b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-urdf/src/writer.rs:200-214 | crates/vcad-kernel-urdf/src/writer.rs:276-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. 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":"crates/vcad-kernel-urdf/src/writer.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f94b1612cfbaf3d449040c51698cc65410e2e63abbd2e23860bbcd5f8d5e01a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7): crates/vcad-cli/src/app.rs:557-570 | crates/vcad-cli/src/app.rs:595-608 | crates/vcad-cli/src/app.rs:633-646 | crates/vcad-cli/src/app.rs:672-685 | crates/vcad-cli/src/app.rs:712-725 | crates/vcad-cli/src/app.rs:749-762 | crates/vcad-cli/src/app.rs:790-803 \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 \u0060crates/vcad-cli/src/app.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdeb308ad7c75c67f3e17085b337be0a1085429b841fbdd03ef4e9233dacd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/vcad-kernel-constraints/src/export.rs:199-212 | crates/vcad-kernel-sketch/src/extrude.rs:54-66 | crates/vcad-kernel-sketch/src/profile.rs:267-279 \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 \u0060crates/vcad-kernel-constraints/src/export.rs:199\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/export.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1882e71e3d234dc13d735de4bb96144c613032f4ace104f053f902370b500fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/vcad-kernel-diff/src/lift.rs:225-238 | crates/vcad-kernel-diff/src/lift.rs:375-388 | crates/vcad-kernel-diff/src/lift.rs:397-410 \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":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"30468d990ccb3323cc97ca97ffab47af54f1b998aa0a618d348510b27bee87d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/vcad-kernel-fea/src/buckling.rs:1777-1790 | crates/vcad-kernel-fea/src/section.rs:1017-1030 | crates/vcad-kernel-fea/src/shell.rs:860-873 \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 \u0060crates/vcad-kernel-fea/src/buckling.rs:1777\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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"9babbf2f4fa0fc2196d298ed02e2eccb16188b8c66ea2cb6ae1f65c2f771f052"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-app/src/engine.rs:279-292 | crates/vcad-cli/src/app.rs:1079-1092 \u2014 before extracting anything, compare \u0060crates/vcad-app/src/engine.rs\u0060 and \u0060crates/vcad-cli/src/app.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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":"crates/vcad-app/src/engine.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6365d394a072a7a7e8b0d46c6c33be7d9937c2b859808e6b33b42330507167ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/vcad-app/src/materializer.rs:1187-1200 | crates/vcad-app/src/materializer.rs:1243-1252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-app/src/materializer.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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd906544f69a7d8a50bc596570628144cd7e3e19330db9f9c409fb24c79625b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-app/src/migrate.rs:503-516 | crates/vcad-app/src/migrate.rs:586-599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-app/src/migrate.rs:503\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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a19d555c8ad378164e84cf1770c9a7bb16d910157cd23fed8083a127d3394a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/vcad-ecad-pcb/src/ratsnest.rs:211-224 | crates/vcad-ecad-pcb/src/router/islands.rs:240-252 \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 \u0060crates/vcad-ecad-pcb/src/ratsnest.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":"crates/vcad-ecad-pcb/src/ratsnest.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0849561f62fd6bc1f643b60a24b00e0c38d83e4892c8b14ca433869d0a6b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:5020-5033 | crates/vcad-render/src/pcb.rs:1044-1057 \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 \u0060crates/vcad-ecad-pcb/src/router/auto.rs:5020\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, \u0060crates/vcad-render/src/pcb.rs:1041\u0060 calls \u0060is_empty\u0060 and \u0060crates/vcad-ecad-pcb/src/router/auto.rs:5019\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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":5020}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb263904e77f0a958d378f27a06001db8b064cda7f22817e7ab258c261ca59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/vcad-ecad-symbols/src/builtin.rs:30-41 | crates/vcad-ecad-symbols/src/footprint.rs:76-89 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-symbols/src/builtin.rs\u0060 and \u0060crates/vcad-ecad-symbols/src/footprint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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 \u0060crates/vcad-ecad-symbols/src/builtin.rs:30\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61c5abb057b0524f160cb8de36539b8ddead114e97c65b9b4b79cbb1c6677d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-eval/src/sensitivity.rs:273-286 | crates/vcad-eval/src/sensitivity.rs:361-374 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-eval/src/sensitivity.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d45b038dca347f8c82085fea123dff54e31a06a374fa25b3e8ba8f74c99450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:1122-1135 | crates/vcad-ir/src/vcode.rs:1162-1175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/vcode.rs:1122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f11b3a3502b61a4eeb921d1265ba9736e69b2609ff111a1b9713aca82a43a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-acoustics/src/receipt.rs:398-411 | crates/vcad-kernel-particle/src/receipt.rs:547-560 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-particle/src/receipt.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. 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 \u0060crates/vcad-kernel-acoustics/src/receipt.rs:398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"399e0d9bfb7138dc2daabaf0304cd069969f569fac3e09d541f147a67be716f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:849-862 | crates/vcad-kernel-booleans/src/classify.rs:864-877 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4830bbe9ce8129958dc0ec3658720515065a9cae2a37b1ba9e8054d77ce67fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/mod.rs:114-125 | crates/vcad-kernel-shell/src/lib.rs:1270-1283 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs\u0060 and \u0060crates/vcad-kernel-shell/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 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 \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85817a0784da0dbc68dca68d1e2c989a80d6b9236b6114f6acfb774e2ddbf8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:838-851 | crates/vcad-kernel-booleans/src/pipeline.rs:871-884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:838\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"75627bc022d99613bf0122161b828eda512bba83392b34764a7410f33187b8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5460-5473 | crates/vcad-kernel-booleans/src/split.rs:5634-5646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:5460\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5460}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce82c457df7d0f0afaabba346903a6ebbfa0cbaaab1d369a43e6ec158b088ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5565-5578 | crates/vcad-kernel-booleans/src/split.rs:6064-6077 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e53025049d8559baf44498dc9be0aaf49b5442829ba731a292ddced628aae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-diff/src/synthesize.rs:300-313 | crates/vcad-kernel-diff/src/synthesize.rs:405-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-diff/src/synthesize.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/synthesize.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1292e3e0367286139ad851e6be98377d694c10367a404535b708ad825e41abf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-drafting/src/section.rs:442-455 | crates/vcad-kernel-drafting/src/section.rs:555-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-drafting/src/section.rs:442\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2efc70bacbbe0075e7023898140744e49682c635934ac54d4527d4236f3604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-fea/src/graph.rs:86-99 | crates/vcad-kernel-thermal/src/graph.rs:654-667 \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 \u0060crates/vcad-kernel-fea/src/graph.rs:86\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":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77963412380412ba9a87d859dd81f21ae9a8dc8c6a1a2f8cde234b66d195460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201314 lines \u00D7 4): crates/vcad-kernel-fillet/src/fillet_curved.rs:710-713 | crates/vcad-kernel-fillet/src/fillet_curved.rs:944-947 | crates/vcad-kernel-fillet/src/fillet_curved.rs:1159-1172 | crates/vcad-kernel-fillet/src/fillet_planar.rs:424-437 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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 \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs:1159\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"6417f4686abfa5c28e38f75ad27a60d77b8f013552119ab92b5fe1c400984686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-gpu/src/decimate.rs:116-129 | crates/vcad-kernel-gpu/src/normals.rs:76-89 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-gpu/src/decimate.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/normals.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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 \u0060crates/vcad-kernel-gpu/src/decimate.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"573fa7ff1e533aaa00cc698b5e090f78dc447e1bb2aaf584e5c286dd4cdf88a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-step/src/entities/curves.rs:269-282 | crates/vcad-kernel-step/src/entities/surfaces.rs:443-456 \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 \u0060crates/vcad-kernel-step/src/entities/curves.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. 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":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03900d8c16713c441d7dc77ba1ba97d003de4889a5fa56d6d5e32716235b764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:2159-2172 | crates/vcad-kernel-wasm/src/lib.rs:2667-2680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:2159\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d95bbf031abdf5e99d73d375c9fc58205112a4448e31790803c6378c987e5a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/vcad-sim/src/batch.rs:217-230 | crates/vcad-sim/src/batch.rs:256-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/vcad-sim/src/batch.rs:266\u0060 calls \u0060Ok\u0060, \u0060batch_observe\u0060 and \u0060crates/vcad-sim/src/batch.rs:233\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":"crates/vcad-sim/src/batch.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49c31ab2105c404447b839f19017015d7eaeeeb4bb98c3bbe6053fb62875e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/vcad-slicer/src/path.rs:299-312 | crates/vcad-slicer/src/path.rs:343-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 \u0060crates/vcad-slicer/src/path.rs:299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/path.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd2a9e8d55e65933c69d818772573db49c8c3a9b5fac5e26a43a0d661078704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mecheval/graders/src/fit.rs:396-409 | mecheval/graders/src/fit_physics.rs:176-189 \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":"mecheval/graders/src/fit.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"704bd467c57d3412d25293b4e3b524ca746dd8d35a953ddd0c447cb7c223f672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 11): crates/vcad-kernel-booleans/src/split.rs:1242-1254 | crates/vcad-kernel-booleans/src/split.rs:1521-1529 | crates/vcad-kernel-booleans/src/split.rs:1577-1585 | crates/vcad-kernel-booleans/src/split.rs:1765-1775 | crates/vcad-kernel-booleans/src/split.rs:1793-1803 | crates/vcad-kernel-booleans/src/split.rs:1851-1861 | crates/vcad-kernel-booleans/src/split.rs:2181-2189 | crates/vcad-kernel-booleans/src/split.rs:3063-3071 | crates/vcad-kernel-booleans/src/split.rs:3077-3085 | crates/vcad-kernel-booleans/src/split.rs:3464-3472 | crates/vcad-kernel-booleans/src/split.rs:4679-4687 \u2014 all 11 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4313b6b93db6a36309e277c0f72a5bbf8717bcc81f3da326c3792361ea0ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201313 lines \u00D7 7): crates/vcad-kernel-booleans/src/split.rs:1885-1894 | crates/vcad-kernel-booleans/src/split.rs:5111-5117 | crates/vcad-kernel-booleans/src/split.rs:5375-5380 | crates/vcad-kernel-booleans/src/split.rs:5515-5521 | crates/vcad-kernel-booleans/src/split.rs:5716-5725 | crates/vcad-kernel-booleans/src/split.rs:6333-6342 | crates/vcad-kernel-booleans/src/split.rs:6863-6875 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:1885\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"075f7bdd0a2972075c92fe04858f23c29133d08be478e84f2282456ec709e6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): crates/vcad-kernel-flow/src/adjoint.rs:249-261 | crates/vcad-kernel-flow/src/adjoint.rs:478-490 | crates/vcad-kernel-flow/src/adjoint.rs:611-623 | crates/vcad-kernel-flow/src/solve.rs:385-397 | crates/vcad-kernel-flow/src/solve.rs:450-462 | crates/vcad-kernel-flow/src/solve.rs:636-648 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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 \u0060crates/vcad-kernel-flow/src/adjoint.rs:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aa29fb1b45438b7a8deb3a5c9de445ba40da4eb456c141a21832bfc6d42124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/vcad-ecad-pcb/src/router/descent.rs:926-938 | crates/vcad-ecad-pcb/src/router/mod.rs:435-447 | crates/vcad-ecad-pcb/src/router/pair.rs:1498-1510 | crates/vcad-ecad-pcb/src/router/pair.rs:1606-1618 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b32a63a82e95c6c1cd041eb051f8bbedffa876789df73c14fa651a452ff3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/vcad-ecad-export/src/gerber.rs:945-957 | crates/vcad-ecad-export/src/gerber.rs:986-999 | crates/vcad-ecad-export/src/gerber.rs:1021-1033 \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 \u0060crates/vcad-ecad-export/src/gerber.rs:945\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e04d9cfe56683ae496c0687531fed9a7a21047e83373a9e4b659c1e426cc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/vcad-ecad-pcb/src/router/legalize.rs:492-504 | crates/vcad-kernel-shell/src/lib.rs:732-744 | crates/vcad-render/src/lib.rs:1619-1631 \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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cbb9a87230aec66d20506387b9cb77e62b3432983dbcf810620dba42c1ee27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/vcad-ffi/src/lib.rs:1428-1440 | crates/vcad-ffi/src/lib.rs:1464-1474 | crates/vcad-ffi/src/lib.rs:2281-2291 \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 \u0060crates/vcad-ffi/src/lib.rs:1428\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdea29ed9de7f7360e7688fc156e6c12d3bc67ba5321019dde6eca51538233c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/vcad-kernel-acoustics/src/optimize.rs:103-114 | crates/vcad-kernel-particle/src/optimize.rs:109-121 | crates/vcad-kernel-particle/src/optimize.rs:188-198 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-particle/src/optimize.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-acoustics/src/optimize.rs:103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca4f9fb41306b4945bf8815afce9d238ebb39a0a41f4f97b88d87527f7b81b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/vcad-kernel-booleans/src/api.rs:835-852 | crates/vcad-kernel-booleans/src/pipeline.rs:2217-2233 | crates/vcad-kernel-booleans/src/validate.rs:109-126 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/api.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/validate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/vcad-kernel-booleans/src/api.rs:835\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeb8d12549051e71f1aa06a3c53c4934904bd1ddf9b66fc6290525718b2f076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:5260-5271 | crates/vcad-kernel-tessellate/src/lib.rs:6076-6088 | crates/vcad-kernel-tessellate/src/lib.rs:6198-6209 \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 \u0060crates/vcad-kernel-tessellate/src/lib.rs:5260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5260}}}],"partialFingerprints":{"codehealthFindingId/v1":"154f5ba2fb44cd197b08f77c5f4a835e4e2e04a66b4ec3014246609393a32b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-cli/src/main.rs:2611-2623 | crates/vcad-cli/src/main.rs:2639-2651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-cli/src/main.rs:2611\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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"99459994114a512f3671a405e649e9c36f802aa5ce026dd63f6751aee3f565c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-ecad-pcb/src/pour_synth.rs:260-272 | crates/vcad-ecad-pcb/src/router/auto.rs:3923-3935 \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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e0bd63fd1cc6329b3d9aced7a51ee8f153ec557c7aa79f7713849e522fcf29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:750-768 | crates/vcad-ecad-pcb/src/router/sco.rs:773-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0875a7d6a816dd3fc1410512e1fba62f975fe9dbbfc5fc3d937b48cba601d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:917-929 | crates/vcad-ecad-pcb/src/router/sco.rs:953-965 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-ecad-pcb/src/router/sco.rs:916\u0060 calls \u0060cholesky_apply\u0060 and \u0060crates/vcad-ecad-pcb/src/router/sco.rs:952\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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"526611d25cc1026d6b122e7a8206c7f0f72bbb511a524764b5866ae08b334d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/vcad-ecad-symbols/src/altium/mod.rs:1020-1045 | crates/vcad-ecad-symbols/src/eagle_brd.rs:364-389 \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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"c235ce5a7a805d39ee46d57faa00d56482559fadde3fe2120d150add804dea8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-ecad-symbols/src/footprint.rs:1486-1498 | crates/vcad-ecad-symbols/src/footprint.rs:1556-1568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/footprint.rs:1486\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc675330ac528c19819606c19016f8906504c1c9245a24fda1c931949084e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-eval/src/cavity_extract.rs:336-348 | crates/vcad-eval/src/sim_extract.rs:364-376 \u2014 before extracting anything, compare \u0060crates/vcad-eval/src/cavity_extract.rs\u0060 and \u0060crates/vcad-eval/src/sim_extract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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 \u0060crates/vcad-eval/src/cavity_extract.rs:336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fb96843efd8a6feecaaf6b0cf7100cc8fdbbedb808caad9851a48cf8f33fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-ffi/src/lib.rs:372-384 | crates/vcad-ffi/src/lib.rs:423-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/lib.rs:372\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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6f34761c061d7f1250cb496f445240febbeb3246fbd02624c1637b4f397540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-ffi/src/print.rs:359-371 | crates/vcad-slicer/src/orient.rs:92-104 \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 \u0060crates/vcad-ffi/src/print.rs:359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/print.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe51eb3931de081100aec1fd4f16410ec504348d99036bd452ab624e5e6058b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:2343-2355 | crates/vcad-kernel-booleans/src/pipeline.rs:2357-2369 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9091ee16e201382325c1d1f888c33b82d729d6622d911ed632bf4397512395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201313 lines \u00D7 3): crates/vcad-kernel-booleans/src/split.rs:349-351 | crates/vcad-kernel-booleans/src/split.rs:1362-1374 | crates/vcad-kernel-booleans/src/split.rs:2714-2726 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:1362\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dd447c00f08edec0cf1314699e12c0b24a44635ddb95ce9334af8ff8d16be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:3129-3146 | crates/vcad-kernel-booleans/src/split.rs:3489-3506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:3129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14f64eac26ca536f10417b2ef2716bae6d9b7478bacc7e1e8c1ad8f94b553e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5054-5066 | crates/vcad-kernel-booleans/src/split.rs:6266-6278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:5054\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5054}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de1728e90c3977d1f209b35a6b05594ae79ee051de8a35c9e95dca9b5a365c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5884-5895 | crates/vcad-kernel-booleans/src/split.rs:5922-5934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:5884\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5884}}}],"partialFingerprints":{"codehealthFindingId/v1":"e367bce0ca17fde267204c7eed7d233db2ef65f94b50c2415726f1d8caa5b84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/vcad-kernel-drafting/src/section.rs:697-709 | crates/vcad-kernel-drafting/src/section.rs:911-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf3d9503ae3fc05226233adafa1efaa0dcef811272d74bf47a44e1a1dc9b27f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201313 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:441-446 | crates/vcad-kernel-em/src/electro.rs:198-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/axisym.rs:441\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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b0bfc23ebdc55f12e047ea4b8ac9c8f7435ec38a43f6572c931a856da50064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-fillet/src/chamfer.rs:116-128 | crates/vcad-kernel-fillet/src/fillet_planar.rs:202-214 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72d7e9862d7ad3eec766ba672acef2f298dd88ad21abf3b38a551a2ede45bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-gpu/src/wavefront.rs:329-341 | crates/vcad-kernel-gpu/src/wavefront.rs:684-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-gpu/src/wavefront.rs:329\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":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb61e9f2908df12e179558e0f7f01e10fd76424287c59b446a76a94747e8fe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-naming/src/lib.rs:377-389 | crates/vcad-kernel-naming/src/profile.rs:163-175 \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 \u0060crates/vcad-kernel-naming/src/lib.rs:377\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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ac2e54fffdd90192bf3793eee8ea3312f20e4ffd741bfc187878a808857e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 3): crates/vcad-kernel-sketch/src/extrude.rs:230-242 | crates/vcad-kernel-sketch/src/extrude.rs:568-571 | crates/vcad-kernel-sketch/src/revolve.rs:117-129 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:230\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd6f1f7346d51844bd4d54a879c6a40e11afd95c402ae40a69b1e5b2421ac3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:4722-4734 | crates/vcad-kernel-tessellate/src/lib.rs:5040-5053 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:4722\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4722}}}],"partialFingerprints":{"codehealthFindingId/v1":"434f08da067c0fafff52b5c608e2f9705503046cbfffcaf1f0457235174914b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:5706-5720 | crates/vcad-kernel-tessellate/src/lib.rs:7773-7787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:5706\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, \u0060crates/vcad-kernel-tessellate/src/lib.rs:5703\u0060 calls \u0060project\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs:7770\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5706}}}],"partialFingerprints":{"codehealthFindingId/v1":"711cffb81fbbd4a2f9379e3dfca39db3fe380f102db40f0205b30b13b5c469d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:8200-8212 | crates/vcad-kernel-tessellate/src/lib.rs:8240-8252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:8200\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b8febb70bb1253fb32f8c480dbb0efbf1639117d91c40c7e827dbea8ea35d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-text/src/glyph.rs:76-88 | crates/vcad-kernel-text/src/glyph.rs:109-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-text/src/glyph.rs:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-text/src/glyph.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3682f2561da15de2396f169be5e06d111ef80a3c97c1fde42ce2fc9038f5d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/vcad-loon/src/convert.rs:34-47 | crates/vcad-loon/src/convert.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 \u0060crates/vcad-loon/src/convert.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e2d64f524baa021278b059e67fc90772b9ec1ddff075e3737b0e4fb24ee5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/vcad-render/src/lib.rs:4443-4455 | crates/vcad-render/src/lib.rs:5555-5564 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92cf19328ad07301b7bb10cfc0c207a218a2f5d4528d17acd3b9722d57e074d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-render/src/lib.rs:5128-5140 | crates/vcad-render/src/lib.rs:5248-5260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-render/src/lib.rs:5128\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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d8a3a9cb75eab84bb018de7867b04d0a1032b0ed01903d4e1706e2e5a03173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 4): crates/vcad-kernel-constraints/src/residual.rs:50-58 | crates/vcad-kernel-constraints/src/residual.rs:67-75 | crates/vcad-kernel-constraints/src/residual.rs:103-114 | crates/vcad-kernel-constraints/src/residual.rs:254-262 \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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcbf13d36df2df0fed3886146649e8c7ed3e7e3853e83aeb7f10e3e0a7b9ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/vcad-app/src/materializer.rs:1182-1193 | crates/vcad-app/src/materializer.rs:1238-1249 | crates/vcad-app/src/materializer.rs:1287-1298 \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 \u0060crates/vcad-app/src/materializer.rs:1182\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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ba0672e6bbbfa89903babf510e84ae46a66df5c481a444f0cacbed0eac518c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/vcad-cli/src/app.rs:746-757 | crates/vcad-cli/src/app.rs:787-798 | crates/vcad-cli/src/app.rs:828-839 \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 \u0060crates/vcad-cli/src/app.rs:746\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"284560f0d8a4ca11f3f8a271b0e9fa5c4f6a673066690b572200cddb52732df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): crates/vcad-kernel-booleans/src/cyl_band.rs:670-678 | crates/vcad-kernel-tessellate/src/lib.rs:4838-4849 | crates/vcad-kernel-tessellate/src/lib.rs:6940-6949 \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 \u0060crates/vcad-kernel-booleans/src/cyl_band.rs:670\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a251b6305b607a6d7366759d8135a8de6db726fd1951618ad86228d0f5b7ac06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/vcad-kernel-export/src/lib.rs:372-383 | crates/vcad-kernel-export/src/lib.rs:389-400 | crates/vcad-kernel-export/src/lib.rs:411-422 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-export/src/lib.rs:372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-export/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd78df7f35b8ce3550c1ac9895842267a41261b7d0a0a0e1e91931602ef88593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/vcad-kernel-fillet/src/chamfer.rs:113-123 | crates/vcad-kernel-fillet/src/fillet_planar.rs:198-209 | crates/vcad-kernel-fillet/src/fillet_planar.rs:414-424 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs:198\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-fillet/src/chamfer.rs:112\u0060 calls \u0060compute_centroid\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs:198\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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"af25d975cddb680fe3e46c188fd5bdca0883c91f415b1241ff814a99eee45365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/vcad-kernel-flow/src/gpu.rs:192-202 | crates/vcad-kernel-gpu/src/wavefront.rs:168-179 | crates/vcad-kernel-gpu/src/wavefront.rs:463-474 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/gpu.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/wavefront.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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 \u0060crates/vcad-kernel-flow/src/gpu.rs:192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"812f777c58800201f84d32c422520fa07a5dd9ce18f72fee536ba81d7dcf3e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): crates/vcad-kernel-geom/src/lib.rs:211-219 | crates/vcad-kernel-geom/src/lib.rs:1460-1468 | crates/vcad-kernel-sweep/src/frenet.rs:83-94 \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 \u0060crates/vcad-kernel-geom/src/lib.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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4f4af8edceb93149e6ced9517d308f98e0733fe9fb807b57629b258f5e011e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/vcad-kernel-sketch/src/extrude.rs:1465-1476 | crates/vcad-kernel-sketch/src/revolve.rs:644-655 | crates/vcad-kernel-sweep/src/loft.rs:295-306 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:1465\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"15be32d1b47d83282ac7048e7b28050a2e7d786d0c4373e24ff13322a26d3032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/vcad-render/src/animate.rs:375-386 | crates/vcad-render/src/animate.rs:599-609 | crates/vcad-render/src/animate.rs:697-707 \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 \u0060crates/vcad-render/src/animate.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":"crates/vcad-render/src/animate.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c615eae6491b28725ab58180e49c88a59dd774ff73a71c9351a96675cdb2201a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/vcad-render/src/animate.rs:427-440 | crates/vcad-render/src/animate.rs:625-636 | crates/vcad-render/src/animate.rs:724-735 \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 \u0060crates/vcad-render/src/animate.rs:427\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":"crates/vcad-render/src/animate.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d948c763eba2c161f3cf10b2afd6b08ce31b32f7c0b3be3ecef8d347e295b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ecad-package/src/derive.rs:102-113 | crates/vcad-ecad-symbols/src/footprint.rs:62-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 \u0060crates/vcad-ecad-package/src/derive.rs:102\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":"crates/vcad-ecad-package/src/derive.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7614add8dcf829fe8cc16321a49ba41635238332398bd2ff1bd5810ad33682cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/flow/route.rs:750-761 | crates/vcad-ecad-pcb/src/router/flow/route.rs:774-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/flow/route.rs:750\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d27f3018888277cbabe9addf36d629fc188161682981ba0c1eb26d2ad2f5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/maze.rs:589-600 | crates/vcad-ecad-pcb/src/router/maze.rs:1370-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/maze.rs:589\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1902a682c1e9de1186da2247ae8ee19535dbde794428fd8dde2b6e83df3a5a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/pair.rs:1819-1830 | crates/vcad-ecad-pcb/src/router/pair.rs:1848-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 \u0060crates/vcad-ecad-pcb/src/router/pair.rs:1819\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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3669fc5d66e9220bd232d9f91acbe73e371a490190390e567688ba958032dbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:1112-1123 | mecheval/graders/src/pcb.rs:144-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e9bb0ba99790e0bb0c05e32f562184c327f650ad343bbb77b69864b54d3f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ffi/src/lib.rs:2031-2042 | crates/vcad-ffi/src/lib.rs:2400-2411 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbed58d914aa93824bb31e6739ba3f7f82b36c8046f19d111c2ad1635d76e47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:1145-1156 | crates/vcad-ir/src/vcode.rs:1185-1196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/vcode.rs:1145\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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad3003afdffe60b0fea142b732c072bd54f67295080e76df442c6b34ff7e6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:1220-1231 | crates/vcad-kernel-booleans/src/pipeline.rs:305-316 \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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"be936a4dc3f790660fd6820313b2c65bb92498d493ae2130739796fc10a33c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:729-740 | crates/vcad-kernel-tessellate/src/manifold.rs:389-400 \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 \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs:729\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"c587c7122752486047e3fb0404c7fd799dd4c1f4a24498adecb4d2a010bd18e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:2178-2189 | crates/vcad-kernel-booleans/src/pipeline.rs:2258-2269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:2178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99848534302c2f6ebe619e942e19e09608d324f319be422369814cbf2b99302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:2938-2949 | crates/vcad-kernel-booleans/src/split.rs:7226-7237 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"82176a8ef7086f4e58027f6efe0f1c7eb71079856be696a345a6172d91a84829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:6818-6830 | crates/vcad-kernel-booleans/src/split.rs:6834-6846 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6818}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13bff09d974fa68c4c3290a2092c66841909be0224ae96704ff7ac9abcb0401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:7181-7192 | crates/vcad-kernel-booleans/src/trim.rs:1068-1079 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/split.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":7181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcb155bc31e9c330274429a0f3becac5fe5e649293aab95df7aacdc0e2481af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/vcad-kernel-cam/src/operation/roughing3d.rs:176-187 | crates/vcad-kernel-cam/src/operation/roughing3d.rs:230-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-cam/src/operation/roughing3d.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":"crates/vcad-kernel-cam/src/operation/roughing3d.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3a731a18f611bc3818e404aa3d74d8286fa0d033d0a110fb1da3790f67b863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-diff/src/mass.rs:166-177 | crates/vcad-kernel-diff/src/seam.rs:470-481 \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 \u0060seam\u0060 to \u0060\u0026SeamMesh\u0060 in one and \u0060\u0026SeamMesh) -\u003E (f64\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":"crates/vcad-kernel-diff/src/mass.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d359ea4b05af9f0eb4051d5a50a61fe0fb2921f81a4a9b9182a199659c0a0073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-fillet/src/chamfer.rs:135-146 | crates/vcad-kernel-fillet/src/fillet_planar.rs:217-229 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/vcad-kernel-fillet/src/chamfer.rs:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab23de14fb1c56174f7e92fbf2c7bf934decf3cb162d1d9801fc4b18ae3e6787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-geom/src/lib.rs:386-397 | crates/vcad-kernel-geom/src/lib.rs:927-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 \u0060crates/vcad-kernel-geom/src/lib.rs:386\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac1ffec24904f8ac84743e4d969df80a75d42b4ccf8ef6998974650cddd8836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-gpu/src/decimate.rs:67-78 | crates/vcad-kernel-gpu/src/normals.rs:41-52 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-gpu/src/decimate.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/normals.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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 \u0060crates/vcad-kernel-gpu/src/decimate.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f64ff4a5bc0ba3e4007def5da2fd97d11e69cd72fdf0a5c2fca2e06cd6689e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/vcad-kernel-nurbs/src/lib.rs:146-157 | crates/vcad-kernel-step/src/entities/surfaces.rs:1121-1130 \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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8ae0034dd3a269e0fea709446093f8480700a8ba3c0ff2b7d4320265a05418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/vcad-kernel-raytrace/src/cpu.rs:95-104 | crates/vcad-kernel-raytrace/src/cpu.rs:184-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 \u0060crates/vcad-kernel-raytrace/src/cpu.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c78e9cb5626ecd4dd4727489ddf78546c2178180aa3c77d3c4d166c15e0521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/vcad-kernel-raytrace/src/cpu.rs:124-133 | crates/vcad-kernel-raytrace/src/cpu.rs:209-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-raytrace/src/cpu.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":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9475965acbc2eff7b77cf1a469d39706584d17d51a5f89ce6e123b21b38981d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:555-566 | crates/vcad-kernel-sketch/src/extrude.rs:825-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"429f79ef39efc5ab2e81fe5533ec51e43f7e7070567220d715125ae3832581f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-tessellate/src/frozen.rs:900-911 | crates/vcad-kernel-tessellate/src/frozen.rs:1327-1338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/frozen.rs:900\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb97ec9c24a29e0701012ca132815a95fd2e31964ff8d921ea25e394c65de83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:1992-2004 | crates/vcad-kernel-tessellate/src/lib.rs:8809-8821 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddc32b9cd9d4ae7881b183973104eada9945fb748835869ea30704745fb1ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:2372-2383 | crates/vcad-kernel-tessellate/src/lib.rs:2443-2452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:2372\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"945ef6a52779c62c9358a82ed770321802159695cad05de8eb30b4a981a92596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:3057-3068 | crates/vcad-kernel-tessellate/src/lib.rs:3118-3129 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"232e33ebbf842a24817c7e48b5a925c1caec312cfc4f872f3df8e5b31e692ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:2248-2259 | crates/vcad-kernel-wasm/src/lib.rs:2428-2439 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2248}}}],"partialFingerprints":{"codehealthFindingId/v1":"65544f11637c305b9025cbda792b0d74e24a168ddc6ce5a3d68311e9801842e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel/src/lib.rs:2343-2354 | crates/vcad-kernel/src/lib.rs:2403-2414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel/src/lib.rs:2343\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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f448603c9ae1c4543937f0d4fd71a3546916fa2e3f77f3257bb329ac4f293061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-slicer/src/slice.rs:74-85 | crates/vcad-slicer/src/support.rs:85-96 \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 \u0060crates/vcad-slicer/src/slice.rs:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-slicer/src/support.rs:81\u0060 calls \u0060is_empty\u0060 and \u0060crates/vcad-slicer/src/slice.rs:72\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":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aacaddbd032bb4d6cfd0eeba87963d4974cc1ad1a868d3f3b038c31bbba7aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 9): crates/vcad-kernel-booleans/src/split.rs:834-844 | crates/vcad-kernel-booleans/src/split.rs:1882-1891 | crates/vcad-kernel-booleans/src/split.rs:3101-3110 | crates/vcad-kernel-booleans/src/split.rs:5109-5115 | crates/vcad-kernel-booleans/src/split.rs:5373-5379 | crates/vcad-kernel-booleans/src/split.rs:5513-5519 | crates/vcad-kernel-booleans/src/split.rs:5713-5722 | crates/vcad-kernel-booleans/src/split.rs:6330-6339 | crates/vcad-kernel-booleans/src/split.rs:6860-6869 \u2014 all 9 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 \u0060crates/vcad-kernel-booleans/src/split.rs:834\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-booleans/src/split.rs:1897\u0060 calls \u0060add_curve_3d\u0060, \u0060clone\u0060 and \u0060crates/vcad-kernel-booleans/src/split.rs:849\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"801f2062c6df18e18444f543ac492e13e8b44af5b3229edd26a2520d2ebb0a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8): crates/vcad-cli/src/app.rs:555-565 | crates/vcad-cli/src/app.rs:593-603 | crates/vcad-cli/src/app.rs:631-641 | crates/vcad-cli/src/app.rs:670-680 | crates/vcad-cli/src/app.rs:710-720 | crates/vcad-cli/src/app.rs:747-757 | crates/vcad-cli/src/app.rs:788-798 | crates/vcad-cli/src/app.rs:829-839 \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 \u0060crates/vcad-cli/src/app.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2389acace60a784e83a24ea939ef28cea63ad924b3f764534215d2e5b47de33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): crates/vcad-kernel-acoustics/src/receipt.rs:266-276 | crates/vcad-kernel-em/src/receipt.rs:375-385 | crates/vcad-kernel-flow/src/receipt.rs:289-299 | crates/vcad-kernel-particle/src/receipt.rs:383-393 | crates/vcad-kernel-thermal/src/receipt.rs:429-439 | crates/vcad-kernel-tolerance/src/receipt.rs:302-312 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-em/src/receipt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 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 \u0060crates/vcad-kernel-acoustics/src/receipt.rs:266\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf843d4fa004a3f951ec7dbad924dfa4b1e60d485c133184765e2f94922144f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 5): crates/vcad-kernel-sketch/src/extrude.rs:978-984 | crates/vcad-kernel-sketch/src/extrude.rs:1293-1303 | crates/vcad-kernel-sketch/src/extrude.rs:1436-1446 | crates/vcad-kernel-sketch/src/revolve.rs:610-620 | crates/vcad-kernel-sweep/src/sweep.rs:370-380 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/vcad-kernel-sketch/src/extrude.rs:1304\u0060 calls \u0060add_face\u0060 and \u0060crates/vcad-kernel-sketch/src/extrude.rs:985\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"727e23efeb40248184b6b5f6643976f216978951e2bc5fd80e309fb7d8214ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/vcad-ecad-export/src/gerber.rs:712-724 | crates/vcad-ecad-export/src/gerber.rs:745-757 | crates/vcad-ecad-export/src/gerber.rs:786-798 | crates/vcad-ecad-export/src/gerber.rs:852-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 \u0060crates/vcad-ecad-export/src/gerber.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":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ad0308418e01718ebdad33e5d754c017f4a98f109969fc78a1aa726be7123d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/vcad-loon/src/convert.rs:509-519 | crates/vcad-loon/src/convert.rs:536-546 | crates/vcad-loon/src/convert.rs:560-570 | crates/vcad-loon/src/convert.rs:579-589 \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 \u0060crates/vcad-loon/src/convert.rs:509\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-loon/src/convert.rs:506\u0060 calls \u0060vec3\u0060, \u0060f64_val\u0060 and \u0060crates/vcad-loon/src/convert.rs:559\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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5bc5ad7d2917667d7f537f9983341b176e48c37386ef2a473f9802a20f743d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-app/src/materializer.rs:1181-1191 | crates/vcad-app/src/materializer.rs:1286-1296 | crates/vcad-app/src/materializer.rs:1410-1420 \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 \u0060crates/vcad-app/src/materializer.rs:1181\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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88fd2a17bb992955ba484f035768d23e083eb31df27252afd54aacd49a02515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-cli/src/app.rs:443-454 | crates/vcad-cli/src/app.rs:482-492 | crates/vcad-cli/src/app.rs:519-529 \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 \u0060crates/vcad-cli/src/app.rs:443\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96b997e315a26626169c5de4727571cda923973d19132b621465a3c4c71e5e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/vcad-ecad-sim/src/circuit/ac.rs:141-150 | crates/vcad-ecad-sim/src/circuit/linalg.rs:20-30 | crates/vcad-kernel-acoustics/src/linalg.rs:50-60 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-sim/src/circuit/ac.rs\u0060 and \u0060crates/vcad-ecad-sim/src/circuit/linalg.rs\u0060 as WHOLE FILES: this scan already matched 5 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. 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 \u0060crates/vcad-ecad-sim/src/circuit/ac.rs:141\u0060 it does not close everything it opens, so those exact 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 \u0060a\u0060 to \u0060\u0026mut [Cplx]\u0060 in one and \u0060\u0026mut [f64]\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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b2f4918a721e948967aa8be35f2d04bc197566513992234a2fed07d8ef8663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): crates/vcad-ecad-sim/src/circuit/ac.rs:154-163 | crates/vcad-ecad-sim/src/circuit/linalg.rs:34-44 | crates/vcad-kernel-antenna/src/linalg.rs:84-92 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-sim/src/circuit/ac.rs\u0060 and \u0060crates/vcad-ecad-sim/src/circuit/linalg.rs\u0060 as WHOLE FILES: this scan already matched 5 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. 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 \u0060crates/vcad-ecad-sim/src/circuit/ac.rs:154\u0060 it does not close everything it opens, so those exact 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 \u0060a\u0060 to \u0060\u0026mut [Cplx]\u0060 in one and \u0060\u0026mut [f64]\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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"afba1ec7f7f3306afe4ec546a216c05cbe9bdee4a5b39ffba0dd095f9a802800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-kernel-booleans/src/mesh/mod.rs:120-130 | crates/vcad-kernel-drafting/src/section.rs:129-139 | crates/vcad-kernel-shell/src/lib.rs:1278-1288 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs\u0060 and \u0060crates/vcad-kernel-shell/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 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 \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs: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":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d873ce945340ebed482e60937f591a2f81139cf0e60e432203cb57a1234d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 3): crates/vcad-kernel-booleans/src/split.rs:1471-1481 | crates/vcad-kernel-booleans/src/split.rs:1680-1688 | crates/vcad-kernel-booleans/src/split.rs:3982-3988 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:3982\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec719cdc934d2afa1698c961bd7e7053912da1b7fcc20e4fe95fa9900056122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-kernel-geom/src/lib.rs:408-418 | crates/vcad-kernel-geom/src/lib.rs:591-601 | crates/vcad-kernel-geom/src/lib.rs:950-960 \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 \u0060crates/vcad-kernel-geom/src/lib.rs:408\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-geom/src/lib.rs:962\u0060 calls \u0060from_f64\u0060 and \u0060crates/vcad-kernel-geom/src/lib.rs:420\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":"crates/vcad-kernel-geom/src/lib.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5f9abc6daece37ca428c7db9f69e73d34b949bc3e38f4d7e494f62803b8f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/vcad-kernel-gpu/src/wavefront.rs:325-335 | crates/vcad-kernel-gpu/src/wavefront.rs:680-690 | crates/vcad-kernel-gpu/src/wavefront.rs:701-710 \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":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e87bc83b9726cfe7b3e804e2a792bd6240a3253138eec368d335f34a912889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-kernel-step/src/pmi.rs:127-140 | crates/vcad-kernel-step/src/pmi.rs:147-157 | crates/vcad-kernel-step/src/pmi.rs:165-175 \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 \u0060crates/vcad-kernel-step/src/pmi.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":"crates/vcad-kernel-step/src/pmi.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dda4242b2d58086a9e20c175a5584d2b3d6043fc78872fb0bf9cfe251b3c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:1994-2004 | crates/vcad-kernel-tessellate/src/lib.rs:8811-8821 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:410-420 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-tessellate/src/lib.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/mesh_ray.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f42b273df2551b09a319374936cdd496ac71a1bc6c65b191b7761c4fe1b7546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-kernel-urdf/src/writer.rs:216-226 | crates/vcad-kernel-urdf/src/writer.rs:239-254 | crates/vcad-kernel-urdf/src/writer.rs:294-304 \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 \u0060crates/vcad-kernel-urdf/src/writer.rs:239\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":"crates/vcad-kernel-urdf/src/writer.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f1879792d3b8c815e2abdb26cba5c1b0aa598f4c7eea9a90e592349438962b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-cli/src/app.rs:1351-1361 | crates/vcad-render/src/main.rs:1178-1188 \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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1d16a723af2bf1f653cca8e7fa762d0207af11f943542840f6777228f5b473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-cli/src/ui/chat.rs:363-373 | crates/vcad-cli/src/ui/command.rs:147-157 \u2014 before extracting anything, compare \u0060crates/vcad-cli/src/ui/chat.rs\u0060 and \u0060crates/vcad-cli/src/ui/command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 105 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":"crates/vcad-cli/src/ui/chat.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9609dfb2f971bd8b60afcd6020de034bccf718aef94018962a58ffa912855e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:1223-1233 | crates/vcad-ecad-pcb/src/router/auto.rs:1244-1254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/auto.rs:1223\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dc41d64df83e1813fc75859924752851037bf4d1ef5dda06b077c9a317e634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:4160-4170 | crates/vcad-ecad-pcb/src/router/auto.rs:4427-4437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/auto.rs:4160\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4160}}}],"partialFingerprints":{"codehealthFindingId/v1":"287306707b170f61b1abc65954def2c4dc66eacdba20ebd94b217a83c161d7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/flow/flow.rs:996-1006 | crates/vcad-ecad-pcb/src/router/flow/flow.rs:1051-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 \u0060crates/vcad-ecad-pcb/src/router/flow/flow.rs:996\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b261925000786e0656087145aff658511c7ea458a315ac10ba4af4692db59cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/flow/realize.rs:434-444 | crates/vcad-ecad-pcb/src/router/flow/realize.rs:644-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/flow/realize.rs:434\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1f0f2b0c1816b649c19e6aa3a63f1568f1362707230eca9eb6fd85769b432a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/flow/realize.rs:446-456 | crates/vcad-ecad-pcb/src/router/flow/realize.rs:656-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/flow/realize.rs:446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a312504e35346708bb000a039877e66a03f180e07aa2447dc950b52f676f176e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-pcb/src/session.rs:789-799 | crates/vcad-ecad-pcb/src/session.rs:869-879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/session.rs:789\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c807aa0dd4b8bab2e249f987157f3c192d18ffc655ca6813e279f703f8d0a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-sim/src/circuit/ac.rs:346-356 | crates/vcad-ecad-sim/src/circuit/ac.rs:360-370 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1348b3743e298d1eb3a7a4fc8dc357a0cbc02db2e2617adf6b41c0c08664bb40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-symbols/src/builtin.rs:14-24 | crates/vcad-ecad-symbols/src/footprint.rs:60-70 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-symbols/src/builtin.rs\u0060 and \u0060crates/vcad-ecad-symbols/src/footprint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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 \u0060crates/vcad-ecad-symbols/src/builtin.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c29524ef169c6178c6bc4eb30e23639f0ae8e48640904965986148a955e4b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:535-545 | crates/vcad-ecad-symbols/src/kicad_write.rs:1060-1070 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"394bbeeceb7d1d1e4d1d22b59e0761d7ed5250edb12bfef6cb01cf51fb84e652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:2028-2038 | crates/vcad-eval/src/evaluate.rs:2080-2090 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-eval/src/evaluate.rs:2028\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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"461a26679ff358ee5a53d94f34b682e8f88a4fb8e44081a7947ace3395908a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:2433-2442 | crates/vcad-kernel-wasm/src/lib.rs:2280-2290 \u2014 before extracting anything, compare \u0060crates/vcad-eval/src/evaluate.rs\u0060 and \u0060crates/vcad-kernel-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dada9b5a4acb4b03c484ef52cd69327faf7d46e55e4188ac25e1a610fd9465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:3487-3496 | crates/vcad-kernel-drafting/src/section.rs:352-362 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6f6e58e93cbdcef8d2ababee35cfe892d522ebfce9a2a745dbc9be49eeff3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-eval/src/kinematics.rs:154-164 | crates/vcad-eval/src/kinematics.rs:180-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. 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":"crates/vcad-eval/src/kinematics.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9559fe5dc39a195032d2280cda7036546f8708c86273c9733be9b48d9e45f165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ffi/src/cam_job.rs:521-531 | crates/vcad-ffi/src/cam_job.rs:583-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/cam_job.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":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fd9a09198af85a5c4dd05fc529ed209b79c7f04076ebe9684d49ecb09fc93e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-acoustics/src/instrument.rs:499-509 | crates/vcad-kernel-fea/src/modal.rs:317-327 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/instrument.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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 \u0060crates/vcad-kernel-acoustics/src/instrument.rs:499\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"87712f2c691e2dd63a665b94648a2e888a934b6eee8bc738bc46be0a5b6181b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-booleans/src/api.rs:883-894 | crates/vcad-kernel-tessellate/src/lib.rs:903-914 \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 \u0060crates/vcad-kernel-booleans/src/api.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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a793c2156fba88378046cfc5bf7b0ecd053a6265c185af1b3c8f979ccd5216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:683-691 | crates/vcad-kernel-booleans/src/trim.rs:256-266 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/classify.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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 \u0060crates/vcad-kernel-booleans/src/classify.rs:683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"997cc40829358c6e5b5b307eb0b93b6eda446b418e0c522831e0a22350864069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:1665-1675 | crates/vcad-kernel-booleans/src/classify.rs:1676-1686 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2a0485dbe9ffaf6508e7a4ae4431cd96ea71c7a2e77b2985dc31e3647ba3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:2773-2783 | crates/vcad-kernel-booleans/src/split.rs:3776-3783 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:2773\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb24055ea82306f9351e2d2aab348733c74c182dd6e7da0a5fc368cbd6c2291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:3336-3346 | crates/vcad-kernel-booleans/src/split.rs:3603-3613 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d02257def3cff76d246c1c6961c811a7ce1e6b885586a8de1faab921007504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:4031-4041 | crates/vcad-kernel-booleans/src/split.rs:4519-4526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:4031\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec16478aa13a06793328c49d7c8fd3028d43c18d44bfc25327e480c1b780e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:4850-4860 | crates/vcad-kernel-booleans/src/split.rs:5164-5172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:4850\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4850}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd76850419da2d54615ff233b6f7f3f6127911195a0dc9c0e8fab6c07c7a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5072-5080 | crates/vcad-kernel-booleans/src/split.rs:6285-6295 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5072}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bad11f3ed8a633def1ebd129935b02226cfe725097c7806e0d462609e18ba34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-cam/src/operation/contour.rs:240-250 | crates/vcad-kernel-cam/src/operation/pocket.rs:246-256 \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 \u0060crates/vcad-kernel-cam/src/operation/contour.rs:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/operation/contour.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55e70960b80f6de9814f288f3c59b8d503f2811560b5476718d2718341a74ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-diff/src/seam.rs:311-321 | crates/vcad-kernel-diff/src/second_order.rs:137-147 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-diff/src/seam.rs\u0060 and \u0060crates/vcad-kernel-diff/src/second_order.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 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 \u0060crates/vcad-kernel-diff/src/seam.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/seam.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced7a264c2b74a03eff7fb23807e87c8c4f0073ed58aaa6a9b3bbbee1762761a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): crates/vcad-kernel-diff/src/seam.rs:377-402 | crates/vcad-kernel-diff/src/second_order.rs:186-213 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-diff/src/seam.rs\u0060 and \u0060crates/vcad-kernel-diff/src/second_order.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 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 \u0060crates/vcad-kernel-diff/src/seam.rs:377\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, \u0060crates/vcad-kernel-diff/src/second_order.rs:214\u0060 calls \u0060assemble_vertex_rows_second\u0060, \u0060solve_vertex_velocity\u0060 and \u0060crates/vcad-kernel-diff/src/seam.rs:403\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":"crates/vcad-kernel-diff/src/seam.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"19859ef24b71acd1103e7d1108a1f644822af5962028988784a4d04b9e6c272d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-diff/src/seam.rs:403-413 | crates/vcad-kernel-diff/src/second_order.rs:217-227 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-diff/src/seam.rs\u0060 and \u0060crates/vcad-kernel-diff/src/second_order.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 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 \u0060crates/vcad-kernel-diff/src/seam.rs:403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/seam.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad28957c4df3da4f46a81679d5a57c891d509f8aac12aaae151ce7cd1dd141c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:659-669 | crates/vcad-kernel-em/src/planar.rs:563-573 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/vcad-kernel-em/src/planar.rs:574\u0060 calls \u0060cell_geometry\u0060 and \u0060crates/vcad-kernel-em/src/axisym.rs:670\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"20170c2a36ef35b6e7a3d2511104c72f2b243f2a861bf2222eb232e06c366680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:525-535 | crates/vcad-kernel-flow/src/adjoint.rs:650-659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-flow/src/adjoint.rs:525\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"afec351d2c183b1bd1828dcfae095ce29b6021fc69ce4ae0a90276629268d149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-flow/src/conjugate_adjoint.rs:474-484 | crates/vcad-kernel-flow/src/conjugate_adjoint.rs:509-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"928be5a504b678b195fcfee71c4c28d3059106fd90fd398a40f216f71946cdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-flow/src/gpu.rs:249-259 | crates/vcad-kernel-gpu/src/wavefront.rs:229-239 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/gpu.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/wavefront.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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 \u0060crates/vcad-kernel-flow/src/gpu.rs:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a668a531dd96e46a2bfe32a7860256e3e168b2cf7032ede600eef06332a8778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-particle/src/poisson.rs:260-273 | crates/vcad-kernel-particle/src/space_charge.rs:196-209 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-particle/src/poisson.rs\u0060 and \u0060crates/vcad-kernel-particle/src/space_charge.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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 \u0060crates/vcad-kernel-particle/src/poisson.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/poisson.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6de95ae302b7bd57d71f4ba675e7ea91ae97ad502940715228af060206f8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/vcad-kernel-particle/src/wire3d.rs:604-614 | crates/vcad-kernel-tessellate/src/clearance.rs:462-471 \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 \u0060crates/vcad-kernel-particle/src/wire3d.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":"crates/vcad-kernel-particle/src/wire3d.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6cdfc35b7d387302a22b801ce7c00787fa2aa8a80a342cc095328b9b533a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 4): crates/vcad-kernel-qcd/src/analysis.rs:142-152 | crates/vcad-kernel-shell/src/lib.rs:951-953 | crates/vcad-kernel-tessellate/src/frozen.rs:730-732 | crates/vcad-render/src/callouts.rs:263-273 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-qcd/src/analysis.rs:142\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-qcd/src/analysis.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7559e422fce20f45a18ecd659f210fe5a6b470485be1998dffe0994dc52c5741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-sheet/src/poly2d.rs:537-547 | crates/vcad-kernel-sheet/src/poly2d.rs:664-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sheet/src/poly2d.rs:537\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ab58c7c4d43c0049bd1335654fabc081f9bc9c2bdae708c21a6edf86b7588d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:1198-1208 | crates/vcad-kernel-sweep/src/sweep.rs:276-286 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/sweep.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80c1b44242e4bf35e9b430fb4a598373e4798f3dbe2dd389c8384c805c61bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:1208-1219 | crates/vcad-kernel-sweep/src/loft.rs:185-196 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/loft.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 97 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:1208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a1ba139334f65a348ced9e2b969cb05508324bef41d4194ac07e9b9057267a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/vcad-kernel-tessellate/src/clearance.rs:327-336 | crates/vcad-kernel-tessellate/src/clearance.rs:338-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 \u0060crates/vcad-kernel-tessellate/src/clearance.rs:338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f8c8b685e796f14d3544cbf91e37034f90a9627c50b775131f115fa193e818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-thermal/src/solve.rs:742-752 | crates/vcad-kernel-thermal/src/solve.rs:754-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. 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":"crates/vcad-kernel-thermal/src/solve.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ec2685caf3260aabc6beda63aae7b1bcb76d79d74a14f8112bb76764739fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:6744-6753 | crates/vcad-kernel-wasm/src/lib.rs:6780-6790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:6744\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3e97d02c688a597d9ea19a3866e9e005905145d56a213d7ba223a26d114375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-parts/src/vacuum/chambers.rs:227-237 | crates/vcad-parts/src/vacuum/chambers.rs:376-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-parts/src/vacuum/chambers.rs:227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-parts/src/vacuum/chambers.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"893dfdb17aed91242dc45910ae6f64015ff44f644c62d4df4317fe61fcc4fdec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-slicer/src/path.rs:319-329 | crates/vcad-slicer/src/path.rs:362-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-slicer/src/path.rs:319\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":"crates/vcad-slicer/src/path.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3462d34d09ef8b5da2e23b1d338cf954ccb586591a218bbe1081cd33955aaf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mecheval/graders/src/fit.rs:251-261 | mecheval/graders/src/fit.rs:263-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mecheval/graders/src/fit.rs:251\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/fit.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18d9c60d2eff86317bf73f4913ae8120781f182c14d0eb30b02e1c20270de87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mecheval/graders/src/fit.rs:323-333 | mecheval/graders/src/fit.rs:471-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":"mecheval/graders/src/fit.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f969c9f84c39578813e103d054f8ef587cf71ea0b799e51621c1580015cdb37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): crates/vcad-kernel-acoustics/src/receipt.rs:351-360 | crates/vcad-kernel-antenna/src/receipt.rs:486-495 | crates/vcad-kernel-em/src/receipt.rs:469-478 | crates/vcad-kernel-fea/src/receipt.rs:271-280 | crates/vcad-kernel-flow/src/receipt.rs:387-396 | crates/vcad-kernel-optics/src/receipt.rs:269-278 | crates/vcad-kernel-orbit/src/receipt.rs:192-201 | crates/vcad-kernel-thermal/src/receipt.rs:623-632 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-antenna/src/receipt.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-acoustics/src/receipt.rs:351\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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f76c33ccaa49c1078af378959767e9ea5c367b3bae4401ce98384b028712583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): crates/vcad-kernel-acoustics/src/optimize.rs:58-70 | crates/vcad-kernel-optics/src/optimize.rs:62-74 | crates/vcad-kernel-particle/src/optimize.rs:61-73 | crates/vcad-kernel-particle/src/optimize.rs:164-176 | crates/vcad-kernel-particle/src/optimize.rs:340-352 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-optics/src/optimize.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. 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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"78702fc1c9b0e189d2439880ed320e1e52bd89921317693dac19a26efd954ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/vcad-kernel-cam/src/post/grbl.rs:128-137 | crates/vcad-kernel-cam/src/post/grbl.rs:158-167 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:180-189 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:210-219 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-cam/src/post/grbl.rs\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-cam/src/post/grbl.rs:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"142d074672ad2ba065a8e45e64b93bb88d2a080328f2de6c388b1b4c902f29d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-cli/src/app.rs:771-780 | crates/vcad-cli/src/app.rs:812-821 | crates/vcad-cli/src/app.rs:855-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 \u0060crates/vcad-cli/src/app.rs:771\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6d66db30abb0d169ebffa2d10e1250e04a4043ca72804a12894c8bcb38c05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-eval/src/kinematics.rs:155-164 | crates/vcad-eval/src/kinematics.rs:181-190 | crates/vcad-eval/src/kinematics.rs:204-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-eval/src/kinematics.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":"crates/vcad-eval/src/kinematics.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25c8fc78db2cae9b3ad17963b47d19f1ef4668571f861a3ca071581a0149205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-eval/src/validate.rs:93-102 | crates/vcad-ir/src/lib.rs:1538-1547 | crates/vcad-ir/src/lib.rs:1590-1599 \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":"crates/vcad-eval/src/validate.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"febb5475a31ee9ba062312abcc89c1639079c1e2b83b109c1b335b9a81e51017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-ffi/src/engine.rs:100-109 | crates/vcad-ffi/src/engine.rs:160-169 | crates/vcad-ffi/src/engine.rs:331-340 \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 \u0060crates/vcad-ffi/src/engine.rs:100\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/engine.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ef602c4bd34ca8aa197656ad496075079d5959968eaf14c2802932471040cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-ffi/src/lib.rs:790-799 | crates/vcad-ffi/src/lib.rs:886-895 | crates/vcad-ffi/src/lib.rs:912-921 \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 \u0060crates/vcad-ffi/src/lib.rs:790\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"6825c6d9d20e93d72841cf76857728208f483b3240c935f017aefaaae36f8dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/vcad-kernel-fillet/src/chamfer.rs:49-62 | crates/vcad-kernel-fillet/src/fillet_curved.rs:205-218 | crates/vcad-kernel-fillet/src/fillet_planar.rs:85-98 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dead2533d73c3369c4974445fb1b976a1829cae62fd0f4cb50568e4e0d7a4610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 4): crates/vcad-kernel-fillet/src/fillet_planar.rs:274-276 | crates/vcad-kernel-sketch/src/extrude.rs:1328-1337 | crates/vcad-kernel-sweep/src/loft.rs:340-349 | crates/vcad-kernel-sweep/src/sweep.rs:419-428 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/loft.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 97 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 \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs:274\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/fillet_planar.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8ec30dd01bc9859d2e5ed55b7c0e59c2161bcafc2540fa420a1ad50a9be36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-kernel-wasm/src/lib.rs:5549-5558 | crates/vcad-kernel-wasm/src/lib.rs:5640-5649 | crates/vcad-kernel-wasm/src/lib.rs:5672-5681 \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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5549}}}],"partialFingerprints":{"codehealthFindingId/v1":"8788b9ac8aee101e0483e2ff9aeab22529d7ce335c1c7380c8464dfb80dc4f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-kernel-wasm/src/lib.rs:9330-9339 | crates/vcad-kernel-wasm/src/lib.rs:9456-9465 | crates/vcad-kernel-wasm/src/lib.rs:9648-9657 \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 \u0060crates/vcad-kernel-wasm/src/lib.rs:9330\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, \u0060crates/vcad-kernel-wasm/src/lib.rs:9645\u0060 calls \u0060from_str\u0060, \u0060map_err\u0060 and \u0060crates/vcad-kernel-wasm/src/lib.rs:9328\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":9330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75d2edf80105dc6240369166325c8bad8501094afb14fc5b8b91d711ddc6e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/vcad-chat/src/executor.rs:563-572 | crates/vcad-chat/src/executor.rs:596-603 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-chat/src/executor.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"77940c7e93f6bafb5148e3db6d3c40e2eed20e2f7446503e6c09a0034aefdd4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-cli/src/input.rs:394-403 | crates/vcad-cli/src/input.rs:441-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/input.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bc8420021e0402dfa1f8d408f5fe88079fc130b2ef2791210db59b30bc72c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-ecad-pcb/src/dfm.rs:517-525 | crates/vcad-ecad-pcb/src/drc.rs:1448-1457 \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 \u0060crates/vcad-ecad-pcb/src/dfm.rs:517\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aa6f236fd3214de9065028fb21f9fdc0a48785f01ff5fc82469ff339ef318c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ecad-pcb/src/dfm.rs:528-537 | crates/vcad-ecad-pcb/src/drc.rs:1462-1471 \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 \u0060crates/vcad-ecad-pcb/src/dfm.rs:528\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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db72d575bc1d48a4bb2624affe397846b3aa2b5c05b7c1c76b6d984409c9a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/diff_pair.rs:72-81 | crates/vcad-ecad-pcb/src/router/pair.rs:141-150 \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":"crates/vcad-ecad-pcb/src/router/diff_pair.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf6adf318a6d778b6967c614832ed6aa20a69108a72d524c1391b9680200d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/length_match.rs:116-129 | crates/vcad-ecad-pcb/src/router/length_match.rs:634-647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/length_match.rs:116\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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"55159ea9d47307aae45a3a84bef508f8d29a89889630467f5073b48f6e6271df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/pair.rs:1527-1537 | crates/vcad-ecad-pcb/src/router/pair.rs:1642-1652 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f202c69fd987b1a5d20723a045b2dbc980b8bf2231c29bfa31ad8c075ad2e769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/pair.rs:1814-1823 | crates/vcad-ecad-pcb/src/router/pair.rs:1833-1842 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"885c3439fb9f1e15f2c62b88289ed6d7ea3ac6b59f679ab13c98b89a4d5eb29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:902-911 | crates/vcad-ecad-pcb/src/router/sco.rs:943-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 \u0060crates/vcad-ecad-pcb/src/router/sco.rs:902\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-ecad-pcb/src/router/sco.rs:916\u0060 calls \u0060cholesky_apply\u0060 and \u0060crates/vcad-ecad-pcb/src/router/sco.rs:953\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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4bbafbda8028ccfbec43941a3b8e03ace19fef6b54abfc216d8f1ee0c14648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_pcb.rs:625-634 | crates/vcad-ecad-symbols/src/kicad_pcb.rs:638-647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/kicad_pcb.rs:625\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72c2209f04e96ff9132be6cc8dbdcedbdf08c6912dd4079952175e80b4f49a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ir/src/constraints.rs:315-324 | crates/vcad-ir/src/constraints.rs:329-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. 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":"crates/vcad-ir/src/constraints.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b09865447024d4075cb8eabe56d7c1269336b74f2ad53c5d219049a9396c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-acoustics/src/linalg.rs:70-79 | crates/vcad-kernel-antenna/src/linalg.rs:90-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-acoustics/src/linalg.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/linalg.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1903276629b093bd5b996bef9e332b39d26e33836bf4c45a486171b8bb5b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-acoustics/src/strike.rs:226-235 | crates/vcad-kernel-acoustics/src/strike.rs:237-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d278425a91df699873af2df099577819a51d331d3e791d2d1da6bb1fc1452ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-atoms/src/inspect.rs:49-58 | crates/vcad-kernel-atoms/src/inspect.rs:67-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-atoms/src/inspect.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-atoms/src/inspect.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e702e89912a0d70bbcebe5d26b6bc76137db65b3bb3c10058add4e1f6d3eaa9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:918-927 | crates/vcad-kernel-booleans/src/trim.rs:541-548 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/classify.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54db0ade930a584de0a0679bfc9a785fcf8ac6184a6cd72b1171917f84d216c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/cyl_band.rs:1312-1321 | crates/vcad-kernel-booleans/src/cyl_band.rs:2544-2553 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5ef07b8293b64a44057fa45cb9826ba27d6cbd7fd83929330cfe1f062bc31c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/vcad-kernel-booleans/src/no_crossing.rs:191-201 | crates/vcad-kernel-booleans/src/no_crossing.rs:203-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/no_crossing.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. 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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"894b54bd852efb5f93ac731e8acf7c64f6048a614bc3959cea7be09788b0f036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:2198-2210 | crates/vcad-kernel-booleans/src/split.rs:3763-3772 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"655326cf8591f36cd7bd2e95acc2c2e54014780b69439a2b74e6a4d97508c4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:3322-3331 | crates/vcad-kernel-booleans/src/split.rs:3574-3583 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dad637801c57258ad10b3b0ee214acfce2161ac9bcd3e526b6e0139fd14c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:4903-4912 | crates/vcad-kernel-booleans/src/split.rs:6119-6128 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4903}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69e46431d3de05cc09ca25b24d8ea3b7bc1ed9a6a077e6635f112d79143af41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5585-5597 | crates/vcad-kernel-booleans/src/split.rs:6092-6101 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5585}}}],"partialFingerprints":{"codehealthFindingId/v1":"6134ed78dc742204523a13821b416c8538af987b5de3c40e706cda29fb5ec327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/trim.rs:190-199 | crates/vcad-kernel-booleans/src/trim.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 \u0060crates/vcad-kernel-booleans/src/trim.rs:190\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6737f5f65bd724a0c5aa42801a0190aec6a21bae658f732ddfb5925fce4018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-cam/src/operation/contour.rs:117-126 | crates/vcad-kernel-cam/src/operation/pocket.rs:59-68 \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":"crates/vcad-kernel-cam/src/operation/contour.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c0a9376f827d0a0771bf1251d0ae2b4897596450fa165b2d0832865ade38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-cam/src/turning/geom.rs:99-108 | crates/vcad-kernel-cam/src/turning/geom.rs:111-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-cam/src/turning/geom.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":"crates/vcad-kernel-cam/src/turning/geom.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4625755ef73c5494c0f73865562782425ac8024c7ec94a9e09b7fb250df7f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-dfm/src/geom/probe.rs:351-359 | crates/vcad-kernel-raytrace/src/intersect/triangle.rs:63-72 \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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b53f88e49211a003b284b5e718e4fedc2c6dbafb31ba110ca38af2677f8b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-dfm/src/rules/casting.rs:34-42 | crates/vcad-kernel-dfm/src/rules/mold.rs:26-35 \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 \u0060crates/vcad-kernel-dfm/src/rules/casting.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/casting.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6d8914746a23ff018ffb41493ffacce2dc8a71a58b30e2bbef1e8a2259ff09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-diff/src/adjoint.rs:285-295 | crates/vcad-kernel-diff/src/second_order.rs:183-193 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-diff/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-diff/src/second_order.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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":"crates/vcad-kernel-diff/src/adjoint.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"be12dc3ca04005a4ca4918a58a88f33b89a8763cc49990429fef8d22ecef1fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/vcad-kernel-diff/src/implicit.rs:105-112 | crates/vcad-kernel-geom/src/lib.rs:1624-1633 \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":"crates/vcad-kernel-diff/src/implicit.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bc448a0d6523d153d38a81c76b5877f90f30502b438634dc5ab52adb14d95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:861-874 | crates/vcad-kernel-em/src/axisym.rs:890-903 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/axisym.rs:861\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f0e8b669f07463b3a99786f0150aeb17551ebc0db27071f7742f14f8adb64f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-fea/src/buckling.rs:441-450 | crates/vcad-kernel-fea/src/modal.rs:207-215 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/buckling.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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. 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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"971aed1f598e95b0f8da73b080c8a991b5accb394520eb92c6448d24ab37083c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-fea/src/graph.rs:331-340 | crates/vcad-kernel-thermal/src/graph.rs:384-392 \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 \u0060crates/vcad-kernel-fea/src/graph.rs:331\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"92aa0c9d19b468b322431e7d1cb5f94730b5d9c80626b4ee5640bc141ea27964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/vcad-kernel-primitives/src/lib.rs:113-122 | crates/vcad-kernel-primitives/src/lib.rs:330-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f31025ad2d8e2e34905c975e74e4c34d489cdb28253d188cd1aade55dbec2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u201310 lines \u00D7 8): crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:86-86 | crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:87-96 | crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:97-98 | crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:100-101 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:161-161 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:162-170 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:171-172 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:174-175 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-raytrace/src/intersect/bilinear.rs\u0060 and \u0060crates/vcad-kernel-raytrace/src/intersect/bspline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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. 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":"crates/vcad-kernel-raytrace/src/intersect/bilinear.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f40317e8f3d9cfd2920cfaf297f4dacfeb8f4c14577a318051297b94dd62cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:105-114 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:179-188 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-raytrace/src/intersect/bilinear.rs\u0060 and \u0060crates/vcad-kernel-raytrace/src/intersect/bspline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"crates/vcad-kernel-raytrace/src/intersect/bilinear.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"340a7f4c2815a9a4a405fc6581e2a4c46079a5b93fb1e757bae3e1dbce690130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-sheet/src/poly2d.rs:111-120 | crates/vcad-kernel-sheet/src/unfold.rs:362-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. 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":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d48317c1df022467e44d9e818e25a485ab4811a257d156a1062b47c4755f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:1180-1189 | crates/vcad-kernel-sweep/src/sweep.rs:245-254 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/sweep.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:1180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b71d3295c86145120b540f834d76a8319d7a13861ecc7518e72e4f13f72818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-tessellate/src/clearance.rs:646-655 | crates/vcad-kernel-tessellate/src/clearance.rs:720-729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/clearance.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":"crates/vcad-kernel-tessellate/src/clearance.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"add8e8e4d452a474f1ab4fd75208e130ec282182ab4b672352defc30e1d428d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:1019-1028 | crates/vcad-kernel-tessellate/src/lib.rs:1256-1264 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd122a9ce69ca88bc2b6b2d95616ad942030eb632f97bcfb6279b987ab9b0c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:2618-2627 | crates/vcad-kernel-tessellate/src/lib.rs:4103-4112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:2618\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65dc26aeb37ac0dd4cbd2cae613d8eb68947c4969500fed815115ac09f88b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:4678-4687 | crates/vcad-kernel-tessellate/src/lib.rs:4910-4919 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4678}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee88b4760f48b0ad7b03bc1d86bb4de9654b621bcc0e3a0eb5b3545394201767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:4777-4787 | crates/vcad-kernel-tessellate/src/lib.rs:6863-6874 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4f872db0d1c6d73ed526020e75c0a7cc5616b1f2234fee03a02cf3e89e63ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-thermal/src/adjoint.rs:270-279 | crates/vcad-kernel-thermal/src/graph.rs:241-250 \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 \u0060crates/vcad-kernel-thermal/src/adjoint.rs:270\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":"crates/vcad-kernel-thermal/src/adjoint.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a7071b76f8d4031361f10864633e3c7bddf1e2aa2cf4d9341bfdad1ec384f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-wasm/src/circuit_sim.rs:853-862 | crates/vcad-kernel-wasm/src/circuit_sim.rs:903-911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/circuit_sim.rs:853\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/circuit_sim.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adf0d566a2c91824874eef4292bac057e4999497b916d757c6e69b65e603224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:5473-5482 | crates/vcad-kernel-wasm/src/lib.rs:5502-5510 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5473}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3e789e2809cae76f9ac9d8c5e67a5bcab977367479bddb8e797cf273300fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:10396-10405 | crates/vcad-kernel-wasm/src/lib.rs:10480-10489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:10396\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36c5d1c6ada836451089af9a08bc3044204dd0b1cf75980ad2b55ee569e9300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u201310 lines \u00D7 3): crates/vcad-render/src/lib.rs:2911-2911 | crates/vcad-render/src/lib.rs:4184-4193 | crates/vcad-render/src/lib.rs:4220-4225 \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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":2911}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d3a8e087cec377a3dcc505435a90921d9887d5bcd5933af8fb91bf4ba4f5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-render/src/main.rs:1244-1253 | crates/vcad-render/src/main.rs:1351-1360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-render/src/main.rs:1244\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":"crates/vcad-render/src/main.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2f39c45a1d18463b2f12181a533c642edac336f434d3e32970279dac5bb2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 9): crates/vcad-kernel-booleans/src/split.rs:1525-1532 | crates/vcad-kernel-booleans/src/split.rs:1770-1778 | crates/vcad-kernel-booleans/src/split.rs:1798-1806 | crates/vcad-kernel-booleans/src/split.rs:3067-3074 | crates/vcad-kernel-booleans/src/split.rs:3081-3088 | crates/vcad-kernel-booleans/src/split.rs:5084-5089 | crates/vcad-kernel-booleans/src/split.rs:6302-6307 | crates/vcad-kernel-booleans/src/split.rs:6826-6831 | crates/vcad-kernel-booleans/src/split.rs:6842-6847 \u2014 all 9 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"786e56fd7f7aad0a15acad51ff844259d6a4e2a46ac60f4545f4cda83c35e4df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 9): crates/vcad-kernel-constraints/src/residual.rs:50-55 | crates/vcad-kernel-constraints/src/residual.rs:67-72 | crates/vcad-kernel-constraints/src/residual.rs:103-111 | crates/vcad-kernel-constraints/src/residual.rs:254-259 | crates/vcad-kernel-constraints/src/symbolic.rs:297-302 | crates/vcad-kernel-constraints/src/symbolic.rs:310-315 | crates/vcad-kernel-constraints/src/symbolic.rs:338-343 | crates/vcad-kernel-constraints/src/symbolic.rs:351-356 | crates/vcad-kernel-constraints/src/symbolic.rs:484-489 \u2014 there are 9 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 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2520c44c8646949c512b82531c523fc3193277786c3d79c94b08a5acb67b9907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/vcad-kernel-acoustics/src/receipt.rs:261-269 | crates/vcad-kernel-em/src/receipt.rs:370-378 | crates/vcad-kernel-flow/src/receipt.rs:284-292 | crates/vcad-kernel-neutronics/src/receipt.rs:305-313 | crates/vcad-kernel-particle/src/receipt.rs:378-386 | crates/vcad-kernel-thermal/src/receipt.rs:424-432 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-em/src/receipt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 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 \u0060crates/vcad-kernel-acoustics/src/receipt.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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be7ad0177d274d5ba9150e363017537af1eea5ede52ed627ef01ab9ffad488e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 5): crates/vcad-ecad-sim/src/circuit/adjoint.rs:179-186 | crates/vcad-ecad-sim/src/circuit/dc.rs:198-205 | crates/vcad-ecad-sim/src/circuit/devices.rs:582-589 | crates/vcad-ecad-sim/src/circuit/devices.rs:605-612 | crates/vcad-ecad-sim/src/circuit/transient_adjoint.rs:432-440 \u2014 there are 5 copies across 4 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":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d2764dbe4957714b6f303d74b302256081a06fa984e333d71049e02ae7ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/vcad-kernel-tessellate/src/lib.rs:5277-5285 | crates/vcad-kernel-tessellate/src/lib.rs:6094-6102 | crates/vcad-kernel-tessellate/src/lib.rs:6214-6222 | crates/vcad-kernel-tessellate/src/lib.rs:6513-6521 | crates/vcad-kernel-tessellate/src/lib.rs:6778-6786 \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 \u0060crates/vcad-kernel-tessellate/src/lib.rs:5277\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-tessellate/src/lib.rs:6524\u0060 calls \u0060align_winding_to_normals\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs:6104\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7770d30268e5b72160207c63ecf644c0cae9053028197f109509ec54ed54933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/vcad-ir/src/vcode.rs:1096-1104 | crates/vcad-ir/src/vcode.rs:1202-1210 | crates/vcad-ir/src/vcode.rs:1234-1242 | crates/vcad-ir/src/vcode.rs:1260-1268 \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 \u0060crates/vcad-ir/src/vcode.rs:1096\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f098ae10934d9896985d177a56e1e03d053364d06136c85b6624ebe46640683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/vcad-kernel-tessellate/src/lib.rs:841-849 | crates/vcad-kernel-tessellate/src/lib.rs:947-955 | crates/vcad-kernel-tessellate/src/lib.rs:1792-1800 | crates/vcad-kernel-tessellate/src/lib.rs:8724-8732 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060mesh\u0060 to \u0060\u0026TriangleMesh\u0060 in one and \u0060\u0026mut TriangleMesh\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, \u0060crates/vcad-kernel-tessellate/src/lib.rs:8723\u0060 calls \u0060drop_exact_duplicate_triangles\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs:839\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9ac856b42579c70dd0037110a0ecefd37284bd1e559974d1de5395daa6af67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-cli/src/main.rs:1472-1480 | crates/vcad-cli/src/main.rs:3393-3401 | crates/vcad-cli/src/main.rs:3586-3594 \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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc122ad077946fd95f5f29e08f66693cc801937f79f18bab9f1eb86f8e81fa04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-ecad-package/src/derive.rs:102-110 | crates/vcad-ecad-symbols/src/builtin.rs:16-24 | crates/vcad-ecad-symbols/src/footprint.rs:62-70 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-symbols/src/builtin.rs\u0060 and \u0060crates/vcad-ecad-symbols/src/footprint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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":"crates/vcad-ecad-package/src/derive.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"effac8ab7a554e761dd0990d3532ebbe3103a0cd55398a505b8164f686fb196c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/vcad-ecad-sim/src/circuit/ac.rs:190-198 | crates/vcad-ecad-sim/src/circuit/ac.rs:312-319 | crates/vcad-ecad-sim/src/circuit/devices.rs:375-383 \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 \u0060crates/vcad-ecad-sim/src/circuit/ac.rs:190\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060g\u0060 to \u0060Cplx\u0060 in one and \u0060f64\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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3695a442e112da3bad2b8f9e65228b3dba7ba13786c350a60953eb48aef80a37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-eval/src/cavity_extract.rs:326-334 | crates/vcad-eval/src/sim_extract.rs:353-362 | crates/vcad-eval/src/thermal_extract.rs:572-580 \u2014 before extracting anything, compare \u0060crates/vcad-eval/src/cavity_extract.rs\u0060 and \u0060crates/vcad-eval/src/sim_extract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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 \u0060crates/vcad-eval/src/cavity_extract.rs:326\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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"30957b92812cd278c9ceeb0bf0762ebdbbff9ecf10eb832c1ca36167fcb4860d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-acoustics/src/optimize.rs:83-91 | crates/vcad-kernel-optics/src/optimize.rs:95-103 | crates/vcad-kernel-particle/src/optimize.rs:86-94 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-optics/src/optimize.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. 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 \u0060crates/vcad-kernel-acoustics/src/optimize.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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f2c388f649cfa56ec8d35f94792108bf747f92426d1c9f95d947558ad10263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-booleans/src/split.rs:803-811 | crates/vcad-kernel-booleans/src/split.rs:3127-3135 | crates/vcad-kernel-booleans/src/split.rs:3487-3495 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:803\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d21e20262857a932b42f7c36ceadd9a101f3d3bb6edab4e5b7354d441e8124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-fea/src/mesh.rs:129-137 | crates/vcad-kernel-fea/src/mesh.rs:562-570 | crates/vcad-kernel-topopt/src/domain.rs:91-99 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/mesh.rs\u0060 and \u0060crates/vcad-kernel-topopt/src/domain.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 before the matched lines, \u0060crates/vcad-kernel-fea/src/mesh.rs:561\u0060 calls \u0060clamp\u0060 and \u0060crates/vcad-kernel-fea/src/mesh.rs:128\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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f1be75f022e4795fa7f86c1cc436bf9434260204dbda0c37634bb7b96f864a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-features/src/lib.rs:176-184 | mecheval/graders/src/fillets.rs:53-61 | mecheval/graders/src/holes.rs:78-86 \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. 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":"crates/vcad-kernel-features/src/lib.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44e1e70e3ffa89c438f3a448f1d6628bf2deceb303e01b7139dddfcf5a1b497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20139 lines \u00D7 7): crates/vcad-kernel-booleans/src/mesh/csg.rs:97-99 | crates/vcad-kernel-fillet/src/fillet_planar.rs:270-272 | crates/vcad-kernel-shell/src/lib.rs:906-908 | crates/vcad-kernel-sketch/src/extrude.rs:1318-1326 | crates/vcad-kernel-sweep/src/loft.rs:330-338 | crates/vcad-kernel-sweep/src/sweep.rs:409-417 | crates/vcad-kernel-tessellate/src/lib.rs:2905-2906 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060crates/vcad-kernel-booleans/src/mesh/csg.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060verts\u0060 to \u0060Vec\u003CPoint3\u003E\u0060 in one and \u0060\u0026[Point3]\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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3391c1214e97c3e1e91583d0652ccb137a73adeb2317fb2c7a521901c8978b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:5257-5265 | crates/vcad-kernel-tessellate/src/lib.rs:5289-5297 | crates/vcad-kernel-tessellate/src/lib.rs:6195-6203 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5257}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f0d37c9c48ccf64c05e7f23c52fd2b7ad4c95d049ee23e8f7f1d7478725e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-thermal/src/adjoint.rs:268-276 | crates/vcad-kernel-thermal/src/graph.rs:239-247 | crates/vcad-kernel-thermal/src/solve.rs:721-729 \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":"crates/vcad-kernel-thermal/src/adjoint.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"90efd098cb026c8441e8baf75dab27115001dd254ce1014384377d75a6cbabe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-ecad-export/src/gerber.rs:683-694 | crates/vcad-ecad-export/src/gerber.rs:809-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-export/src/gerber.rs:683\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8639686cb99c62d580ca43ff8854d49a135582e7dcda9b8c3ec0e0024585acc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ecad-export/src/gerber.rs:737-747 | crates/vcad-ecad-export/src/gerber.rs:778-788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-export/src/gerber.rs:737\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df693597b48f7acb5a16f65935258a610445cc0c71d980d55381f40ee97de31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/flow/route.rs:952-960 | crates/vcad-ecad-pcb/src/router/flow/route.rs:1200-1208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/flow/route.rs:952\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"546fc0dfd1a5ab882a28234ea05a203c321c17e99f35e2aa3119295a41b22219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/gpu_bridge.rs:51-59 | crates/vcad-ecad-pcb/src/router/gpu_bridge.rs:85-93 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/router/gpu_bridge.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dd1b5da6185dd4511f12e82b1f33cf661a51b95829b70be16824855f74a60e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/pair.rs:92-100 | crates/vcad-ecad-pcb/src/router/si_claims.rs:249-256 \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 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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bd00f1591156dc4ed9e244822fae593cb20421ca596c0f064ca144dcb7ff4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:310-317 | crates/vcad-ecad-pcb/src/router/sco.rs:547-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/sco.rs:310\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-ecad-pcb/src/router/sco.rs:320\u0060 calls \u0060include\u0060 and \u0060crates/vcad-ecad-pcb/src/router/sco.rs:558\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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb672d69fc87f0a7a5f6176f18f45a348e7d65069295941065e914476c2743da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:321-329 | crates/vcad-ecad-pcb/src/router/sco.rs:558-566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/sco.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-ecad-pcb/src/router/sco.rs:320\u0060 calls \u0060include\u0060 and \u0060crates/vcad-ecad-pcb/src/router/sco.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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ffc5b22d700659428aff79f26cf0834cff1474ba11b35f9e56c9d615a515ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-schematic/src/erc.rs:178-186 | crates/vcad-ecad-schematic/src/erc.rs:288-296 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-schematic/src/erc.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f03b8add79688742f0e079eac9ee2364e10a0d5d1e982fde73ce328ee38b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-sim/src/circuit/ac.rs:176-184 | crates/vcad-ecad-sim/src/circuit/linalg.rs:56-64 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-sim/src/circuit/ac.rs\u0060 and \u0060crates/vcad-ecad-sim/src/circuit/linalg.rs\u0060 as WHOLE FILES: this scan already matched 5 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. 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 \u0060crates/vcad-ecad-sim/src/circuit/ac.rs:176\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 \u0060a\u0060 to \u0060\u0026mut [Cplx]\u0060 in one and \u0060\u0026mut [f64]\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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"979e4975a3e17d068894e6067727bf71d90255c48f9745a9d7e20251ee820333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-symbols/src/builtin.rs:131-139 | crates/vcad-ecad-symbols/src/builtin.rs:207-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/builtin.rs:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a637d61b3c3a1b3b7c9a47fbfc62b98a024dc7ea32407eb927e029d50b907e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:141-149 | crates/vcad-eval/src/evaluate.rs:826-834 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7514ccc5e21b053d4155a8d0aede200342e1bc702c2583c1497656ab2e1962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:2698-2706 | crates/vcad-kernel-tessellate/src/placement.rs:30-38 \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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd23f6bd8fdc024242ce45b436db04c95fc23cf091561481ba0fbbc347d15f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-eval/src/sim_extract.rs:305-313 | crates/vcad-eval/src/thermal_extract.rs:531-538 \u2014 before extracting anything, compare \u0060crates/vcad-eval/src/sim_extract.rs\u0060 and \u0060crates/vcad-eval/src/thermal_extract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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 \u0060crates/vcad-eval/src/sim_extract.rs:305\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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea0049c9840d083cc3b48ba4718d39f861f4e42166df2d5034a6a7e41f1542a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ffi/src/import.rs:214-222 | crates/vcad-ffi/src/lib.rs:3615-3623 \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 \u0060crates/vcad-ffi/src/import.rs:214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/import.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c47a139e6365366d2632d256ea39bdf9770bb0b89fd306546098bd5475151d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ffi/src/lib.rs:483-491 | crates/vcad-ffi/src/lib.rs:552-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/lib.rs:483\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abe4fec1076de6587cefe4efcfe734faaf976d8f28d1ab7173b4d724f893235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-ir/src/gear.rs:362-369 | crates/vcad-parts/src/builder.rs:164-172 \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 \u0060crates/vcad-ir/src/gear.rs:362\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"crates/vcad-ir/src/gear.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2179a27953cb5bbea8875361051e64d8aeb8cb14aad12920de0b09a8df43c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ir/src/lib.rs:1535-1543 | crates/vcad-ir/src/vcode.rs:2311-2319 \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":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3db6c743dd0524883299bbdb0cb0dba293370a7295920a7f52bf9ef6e6b196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:592-600 | crates/vcad-kernel-booleans/src/classify.rs:818-826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/classify.rs:592\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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df6fb0290296743dad6a06bc1b674559db32baa98d9176e9bd2daf7995cfea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:124-133 | crates/vcad-kernel-booleans/src/pipeline.rs:143-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:124\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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"670ee4a77cd86594d5275cede2caaa0006da2eac1c4fff53d9fb4b6547116b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-booleans/src/repair.rs:301-309 | crates/vcad-kernel-booleans/src/repair.rs:331-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 \u0060crates/vcad-kernel-booleans/src/repair.rs:301\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1c650860e0faf9eb62b9ef222d3e8a6202d07cda118938fdee044e67ad26fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1721-1729 | crates/vcad-kernel-tessellate/src/lib.rs:2968-2976 \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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea379f59f0290148a185326ea774b65ab8b4713c0283dec2550726f4a07e0e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:2937-2945 | crates/vcad-kernel-booleans/src/trim.rs:1067-1075 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/split.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/vcad-kernel-booleans/src/split.rs:2937\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"1338a0a61dab0bdfae89afe0a2b9df014fcf2d95f66e87a7f359245a75d398af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:7180-7188 | crates/vcad-kernel-booleans/src/split.rs:7225-7233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:7180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":7180}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c6f1f10154594190d021ef00d209ffae11b82f078b7a9738b1a60ec0155d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-booleans/src/trim.rs:330-338 | crates/vcad-kernel-booleans/src/trim.rs:499-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/trim.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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8986b801e13a965de500391f6822002cd39545e7d7456e62e3680e90d3664e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-kernel-cam/src/dropcutter/ball.rs:101-109 | crates/vcad-kernel-cam/src/dropcutter/bull.rs:212-219 \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":"crates/vcad-kernel-cam/src/dropcutter/ball.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca0073902224309e304e773ca4fe82e9fc478ccc519791ab2f7d1deb1569cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-constraints/src/residual.rs:33-41 | crates/vcad-kernel-constraints/src/residual.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 \u0060crates/vcad-kernel-constraints/src/residual.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. 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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"78038d859f48be71ba335657cb5c7a2c547de2cfbb600c2b99f9fee9ce48a70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): crates/vcad-kernel-diff/src/adjoint.rs:366-369 | crates/vcad-kernel-diff/src/seam.rs:440-448 | crates/vcad-kernel-diff/src/second_order.rs:254-262 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-diff/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-diff/src/seam.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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. 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":"crates/vcad-kernel-diff/src/adjoint.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cca392d18ac37064aa9133d447ddb6acf54de242f6e1e5546dacd97fac772dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-drafting/src/edge_extract.rs:147-155 | crates/vcad-kernel-drafting/src/edge_extract.rs: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 \u0060crates/vcad-kernel-drafting/src/edge_extract.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/edge_extract.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b41d7d45a3dcbd4d102f8758d37a05ae1c18d795495429407a01ec325bbe0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-drafting/src/edge_extract.rs:186-194 | crates/vcad-kernel-drafting/src/edge_extract.rs:232-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-drafting/src/edge_extract.rs:186\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/edge_extract.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad473a098fb7e386fe3488b6a7d2cd149158ccf0d4147e1e4fed61063b038d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-kernel-drafting/src/section.rs:477-485 | crates/vcad-kernel-drafting/src/section.rs:493-500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-drafting/src/section.rs:477\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"844ef515c04fed1534113a77cc0aecf3816f3eb27be83133b590d5b27bdcf803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-drafting/src/sheet.rs:640-649 | crates/vcad-kernel-drafting/src/sheet.rs:692-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-drafting/src/sheet.rs:640\u0060 it begins part-way through the construct above it, so those exact 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 \u0060view\u0060 to \u0060\u0026ProjectedView\u0060 in one and \u0060\u0026DetailView\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":"crates/vcad-kernel-drafting/src/sheet.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"93955b91aab4613c1acd834754965006de33d034bf8d7a3b372b02dc8d01732c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-fea/src/buckling.rs:885-893 | crates/vcad-kernel-fea/src/modal.rs:395-403 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/buckling.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"112b80854e69ac90f08d45ad167ac76dbe1e54d10c28ee0777411b5158ed2099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-fillet/src/topology.rs:179-189 | crates/vcad-kernel-shell/src/lib.rs:1331-1341 \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 \u0060crates/vcad-kernel-fillet/src/topology.rs:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/topology.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6bdf58dfc68dd779c8b4ebeb42f0f36d4e447b600c1eeef197979822a65515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-fillet/src/topology.rs:194-202 | crates/vcad-kernel-shell/src/lib.rs:1354-1362 \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 \u0060crates/vcad-kernel-fillet/src/topology.rs:194\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":"crates/vcad-kernel-fillet/src/topology.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d6d3ff066043f77d373f04dedba04934873f94e59be31d08b6848c4a8258da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:146-153 | crates/vcad-kernel-flow/src/solve.rs:192-200 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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. 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"178329e97dcf3d2a6f5e7c290e63d7e96ccce163cbe31fe1af2883a97bed5f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:184-192 | crates/vcad-kernel-flow/src/solve.rs:301-306 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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 \u0060crates/vcad-kernel-flow/src/adjoint.rs:184\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"163c3b7c2502d0a1102d76515334792b0ab33ef808b51dd704d000c14250e982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:203-211 | crates/vcad-kernel-flow/src/solve.rs:321-329 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b7cc198a72f22e216d96529f48fa016b3a6ec677703dc482d8983763e1d4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:268-290 | crates/vcad-kernel-flow/src/solve.rs:404-426 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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 \u0060crates/vcad-kernel-flow/src/adjoint.rs:268\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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"faccee7f18d5babaa381a66d06ed06d803791caf69bd81ff2e2421262254ae31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-particle/src/poisson.rs:275-283 | crates/vcad-kernel-particle/src/space_charge.rs:211-219 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-particle/src/poisson.rs\u0060 and \u0060crates/vcad-kernel-particle/src/space_charge.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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 \u0060crates/vcad-kernel-particle/src/poisson.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":"crates/vcad-kernel-particle/src/poisson.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e44611f5fac235c7803dee06fe1ad5d1dd928e0ab4e7cdf17598502d789174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-kernel-particle/src/wire3d.rs:594-601 | crates/vcad-kernel-tessellate/src/clearance.rs:451-459 \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 \u0060crates/vcad-kernel-particle/src/wire3d.rs:594\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/wire3d.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"637ef3c81bb74c8f54818c44808218923ea08969f668d0aaddbb1cd4f2d1dc4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-physics/src/diff.rs:413-422 | crates/vcad-kernel-physics/src/diff.rs:596-605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-physics/src/diff.rs:413\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5833e0d1fab494ebaab7f46502923e46299e62e0be460eb2fe6d801bd57ae1da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-primitives/src/lib.rs:440-448 | crates/vcad-kernel-primitives/src/lib.rs:617-625 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ac660f72bb15ca628b53cfdd2d76d5e97f33d48896ade152d85fa3dbfd403d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-primitives/src/lib.rs:459-467 | crates/vcad-kernel-primitives/src/lib.rs:697-705 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb35672b4bf7b5016b3f9e499bcf45c79a2312e766b07ab5bed103d360045b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-kernel-raytrace/src/cpu.rs:106-114 | crates/vcad-kernel-raytrace/src/cpu.rs:541-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-raytrace/src/cpu.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a735e349c201073c44fdbbb206320b583200c9a5ebdda39db9a481c7865f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-raytrace/src/cpu.rs:143-152 | crates/vcad-kernel-raytrace/src/cpu.rs:573-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-raytrace/src/cpu.rs:143\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":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd9c35934cf262809f9d5e4f7ba7c04281041bec6c8c1918c83dc09e05f49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-step/src/entities/geometry.rs:123-131 | crates/vcad-kernel-step/src/entities/geometry.rs:151-159 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-step/src/entities/geometry.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2ab037dac9b7a0a5f3c9f07a424f4c342a55972128307edb3e3281f4ae420d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:925-933 | crates/vcad-kernel-tessellate/src/lib.rs:1464-1472 \u2014 both copies are in the same file, so extract the block 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 \u0060mesh\u0060 to \u0060\u0026TriangleMesh\u0060 in one and \u0060\u0026mut TriangleMesh\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473855e24648aca9de1443ce2017265db70271cd2aaa40e20249ff41d6f6d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:4709-4721 | crates/vcad-kernel-tessellate/src/lib.rs:5022-5034 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4709}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f87d9be880369734072286de1f32354d83d58f25a00a101aaa539a587be880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-urdf/src/reader.rs:242-250 | crates/vcad-kernel-urdf/src/reader.rs:253-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 \u0060crates/vcad-kernel-urdf/src/reader.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":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4425c9400ea5ca452a684785f7fe72b85da30f73769471ffe86ca8e5cca454f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-urdf/src/writer.rs:459-467 | crates/vcad-kernel-urdf/src/writer.rs:477-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 \u0060crates/vcad-kernel-urdf/src/writer.rs:459\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":"crates/vcad-kernel-urdf/src/writer.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1617a90ee12ce406f5d4416715e0bfbbff64be6c9dcccdff1447b2d7224637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:1917-1925 | crates/vcad-site-wasm/src/lib.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef8068c51fb5c907147ef7c6c3651e2f60a640c7448cfecf7d2eb5aeabe38e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel/src/lib.rs:2994-3002 | crates/vcad-kernel/src/lib.rs:3013-3021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel/src/lib.rs:2994\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"45283fc00ad822506522dec7ae10670ef5a8aa4cd6455ddec93fb93bad50117f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel/src/lib.rs:3159-3167 | crates/vcad-kernel/src/lib.rs:3168-3176 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40b50012eafe08577581828c53969672515f96367f8634b2f31807ac39d4fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel/src/sheet_json.rs:322-330 | crates/vcad-kernel/src/sheet_json.rs:385-393 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-kernel/src/sheet_json.rs:331\u0060 calls \u0060flat_pattern_to_dto\u0060, \u0060summarise_model\u0060 and \u0060crates/vcad-kernel/src/sheet_json.rs:394\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecadc3cc8b832d3294e9e39907f7b2f693bd5efe23d10b32ebd759c046c6aba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-loon/src/convert.rs:2886-2894 | crates/vcad-loon/src/convert.rs:2940-2948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/convert.rs:2886\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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba1d65f4a3f3fbd11bca6688c5211c26376fac215bdb055be3b3eefecc90cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-mcp/src/server.rs:1122-1129 | crates/vcad-mcp/src/server.rs:1134-1142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-mcp/src/server.rs:1122\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62055a0aa6ea453b6018bd43d264adee764353640f041379663321cebb9c75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-mcp/src/transport.rs:272-281 | crates/vcad-mcp/src/transport.rs:365-374 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-mcp/src/transport.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f44f77e7b49648b0db269a13f9ef5a20dac9d53f7a1f6c99debca5781fdaaa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 3): crates/vcad-render/src/callouts.rs:134-136 | crates/vcad-render/src/exact.rs:176-184 | crates/vcad-render/src/exact.rs:205-213 \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 \u0060crates/vcad-render/src/callouts.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":"crates/vcad-render/src/callouts.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8656061853e9723987cd90f1f2d717424e994805a00ffda47b96d6f09801066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-render/src/lib.rs:4327-4335 | crates/vcad-render/src/lib.rs:5451-5459 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-render/src/lib.rs:5450\u0060 calls \u0060palette\u0060 and \u0060crates/vcad-render/src/lib.rs:4326\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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4327}}}],"partialFingerprints":{"codehealthFindingId/v1":"22258fab5fe1f472d0f525a40a267cc54db60e2a6400e0d4b6b90112a8ad6c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/vcad-render/src/photoreal.rs:800-808 | crates/vcad-render/src/photoreal_gpu.rs:458-464 \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 \u0060crates/vcad-render/src/photoreal.rs:800\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/photoreal.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"7108a54ebea3ca25cbd256c8dc94c31c63c2d3cc105aee2acbf2939ac6701eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mecheval/graders/src/pcb.rs:191-199 | mecheval/graders/src/pcb.rs:549-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mecheval/graders/src/pcb.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. 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 \u0060snapshot\u0060 to \u0060\u0026EvalSnapshot) -\u003E (CheckOutcome\u0060 in one and \u0060\u0026EvalSnapshot\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":"mecheval/graders/src/pcb.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"af477df947a3b15afc28b59e414ee7dda1233270edaaee45f351391cd81c7b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 6): crates/vcad-kernel-sketch/src/extrude.rs:1302-1308 | crates/vcad-kernel-sketch/src/extrude.rs:1445-1452 | crates/vcad-kernel-sketch/src/revolve.rs:568-573 | crates/vcad-kernel-sketch/src/revolve.rs:619-625 | crates/vcad-kernel-sweep/src/loft.rs:275-282 | crates/vcad-kernel-sweep/src/sweep.rs:379-386 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:1302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"149352dadd95dbd174822a415e239c03540e91f1cf10ed2a4a87a6bf82075f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/vcad-kernel-wasm/src/lib.rs:8856-8863 | crates/vcad-kernel-wasm/src/lib.rs:8983-8990 | crates/vcad-kernel-wasm/src/lib.rs:9181-9188 | crates/vcad-kernel-wasm/src/lib.rs:9335-9342 | crates/vcad-kernel-wasm/src/lib.rs:9653-9660 \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 \u0060crates/vcad-kernel-wasm/src/lib.rs:8856\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, \u0060crates/vcad-kernel-wasm/src/lib.rs:9662\u0060 calls \u0060resolve\u0060, \u0060map_err\u0060, \u0060to_string\u0060 and \u0060crates/vcad-kernel-wasm/src/lib.rs:9343\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00c90fba1341e3b51742babe159d66b96b81f1e848c065fcd6fa5da0191ef46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/vcad-kernel-booleans/src/split.rs:2938-2945 | crates/vcad-kernel-booleans/src/split.rs:7181-7188 | crates/vcad-kernel-booleans/src/split.rs:7226-7233 | crates/vcad-kernel-booleans/src/trim.rs:1068-1075 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/split.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/vcad-kernel-booleans/src/split.rs:2938\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"880ef96866b7588f22953eed78c0920e23efd07bccf6f6faf12eb8908b896c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/vcad-kernel-booleans/src/trim.rs:436-443 | crates/vcad-kernel-booleans/src/trim.rs:558-565 | crates/vcad-kernel-booleans/src/trim.rs:612-619 | crates/vcad-kernel-booleans/src/trim.rs:656-663 \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 \u0060crates/vcad-kernel-booleans/src/trim.rs:436\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-kernel-booleans/src/trim.rs:435\u0060 calls \u0060unwrap_cylindrical_loop\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs:655\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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bbc717fe96e64d8bf0165c5be714f48b41764e9b2d99d25fa2c03e734636e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/vcad-kernel-export/src/lib.rs:371-378 | crates/vcad-kernel-export/src/lib.rs:388-395 | crates/vcad-kernel-export/src/lib.rs:410-417 | crates/vcad-kernel-export/src/lib.rs:472-478 \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 \u0060crates/vcad-kernel-export/src/lib.rs:371\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-export/src/lib.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8a9e3d882862ea97849bd63b6b86a9e033b3f44f3d7d80d0d725b29fdf8e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/vcad-kernel-fea/src/mesh.rs:162-173 | crates/vcad-kernel-fea/src/mesh.rs:420-431 | crates/vcad-kernel-fea/src/mesh.rs:574-585 | crates/vcad-kernel-topopt/src/domain.rs:115-126 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/mesh.rs\u0060 and \u0060crates/vcad-kernel-topopt/src/domain.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd8b6f393cbd04592b0cbfac98c1b7b5ae17de84def6b093779820e00e2ce03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/vcad-kernel-qcd/src/analysis.rs:147-154 | crates/vcad-kernel-shell/src/lib.rs:955-962 | crates/vcad-kernel-tessellate/src/frozen.rs:745-752 | crates/vcad-render/src/callouts.rs:268-275 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-qcd/src/analysis.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a2cca8e8bb150e6e536afad4355ca61cb664fa10d774bbf027aa19400a58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/vcad-kernel-raytrace/src/intersect/cylinder.rs:60-70 | crates/vcad-kernel-raytrace/src/intersect/torus.rs:67-77 | crates/vcad-kernel-raytrace/src/trim.rs:784-791 | crates/vcad-kernel-raytrace/src/trim.rs:874-881 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060torus\u0060 to \u0060\u0026TorusSurface\u0060 in one and \u0060\u0026vcad_kernel_geom::TorusSurface\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 after the matched lines, \u0060crates/vcad-kernel-raytrace/src/intersect/torus.rs:78\u0060 calls \u0060norm\u0060 and \u0060crates/vcad-kernel-raytrace/src/intersect/cylinder.rs:71\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":"crates/vcad-kernel-raytrace/src/intersect/cylinder.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"27173439b397e807e935f7f8a90b7c836d4cbdb7aa4bbd61058a9ccc0f8e11eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-app/src/migrate.rs:511-518 | crates/vcad-app/src/migrate.rs:594-601 | crates/vcad-app/src/migrate.rs:650-657 \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 after the matched lines, \u0060crates/vcad-app/src/migrate.rs:602\u0060 calls \u0060insert\u0060, \u0060to_string\u0060, \u0060F64\u0060 and \u0060crates/vcad-app/src/migrate.rs:658\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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"532ea94f5fb2dabb9484457572e401b31cbe73f592f29c4ff342e0a6b530bc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-ir/src/vcode.rs:2445-2452 | crates/vcad-ir/src/vcode.rs:2457-2464 | crates/vcad-ir/src/vcode.rs:2469-2476 \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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ae82267ba0b95fb09285cab6df8cb7a5db13462498b75e5fa1ddfde870b138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-kernel-acoustics/src/optimize.rs:108-115 | crates/vcad-kernel-particle/src/optimize.rs:115-122 | crates/vcad-kernel-particle/src/optimize.rs:386-393 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-particle/src/optimize.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-acoustics/src/optimize.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3f1b0678edd6cc54b1d8799acc29f5121123cab9afd74698e16b348393a423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/vcad-kernel-booleans/src/classify.rs:273-280 | crates/vcad-kernel-booleans/src/classify.rs:481-488 | crates/vcad-kernel-booleans/src/split.rs:3772-3778 \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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6ee8a47763c8abc11c5e0a60b21cff599e54186e94e131881553ecc357b46b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-kernel-booleans/src/classify.rs:593-600 | crates/vcad-kernel-booleans/src/classify.rs:819-826 | crates/vcad-kernel-booleans/src/classify.rs:838-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 \u0060crates/vcad-kernel-booleans/src/classify.rs:593\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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"1578a1638d9d3e2eae7e665831dd5cfebea29713d24c72867d71d6722afd27f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-kernel-booleans/src/cyl_band.rs:1313-1320 | crates/vcad-kernel-booleans/src/cyl_band.rs:2545-2552 | crates/vcad-kernel-booleans/src/split.rs:3477-3484 \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 \u0060crates/vcad-kernel-booleans/src/cyl_band.rs:1313\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91f6ae6d66db4310c9e242f0260736d8c4532af12a8a1c978c36f3c18f8eb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/vcad-kernel-constraints/src/residual.rs:36-43 | crates/vcad-kernel-constraints/src/residual.rs:169-175 | crates/vcad-kernel-constraints/src/residual.rs: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":"crates/vcad-kernel-constraints/src/residual.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84fd154f47003ff6caa3d226f99fad5b053c50ff9581663922cb7b8b18a50da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-kernel-dfm/src/rules/casting.rs:64-73 | crates/vcad-kernel-dfm/src/rules/mold.rs:55-62 | crates/vcad-kernel-dfm/src/rules/sheet.rs:54-63 \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 \u0060crates/vcad-kernel-dfm/src/rules/casting.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":"crates/vcad-kernel-dfm/src/rules/casting.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"537cd574c126996ab7ba7358306d55223b1bb6bf9dd9b1cc41535d7b32f985e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-diff/src/adjoint.rs:301-309 | crates/vcad-kernel-diff/src/seam.rs:389-397 | crates/vcad-kernel-diff/src/second_order.rs:200-208 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-diff/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-diff/src/seam.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 \u0060crates/vcad-kernel-diff/src/adjoint.rs:301\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/adjoint.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"593a83cceb8f06ef097acca53c39ca40e2d320c9c386bbae1da4cb7cf25fb9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20138 lines \u00D7 4): crates/vcad-ecad-pcb/src/spatial.rs:315-315 | crates/vcad-kernel-drafting/src/section.rs:653-662 | crates/vcad-kernel-sketch/src/profile.rs:485-492 | crates/vcad-slicer/src/perimeter.rs:153-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-drafting/src/section.rs:653\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060p\u0060 to \u0060\u0026Point2D\u0060 in one and \u0060Point2\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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fc3e777253038fe80ccb1b00c3b4f8e4cfac562487df0a60af0695b3baf2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-kernel-fea/src/buckling.rs:1657-1666 | crates/vcad-kernel-fea/src/section.rs:882-891 | crates/vcad-kernel-fea/src/shell.rs:747-756 \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 \u0060crates/vcad-kernel-fea/src/buckling.rs:1657\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-fea/src/buckling.rs:1667\u0060 calls \u0060load_factor\u0060 and \u0060crates/vcad-kernel-fea/src/section.rs:892\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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a496fed044c03d09e493bf00cbb17dbdf604033cb7e0152417c6af87176f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): crates/vcad-kernel-sketch/src/extrude.rs:233-240 | crates/vcad-kernel-sketch/src/revolve.rs:120-127 | crates/vcad-kernel-sweep/src/loft.rs:148-153 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:233\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c34942b450ffdab947a927c1d6ce89478fc3fcdca7946430ca6347dbbd192b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:1021-1028 | crates/vcad-kernel-tessellate/src/lib.rs:1257-1264 | crates/vcad-kernel-tessellate/src/lib.rs:1488-1495 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcfb41066ee9ce5d4de855964b7573bd2032c93a65e01618671bee02e65b487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:2644-2651 | crates/vcad-kernel-tessellate/src/lib.rs:4709-4716 | crates/vcad-kernel-tessellate/src/lib.rs:5022-5029 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"1106aa50095d137bcbaf307ab3fea2f04e648df69ed71ff05eef2d1b8f4c80b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-app/src/feature.rs:635-643 | crates/vcad-app/src/feature.rs:754-762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-app/src/feature.rs:635\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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a159f52207188a9063ffc92c39c5d9851fffd338e50de21cc131fb87090a3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-cli/src/app.rs:190-197 | crates/vcad-cli/src/repl.rs:23-30 \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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"104ca334b01daa5d376bef44b125daadd87f666de69eaf2000c4d52c471215f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-cli/src/main.rs:4653-4660 | crates/vcad-cli/src/main.rs:4824-4831 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2b6db00aafa7d172beccd89a39907f4ef802e520036f6b60c97a2984ce178b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-package/src/presets.rs:54-61 | crates/vcad-ecad-symbols/src/footprint.rs:212-219 \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":"crates/vcad-ecad-package/src/presets.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b0a4825dc0bfc858f11a58bf68b97f0d8326ed1625efa3f47e2d34da799e36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-pcb/src/copper_pour.rs:188-195 | crates/vcad-ecad-pcb/src/router/mod.rs:759-766 \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":"crates/vcad-ecad-pcb/src/copper_pour.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e103989c281b66e97b5ba179676c0847ee1a477c010b1428498fe7e0aafd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/complete.rs:1964-1979 | crates/vcad-ecad-pcb/src/router/maze.rs:1425-1440 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-pcb/src/router/complete.rs\u0060 and \u0060crates/vcad-ecad-pcb/src/router/maze.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76f443512cd9f442830518341069d929a75bb1ba96fbb2bbf18aabfab0d4e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/escape.rs:507-514 | crates/vcad-ecad-pcb/src/router/escape.rs:563-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a109c81c9d6b33e1392064034be634d81ae99ddec497545fd321ea349d89f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/global.rs:282-289 | crates/vcad-ecad-pcb/src/router/global.rs:339-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/global.rs:282\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/global.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f92c3153c9994815ee1aaadf60bd3cda370a776fb9cc0999e5f1bff24eb2d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/length_match.rs:181-188 | crates/vcad-ecad-pcb/src/router/length_match.rs:799-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 \u0060crates/vcad-ecad-pcb/src/router/length_match.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. 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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"12182e5b7edc822343a3f7ca554bf3d2c89f5ece180b2b7797ff252109564c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:463-470 | crates/vcad-ecad-symbols/src/kicad_write.rs:2873-2880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/kicad_write.rs:463\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab75dc8dac139137b7ec04445b1d87a5aa48da4110b52e8b702b8bb4bbd20a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-eval/src/cavity_extract.rs:91-99 | crates/vcad-eval/src/sim_extract.rs:98-106 \u2014 before extracting anything, compare \u0060crates/vcad-eval/src/cavity_extract.rs\u0060 and \u0060crates/vcad-eval/src/sim_extract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9be3c2a8e8c3927fc749b9cf72c72b91f597299d1a40e41fe6d93bbd9c8b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-eval/src/diff.rs:288-295 | crates/vcad-eval/src/sensitivity.rs:387-394 \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 \u0060crates/vcad-eval/src/diff.rs:288\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/diff.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"880648f54e96efdeba3a17e15e5e4ed8f6dba600f8ffceaf77e135677fd2c5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-eval/src/sim_extract.rs:498-506 | crates/vcad-kernel-fea/src/shell.rs:435-443 \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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d687726a9bc4cbe3402206847b585a5a52522064a34f25f05b05541a2ce13796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ffi/src/engine.rs:74-81 | crates/vcad-ffi/src/engine.rs:111-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/engine.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/engine.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"178111a4ebf4517e3d1cd0b652ab3ce521a9b385c69c8e140efe78d9ea60ac96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:1484-1496 | crates/vcad-ir/src/vcode.rs:1512-1525 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/vcode.rs:1484\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3995bd177dcfb2b9a94afaa0331c238f2bd61312a438adb6df6cf7a5d83c71f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:2204-2211 | crates/vcad-ir/src/vcode.rs:2222-2229 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1854aed92ba7c261b4762f4c4e3e7b7bb0aada20c3c5b32e40cfdd2f0c9e04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-acoustics/src/helmholtz.rs:332-339 | crates/vcad-kernel-acoustics/src/helmholtz.rs:348-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 \u0060crates/vcad-kernel-acoustics/src/helmholtz.rs:332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/helmholtz.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a283cdbe4765c1da7d97b37441de1a700ba182a679178bc28277a895767f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-acoustics/src/strike.rs:205-212 | crates/vcad-kernel-fea/src/modal.rs:271-278 \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 \u0060crates/vcad-kernel-acoustics/src/strike.rs:205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8daa5d765e06271838c11b579512ac8d498b81bba6ddbc7a72b95d4aa634b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:148-155 | crates/vcad-kernel-booleans/src/trim.rs:380-387 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/classify.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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 \u0060crates/vcad-kernel-booleans/src/classify.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. 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"db48a658a0c140a3be1bd02c214f50729cf159817842c796cb1423f6708e9801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/vcad-kernel-booleans/src/freeze.rs:83-88 | crates/vcad-kernel-booleans/src/split.rs:775-782 \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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4039fc0d267651c1b198a1eb4d4be1569b142a9670cb20dec15843406eedeb71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:557-564 | crates/vcad-kernel-booleans/src/mesh/csg.rs:574-580 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"b220553cba8e0e143e80298fb701c15c1d59dda1164def4979576245da5ba200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:602-609 | crates/vcad-kernel/src/lib.rs:1597-1604 \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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefdb347dc0315e55d812ea3d155afdf24cf708eb5a78f84100469844b9df275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:726-733 | crates/vcad-kernel-booleans/src/split.rs:807-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:726\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"6952cc6206e74ef5209da2932a82245862ce5aff5f0c7af6352fe305d2958c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-booleans/src/trim.rs:393-400 | crates/vcad-kernel-booleans/src/trim.rs:735-742 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"93401fd8e305b9c6f3279832fbae794e39d757106434ee2e393eeee9054a1c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/vcad-kernel-cam/src/dropcutter/mesh_accel.rs:74-81 | crates/vcad-kernel-drafting/src/edge_extract.rs:461-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/dropcutter/mesh_accel.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"80348b93cbd0b9211ec9f96ede8afc463759e25547daadc8652a3960b95779eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/vcad-kernel-cam/src/post/grbl.rs:113-153 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:165-205 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-cam/src/post/grbl.rs\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-cam/src/post/grbl.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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c8e612f59646483727e46c46afc6d57574d191c942c90bd3a93daee7183ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-cam/src/post/grbl.rs:153-160 | crates/vcad-kernel-cam/src/post/grbl.rs:204-211 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-kernel-cam/src/post/grbl.rs:201\u0060 calls \u0060push\u0060, \u0060coord\u0060 and \u0060crates/vcad-kernel-cam/src/post/grbl.rs:150\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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae05d7fd1cdded404e8c3e982f116cb9a0b71458058b12780057d2d05c4e844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-cam/src/post/linuxcnc.rs:205-212 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:264-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs:261\u0060 calls \u0060push\u0060, \u0060coord\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs:202\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":"crates/vcad-kernel-cam/src/post/linuxcnc.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"583d05626b4f40c92a1d753daa10c54c32a1d61479bee389a349d8567661aa6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-dfm/src/geom/probe.rs:99-106 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:428-435 \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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d3271c908bc7273494208c57bd79c17b37e4d3b745805db8f00b1e99539fa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-dfm/src/geom/radii.rs:22-29 | crates/vcad-kernel-features/src/lib.rs:174-181 \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 \u0060crates/vcad-kernel-dfm/src/geom/radii.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"crates/vcad-kernel-dfm/src/geom/radii.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"799c295d11c178d140baaa8aadbaaf3b33ff0a0311d37ad50839fe97bd12a7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 3): crates/vcad-kernel-drafting/src/section.rs:85-92 | crates/vcad-kernel-drafting/src/section.rs:93-100 | crates/vcad-kernel-drafting/src/section.rs:101-105 \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 \u0060crates/vcad-kernel-drafting/src/section.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. 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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1922f7eade0b9788485a6398e4d2b089587b5dcae33ad6b6a239a11b2dc21a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-em/src/ac.rs:143-150 | crates/vcad-kernel-em/src/grid.rs:418-425 \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 \u0060crates/vcad-kernel-em/src/ac.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/ac.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe42d47001af9d09cdefef06b8781613b138751154fa38421056fa5ca75b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:558-567 | crates/vcad-kernel-em/src/planar.rs:462-469 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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 \u0060crates/vcad-kernel-em/src/axisym.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d40d26d417c1c4604b8fb3b78b2eabff5fb3fd742ddf75d5051307a9e95dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:593-600 | crates/vcad-kernel-em/src/planar.rs:510-517 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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 \u0060crates/vcad-kernel-em/src/axisym.rs:593\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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c216488d33fd06b99e9180b0725aa02fd9dc94fd67f53b64ec9c398703b920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-em/src/planar.rs:725-732 | crates/vcad-kernel-em/src/planar.rs:742-749 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/planar.rs:725\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dab4bdb84de762998a55265a65c24a357cbb61a23c93a4c08bcdfeb3288ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-gpu/src/wavefront.rs:102-110 | crates/vcad-kernel-gpu/src/wavefront.rs:372-380 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9db4757ee3e72ffccb3412f45b36e5375d0599bd27fea9143b791f211310ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-neutronics/src/diffusion.rs:308-315 | crates/vcad-kernel-neutronics/src/diffusion.rs:336-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 \u0060crates/vcad-kernel-neutronics/src/diffusion.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":"crates/vcad-kernel-neutronics/src/diffusion.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4ec5f29d9b5563d6b70760526b463dbdf95a31e38fdd2df853634eaf29733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-particle/src/poisson.rs:243-250 | crates/vcad-kernel-particle/src/space_charge.rs:172-179 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-particle/src/poisson.rs\u0060 and \u0060crates/vcad-kernel-particle/src/space_charge.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"crates/vcad-kernel-particle/src/poisson.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfdc2a6231737213532c8f75328996939fbfa0bc1b40557eef3f74e30100fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-primitives/src/lib.rs:349-358 | crates/vcad-kernel-primitives/src/lib.rs:369-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-primitives/src/lib.rs:349\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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"494a2f59241e55c3fa9102ac0bcfa2f0dd30d01420535afd5a360ba086d9698d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:71-78 | crates/vcad-kernel-raytrace/src/intersect/bilinear.rs:129-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. 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":"crates/vcad-kernel-raytrace/src/intersect/bilinear.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d143be661d4850a0c2addcf287b1fc981f973b3b5fef2d7f95e01978d8ef533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-raytrace/src/intersect/bspline.rs:147-154 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:209-216 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-raytrace/src/intersect/bspline.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"788919b91003e29259276e9907d254b030cbf0e8683e10c2511b6c040b8965fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-sheet/src/unfold.rs:129-136 | crates/vcad-kernel-sheet/src/unfold.rs:157-164 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-sheet/src/unfold.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fcd0d069d41c61727f8dba43c5137a215ae67ae56c4517c224964ffda646f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 3): crates/vcad-kernel-qcd/src/analysis.rs:138-139 | crates/vcad-kernel-shell/src/lib.rs:941-948 | crates/vcad-render/src/callouts.rs:252-259 \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 \u0060crates/vcad-kernel-qcd/src/analysis.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. 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":"crates/vcad-kernel-qcd/src/analysis.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fa1b9bb31bb764806783af5dd9fe2be3b9e3a7bb0088ce7116f02fb2da586d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/vcad-kernel-sketch/src/extrude.rs:312-319 | crates/vcad-kernel-sketch/src/extrude.rs:888-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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfaa60139d197c6133bb0d11dafb824511ceb4c018df50cea19582fa142f9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-sketch/src/revolve.rs:425-432 | crates/vcad-kernel-sketch/src/revolve.rs:626-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sketch/src/revolve.rs:425\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":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae69a6aff8b991b5c0a8a680490ad64cf1a909dd29a29e3d8cce2b1d3cf6fac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-step/src/pmi.rs:224-231 | crates/vcad-kernel-step/src/pmi.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/pmi.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ab4a9df12b583989ce58f1c7b45df728ad7636d8f319c5c5fdca691662f400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:2350-2356 | crates/vcad-kernel-tessellate/src/lib.rs:2399-2406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:2399\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f18e18d0ede769bfafa49c93409d9e702ff2069d696da51bab1a815c72d8d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:4990-4995 | crates/vcad-kernel-tessellate/src/lib.rs:6656-6663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:4990\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4990}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31e7af2e3a3b6d8f7655742b5baf492fa0b0b2bb76cd8766987bd7d4af1437c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:5330-5337 | crates/vcad-kernel-tessellate/src/lib.rs:5433-5440 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4804c61866e986358d99c3657bd23619fd671e25deb6f3b8a28482469509dfa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:5567-5569 | crates/vcad-kernel-tessellate/src/lib.rs:5756-5763 | crates/vcad-kernel-tessellate/src/lib.rs:7856-7865 \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 \u0060crates/vcad-kernel-tessellate/src/lib.rs:5567\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53e128ccf3ff868dcc4b0948c053d803c0883c8d0dd78e2a46df934e5b3626e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:7159-7166 | crates/vcad-kernel-tessellate/src/lib.rs:7200-7206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:7159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8762ee12bddbedb6709fa6748ef668ee84af67ce07fc1dc3b578beb14d5b4da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-topopt/src/fea.rs:207-214 | crates/vcad-kernel-topopt/src/fea.rs:233-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-topopt/src/fea.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":"crates/vcad-kernel-topopt/src/fea.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ddfd44833377c11ab4bd0c631d46ab5c5f01383b040626d5ca59bbac30caff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-urdf/src/reader.rs:1213-1220 | crates/vcad-kernel-urdf/src/reader.rs:1258-1265 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5a5887406b4e26907e468bbd4bc5399cdbd68c8398d192d2d496db4f1d45bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:9385-9392 | crates/vcad-kernel-wasm/src/lib.rs:9713-9720 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":9385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dbef8fbfd0e25e547f2b172236a987acdd78b0bb691993ed4d240a707055fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:10417-10424 | crates/vcad-kernel-wasm/src/lib.rs:10494-10501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:10417\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":10417}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e580edf6fd8d5a847ab937df14e0c2920bc831629b6f5588a439fcea9a9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel/src/lib.rs:2307-2314 | crates/vcad-kernel/src/lib.rs:2367-2374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel/src/lib.rs:2307\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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a185dbdcbe455b186c2ed035fd7443a693d503e6d9e9a50b6746db64af847b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 4): crates/vcad-kernel-booleans/src/validate.rs:37-38 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:61-62 | crates/vcad-kernel/src/lib.rs:2996-3003 | crates/vcad-kernel/src/lib.rs:3062-3069 \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 \u0060crates/vcad-kernel/src/lib.rs:2996\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/validate.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eff609a6961d49fb2228e29611730851c4186b318b97f1a7baf2b1d438b20f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-loon/src/convert.rs:25-32 | crates/vcad-loon/src/convert.rs:259-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2613922259daf0e17c08dec7fae143acc432ae200517eb28f8fc95ac19fc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-loon/src/params.rs:171-178 | crates/vcad-loon/src/variants.rs:300-307 \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":"crates/vcad-loon/src/params.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecf73421face683ea7de836c34854019c3a258bfcfbde18d2b41c26c48a43f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-loon/src/variants.rs:570-577 | crates/vcad-loon/src/variants.rs:592-599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/variants.rs:570\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9a17399749a50486fbcd1a4d360547d41ab012ce833b5ab8bf5f57f2833a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-render/src/lib.rs:1160-1167 | crates/vcad-render/src/report.rs:252-259 \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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7d7cf82efd5d21756a3da516ca78a82e03ea74876ac9b371157d9cd20e0ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-sim/src/single.rs:57-64 | crates/vcad-sim/src/single.rs:79-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-sim/src/single.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"029de70210d0be0a32c07638da601884daec32e2f81b88bf114cd5afa70a429a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): crates/vcad-kernel-sketch/src/extrude.rs:232-238 | crates/vcad-kernel-sketch/src/extrude.rs:558-564 | crates/vcad-kernel-sketch/src/extrude.rs:828-834 | crates/vcad-kernel-sketch/src/extrude.rs:1170-1176 | crates/vcad-kernel-sketch/src/revolve.rs:119-125 | crates/vcad-kernel-sweep/src/loft.rs:147-153 | crates/vcad-kernel-sweep/src/sweep.rs:163-169 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8b37ce31b2e23869d67ca8d8aaa400bbd4b92296f0fdf325c63ec2bd15e6a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/vcad-ffi/src/engine.rs:65-71 | crates/vcad-ffi/src/engine.rs:98-104 | crates/vcad-ffi/src/engine.rs:135-141 | crates/vcad-ffi/src/engine.rs:158-164 | crates/vcad-ffi/src/engine.rs:221-227 | crates/vcad-ffi/src/engine.rs:329-335 \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 \u0060crates/vcad-ffi/src/engine.rs:65\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/engine.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8878975bb8c62954cc28d2eb58a748ac09e0b790817403b7bc50efff607f575a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/vcad-ecad-sim/src/circuit/ac.rs:176-182 | crates/vcad-ecad-sim/src/circuit/linalg.rs:56-62 | crates/vcad-kernel-acoustics/src/instrument.rs:612-618 | crates/vcad-kernel-fea/src/modal.rs:299-305 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-sim/src/circuit/ac.rs\u0060 and \u0060crates/vcad-ecad-sim/src/circuit/linalg.rs\u0060 as WHOLE FILES: this scan already matched 5 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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060\u0026mut [Cplx]\u0060 in one and \u0060\u0026mut [f64]\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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e115a99730212b1778e63ebace0d2524810a34ab0dec4ec6fa4517eddae819fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/vcad-kernel-raytrace/src/cpu.rs:94-99 | crates/vcad-kernel-raytrace/src/cpu.rs:183-189 | crates/vcad-kernel-raytrace/src/cpu.rs:356-361 | crates/vcad-kernel-raytrace/src/cpu.rs:511-516 \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":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32419ad052b9dd0a091528cf220cfd6c090b64f45e4cb39bf174a5c7eaa65a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-cli/src/app.rs:980-986 | crates/vcad-cli/src/app.rs:987-993 | crates/vcad-cli/src/app.rs:994-1000 \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 \u0060crates/vcad-cli/src/app.rs:980\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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b5de4b4ad4bcabe9565b5c30cee4847ce14ef4f1ee1fe24842c52489a8adcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-cli/src/main.rs:1520-1526 | crates/vcad-cli/src/main.rs:2201-2207 | crates/vcad-cli/src/main.rs:5003-5009 \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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3154f32d64e4539796c360cdacee7a8dca7072221695688d6b435e87a97274ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-ecad-pcb/src/router/sco.rs:287-293 | crates/vcad-ecad-pcb/src/router/sco.rs:313-319 | crates/vcad-ecad-pcb/src/router/sco.rs:551-557 \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 \u0060crates/vcad-ecad-pcb/src/router/sco.rs:287\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-ecad-pcb/src/router/sco.rs:320\u0060 calls \u0060include\u0060 and \u0060crates/vcad-ecad-pcb/src/router/sco.rs:558\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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a402bea9dd57b687f1d34dd374261e84fe99a23bb9b3a0255d4cfbb904c0d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-ffi/src/lib.rs:400-406 | crates/vcad-ffi/src/lib.rs:482-488 | crates/vcad-ffi/src/lib.rs:551-557 \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 \u0060crates/vcad-ffi/src/lib.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5285e0b17e0ea3833be1591623bb31ee0457d77a8543b1e34348ccf91243d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-ir/src/vcode.rs:1463-1469 | crates/vcad-ir/src/vcode.rs:1490-1496 | crates/vcad-ir/src/vcode.rs:1519-1525 \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 \u0060crates/vcad-ir/src/vcode.rs:1463\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-ir/src/vcode.rs:1517\u0060 calls \u0060get\u0060, \u0060parse_f64\u0060, \u0060transpose\u0060 and \u0060crates/vcad-ir/src/vcode.rs:1488\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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e639924e959b0e28ecb895592ea6ae9db41f947d4a0ee4f0c269409e34fc70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-acoustics/src/optimize.rs:70-76 | crates/vcad-kernel-optics/src/optimize.rs:74-80 | crates/vcad-kernel-particle/src/optimize.rs:73-79 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-optics/src/optimize.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. 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 \u0060crates/vcad-kernel-acoustics/src/optimize.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d7010336be27a638dc8b2d6221bad0642f281a17c3315868ab630406b87ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/vcad-kernel-booleans/src/split.rs:1581-1586 | crates/vcad-kernel-booleans/src/split.rs:1809-1815 | crates/vcad-kernel-booleans/src/split.rs:1856-1862 \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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dce9fdbd0989246fcbc1f5c4f5f9370ad6aea4bdbaa0e02de3a59b87e48509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-flow/src/gpu.rs:341-347 | crates/vcad-kernel-gpu/src/narrowphase.rs:179-185 | crates/vcad-kernel-gpu/src/wavefront_batch.rs:340-346 \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":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ff11633ceb81e9385e51bec1885c76d586b5af6b9962be064befbb26352bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/vcad-kernel-neutronics/src/rng.rs:55-67 | crates/vcad-kernel-qcd/src/rng.rs:39-51 | crates/vcad-kernel-tolerance/src/rng.rs:48-60 \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":"crates/vcad-kernel-neutronics/src/rng.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fd7b3ced89583df326d7c3ce4bb3b9ba3b6e1fd85ffc553d167fed196fe92f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-tessellate/src/frozen.rs:290-296 | crates/vcad-kernel-tessellate/src/frozen.rs:337-343 | crates/vcad-kernel-tessellate/src/frozen.rs:363-369 \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, \u0060crates/vcad-kernel-tessellate/src/frozen.rs:362\u0060 calls \u0060cos\u0060, \u0060sin\u0060 and \u0060crates/vcad-kernel-tessellate/src/frozen.rs:289\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":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20dcfc1dd789882bb530043fb6ba33cabbe7d450d9bba294694ef26bed27107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:4576-4581 | crates/vcad-kernel-tessellate/src/lib.rs:7261-7266 | crates/vcad-kernel-tessellate/src/lib.rs:8133-8139 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4576}}}],"partialFingerprints":{"codehealthFindingId/v1":"75152fbad7fc3043aacb578b24f7cba21d00cb831324fd5c4ee3105b957f83f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel/src/sheet_json.rs:377-383 | crates/vcad-kernel/src/sheet_json.rs:603-609 | crates/vcad-kernel/src/sheet_json.rs:1309-1315 \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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0590593b20fe04a46e919b49286559e379ca735df274d89e9304d0c0e3bd75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/termview/src/rasterize.rs:618-624 | crates/termview/src/rasterize.rs:697-703 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/termview/src/rasterize.rs:618\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/termview/src/rasterize.rs:629\u0060 calls \u0060draw_tiny_char\u0060 and \u0060crates/termview/src/rasterize.rs:704\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":"crates/termview/src/rasterize.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"da33d38462288eb09abfd3827a5a698bf7e1651e23dab3b963d69dd616be0284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-atoms/src/fab.rs:386-392 | crates/vcad-atoms/src/fab.rs:524-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-atoms/src/fab.rs:386\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/fab.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0decdeeb76e2a2cc9bb44b58b32062fa63a91c200edd1276394fbe36a723a9a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-cli/src/tui/sketch_mode.rs:102-110 | crates/vcad-kernel-wasm/src/sketch_session.rs:210-218 \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 \u0060crates/vcad-cli/src/tui/sketch_mode.rs:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/tui/sketch_mode.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd3a6ce6835797f607e58be0a9eea9ef2cfa30b83507d83ebb87f3080c91ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-cli/src/ui/status.rs:101-107 | crates/vcad-cli/src/ui/toolbar.rs:567-573 \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 \u0060crates/vcad-cli/src/ui/status.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":"crates/vcad-cli/src/ui/status.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"07350c38545d16d0452c81984efdf765f453f62ca54e4978e1db2ce91137a814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/vcad-ecad-export/src/gerber.rs:905-910 | crates/vcad-ecad-export/src/gerber.rs:911-917 | crates/vcad-ecad-export/src/gerber.rs:921-927 \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 \u0060crates/vcad-ecad-export/src/gerber.rs:905\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-ecad-export/src/gerber.rs:918\u0060 calls \u0060Some\u0060 and \u0060crates/vcad-ecad-export/src/gerber.rs:910\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":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a7526aeb7b529f918ab8cb31c4e99fea30c786cb124ed5465332a1efced3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/drc.rs:931-937 | crates/vcad-ecad-pcb/src/via_sizing.rs:70-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acc8260910593e575d983b8e221fff9639eb9334eec8fdc68a996313a7c3466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-pcb/src/ratsnest.rs:123-130 | crates/vcad-kernel-dfm/src/geom/probe.rs:514-521 \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":"crates/vcad-ecad-pcb/src/ratsnest.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2f41346f65976fdb9bcef067b546537af9ffed56db0a03c91aa22218a13ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/complete.rs:246-252 | crates/vcad-kernel-booleans/src/trim.rs:695-701 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060p\u0060 to \u0060Vec2\u0060 in one and \u0060\u0026Point2\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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5226564e306ff535eea4ba47f7fffc1126eae9a767a077ea214e9f0214236b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/complete.rs:1417-1423 | crates/vcad-ecad-pcb/src/router/maze.rs:775-781 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-pcb/src/router/complete.rs\u0060 and \u0060crates/vcad-ecad-pcb/src/router/maze.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/vcad-ecad-pcb/src/router/complete.rs:1417\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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa338a27a4cd2dae459c620a109cdff133741bcb6a86a90d2c9e9d563e370a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/length_match.rs:294-300 | crates/vcad-ecad-pcb/src/router/length_match.rs:833-839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/length_match.rs:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"608e346bc4dc3d06ae418dda6139503bdb7b37da4d9030a026fabb4de15ffecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/maze.rs:574-580 | crates/vcad-ecad-pcb/src/router/maze.rs:1362-1368 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f69a3fe316ac1b04fac29c82c91c49fa04b7842832bfd3f15c40fea6d8f92be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:474-480 | crates/vcad-ecad-pcb/src/router/sco.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 \u0060crates/vcad-ecad-pcb/src/router/sco.rs:474\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"87882a4dbf73f8bdf1616ed281d0a3944c51ee3bcd77899bd4d1bbe7d5ac7b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/si_claims.rs:325-333 | crates/vcad-ecad-pcb/src/router/si_claims.rs:473-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/si_claims.rs:325\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/si_claims.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcefc11e09121414fb90e0a06d72a783be8e6a8fe93d8e80fb00a84a5c8b3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/vcad-ecad-symbols/src/altium/binary.rs:259-264 | crates/vcad-ecad-symbols/src/altium/binary.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. 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":"crates/vcad-ecad-symbols/src/altium/binary.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"60413d3bc80aa5fc4b81ace8c7b45dfe96e40e34f1fa9a91e9477965a38d9d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-symbols/src/footprint.rs:2078-2085 | crates/vcad-ecad-symbols/src/footprint.rs:2132-2138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/footprint.rs:2078\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"62da62f35854dcad91d8b378a76f01bd8ba08bf7d810ad8a9d3ba3211e87a78e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-symbols/src/footprint.rs:2108-2114 | crates/vcad-ecad-symbols/src/footprint.rs:2170-2176 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0e019d8869a12aa96e3431742e37413db03b2d78e73e79eaf4b68c0bf562d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_board.rs:42-48 | crates/vcad-ecad-symbols/src/kicad_board.rs:78-85 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bd626c185f9e688ed8084b55c2023144c5e6781d304287706fc0e0695a2cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-eval/src/sim_extract.rs:320-328 | crates/vcad-eval/src/thermal_extract.rs:543-551 \u2014 before extracting anything, compare \u0060crates/vcad-eval/src/sim_extract.rs\u0060 and \u0060crates/vcad-eval/src/thermal_extract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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 \u0060crates/vcad-eval/src/sim_extract.rs:320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f0c88c377e2cf68fe6294cb9ee0fa58835236ec5d6f3dfd7498c9081a5d9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ffi/src/fea.rs:453-459 | crates/vcad-ffi/src/fea.rs:480-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/fea.rs:453\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/fea.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"727a0190b99bcb9a89018e43e0fc84190da54852eca181900fcde2346d047a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ffi/src/gym.rs:531-537 | crates/vcad-ffi/src/train.rs:685-691 \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 \u0060crates/vcad-ffi/src/gym.rs:531\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-ffi/src/gym.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e094d9f60be7f2bcc4483e2738873ea47c10ba13991905cdb4984f2472356452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ffi/src/lib.rs:1115-1122 | crates/vcad-ffi/src/lib.rs:1205-1212 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"29106fc74a1aa049ffd30c368c247045c89c0d7c69f00c48892572b92600c29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-acoustics/src/instrument.rs:506-513 | crates/vcad-kernel-acoustics/src/strike.rs:269-276 \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 \u0060crates/vcad-kernel-acoustics/src/instrument.rs:506\u0060 it begins part-way through the construct above it, so those exact 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 \u0060n\u0060 to \u0060usize) -\u003E (Vec\u003Cf64\u003E\u0060 in one and \u0060usize\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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f8de1cc641af2f629d77580fabc4774980b74245458daa9487929fa501c7cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/bbox.rs:309-315 | crates/vcad-kernel-booleans/src/bbox.rs:318-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/bbox.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":"crates/vcad-kernel-booleans/src/bbox.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d505d50309fd33813c9fca83a3a18d614712633c89ceefb6af52b7d0a0d22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:807-813 | crates/vcad-kernel-booleans/src/classify.rs:829-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 \u0060crates/vcad-kernel-booleans/src/classify.rs:807\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"0517457d105c96c2b1319f7f8d454588ef3e13578e6bdb096fe20b50d8dabee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:1344-1350 | crates/vcad-kernel-booleans/src/pipeline.rs:353-359 \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 \u0060crates/vcad-kernel-booleans/src/classify.rs:1344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b703d7e3af8bc542e3b92beed9016c146e3a83ff89f301d61df00595d12496e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:921-927 | crates/vcad-kernel-tessellate/src/lib.rs:1868-1874 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs:921\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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbecefbddbd9aea9af4f17763044c23dd520e0f9faaa45e24bc4af0fdd2a44b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/no_crossing.rs:395-401 | crates/vcad-kernel-booleans/src/no_crossing.rs:409-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/no_crossing.rs:395\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0de06d25b7057d4a535f96b0705ca3b15fae04167ef14e6d711bf0256d088a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1497-1503 | crates/vcad-kernel-booleans/src/split.rs:3417-3423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:1497\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc59909e85e3308f7e42f8f5601660a95418af48d90447340937b1dfea50d132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5451-5457 | crates/vcad-kernel-booleans/src/split.rs:5619-5632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:5451\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5acb3a2d6bc0b41aa106e2d91ebc925577b818abfeb7f3f62ecd2133adf7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-cam/src/operation/contour.rs:156-162 | crates/vcad-kernel-cam/src/operation/pocket.rs:94-100 \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 \u0060crates/vcad-kernel-cam/src/operation/contour.rs:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/operation/contour.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd6c469089d86cd85a573ff429e97fcd95cc123be2423c35b79924c2e76d815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-dfm/src/geom/probe.rs:114-120 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:441-447 \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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6114eb463f0dc773ff0b69d763ef6e75cd25990db3c9694e9413c3f8b3b129f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-dfm/src/rules/fdm.rs:90-96 | crates/vcad-kernel-dfm/src/rules/sheet.rs:26-32 \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 \u0060crates/vcad-kernel-dfm/src/rules/fdm.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/fdm.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d07f2c16b422278ff1caa037e84714a02820b401ca0795efff67e0c1c161c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:715-723 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:754-762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"4952ad79458804b7af5b45ddb2e5b7990d8afd632fd79ff750f89c8671fd4b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-drafting/src/dxf.rs:31-37 | crates/vcad-kernel-drafting/src/dxf.rs:120-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be0fbc0e1a65501c84fe4da4e37213e109514bd233b9ade5a733b2eb99f81e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-drafting/src/sheet.rs:635-641 | crates/vcad-kernel-drafting/src/sheet.rs:654-660 \u2014 both copies are in the same file, so extract the block 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 \u0060view\u0060 to \u0060\u0026ProjectedView\u0060 in one and \u0060\u0026SectionView\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":"crates/vcad-kernel-drafting/src/sheet.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fba0df66ce247ff2bbad20c97784b4df4e66ceec0d5ce16aeb77c89909ba70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:379-385 | crates/vcad-kernel-em/src/planar.rs:260-266 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8b768fb49626318a229182245ca891171a1998154f79b12370e9d2818dcb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:735-741 | crates/vcad-kernel-em/src/planar.rs:640-646 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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 \u0060crates/vcad-kernel-em/src/axisym.rs:735\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c22211059e24a1c8ae0d05593b773f1cd973a5c37f0eb336bc7f19eae80c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-enclosure/src/mesh.rs:448-454 | crates/vcad-kernel-enclosure/src/mesh.rs:461-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 \u0060crates/vcad-kernel-enclosure/src/mesh.rs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-enclosure/src/mesh.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"649e95420b4d64026c7be880fb685991a1f3b9e2cc5f8596fb799e24abc24f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-fea/src/buckling.rs:475-481 | crates/vcad-kernel-fea/src/modal.rs:239-245 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/buckling.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"09662af0877298b4ace48cc1c87ff7729850f1041dc1c3b4efe887d8d904db0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-fea/src/mesh.rs:185-191 | crates/vcad-kernel-fea/src/mesh.rs:486-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-fea/src/mesh.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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dca5abdd16421862d8211bfb1ddf49b2216490dda20eb16842899610540b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/vcad-kernel-fillet/src/chamfer.rs:88-102 | crates/vcad-kernel-fillet/src/fillet_planar.rs:124-135 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/vcad-kernel-fillet/src/chamfer.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8054d70d02badb259b7f97f944fee535d8e9566c18b34329d0fbb23dba2a6605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-fillet/src/closest_point.rs:153-159 | crates/vcad-kernel-raytrace/src/trim.rs:924-930 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-kernel-fillet/src/closest_point.rs:150\u0060 calls \u0060dot\u0060 and \u0060crates/vcad-kernel-raytrace/src/trim.rs:922\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":"crates/vcad-kernel-fillet/src/closest_point.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c21615741b43bef09689c39f9592dba3523f593c2a57a0d9dede883aa4fcd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-fillet/src/fillet_planar.rs:177-183 | crates/vcad-kernel-fillet/src/fillet_planar.rs:393-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 \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/fillet_planar.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1c43a7ca6135db05c87403bd80bf0279d034f6d1faeb3421cb6218983efe7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): crates/vcad-kernel-flow/src/adjoint.rs:227-229 | crates/vcad-kernel-flow/src/adjoint.rs:272-278 | crates/vcad-kernel-flow/src/solve.rs:352-354 | crates/vcad-kernel-flow/src/solve.rs:408-414 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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 \u0060crates/vcad-kernel-flow/src/adjoint.rs:272\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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c5cbd26a909928dcfb255db0b640548962b6a9feba933ffd59af59946ee748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/vcad-kernel-particle/src/wire3d.rs:621-627 | crates/vcad-kernel-tessellate/src/clearance.rs:478-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 \u0060crates/vcad-kernel-tessellate/src/clearance.rs:478\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/wire3d.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca3227638758be599181ea6cb653e3315ba3c449507139c38371f90b45b84e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-photonics/src/sim.rs:715-721 | crates/vcad-kernel-photonics/src/sim.rs:732-738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-photonics/src/sim.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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"8036d26dad830fe0d29306b2bf158030a2c6b72f2c3b3deea9bf7822a7820a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): crates/vcad-kernel-physics/src/world.rs:487-493 | mecheval/graders/src/fit_physics.rs:588-590 | mecheval/graders/src/fit_physics.rs:629-635 \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. 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"34734ed1a353d7f5287aeecc4a13f79a2af583701faabc53d501fa21cb63b380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-physics/src/world.rs:2083-2089 | crates/vcad-kernel-physics/src/world.rs:2098-2104 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9fa53479aa9611f00c166afa0d51b7bd197688d53b238a665bb94a0707f381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-qcd/src/lattice.rs:177-183 | crates/vcad-kernel-qcd/src/lattice.rs:207-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 \u0060crates/vcad-kernel-qcd/src/lattice.rs:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-qcd/src/lattice.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80614a8ce80376aa7cc1b49d9fb02ebc4fef24f7f2b0e7646d679cc09061653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-shell/src/lib.rs:305-315 | crates/vcad-kernel-shell/src/lib.rs:345-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a01cee7474e8e73f99b396b10c63d706a04930568c9e136defdb6456c64075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-step/src/reconstruct.rs:191-197 | crates/vcad-kernel-step/src/reconstruct.rs:209-215 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aa8cf59316722b39b7637464800b94181e21af59accf6a7d1469a95632ea9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:1489-1495 | crates/vcad-kernel-tessellate/src/lib.rs:8775-8781 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"196e7db042105d36e85a3d86f216d23e990e44a693e377c267b810536b7a35dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:5660-5674 | crates/vcad-kernel-tessellate/src/lib.rs:7713-7727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:5660\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5660}}}],"partialFingerprints":{"codehealthFindingId/v1":"c361068348d4ec128c081a008a41bf53408dd4685c906205495aa9aa8fbee727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:5733-5759 | crates/vcad-kernel-tessellate/src/lib.rs:7833-7859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:5733\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5733}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a60635525db9fec085022449fc26fed79d5ed8269495eab07fe1720b0383815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-urdf/src/reader.rs:1198-1205 | crates/vcad-kernel-urdf/src/reader.rs:1243-1250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-urdf/src/reader.rs:1198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e55d23deb3abf9ef668832088993d5c88d5176cf68f25906ca5564476dfc8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-wasm/src/document_engine.rs:374-380 | crates/vcad-kernel-wasm/src/document_engine.rs:382-388 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b2aa9165648567b619f2d79df4a9b01a76437b9b69d29365bac1e0b0708e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:2103-2109 | crates/vcad-kernel-wasm/src/lib.rs:2625-2631 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-kernel-wasm/src/lib.rs:2112\u0060 calls \u0060to_mesh\u0060, \u0060unwrap_or\u0060 and \u0060crates/vcad-kernel-wasm/src/lib.rs:2634\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e58dd5117004fd6d857dae5e88b68cdb49678ef1dd5f85588644fe7a8177ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:4048-4054 | crates/vcad-kernel-wasm/src/lib.rs:4100-4106 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":4048}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bf22ca8c02c9be91621a0ba9829807220dca3dce13215cbec4c9eaca5f9be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:9341-9347 | crates/vcad-kernel-wasm/src/lib.rs:9662-9668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:9341\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-kernel-wasm/src/lib.rs:9659\u0060 calls \u0060resolve\u0060, \u0060map_err\u0060, \u0060to_string\u0060 and \u0060crates/vcad-kernel-wasm/src/lib.rs:9340\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":9341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccbf61b196f69052fd6d2006cb4f15a52c23a762f35141bd9f5f85157dac0bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-loon/src/fastener.rs:623-630 | crates/vcad-parts/src/vacuum/mod.rs:601-608 \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 \u0060crates/vcad-loon/src/fastener.rs:623\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":"crates/vcad-loon/src/fastener.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de07edaa20fba2c216285f3da3e4ae561a3015441ef4fd798fff74a056f6f53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 5): crates/vcad-kernel-fea/src/mesh.rs:164-171 | crates/vcad-kernel-fea/src/mesh.rs:422-429 | crates/vcad-kernel-fea/src/mesh.rs:576-583 | crates/vcad-kernel-tessellate/src/clearance.rs:147-153 | crates/vcad-kernel-topopt/src/domain.rs:117-124 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/mesh.rs\u0060 and \u0060crates/vcad-kernel-topopt/src/domain.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c62178360f855d208eb45b545e38ecb19b312b14380f13faef41982351e35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/vcad-kernel-sketch/src/extrude.rs:988-993 | crates/vcad-kernel-sketch/src/extrude.rs:1309-1315 | crates/vcad-kernel-sketch/src/extrude.rs:1453-1459 | crates/vcad-kernel-sweep/src/loft.rs:283-289 | crates/vcad-kernel-sweep/src/sweep.rs:387-393 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/loft.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 97 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:988\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b262b789f6b4dacb1f5a71d7280830f78b91b416b5f5514faa4ab918d0e6b6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/vcad-kernel-booleans/src/api.rs:838-845 | crates/vcad-kernel-booleans/src/pipeline.rs:2219-2226 | crates/vcad-kernel-booleans/src/validate.rs:112-119 | crates/vcad-kernel-booleans/src/validate.rs:128-135 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/api.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/validate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/vcad-kernel-booleans/src/api.rs:838\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"321cc0db93bf9ce8b88e6e308d6d4278217a469f463f0daf34e68257eb13dc51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/vcad-kernel-booleans/src/split.rs:1441-1446 | crates/vcad-kernel-booleans/src/split.rs:1580-1585 | crates/vcad-kernel-booleans/src/split.rs:1854-1861 | crates/vcad-kernel-booleans/src/split.rs:2184-2189 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:1441\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce30df3c27f8f16f46d845e71af146d9fa2c0509328cfdf645047fb60566c529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-app/src/materializer.rs:677-688 | crates/vcad-app/src/materializer.rs:718-723 | crates/vcad-app/src/materializer.rs:753-764 \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 \u0060crates/vcad-app/src/materializer.rs:677\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ccbef78af473bc071d5e5144a80e8ecd2b6c66880bb77ef8436a8fde50503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 12): crates/vcad-ecad-fabprep/src/verdict.rs:185-188 | crates/vcad-ecad-pcb/src/copper_pour.rs:173-176 | crates/vcad-ecad-pcb/src/drc.rs:287-290 | crates/vcad-ecad-pcb/src/drc.rs:1544-1548 | crates/vcad-ecad-pcb/src/pour_synth.rs:448-451 | crates/vcad-ecad-pcb/src/pour_synth.rs:645-648 | crates/vcad-ecad-pcb/src/router/auto.rs:1651-1654 | crates/vcad-ecad-pcb/src/router/complete.rs:1137-1140 | crates/vcad-ecad-pcb/src/router/complete.rs:1638-1641 | crates/vcad-ecad-pcb/src/router/congestion.rs:148-153 | crates/vcad-ecad-pcb/src/router/legalize.rs:723-726 | crates/vcad-ecad-pcb/src/router/maze.rs:1447-1452 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-pcb/src/router/complete.rs\u0060 and \u0060crates/vcad-ecad-pcb/src/router/maze.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 \u0060crates/vcad-ecad-pcb/src/drc.rs:1544\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-ecad-fabprep/src/verdict.rs:189\u0060 calls \u0060push\u0060 and \u0060crates/vcad-ecad-pcb/src/drc.rs:291\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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3df5681b83a8ffbc35968653cd41cbd1cf2e20633e36ade5efa7885aa4198d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/vcad-eval/src/cavity_extract.rs:269-277 | crates/vcad-eval/src/sim_extract.rs:302-309 | crates/vcad-eval/src/thermal_extract.rs:528-535 \u2014 before extracting anything, compare \u0060crates/vcad-eval/src/cavity_extract.rs\u0060 and \u0060crates/vcad-eval/src/sim_extract.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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. 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, \u0060crates/vcad-eval/src/sim_extract.rs:311\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060crates/vcad-eval/src/cavity_extract.rs:277\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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a9b93cdbd6f30b91982867dd058ce5254d1ef2627784d20995e8b78c864a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-booleans/src/bbox.rs:342-348 | crates/vcad-kernel-booleans/src/bbox.rs:399-405 | crates/vcad-kernel-booleans/src/bbox.rs:409-415 \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 \u0060crates/vcad-kernel-booleans/src/bbox.rs:342\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":"crates/vcad-kernel-booleans/src/bbox.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6b16adcad89f82b3a96b89455b436a264c79538bf758b225fbc0fb7be2371c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-booleans/src/mesh/mod.rs:178-183 | crates/vcad-kernel-fillet/src/topology.rs:184-189 | crates/vcad-kernel-shell/src/lib.rs:1336-1341 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/mod.rs\u0060 and \u0060crates/vcad-kernel-shell/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66aa2591a41ec98072e0def833defc127f442f4386bfcabb8a1a4e2499d77b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-cam/src/toolpath.rs:258-264 | crates/vcad-kernel-cam/src/toolpath.rs:266-272 | crates/vcad-kernel-cam/src/toolpath.rs:275-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. 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":"crates/vcad-kernel-cam/src/toolpath.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0538540a86bb82ce8a9bd7ec5bbf03ec7cb6df20a87d750d11effcbb0e125a37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/vcad-kernel-constraints/src/session.rs:891-897 | crates/vcad-kernel-tessellate/src/lib.rs:366-371 | crates/vcad-render/src/lib.rs:2069-2075 \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":"crates/vcad-kernel-constraints/src/session.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"d087a148686e1a249d60b50f6c3a671176e5f5eaf73fa53fbc258992e680c8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 4): crates/vcad-kernel-diff/src/lift.rs:245-250 | crates/vcad-kernel-diff/src/lift.rs:275-280 | crates/vcad-kernel-diff/src/lift.rs:305-310 | crates/vcad-kernel-diff/src/lift.rs:334-335 \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 \u0060crates/vcad-kernel-diff/src/lift.rs:245\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-diff/src/lift.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a93438596b8a04c6f8bee2e481b5337c326feaa68272f53a3427f55e4e4aa2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:199-204 | crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:235-240 | crates/vcad-kernel-drafting/src/section.rs:616-621 \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":"crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb120dc17161d6dc858de66ce89b0a88ab5065e792c15992ccf90990c1a4af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-drafting/src/edge_extract.rs:457-462 | crates/vcad-kernel-drafting/src/hidden_line.rs:430-436 | crates/vcad-kernel-raytrace/src/trim.rs:919-925 \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 \u0060crates/vcad-kernel-drafting/src/edge_extract.rs:457\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/edge_extract.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ea5d70042d37ef303711286f45458ca8e35dd53a9154e806d056c627e0566a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-sketch/src/extrude.rs:1207-1212 | crates/vcad-kernel-sweep/src/loft.rs:184-189 | crates/vcad-kernel-sweep/src/sweep.rs:285-290 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/loft.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 97 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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"296a27d3441248dbba38650e6f9c81a436b94b88ed72444d603d934cbdb1d495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-stocksim/src/verify.rs:296-301 | crates/vcad-kernel-tessellate/src/clearance.rs:499-504 | mecheval/graders/src/fit.rs:244-250 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-stocksim/src/verify.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/clearance.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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 \u0060crates/vcad-kernel-stocksim/src/verify.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":"crates/vcad-kernel-stocksim/src/verify.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1749051da908ff6b62ed16e01776543215ee5004023c22905f2ee97e75071f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:4584-4589 | crates/vcad-kernel-tessellate/src/lib.rs:7071-7076 | crates/vcad-kernel-tessellate/src/lib.rs:7269-7274 \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 \u0060crates/vcad-kernel-tessellate/src/lib.rs:4584\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a519bf0a77549f4e267ebee38f4165316ab6c2a9fcbe13720cde07df47d47f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-wasm/src/lib.rs:5956-5961 | crates/vcad-kernel-wasm/src/lib.rs:5990-5995 | crates/vcad-kernel-wasm/src/lib.rs:6023-6028 \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 \u0060crates/vcad-kernel-wasm/src/lib.rs:5956\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5956}}}],"partialFingerprints":{"codehealthFindingId/v1":"42620a6c1da3380dbe1852b4a0937a73a310bbc3df2a07657141c68c64b11407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-wasm/src/lib.rs:9342-9348 | crates/vcad-kernel-wasm/src/lib.rs:9558-9563 | crates/vcad-kernel-wasm/src/lib.rs:9663-9669 \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 \u0060crates/vcad-kernel-wasm/src/lib.rs:9342\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":9342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c349a78908796ff9933965ed870c49a7eebdd90b7502a4166eb3bb261c2e9b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/termview/src/rasterize.rs:644-649 | crates/termview/src/rasterize.rs:692-697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/termview/src/rasterize.rs:644\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/termview/src/rasterize.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a58420e6ea4e39a2ea8c53b69a913f7535f4077f7bf1e62f8c3368adf4a20a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-app/src/feature.rs:558-565 | crates/vcad-app/src/feature.rs:608-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-app/src/feature.rs:558\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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9cf6ea1979c020da7ca3161da5cd1c1b280da51dfe5601d25db1b22b01be80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-cli/src/main.rs:5099-5105 | crates/vcad-ecad-pcb/src/session.rs:268-274 \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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":5099}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d34f4a149ba9ab62ba8bfb6bcade65e19db162f5c6b4cd8d5bacd13d452734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-cli/src/ui/tree.rs:108-113 | crates/vcad-cli/src/ui/tree.rs:122-127 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-cli/src/ui/tree.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfaef3ffd320991f2d89e22606922a37d4d750eda3b89dfe9d102cfc116ff25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-design-constraints/src/measure.rs:276-282 | crates/vcad-design-constraints/src/measure.rs:284-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. 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":"crates/vcad-design-constraints/src/measure.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14630a39044ef57ac812eb3d32c61f4fb17c10e87538fdeac8d61af55891664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:1676-1681 | crates/vcad-ecad-pcb/src/router/auto.rs:1714-1719 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d396998a2e5695f4bb1da67a6a5fe2ab680c4adbff34573d98aace10d2d89efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:4020-4025 | crates/vcad-ecad-pcb/src/router/flow/route.rs:155-160 \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 \u0060crates/vcad-ecad-pcb/src/router/auto.rs:4020\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26495c8d9ebe69d0a6449f486f6f1c9d8f0b92530fe6a323c1d97e260f20621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:894-899 | crates/vcad-ecad-pcb/src/router/sco.rs:935-940 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/sco.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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"09adfb3ca6a10199e06d8d4b6e361472e2b49661041421eda66c229eb0b3289a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/spatial.rs:610-616 | crates/vcad-ffi/src/lib.rs:2175-2181 \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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"834201c3baa38b3901cba7e0b6e0b2eb756f18e462e02aad4cbc6a211d40b5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-pcb/src/spatial.rs:611-616 | mecheval/graders/src/pcb.rs:149-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 \u0060mecheval/graders/src/pcb.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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"01078fdb7381b339ed4cc4381bc6571f72a51f00b41619d3781c9001c329b618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_pcb.rs:158-167 | crates/vcad-ecad-symbols/src/kicad_sch.rs:51-60 \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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b1b3ba1d4fd083ce7bab5edf1b610bae7bed5ab97612b6bc4f1a25e4d45fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_pcb.rs:705-711 | crates/vcad-ecad-symbols/src/kicad_pcb.rs:712-718 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ff16ab6f08e1f1245f529cef5cf090ecfecd864c94d7666de42522dd8e5592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:2515-2520 | crates/vcad-ecad-symbols/src/kicad_write.rs:2522-2527 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9350d81dcfa3097133a67829503ed9262890e1dc629b4e55d0a5188bf21be94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-eval/src/cavity_extract.rs:496-501 | crates/vcad-kernel-booleans/src/split.rs:5183-5188 \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 \u0060crates/vcad-eval/src/cavity_extract.rs:496\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"775efbc2783194c23bd5ee778137dee611eba627052cef6314f57b33e9d73fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:3725-3730 | crates/vcad-kernel-fea/src/mesh.rs:814-819 \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 \u0060crates/vcad-eval/src/evaluate.rs:3725\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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":3725}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c66df0e85e4b7ec7bf80e367ecc2bb5228dfeaa15ecb8f98b89d343e137db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-eval/src/pcb_preview.rs:589-594 | crates/vcad-eval/src/pcb_preview.rs:595-600 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-eval/src/pcb_preview.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93aad731ca165515b08bb1dc641a36f6ece5b4419f730eabd03ab0368ca1310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-eval/src/sim_extract.rs:716-722 | crates/vcad-eval/src/sim_extract/em.rs:318-324 \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":"crates/vcad-eval/src/sim_extract.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d9630963939a48f9705c34a9d04beec0794b1d5ed140b085c51cd87ef6f2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-eval/src/validate.rs:98-103 | crates/vcad-kernel-urdf/src/writer.rs:409-414 \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 \u0060crates/vcad-eval/src/validate.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/validate.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71de3cd70020383c7598fa08053ab22f6bcdb862848c4817829720db50b9428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ffi/src/drafting.rs:262-267 | crates/vcad-kernel-drafting/src/dimension/placement.rs:90-95 \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 \u0060crates/vcad-ffi/src/drafting.rs:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc7069e7fe659f3534cab4b9842b2c8cf21272dd05d75bf75439d12e0098369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ffi/src/lib.rs:499-504 | crates/vcad-ffi/src/lib.rs:629-634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/lib.rs:499\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f70116cb1977aba461bde7696b2378db0327adad9ff34694cb954d570b77b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/vcad-kernel-acoustics/src/instrument.rs:271-279 | crates/vcad-kernel-fea/src/mesh.rs:465-472 \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 \u0060crates/vcad-kernel-acoustics/src/instrument.rs:271\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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6492fb81a1f01a0fa53cd86206d81d372abb6a498b0f78a3fe5f5b8a1381872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-acoustics/src/instrument.rs:358-365 | crates/vcad-kernel-acoustics/src/strike.rs:174-181 \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 \u0060crates/vcad-kernel-acoustics/src/instrument.rs:358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f592991158790d58c2f4ce506cb31d835d1dff49bd78a0c3897bf60b916f3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-acoustics/src/instrument.rs:462-467 | crates/vcad-kernel-fea/src/modal.rs:295-300 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/instrument.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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 \u0060crates/vcad-kernel-acoustics/src/instrument.rs:462\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa571e7f1786f630835f4becc0649a555b64da46760b26b1f67089891701ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 6): crates/vcad-kernel-acoustics/src/instrument.rs:518-520 | crates/vcad-kernel-acoustics/src/instrument.rs:523-525 | crates/vcad-kernel-acoustics/src/instrument.rs:530-535 | crates/vcad-kernel-fea/src/modal.rs:340-342 | crates/vcad-kernel-fea/src/modal.rs:345-347 | crates/vcad-kernel-fea/src/modal.rs:352-357 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/instrument.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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 \u0060crates/vcad-kernel-acoustics/src/instrument.rs:518\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"655d12e6d516131b4e15aa1d3bfc0b8ebb0f2d63789f97123516ddb1d4c21710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 5): crates/vcad-eval/src/evaluate.rs:2694-2695 | crates/vcad-eval/src/kinematics.rs:27-28 | crates/vcad-ffi/src/lib.rs:822-823 | crates/vcad-kernel-assembly/src/pose.rs:45-50 | crates/vcad-typst/src/lib.rs:230-235 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060t\u0060 to \u0060\u0026Transform3D\u0060 in one and \u0060\u0026vcad_ir::Transform3D\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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"40792c3861a73b2a266296aa8f29a8d33f584ea1d03e869362b6b0ef2ccf25db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-booleans/src/api.rs:928-935 | crates/vcad-kernel-booleans/src/validate.rs:354-361 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/api.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/validate.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"312dd0f3fd78b6e01c8b35c26415967852072b7ae1cbbdaa4037a0d93f29314f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:588-593 | crates/vcad-kernel-booleans/src/trim.rs:337-342 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/classify.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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 \u0060crates/vcad-kernel-booleans/src/classify.rs:588\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"558040cb32dde8b7a003ad4b069c636d8b6d49df0d9dcbfbb4f288fb9ba0f01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:683-688 | crates/vcad-kernel-tessellate/src/lib.rs:2935-2940 \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 \u0060crates/vcad-kernel-booleans/src/classify.rs:683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b183d7c2b5da8b0a50e0975cd4f1ff1119a2c7d189fda96d683638d327b9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:647-652 | crates/vcad-kernel-booleans/src/mesh/csg.rs:689-694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs:647\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c65787e4439404412de44fe82cd10d87a89ee03c0fdf6d5b3a9519c25ccc831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:115-122 | crates/vcad-kernel-booleans/src/pipeline.rs:137-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. 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bcad05fb838626de71b128505a582b71e07085d432c008a6884e48444685c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1502-1507 | crates/vcad-kernel-booleans/src/split.rs:1736-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 \u0060crates/vcad-kernel-booleans/src/split.rs:1502\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c8bd9e7fc8579d4268057b1e2827e177ff765ad657b4a437cfbb877ce966e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1628-1633 | crates/vcad-kernel-booleans/src/split.rs:3487-3492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:1628\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9087cd586dea588a5e7f2c8cabf4ba69b86ae85ac685f1b4a15da0e21cc8f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1919-1924 | crates/vcad-kernel-booleans/src/split.rs:7149-7154 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9077a9e19cc5295565b28091e896fc73ef8cda8046ad3a53c6012de4beeeb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:3095-3100 | crates/vcad-kernel-booleans/src/split.rs:6854-6859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:3095\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03d7a8582ca5c9c42e9f248ccac7d132b0531dee7d318599c5444afe5b1c5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:4997-5003 | crates/vcad-kernel-booleans/src/split.rs:5229-5235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:4997\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4997}}}],"partialFingerprints":{"codehealthFindingId/v1":"737c7620d36db53cb15916451e487c0ec2bc31a1e9702759bd45150aa9f4799e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/trim.rs:298-304 | crates/vcad-kernel-booleans/src/trim.rs:472-478 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-kernel-booleans/src/trim.rs:291\u0060 calls \u0060project_point_to_uv\u0060, \u0060as_ref\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs:468\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":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f563429beb7b3101c2bfe809dd0da94e9bcaa82d266c2113c09fbdc91df2f332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): crates/vcad-kernel-booleans/src/ssi.rs:1085-1089 | crates/vcad-kernel-booleans/src/ssi.rs:1130-1133 | crates/vcad-kernel-booleans/src/trim.rs:866-871 | crates/vcad-kernel-fillet/src/closest_point.rs:85-90 \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. 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":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"5602cd0605dd16f1ac3432b4334ef0af7908e47455d2e4d0cab42b4c3cf00bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-cam/src/dropcutter/ball.rs:86-91 | crates/vcad-kernel-cam/src/dropcutter/bull.rs:201-206 \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 \u0060crates/vcad-kernel-cam/src/dropcutter/ball.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/dropcutter/ball.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c916a2286d4acb9ca2abdd90385df86fb70c00f6c06a5675d0befda066ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/vcad-kernel-cam/src/post/grbl.rs:189-204 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:249-264 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-cam/src/post/grbl.rs\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 152 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 \u0060crates/vcad-kernel-cam/src/post/grbl.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7395e1a87d885736400095955709134248f03c2235f5d345921001ff209eb87b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-constraints/src/symbolic.rs:453-458 | crates/vcad-kernel-constraints/src/symbolic.rs:507-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-constraints/src/symbolic.rs:453\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":"crates/vcad-kernel-constraints/src/symbolic.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd3de0e10af9942cd9ea3e2ebbd4b77e60d54aa2b2462a1a452779ee1099dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-dfm/src/geom/accessibility.rs:42-48 | crates/vcad-kernel-dfm/src/geom/draft.rs:27-33 \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 \u0060crates/vcad-kernel-dfm/src/geom/accessibility.rs:42\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-dfm/src/geom/accessibility.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfaee7672624cba00cde54e7c4456d18de5544afaaa9ac319aff3c3830194ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-dfm/src/geom/accessibility.rs:72-77 | crates/vcad-kernel-dfm/src/geom/thickness.rs:120-125 \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 \u0060crates/vcad-kernel-dfm/src/geom/accessibility.rs:72\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-dfm/src/geom/accessibility.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"36be910a6ebe44508b25323261c8ef3d50e981d2a54d04d9d92782a3f7e7aa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/vcad-kernel-dfm/src/geom/probe.rs:197-199 | crates/vcad-kernel-dfm/src/geom/probe.rs:382-386 | crates/vcad-kernel-shell/src/lib.rs:895-900 \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 \u0060crates/vcad-kernel-dfm/src/geom/probe.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. 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":"crates/vcad-kernel-dfm/src/geom/probe.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c170a5ae0ff8c715319bc74ed5136a589250ccf8f25deb14b3cc22fb482225ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-dfm/src/rules/fdm.rs:76-81 | crates/vcad-kernel-dfm/src/rules/fdm.rs:112-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 \u0060crates/vcad-kernel-dfm/src/rules/fdm.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/fdm.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ff33e8f39c4a3c0831c87e7a52bad77aef0a41fdcb4bcf5f0fa0228db1410c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:120-126 | crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:139-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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:128\u0060 calls \u0060Some\u0060 and \u0060crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs:146\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":"crates/vcad-kernel-drafting/src/dimension/geometry_ref.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab1df3786764b831ea884fbc6d7a80f0c59bf29a2b46531858bfa6f3ace2fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 3): crates/vcad-kernel-drafting/src/section.rs:647-652 | crates/vcad-kernel-sketch/src/profile.rs:478-484 | crates/vcad-slicer/src/perimeter.rs:152-152 \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 \u0060crates/vcad-kernel-drafting/src/section.rs:647\u0060 it does not close everything it opens, so those exact 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 \u0060p\u0060 to \u0060\u0026Point2D\u0060 in one and \u0060Point2\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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b71fe3d1bdf10ea29d248d0a94d9012df9c82480f7c6786a238efb662889d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:404-410 | crates/vcad-kernel-em/src/planar.rs:287-293 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"9858a9fc1ac627235b50c0e113eec51013f5aa74979902b262c3d153fb8fb4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-em/src/planar.rs:254-261 | crates/vcad-kernel-em/src/planar.rs:281-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/planar.rs:254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/planar.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bf679780d42b9989c92f0537b9627272494acd96aee59cac40af267d328aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-export/src/lib.rs:361-368 | crates/vcad-slicer-bambu/src/job.rs:52-59 \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":"crates/vcad-kernel-export/src/lib.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8820eebc9f059fc073db3247adc4fb130a8c8dda1b5181e9dfdbb75502eb40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-fea/src/buckling.rs:465-470 | crates/vcad-kernel-fea/src/modal.rs:217-223 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/buckling.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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 \u0060crates/vcad-kernel-fea/src/buckling.rs:465\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"96abcbc8b35656565916d6135d01feca05e9e22906fe92d12525b73007e68e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-fea/src/mesh.rs:189-194 | crates/vcad-kernel-topopt/src/domain.rs:144-151 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/mesh.rs\u0060 and \u0060crates/vcad-kernel-topopt/src/domain.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/vcad-kernel-fea/src/mesh.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"96311762fd449b1bc607f1f4b135476cd5e954b628e13921fbf9006505d38d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-fea/src/mesh.rs:786-797 | crates/vcad-kernel-topopt/src/domain.rs:176-187 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/mesh.rs\u0060 and \u0060crates/vcad-kernel-topopt/src/domain.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/vcad-kernel-fea/src/mesh.rs:786\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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0deb866f2957a38a07fe859ed8800c16ce28e4b083a849e5ae82f4dba296c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-fea/src/solve.rs:459-464 | crates/vcad-kernel-topopt/src/analyze.rs:283-288 \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 \u0060crates/vcad-kernel-fea/src/solve.rs:459\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/solve.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f6de470ffe3666314be7d64104f2ad0a59b38ac460ebc4ca7de994b61a5cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-fillet/src/fillet_subset.rs:596-601 | crates/vcad-kernel-sketch/src/revolve.rs:561-567 \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 \u0060crates/vcad-kernel-fillet/src/fillet_subset.rs:596\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":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb8e3a11904ff36b35bb5b7d61ed1a0c8ee596bcc61ee6f8d2f982dc4ecf4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 4): crates/vcad-kernel-flow/src/adjoint.rs:502-502 | crates/vcad-kernel-flow/src/adjoint.rs:543-548 | crates/vcad-kernel-flow/src/adjoint.rs:635-635 | crates/vcad-kernel-flow/src/adjoint.rs:668-673 \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 \u0060crates/vcad-kernel-flow/src/adjoint.rs:543\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"321d88dadc97f20f137d3434c0e356d09a9037ba925ed09f783bcf85b17a93dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-flow/src/gpu.rs:157-162 | crates/vcad-kernel-gpu/src/wavefront.rs:121-128 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/gpu.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/wavefront.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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 \u0060crates/vcad-kernel-flow/src/gpu.rs:157\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":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfc5ca35376622456913ef50d9b6ef61ef7958be807a89a218e7dfab0eac5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-neutronics/src/rng.rs:13-18 | crates/vcad-kernel-qcd/src/rng.rs:11-16 \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":"crates/vcad-kernel-neutronics/src/rng.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab78aa40334317753ce2040e2db37b6ba4bf90336d04ca3b6b4151ecdbfd9868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-particle/src/adjoint.rs:278-285 | crates/vcad-kernel-particle/src/adjoint.rs:310-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/adjoint.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5578517cfa82030b05a59316d20162206c1002f39a40c5b77310311c44fffe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-photonics/src/sim.rs:579-585 | crates/vcad-kernel-photonics/src/sim.rs:617-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-photonics/src/sim.rs:579\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2a0e1ae2845653f21a7ecabd072a136b77f7b8319d19dc1ecf8e3271ada148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-physics/src/diff.rs:452-462 | crates/vcad-kernel-physics/src/diff.rs:621-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-physics/src/diff.rs:452\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-kernel-physics/src/diff.rs:632\u0060 calls \u0060Some\u0060, \u0060contract\u0060 and \u0060crates/vcad-kernel-physics/src/diff.rs:463\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":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8847fe85e6f7a186608381d228a6876720b132991b1ebe677f436a9babbde907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-primitives/src/lib.rs:38-43 | crates/vcad-kernel-primitives/src/lib.rs:173-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2442289d96c11d2b6236fc348075d4255a6a99a732e3aa944a79e568b42cede3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-primitives/src/lib.rs:451-456 | crates/vcad-kernel-primitives/src/lib.rs:669-674 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-primitives/src/lib.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c12d4bec261b18929d6027c0e90d85853a8d8f8b8570a920e9f953065050cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-qcd/src/su3.rs:231-237 | crates/vcad-kernel-qcd/src/su3.rs:246-252 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-qcd/src/su3.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4496aed4497295760772e7b419b0f76b97d774d6efd08cac031137ebbd1798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-shell/src/lib.rs:374-379 | crates/vcad-kernel-sketch/src/extrude.rs:1192-1197 \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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e86c5c8fb2d58394b93ad6ed5eebdbf1d84588d1782b92d59ce45a88498e4a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/vcad-kernel-step/src/assembly.rs:175-180 | crates/vcad-kernel-tessellate/src/query.rs:102-104 | crates/vcad-parts/src/vacuum/mod.rs:652-657 \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 \u0060crates/vcad-kernel-step/src/assembly.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. 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":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea57e6bd84fa06d4eaa7f2da08732a8a3cd6e73a17c509472753dd93d883e206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:4596-4602 | crates/vcad-kernel-tessellate/src/lib.rs:4998-5004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:4596\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4596}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f84dbe7bf1a62396116e2fa7640057f51bd437966778450c2a08d8ec88eb015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:5314-5315 | crates/vcad-kernel-tessellate/src/lib.rs:5649-5654 | crates/vcad-kernel-tessellate/src/lib.rs:7684-7689 \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 \u0060crates/vcad-kernel-tessellate/src/lib.rs:5314\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8d81c229755ee70da379b4adbb48233fe1645ac8a709cecb34dedf95a00714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:6000-6005 | crates/vcad-kernel-tessellate/src/lib.rs:6169-6174 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6000}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83a46af22d88ede49993c63602a6ed1ef212a9560d362494b96b1292c4935bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:6063-6068 | crates/vcad-kernel-tessellate/src/lib.rs:6172-6177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:6063\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6063}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd77ffff1fa0e4fe15934ec3618f09f07fbbcfd6e28086ab1e830848728474d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:291-296 | crates/vcad-kernel-wasm/src/lib.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 \u0060crates/vcad-kernel-wasm/src/lib.rs:376\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"277576aaf0a9d961d9df56de3fa3dc759d20cfaf433a0b860f3363fcdced6037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:8264-8271 | crates/vcad-kernel-wasm/src/lib.rs:8456-8463 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8264}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cf75017efcac4af4f7b7bcba7c590b17adc0239b68f5d9d021ea4fe60f73fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:8289-8294 | crates/vcad-kernel-wasm/src/lib.rs:8480-8485 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8289}}}],"partialFingerprints":{"codehealthFindingId/v1":"903cb0dc85316dc6c3d392f1c559cec40620fc2a9d78163be4d8b0f2d5b5963c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/vcad-kernel/src/lib.rs:2195-2207 | crates/vcad-kernel/src/lib.rs:2252-2263 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"06648c3f49c24892417cd1880d23bbe784c157fda950e20c18e21ab1ceb3ff48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-mcp/src/server.rs:1006-1011 | crates/vcad-mcp/src/server.rs:1486-1492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-mcp/src/server.rs:1486\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aa9065a2a64c89ffd9249a6e4a4c6ac106494bc0e4875abda1df8e61eaeec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): crates/vcad-kernel-fillet/src/revolved.rs:709-713 | crates/vcad-kernel-primitives/src/lib.rs:482-487 | crates/vcad-kernel-primitives/src/lib.rs:552-564 | crates/vcad-kernel-primitives/src/lib.rs:677-682 | crates/vcad-kernel-primitives/src/lib.rs:745-750 | crates/vcad-kernel-sketch/src/extrude.rs:504-508 | crates/vcad-kernel-sketch/src/extrude.rs:1205-1210 | crates/vcad-kernel-sketch/src/extrude.rs:1359-1364 | crates/vcad-kernel-sketch/src/extrude.rs:1399-1404 | crates/vcad-kernel-sweep/src/loft.rs:182-187 | crates/vcad-kernel-sweep/src/sweep.rs:283-288 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-primitives/src/lib.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/extrude.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":"crates/vcad-kernel-fillet/src/revolved.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"403293aff22d07025735cae51eda3c05e084de7375b80f97a943593edbf8b9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): crates/vcad-kernel-tessellate/src/lib.rs:2864-2868 | crates/vcad-kernel-tessellate/src/lib.rs:4582-4586 | crates/vcad-kernel-tessellate/src/lib.rs:4695-4699 | crates/vcad-kernel-tessellate/src/lib.rs:4988-4992 | crates/vcad-kernel-tessellate/src/lib.rs:5213-5217 | crates/vcad-kernel-tessellate/src/lib.rs:6433-6437 | crates/vcad-kernel-tessellate/src/lib.rs:6654-6658 | crates/vcad-kernel-tessellate/src/lib.rs:7069-7073 | crates/vcad-kernel-tessellate/src/lib.rs:7267-7271 | crates/vcad-kernel-tessellate/src/lib.rs:8141-8145 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-kernel-tessellate/src/lib.rs:4694\u0060 calls \u0060radial_normal\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs:7068\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e1052fa1ffc31f85eb6cfe624d87d0c4fbd715cf7903a0883e1154c304f7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): crates/vcad-kernel-wasm/src/lib.rs:8850-8854 | crates/vcad-kernel-wasm/src/lib.rs:8977-8981 | crates/vcad-kernel-wasm/src/lib.rs:9067-9071 | crates/vcad-kernel-wasm/src/lib.rs:9175-9179 | crates/vcad-kernel-wasm/src/lib.rs:9329-9333 | crates/vcad-kernel-wasm/src/lib.rs:9455-9459 | crates/vcad-kernel-wasm/src/lib.rs:9647-9651 | crates/vcad-kernel-wasm/src/lib.rs:10297-10301 | crates/vcad-kernel-wasm/src/lib.rs:10655-10659 | crates/vcad-kernel-wasm/src/lib.rs:11140-11144 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-kernel-wasm/src/lib.rs:9645\u0060 calls \u0060from_str\u0060, \u0060map_err\u0060 and \u0060crates/vcad-kernel-wasm/src/lib.rs:8849\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8850}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2e4ca76c634689fd87e1bf0a949eb3095798f49b5056943423071eb3f0a9bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): crates/vcad-atoms/src/fab.rs:229-233 | crates/vcad-ffi/src/fea.rs:267-271 | crates/vcad-kernel-assembly/src/pose.rs:311-315 | crates/vcad-kernel-fea/src/modal.rs:1154-1158 | crates/vcad-mcp/src/tools/core.rs:320-324 | crates/vcad-render/src/animate.rs:517-521 | crates/vcad-render/src/report.rs:320-324 | crates/vcad-sound/src/lib.rs:434-438 | crates/vcad-typst/src/lib.rs:305-309 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-atoms/src/fab.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/fab.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"143427702493661047c5375187f17310d3f5aaf8339d5e0967808f3aba6f4cc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/vcad-kernel-booleans/src/split.rs:3082-3088 | crates/vcad-kernel-booleans/src/split.rs:5085-5089 | crates/vcad-kernel-booleans/src/split.rs:5339-5343 | crates/vcad-kernel-booleans/src/split.rs:6303-6307 | crates/vcad-kernel-booleans/src/split.rs:6843-6847 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:3082\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3082}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f03bbd8bcda65bfe287aee0cfcd7029d05b6743332974c5c35d2ad63f8ceb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/vcad-kernel-gpu/src/decimate.rs:352-356 | crates/vcad-kernel-gpu/src/normals.rs:259-263 | crates/vcad-kernel-gpu/src/wavefront.rs:323-327 | crates/vcad-kernel-gpu/src/wavefront.rs:678-682 | crates/vcad-kernel-gpu/src/wavefront.rs:699-703 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-gpu/src/decimate.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/normals.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a63342ed7fff3357f5b1891b131fd94bc9742f0a13b5e061698145670be6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/vcad-kernel-raytrace/src/cpu.rs:122-126 | crates/vcad-kernel-raytrace/src/cpu.rs:207-211 | crates/vcad-kernel-raytrace/src/cpu.rs:376-380 | crates/vcad-kernel-raytrace/src/cpu.rs:530-534 | crates/vcad-kernel-raytrace/src/cpu.rs:553-557 \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":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"734e3b0116656c3f3d7a331aaf8e8b7442b137aba7cb5943a925b56fb2725343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/vcad-kernel-sketch/src/extrude.rs:318-322 | crates/vcad-kernel-sketch/src/extrude.rs:699-703 | crates/vcad-kernel-sketch/src/extrude.rs:892-896 | crates/vcad-kernel-sketch/src/extrude.rs:1218-1222 | crates/vcad-kernel-sweep/src/loft.rs:195-199 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sweep/src/loft.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 97 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:318\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e3e81bea424365c00075327f1bf1ecb1d3bf7dca803a09c172a61e18207255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/vcad-eval/src/validate.rs:98-102 | crates/vcad-ir/src/lib.rs:1543-1547 | crates/vcad-ir/src/lib.rs:1595-1599 | crates/vcad-kernel-urdf/src/writer.rs:408-413 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/validate.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d2f0e65bd4632a8b4b75fd590660eb8a7a285b1b91c29540cb33dfba878745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/vcad-gdsii/src/bridge.rs:230-234 | crates/vcad-kernel-raytrace/src/gpu/buffers.rs:1153-1157 | crates/vcad-process/src/bridge.rs:123-127 | crates/vcad-process/src/masks.rs:74-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-gdsii/src/bridge.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-gdsii/src/bridge.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"68152ebc19fb2ab8436312bdc9cb15c9f7d9646ee5c3ac3e30d993e846a80b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/vcad-kernel-acoustics/src/optimize.rs:67-73 | crates/vcad-kernel-optics/src/optimize.rs:71-77 | crates/vcad-kernel-particle/src/optimize.rs:70-76 | crates/vcad-kernel-particle/src/optimize.rs:173-179 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/optimize.rs\u0060 and \u0060crates/vcad-kernel-optics/src/optimize.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. 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 \u0060crates/vcad-kernel-acoustics/src/optimize.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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccf14cb54f1d1805329c7154dadeb003e3af042dca12aaa756e61be2b4da504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/vcad-kernel-fillet/src/chamfer.rs:54-58 | crates/vcad-kernel-fillet/src/fillet_curved.rs:210-214 | crates/vcad-kernel-fillet/src/fillet_planar.rs:90-94 | crates/vcad-kernel-shell/src/lib.rs:1254-1260 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7ec24a49b56c6cf9a433db333107bd7d83ee25c5ded4ff85de610ba51d848d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/vcad-kernel-fillet/src/chamfer.rs:135-139 | crates/vcad-kernel-fillet/src/fillet_curved.rs:981-985 | crates/vcad-kernel-fillet/src/fillet_planar.rs:217-221 | crates/vcad-kernel-fillet/src/trim.rs:423-427 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_curved.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 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 \u0060crates/vcad-kernel-fillet/src/chamfer.rs:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d7b277a36318bf7b91cd73cb12e529d2ec9aee9b4b554e65d3991148e269dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/vcad-kernel-tessellate/src/lib.rs:5330-5337 | crates/vcad-kernel-tessellate/src/lib.rs:5433-5440 | crates/vcad-kernel-tessellate/src/lib.rs:5668-5672 | crates/vcad-kernel-tessellate/src/lib.rs:7721-7725 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8d15e7bb750d0c9dd8a851133c42f619dbc55d6bafde1344b955e314252b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/vcad-kernel-tessellate/src/lib.rs:6001-6006 | crates/vcad-kernel-tessellate/src/lib.rs:6061-6066 | crates/vcad-kernel-tessellate/src/lib.rs:6130-6135 | crates/vcad-kernel-tessellate/src/lib.rs:6170-6175 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6001}}}],"partialFingerprints":{"codehealthFindingId/v1":"386b666b2939e165e600951057d22df528950c64c49f753dc79265c858bf25f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-booleans/src/classify.rs:486-490 | crates/vcad-kernel-booleans/src/split.rs:2773-2777 | crates/vcad-kernel-booleans/src/split.rs:3776-3780 \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 \u0060crates/vcad-kernel-booleans/src/classify.rs:486\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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9955e652abaade80d96f9d1ccfa50fb1aefeec9b169ad6189b440dbefeaa6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-booleans/src/freeze.rs:263-269 | crates/vcad-kernel-booleans/src/freeze.rs:500-506 | crates/vcad-kernel-booleans/src/repair.rs:271-277 \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":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbaa72a69ee2b61475711a10396be4232dbb493f713bb53ce793647f4be9020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-booleans/src/split.rs:1876-1881 | crates/vcad-kernel-booleans/src/split.rs:5104-5108 | crates/vcad-kernel-booleans/src/split.rs:6324-6329 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:1876\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b371605e54c1e96600359d06a7490c456120f6731a57955104110421c719f374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/vcad-kernel-dfm/src/geom/mod.rs:79-90 | crates/vcad-slicer/src/analyze.rs:347-358 | crates/vcad-slicer/src/dfm.rs:154-165 \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":"crates/vcad-kernel-dfm/src/geom/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e89b754833508035869e13a0c5a302ff9a84bf6f884cb3a5b9e56278d977f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-sheet/src/poly2d.rs:114-119 | crates/vcad-kernel-sheet/src/unfold.rs:365-370 | crates/vcad-kernel/src/sheet_json.rs:866-871 \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":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e29a1f5baf662995fc3874415fd8da2ecb2a37e05742fd4ce1eef4188d6726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-shell/src/lib.rs:910-914 | crates/vcad-kernel-step/src/reader.rs:129-133 | crates/vcad-kernel-tessellate/src/lib.rs:2907-2911 \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 \u0060crates/vcad-kernel-shell/src/lib.rs:910\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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaae703e7d22b1c9ab56493ac615a78933095c9e1ab5623ec7616ebc315fed6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-sketch/src/extrude.rs:262-279 | crates/vcad-kernel-sketch/src/extrude.rs:627-631 | crates/vcad-kernel-sketch/src/revolve.rs:183-187 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-sketch/src/extrude.rs\u0060 and \u0060crates/vcad-kernel-sketch/src/revolve.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060crates/vcad-kernel-sketch/src/extrude.rs:262\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-kernel-sketch/src/revolve.rs:180\u0060 calls \u0060clone\u0060 and \u0060crates/vcad-kernel-sketch/src/extrude.rs:260\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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"292ad2e52bfd69db39d12105868d3ece3a3d76c1880fc83f7830d4a0ee3a18ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-sketch/src/revolve.rs:423-429 | crates/vcad-kernel-sketch/src/revolve.rs:572-578 | crates/vcad-kernel-sketch/src/revolve.rs:624-630 \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 \u0060crates/vcad-kernel-sketch/src/revolve.rs:423\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cea7caa915a08db09061be2f3f59a747c11564a77034e4cfb5b040f219ca6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/termview/src/rasterize.rs:406-411 | crates/termview/src/rasterize.rs:538-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/termview/src/rasterize.rs:406\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/termview/src/rasterize.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"19df2847427b512e7272b0ea9f1632fcc57f9d4d2dfb63d16ba67ebd6d8b4176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-app/src/feature.rs:572-576 | crates/vcad-app/src/feature.rs:591-595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-app/src/feature.rs:572\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, \u0060crates/vcad-app/src/feature.rs:589\u0060 calls \u0060insert\u0060, \u0060into\u0060, \u0060F64\u0060 and \u0060crates/vcad-app/src/feature.rs:570\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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8c48aa503a43da80f62fc9f57491baa1a73b6a20ea4cb42987c8a271a913e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-app/src/migrate.rs:98-104 | crates/vcad-app/src/migrate.rs:134-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-app/src/migrate.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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27fa1980fe9cfd3a69d25ab0b568fc2eb10a4800b65952b6123b7c1801b98e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-atoms/src/fab.rs:212-219 | crates/vcad-ffi/src/print.rs:153-160 \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 \u0060crates/vcad-atoms/src/fab.rs:212\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/fab.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2df97f93d1daea964b52c8eff0981838cf47d2d99297a4f999e5dd1a16f1396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 25): crates/vcad-app/src/camera.rs:105-107 | crates/vcad-atoms/src/optimize.rs:656-658 | crates/vcad-cli/src/main.rs:2476-2480 | crates/vcad-kernel-cam/src/dropcutter/mesh_accel.rs:26-28 | crates/vcad-kernel-export/src/lib.rs:682-684 | crates/vcad-kernel-tessellate/src/creased_normals.rs:193-195 | crates/vcad-kernel-tessellate/src/creased_normals.rs:244-246 | crates/vcad-kernel-tessellate/src/lib.rs:363-365 | crates/vcad-kernel-tessellate/src/lib.rs:723-725 | crates/vcad-kernel-tessellate/src/lib.rs:1401-1405 | crates/vcad-kernel-tessellate/src/lib.rs:1477-1479 | crates/vcad-kernel-tessellate/src/lib.rs:1501-1503 | crates/vcad-kernel-tessellate/src/lib.rs:1879-1881 | crates/vcad-kernel-tessellate/src/lib.rs:2464-2466 | crates/vcad-kernel-tessellate/src/lib.rs:8792-8794 | crates/vcad-kernel-tessellate/src/lib.rs:8919-8921 | crates/vcad-kernel-tessellate/src/manifold.rs:182-184 | crates/vcad-kernel-tessellate/src/manifold.rs:643-645 | crates/vcad-kernel-tessellate/src/mesh_props.rs:84-86 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:74-76 | crates/vcad-kernel-tessellate/src/mesh_ray.rs:111-113 | crates/vcad-kernel-topopt/src/extract.rs:239-241 | crates/vcad-mcp/src/tools/core.rs:329-331 | crates/vcad-mcp/src/tools/core.rs:341-343 | crates/vcad-mcp/src/tools/core.rs:395-397 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-tessellate/src/lib.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/mesh_ray.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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 \u0060crates/vcad-app/src/camera.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. 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":"crates/vcad-app/src/camera.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7b23c08176d05d65d0f12d22196459b1ac375b68a05b4b151aefd8c025920f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-cli/src/main.rs:2485-2491 | crates/vcad-render/src/callouts.rs:169-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-cli/src/main.rs:2485\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8c6b4ddde9e51504d67f60fc2bc8918e39a01fdcb6af6846185dc789a1ccba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-cli/src/main.rs:4520-4525 | crates/vcad-cli/src/main.rs:4662-4667 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-cli/src/main.rs:4520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":4520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5756445dfb05b9a6d46918a873321fd20f45f1c305847997d42a1075bcfbd865"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-design-constraints/src/lower.rs:326-331 | crates/vcad-design-constraints/src/measure.rs:138-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9120ec92b73d76baf1439a7d9eb68eba5b18bb91c56d6c2a585a553f6243ebee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/dfm.rs:503-507 | crates/vcad-ecad-pcb/src/router/escape.rs:87-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 \u0060crates/vcad-ecad-pcb/src/dfm.rs:503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a25b45d12ef6db3fd33bae7f60a50c2279b781125922df17be4aeb521483ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 6): crates/vcad-ecad-pcb/src/drc.rs:1579-1583 | crates/vcad-ecad-pcb/src/router/auto.rs:1610-1612 | crates/vcad-ecad-pcb/src/router/maze.rs:964-966 | crates/vcad-ecad-pcb/src/session.rs:351-353 | crates/vcad-ecad-pcb/src/spatial.rs:191-193 | crates/vcad-slicer/src/infill.rs:229-233 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/drc.rs:1579\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-ecad-pcb/src/spatial.rs:193\u0060 calls \u0060max\u0060 and \u0060crates/vcad-slicer/src/infill.rs:233\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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c589857a1b08179790ddc5213dce42f7d10aa3e54077d37983dc26ffe1aef0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/geometry.rs:60-64 | crates/vcad-eval/src/evaluate.rs:3478-3482 \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 \u0060crates/vcad-ecad-pcb/src/geometry.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":"crates/vcad-ecad-pcb/src/geometry.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c508259fa288995b5bc3895841a7bc3f85dd8f5db31fdc85ed2e9ad6ee9b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:414-418 | crates/vcad-ecad-pcb/src/router/flow/cdt.rs:213-217 \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 \u0060crates/vcad-ecad-pcb/src/router/auto.rs:414\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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfb0a1a9318a04ef0caa3d8f8c2fdd670e30f296f9ce958db37107f9e78b3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:3009-3013 | crates/vcad-ecad-pcb/src/router/shove.rs:193-197 \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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac843e7a3a5fc2133cc69014fc58a37b38cfaf3123727c7ab3c1abc5917c0080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:4577-4581 | crates/vcad-ecad-pcb/src/router/shove.rs:252-257 \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 \u0060crates/vcad-ecad-pcb/src/router/auto.rs:4577\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4577}}}],"partialFingerprints":{"codehealthFindingId/v1":"59543434c00a211b3c88b1683f8deb99d4fd7569f8bbe80c03af3b0c7217360f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/descent.rs:980-984 | crates/vcad-ecad-pcb/src/router/length_match.rs:752-756 \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 \u0060crates/vcad-ecad-pcb/src/router/descent.rs:980\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"895e31d5dc1d48356862ae7eae54ff34ec0459066ecd42bac653dca90991de33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/descent.rs:1714-1719 | crates/vcad-ecad-pcb/src/router/mod.rs:121-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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"827c7f3e833f188e31e5dcb5dbd13db2c8fb2541336913162317db6b792101fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): crates/vcad-ecad-pcb/src/router/descent.rs:1111-1113 | crates/vcad-ecad-pcb/src/router/mod.rs:555-559 | crates/vcad-ecad-pcb/src/router/pair.rs:1880-1884 \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 \u0060crates/vcad-ecad-pcb/src/router/mod.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 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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c62eba16c7e12a867945ef37644e6e3a70b2f40b59b2208834443667f9b44c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-sim/src/circuit/dc.rs:222-227 | crates/vcad-ecad-sim/src/circuit/devices.rs:622-627 \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, \u0060crates/vcad-ecad-sim/src/circuit/devices.rs:628\u0060 calls \u0060Some\u0060 and \u0060crates/vcad-ecad-sim/src/circuit/dc.rs:228\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":"crates/vcad-ecad-sim/src/circuit/dc.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f930ec3e52900e79cce6e01111ff88860432301932f70ab8fc0a19ccc604df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-symbols/src/altium/mod.rs:1046-1050 | crates/vcad-ecad-symbols/src/eagle_brd.rs:391-395 \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 \u0060crates/vcad-ecad-symbols/src/altium/mod.rs:1046\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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"1029d4d5aca02154f76d3e1c142e4f1e7f6288313b7eaa3120aa66310b2dcdc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-ecad-symbols/src/footprint.rs:1212-1228 | crates/vcad-ecad-symbols/src/footprint.rs:1243-1259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a506f680abf85d8ef9a3034f8c6bf44f2c82e6bbfbc12721fed04df55a9631b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-eval/src/diff.rs:183-187 | crates/vcad-eval/src/diff.rs:321-325 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-eval/src/diff.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef22c7fc4eea1773a5f8b56402dfdba6995e7acc560011058e90c0074ab231b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:1646-1650 | crates/vcad-eval/src/evaluate.rs:1728-1732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-eval/src/evaluate.rs:1646\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73d3adf5c9aae63f8533d3241ba22a540631a465ce4532f941da5896c066d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:2657-2662 | crates/vcad-sound/src/lib.rs:261-266 \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 \u0060crates/vcad-eval/src/evaluate.rs:2657\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"8500c92f392b7522bc85d525bae3447512c585b4dc986adca73e4247686af523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20135 lines \u00D7 19): crates/vcad-eval/src/sim_extract/em.rs:444-444 | crates/vcad-eval/src/thermal_extract.rs:619-623 | crates/vcad-ffi/src/print.rs:374-376 | crates/vcad-ffi/src/sheet_metal.rs:174-178 | crates/vcad-kernel-booleans/src/mesh/csg.rs:929-929 | crates/vcad-kernel-booleans/src/validate.rs:41-41 | crates/vcad-kernel-diff/src/mass.rs:68-68 | crates/vcad-kernel-fea/src/mesh.rs:68-68 | crates/vcad-kernel-fea/src/mesh.rs:69-69 | crates/vcad-kernel-fea/src/solve.rs:533-533 | crates/vcad-kernel-fea/src/solve.rs:534-534 | crates/vcad-kernel-tessellate/src/lib.rs:935-935 | crates/vcad-kernel-tessellate/src/manifold.rs:198-198 | crates/vcad-kernel-tessellate/src/mesh_props.rs:76-76 | crates/vcad-kernel/src/lib.rs:3007-3007 | crates/vcad-kernel/src/lib.rs:3073-3073 | crates/vcad-render/src/report.rs:329-329 | crates/vcad-typst/src/lib.rs:289-289 | docs/videos/every-physics/poc/src/main.rs:60-62 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/mesh/csg.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060crates/vcad-eval/src/thermal_extract.rs:619\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":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d92542667508010e9ef3ff38dee5a3ddee3b61188232bfdca14f0dd0367e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-acoustics/src/strike.rs:280-285 | crates/vcad-kernel-acoustics/src/strike.rs:286-291 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1336b8b96230099520a98c502aad3c3c75fa66ec2c60a2b0819f6f56ba174a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-antenna/src/mom.rs:130-137 | crates/vcad-kernel-antenna/src/mom.rs:157-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-antenna/src/mom.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":"crates/vcad-kernel-antenna/src/mom.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"47568d91b5701568b37bc85d899510d01cce1c925f29e2602a1da486825c2367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/api.rs:872-876 | crates/vcad-kernel-tessellate/src/lib.rs:896-900 \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 \u0060crates/vcad-kernel-booleans/src/api.rs:872\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a12c00d0796b86d73b89da231839ab0b18e30c34316d7d1d3af880085f5084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:148-152 | crates/vcad-kernel-tessellate/src/lib.rs:2935-2939 \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 \u0060crates/vcad-kernel-booleans/src/classify.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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa5091a7c3188fd9eeedc1e6a00d1276d0e8cca2b8f03d4c3cf08a3b0a159f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:278-282 | crates/vcad-kernel-tessellate/src/lib.rs:8308-8312 \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 \u0060crates/vcad-kernel-booleans/src/classify.rs:278\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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8198916d5dd3b67aee6ce052f81ae858250db1b8e718a125317cdafc83d06b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:324-333 | crates/vcad-kernel-booleans/src/classify.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 \u0060crates/vcad-kernel-booleans/src/classify.rs:324\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa9dce382d734551b198314299d9e2123340b4f1da0a68868cd1ff66c1ff205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/vcad-kernel-booleans/src/classify.rs:694-698 | crates/vcad-kernel-booleans/src/split.rs:734-736 | crates/vcad-kernel-booleans/src/split.rs:815-817 | crates/vcad-kernel-booleans/src/trim.rs:269-273 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-booleans/src/classify.rs\u0060 and \u0060crates/vcad-kernel-booleans/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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 \u0060crates/vcad-kernel-booleans/src/classify.rs:694\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ec24c6279e8cc4940ddd161747ac69f5704211646e3d40448dcb449f5375f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/vcad-kernel-booleans/src/cyl_cyl.rs:62-66 | crates/vcad-kernel-booleans/src/split.rs:5601-5605 | crates/vcad-kernel-booleans/src/split.rs:6105-6108 \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 \u0060crates/vcad-kernel-booleans/src/cyl_cyl.rs:62\u0060 it begins part-way through the construct above it, so those exact 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 \u0060brep\u0060 to \u0060\u0026BRepSolid\u0060 in one and \u0060\u0026mut BRepSolid\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":"crates/vcad-kernel-booleans/src/cyl_cyl.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53db2a00755e3e128fb4a846a5dcbf6712362edf05c950872e0e5f9817de59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:215-220 | crates/vcad-kernel/src/faces.rs:624-629 \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 \u0060crates/vcad-kernel-booleans/src/mesh/csg.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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3149d3d45c7c201044689f8160677d8af49e2880db4d1265392b4ea01fa7197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/mesh/csg.rs:411-415 | crates/vcad-kernel-shell/src/lib.rs:1262-1266 \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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e197a232c93b5570fc87441f0b027a89a8af83b354d7b57c509902072dca7e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-booleans/src/no_crossing.rs:241-250 | crates/vcad-kernel-booleans/src/no_crossing.rs:459-468 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d4ce5297dfb3c0d115769eb714a97e6ac886ab5764510861a00b72b091f782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:436-441 | crates/vcad-kernel-booleans/src/pipeline.rs:581-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8b301ac9f4418f23c1ba1ec3495edea1f072a0ca1ac67f40e6570867bf2849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:1602-1606 | crates/vcad-kernel-booleans/src/split.rs:4031-4036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:1602\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04894b54067f8b4e5eb428637c540af8c5acbc70a58dddbc7588d2e6005a108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:2769-2775 | crates/vcad-kernel-tessellate/src/lib.rs:8306-8310 \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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9c6c81c1588a4406836f1b9e7f8d49154ce960f20cce6509bbf30f861134d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:3422-3427 | crates/vcad-kernel-booleans/src/split.rs:3626-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/split.rs:3422\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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":3422}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ef53774d3008d3fb81f954e8b72d11bfdf33df20db8653fde4cc195073cc49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:4515-4521 | crates/vcad-kernel-booleans/src/split.rs:4694-4698 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a127b7e734f7e7a3e4d60a040f63fbfc2119eb2caeaf72fe20116592247f0d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:5158-5162 | crates/vcad-kernel-tessellate/src/lib.rs:6546-6550 \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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a089daa574d4786de3755865dba0883941a15a086edad30bfc4bcafacf80d820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-cam/src/toolpath.rs:237-241 | crates/vcad-kernel-tessellate/src/lib.rs:2298-2302 \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 \u0060crates/vcad-kernel-cam/src/toolpath.rs:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/toolpath.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a09fdcb77c935df111f7a894e9c229b171662949ce93aacdbe0f229841c652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/vcad-kernel-constraints/src/symbolic.rs:287-292 | crates/vcad-kernel-constraints/src/symbolic.rs:407-411 | crates/vcad-kernel-constraints/src/symbolic.rs:467-470 \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 \u0060crates/vcad-kernel-constraints/src/symbolic.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. 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":"crates/vcad-kernel-constraints/src/symbolic.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fed6668870509827fdbdfad95dd63d2fbd7a3ade0ff68eac1e2114efb911b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 6): crates/vcad-ecad-pcb/src/drc.rs:2937-2939 | crates/vcad-ecad-pcb/src/session.rs:357-359 | crates/vcad-kernel-cam/src/turning/geom.rs:170-172 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:480-484 | crates/vcad-process/src/masks.rs:38-42 | crates/vcad-process/src/masks.rs:106-108 \u2014 there are 6 copies across 5 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 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:480\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa88e863e3de590cde0d9353520afc6dda2b02e8182fb74213a92e089ccbc5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-diff/src/adjoint.rs:311-316 | crates/vcad-kernel-diff/src/adjoint.rs:381-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-diff/src/adjoint.rs:311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/adjoint.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e012a87e33208ef2589d3d6c0d33e3f0e2ac8c75aa3719fb2eefe416e922a484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-diff/src/implicit.rs:69-73 | crates/vcad-kernel-diff/src/implicit.rs:218-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-diff/src/implicit.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":"crates/vcad-kernel-diff/src/implicit.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d6258b38b6d1e29421980f3b260912e308c704259d74cc453ac84f8e740e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-drafting/src/hidden_line.rs:396-402 | crates/vcad-kernel-drafting/src/hidden_line.rs:425-431 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-drafting/src/hidden_line.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e934a36bffd7c3a4cf9987aed6ecf75cccc12d38e24019f2d5a6cdd2b0bdb1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/vcad-kernel-em/src/axisym.rs:359-362 | crates/vcad-kernel-em/src/axisym.rs:376-380 | crates/vcad-kernel-em/src/axisym.rs:401-405 \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 \u0060crates/vcad-kernel-em/src/axisym.rs:359\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b99bec3ac128ff8354d116eb70025990defcb251aa88e58e634d6192e204a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:544-550 | crates/vcad-kernel-em/src/axisym.rs:580-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/axisym.rs:544\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad95644ad952090d1479c99ef64add59e50f45f93ff2b4f802ba1b7b8861b764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-em/src/electro.rs:333-339 | crates/vcad-kernel-em/src/electro.rs:345-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/electro.rs:333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/electro.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"73830fa5dd89f27bb05c444ca512b1c2a9cd2c7eae7cef09ce11f514113c9b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-fillet/src/rolling_ball.rs:249-253 | crates/vcad-kernel-fillet/src/rolling_ball.rs:260-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 \u0060crates/vcad-kernel-fillet/src/rolling_ball.rs:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/rolling_ball.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4704d638957742ed20e2d1342a4ad5607ca35d732777b307233d01121430f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:155-159 | crates/vcad-kernel-flow/src/solve.rs:202-206 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1689624e2ef293e0a9fbf541c36c33cd6fafabf704d924d987f705a0252080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-flow/src/adjoint.rs:221-226 | crates/vcad-kernel-flow/src/solve.rs:346-351 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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 \u0060crates/vcad-kernel-flow/src/adjoint.rs:221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6db154d3e8a07b7e8035133ca6b1dfeb596d8cc5879cd7bb8a337877f87ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-flow/src/conjugate_adjoint.rs:614-619 | crates/vcad-kernel-flow/src/conjugate_adjoint.rs:641-646 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b204e1b17f7f4d5cf829de3c4e77a9eed46771426e44564278ef840b4327a48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/vcad-kernel-optics/src/paraxial.rs:33-37 | crates/vcad-kernel-optics/src/paraxial.rs:50-54 | crates/vcad-kernel-optics/src/paraxial.rs:113-116 \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 \u0060crates/vcad-kernel-optics/src/paraxial.rs: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. 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":"crates/vcad-kernel-optics/src/paraxial.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b458822c654aeec62f7fea501f8711c4d379e308d36d33e199f58550afc22af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-particle/src/space_charge.rs:66-70 | crates/vcad-kernel-particle/src/space_charge.rs:476-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-particle/src/space_charge.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/space_charge.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cf215cd8a2a6d79a9900b9a92bdf417af5589310295af9540431000193937b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-particle/src/space_charge.rs:332-337 | crates/vcad-kernel-particle/src/space_charge.rs:501-506 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-kernel-particle/src/space_charge.rs:498\u0060 calls \u0060solve_grounded_source\u0060 and \u0060crates/vcad-kernel-particle/src/space_charge.rs:330\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":"crates/vcad-kernel-particle/src/space_charge.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b838f05f96e74d317994697b7ec05922d8dfe896c7f26f9fa57c465b6c5fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-photonics/src/sim.rs:314-318 | crates/vcad-kernel-photonics/src/sim.rs:393-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f863ac8c4568d3fb8715c1136d78fef0083f961904539e832f449ec8926c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-physics/src/colliders.rs:162-168 | crates/vcad-kernel-physics/src/world.rs:477-483 \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 \u0060crates/vcad-kernel-physics/src/colliders.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/colliders.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcc7e592d34af59a44bee273c510f4069f4cc232be6e92b9a4fbc2d4326388c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-qcd/src/lattice.rs:188-196 | crates/vcad-kernel-qcd/src/lattice.rs:218-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-qcd/src/lattice.rs:188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-qcd/src/lattice.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3385611a22d792aebc2a72675d7d433d7ad446099f0b1e74478530450fcb2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/vcad-kernel-raytrace/src/cpu.rs:194-203 | crates/vcad-kernel-raytrace/src/cpu.rs:371-374 | crates/vcad-kernel-raytrace/src/cpu.rs:524-528 \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 \u0060crates/vcad-kernel-raytrace/src/cpu.rs:194\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-kernel-raytrace/src/cpu.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4f3ef8c960b12aac643d4564b43293c6defbfea0a4b81575e79893820a94ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-step/src/reconstruct.rs:471-475 | crates/vcad-kernel-step/src/writer.rs:1163-1167 \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":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df970354c729bc911de54f98b475ede72a018401ac65d1b9ea603393437937d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:3365-3369 | crates/vcad-kernel-tessellate/src/lib.rs:3451-3455 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd72705f756445042145cff4f1fff3dbfc7b233663efffc1847aa7b47254b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:3529-3535 | crates/vcad-kernel-tessellate/src/lib.rs:3536-3542 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-kernel-tessellate/src/lib.rs:3527\u0060 calls \u0060collect\u0060, \u0060sort_by\u0060 and \u0060crates/vcad-kernel-tessellate/src/lib.rs:3535\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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ad2a406ad2e554a7af0ef31b3b4af0f456540f14c35c61cbb02d3c8d8c5344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:5820-5824 | crates/vcad-kernel-tessellate/src/lib.rs:5848-5852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-tessellate/src/lib.rs:5820\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5820}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c4dbafdc7c0929a7cb5d73e401e9892e6df05063e310c7a1a40bab942397b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:6356-6361 | crates/vcad-kernel-tessellate/src/lib.rs:6716-6721 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6356}}}],"partialFingerprints":{"codehealthFindingId/v1":"1415d337caa4654dd92efd5bb66c47aa10892f6f93bfbc09b7fed27313d2589d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:8533-8538 | crates/vcad-kernel/src/lib.rs:2895-2900 \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 \u0060crates/vcad-kernel-tessellate/src/lib.rs:8533\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":8533}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e56f9898c9d1b841ffccda04452b3a4c3b6b45f3a321358dd3c6e5cd58c8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-tessellate/src/mesh_props.rs:105-109 | crates/vcad-kernel/src/lib.rs:3103-3107 \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":"crates/vcad-kernel-tessellate/src/mesh_props.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf5fc44ea3152f3808cc75b2bf09e3e1bc636b837a2346bdf9e3511842b5a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:968-972 | crates/vcad-kernel-wasm/src/lib.rs:1043-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:968\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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48cfb21b672e758793f1726d54097f65c3cb8747f8e1bd9fbd9234ddaeadf93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:1552-1557 | crates/vcad-kernel-wasm/src/lib.rs:1560-1565 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c1ea72984d469c778f1c835accc488c2bc3b798fe7cf07f4b4ebd601bd1f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:5096-5100 | crates/vcad-kernel-wasm/src/lib.rs:5153-5157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:5096\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5096}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03915f0cfb2cba888c373e01d9663bab8ac37f6354966b821bea52cba2990d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:9349-9353 | crates/vcad-kernel-wasm/src/lib.rs:9479-9483 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":9349}}}],"partialFingerprints":{"codehealthFindingId/v1":"62baa7337bc4700229d47f4bb86971a1c5009ea7c35754020733a40d1dc74dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-loon/src/params.rs:225-234 | crates/vcad-loon/src/rootnames.rs:52-61 \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":"crates/vcad-loon/src/params.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c612a6ca0bfef505131208e255a9e524718a25638227badbe5cf31fa022a8e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-parts/src/bearings/bearing_608.rs:45-49 | crates/vcad-parts/src/fasteners/washer_flat.rs:67-72 \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 \u0060crates/vcad-parts/src/bearings/bearing_608.rs:45\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":"crates/vcad-parts/src/bearings/bearing_608.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e890395add92721595309f84585b3d493322717bd9c1021252faa0d55cb9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-render/src/lib.rs:1292-1299 | crates/vcad-render/src/lib.rs:1401-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-render/src/lib.rs:1292\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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede6cebc63051b1f861fc65105c193063f69e6bc0935240de78e2b595a09382d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-render/src/lib.rs:3773-3777 | crates/vcad-render/src/lib.rs:5073-5077 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":3773}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2aec7fcf846f7f002dd4d1cc597297d50ff8535bad4f35c8391bafad228cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-app/src/engine.rs:115-122 | crates/vcad-cli/src/app.rs:278-285 \u2014 before extracting anything, compare \u0060crates/vcad-app/src/engine.rs\u0060 and \u0060crates/vcad-cli/src/app.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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":"crates/vcad-app/src/engine.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffae5fa25add32bc37a8b7b93d2557bf8a160d330cabe7b202aa38bd7c099c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-diff/src/design.rs:136-140 | crates/vcad-kernel-constraints/src/symbolic.rs:139-143 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-diff/src/design.rs\u0060 and \u0060crates/vcad-kernel-constraints/src/symbolic.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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":"crates/vcad-ecad-diff/src/design.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57493c09949414c2958c70dcd17e58be61b21ae618b09cbc21fd6c9712d1c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-diff/src/design.rs:143-147 | crates/vcad-kernel-constraints/src/symbolic.rs:149-153 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-diff/src/design.rs\u0060 and \u0060crates/vcad-kernel-constraints/src/symbolic.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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":"crates/vcad-ecad-diff/src/design.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5473684f0e91ef337535395e4e886ef78f2b847067359a72882fe125ea9d83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-diff/src/design.rs:201-207 | crates/vcad-ecad-diff/src/pdn.rs:243-249 \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":"crates/vcad-ecad-diff/src/design.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"075c46e86634a36c76f72d973d13dd1d95f25755ad81820bc585bd05eb2a4fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-export/src/bom.rs:70-77 | crates/vcad-ecad-export/src/pick_place.rs:40-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/bom.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d14e43b93859d3a639bdfb1900b583bc3010895ec04781bf4c4f0ead772df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/dfm.rs:398-404 | crates/vcad-ecad-pcb/src/drc.rs:1506-1512 \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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d13d561c9888b7ebdb25a51cefb51ea1efa37ec1c13a8d431c2c8184e34dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/drc.rs:2639-2645 | crates/vcad-ecad-schematic/src/lib.rs:63-69 \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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b34527a82fa87e23e6b0489c4efed1b33d841085488e44258935598b4d1448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-ecad-pcb/src/router/complete.rs:1981-1985 | crates/vcad-ecad-pcb/src/router/maze.rs:1454-1458 | crates/vcad-ecad-pcb/src/spatial.rs:215-219 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-pcb/src/router/complete.rs\u0060 and \u0060crates/vcad-ecad-pcb/src/router/maze.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"5286f0997483e374d951cc54b2a210b07dfc284312272c1c9322c9b28739cfed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-sim/src/circuit/ac.rs:261-267 | crates/vcad-ecad-sim/src/circuit/dc.rs:66-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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ede5ecbd95576b187c10c7d464e623eff9bd2ca7e2c4f4991eb5ca7bb27660a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-symbols/src/builtin.rs:46-53 | crates/vcad-ecad-symbols/src/footprint.rs:160-167 \u2014 before extracting anything, compare \u0060crates/vcad-ecad-symbols/src/builtin.rs\u0060 and \u0060crates/vcad-ecad-symbols/src/footprint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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":"crates/vcad-ecad-symbols/src/builtin.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4539a2eeeb0bf01fbc65e81f1826d374e08125510f29a123f3e702a70570e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_mod.rs:172-177 | crates/vcad-ecad-symbols/src/kicad_sym.rs:119-124 \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":"crates/vcad-ecad-symbols/src/kicad_mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fe1000eecb9043f950da79dbf866579e076120eea6511b6fc2be80055cf838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:1479-1485 | crates/vcad-ffi/src/schematic.rs:43-48 \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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9dfad4ac920e75e089ffa96633d0f3287a65a50fdf2dc90322dc45027d0525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ffi/src/cam_job.rs:820-828 | crates/vcad-ffi/src/sheet_metal.rs:213-221 \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":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbf809659ca5338c60f87f9d7e6157eb827040bfc5816e2bc25286d3e4afd7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ffi/src/pcb.rs:47-55 | crates/vcad-ffi/src/schematic.rs:25-33 \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":"crates/vcad-ffi/src/pcb.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"215eb4c59ba1b8e73980e7ee7de85483f1d5699d3b7ff19c954eafa627534e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-acoustics/src/helmholtz.rs:123-127 | crates/vcad-kernel-particle/src/poisson.rs:96-100 \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":"crates/vcad-kernel-acoustics/src/helmholtz.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1928c5ecd6a4beab4fbcc9fa57596e0b7687bc8536e87b2781cfb94f3be2a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/vcad-kernel-acoustics/src/receipt.rs:88-96 | crates/vcad-kernel-antenna/src/receipt.rs:102-110 | crates/vcad-kernel-em/src/receipt.rs:78-86 | crates/vcad-kernel-photonics/src/receipt.rs:162-170 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-antenna/src/receipt.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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee90f8ed8b4e3da0b8dd41aaa6844d9bf8eb19c37681fd5e3d8456151bf1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-assembly/src/pose.rs:35-40 | crates/vcad-kernel-tessellate/src/query.rs:64-69 \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":"crates/vcad-kernel-assembly/src/pose.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2671b1626a0017d8f0f56f49350563a2cdd9de77252161ddaca4ba44aadbcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-cam/src/lib.rs:93-103 | crates/vcad-kernel-wasm/src/lib.rs:5891-5901 \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":"crates/vcad-kernel-cam/src/lib.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c143229f31bb6a9b72934dec4855435bdcb2d47e3286d2c598dbd9fbfb4d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-cam/src/post/grbl.rs:58-66 | crates/vcad-kernel-cam/src/post/linuxcnc.rs:87-95 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-cam/src/post/grbl.rs\u0060 and \u0060crates/vcad-kernel-cam/src/post/linuxcnc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 152 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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7f5360ad50f5c945380d4dee148d25cd26a863f15068ddc29222eecd98ae3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-cam/src/post/mod.rs:83-88 | mecheval/graders/src/suite_c.rs:443-448 \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":"crates/vcad-kernel-cam/src/post/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af800a4dcc07277458d6184549b939b9c514b4a1b01e3e6438f25c83a187c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-em/src/axisym.rs:629-633 | crates/vcad-kernel-em/src/planar.rs:545-549 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-em/src/axisym.rs\u0060 and \u0060crates/vcad-kernel-em/src/planar.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 104 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 \u0060crates/vcad-kernel-em/src/axisym.rs:629\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/axisym.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1b598e978a41fdb8da512aa7fb391640ae84593baf86538739412ac6590d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-naming/src/lib.rs:736-742 | crates/vcad-kernel/src/faces.rs:604-610 \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":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8df5b23e61ffad54f722b1f066377caa11687303009030819ec3553567c161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-sheet/src/edge_flange.rs:255-261 | crates/vcad-kernel-sheet/src/unfold.rs:180-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":"crates/vcad-kernel-sheet/src/edge_flange.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9853873572ac41d3dd89d4042a337bda0742ac9742eca5e2ef998616d60f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-wasm/src/circuit_sim.rs:265-269 | crates/vcad-kernel-wasm/src/document_diff.rs:16-21 \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":"crates/vcad-kernel-wasm/src/circuit_sim.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b4098612be7e63fb1d587bb9e2445515c04f5b915d187e0ed3d19f21fd25a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 8): crates/vcad-loon/src/fastener.rs:545-560 | crates/vcad-parts/src/fasteners/mod.rs:8-23 | crates/vcad-parts/src/fasteners/mod.rs:26-41 | crates/vcad-parts/src/fasteners/mod.rs:56-71 | crates/vcad-parts/src/fasteners/mod.rs:74-89 | crates/vcad-parts/src/fasteners/mod.rs:92-107 | crates/vcad-parts/src/fasteners/mod.rs:110-125 | crates/vcad-parts/src/fasteners/mod.rs:128-143 \u2014 there are 8 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 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/fastener.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"264fdff30b483b0ab4abfa1fae8a5a632e12ff631440f8f8439988b531cb563e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-loon/src/params.rs:181-187 | crates/vcad-loon/src/variants.rs:309-315 \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":"crates/vcad-loon/src/params.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"291d0f38e4db61020746677fde4a234cb14d5a2ad8fea4140c9316db1b115da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-loon/src/params.rs:204-209 | crates/vcad-loon/src/variants.rs:344-349 \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":"crates/vcad-loon/src/params.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"09932de842969a506d7055d36865e91921befa409b7f6653e2b2333b7c6d1802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-parts/src/vacuum/fittings.rs:39-44 | crates/vcad-parts/src/vacuum/instruments.rs:24-29 \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":"crates/vcad-parts/src/vacuum/fittings.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4b5259eba3920985f8c1d2a9676aa1fe039d87c8f68528eb24a8842dd989f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-render/src/lib.rs:812-817 | crates/vcad-render/src/sheet.rs:253-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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf14ad840346d1987bd58f13d4bce99252344d7cad0d89310e91ea6b7228395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-sim/src/circuit/ac.rs:88-93 | crates/vcad-kernel-antenna/src/complex.rs:93-98 \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":"crates/vcad-ecad-sim/src/circuit/ac.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa69b5c886557d1d8e7431a2acbc8613584e9106a65f7185d204ba3680436b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_pcb.rs:149-154 | crates/vcad-ecad-symbols/src/kicad_sch.rs:63-68 \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 \u0060node\u0060 to \u0060\u0026SExpr\u003C\u0027_\u003E\u0060 in one and \u0060\u0026SExpr\u003C\u0027_\u003E) -\u003E (Vec2\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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f35743e279efffadda36c339be783f728d658c1805610b7b42066f77ffabdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-particle/src/device.rs:103-108 | crates/vcad-kernel-particle/src/wire3d.rs:522-527 \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":"crates/vcad-kernel-particle/src/device.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1cb76310cda9155e177d88fcb5fd6bab881aa14ac04325b1de007a6a7092c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-photonics/src/monitor.rs:85-90 | crates/vcad-kernel-qcd/src/su3.rs:43-48 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060o\u0060 to \u0060Cplx\u0060 in one and \u0060C\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":"crates/vcad-kernel-photonics/src/monitor.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee964ca31825de771b8425b12b951ee06c10fca27f0a0536c31c772a56fb324b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-mcp/src/tools/core.rs:586-591 | crates/vcad-mcp/src/tools/instrument.rs:121-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":"crates/vcad-mcp/src/tools/core.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec71fa7898b5f604bf5a99b90fdbd90c0ed01d42c564ae84802a1444dc77c0c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/vcad-kernel-flow/src/gpu.rs:203-225 | crates/vcad-kernel-gpu/src/wavefront.rs:181-205 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/gpu.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/wavefront.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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 \u0060crates/vcad-kernel-flow/src/gpu.rs:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdfc9833734e40b7d6bf1660ba364b8d787efb6b2a407dcc7f22f2411cd71d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-gpu/src/decimate.rs:138-161 | crates/vcad-kernel-gpu/src/normals.rs:150-156 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-gpu/src/decimate.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/normals.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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 \u0060crates/vcad-kernel-gpu/src/decimate.rs:138\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":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"691bbf162eee63450dfada95a160f05194a9942dd5213806c35e4abce55c2465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/length_match.rs:325-342 | crates/vcad-ecad-pcb/src/router/length_match.rs:852-869 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/length_match.rs:325\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":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c79df4301e93dda7b96958e83b1860cb139e273a1e45534298c24c9930a92ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/vcad-render/src/animate.rs:553-570 | crates/vcad-render/src/animate.rs:657-673 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-render/src/animate.rs:553\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/animate.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dec526b5f33e94950155b641dab70c3939ee47f7ab1ec716b557e9755837ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/vcad-kernel-gpu/src/decimate.rs:116-129 | crates/vcad-kernel-gpu/src/normals.rs:76-89 | crates/vcad-kernel-gpu/src/wavefront.rs:153-165 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-gpu/src/decimate.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/normals.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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 \u0060crates/vcad-kernel-gpu/src/decimate.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c251454a9b79b531e1e37d7b61c1a0f5fa9108b9d24dc7198fe2f58f745c9bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_board.rs:401-414 | crates/vcad-ffi/src/lib.rs:1879-1892 \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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4358bfaef7f2da133cd57591c5aace083d10b219dae11d51b7cae982ccfb7952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:2559-2571 | crates/vcad-ir/src/vcode.rs:2719-2732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/vcode.rs:2559\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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1745d5376e22393e857c893e270952ec314ed81615d242d5c9c4fee1fe84e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vcad-ffi/src/cam.rs:194-207 | crates/vcad-ffi/src/cam_job.rs:529-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 \u0060crates/vcad-ffi/src/cam.rs:194\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/cam.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2d4080719971f66b4bc9670d00429f5882adc73260712b2be448307aee0f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/vcad-cli/src/repl.rs:196-209 | crates/vcad-cli/src/repl.rs:222-234 | crates/vcad-cli/src/repl.rs:247-259 \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 \u0060crates/vcad-cli/src/repl.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":"crates/vcad-cli/src/repl.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c4bc608f756f823c61c10c39e7e9b6abd2e3958231f8b7ded8164edbadfa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-step/src/pmi.rs:103-113 | crates/vcad-kernel-step/src/pmi.rs:116-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-step/src/pmi.rs:103\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/pmi.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9b76fcaf79eee27c64dc73cd09cf566e3a39a2182d7bf82672d920217eb7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-cli/src/app.rs:692-704 | crates/vcad-cli/src/app.rs:730-742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-cli/src/app.rs:692\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"373868ed2b5e0bdf34b0bbfd4a3ae06d7e20627133335a38a6948b2e36c374da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:140-152 | crates/vcad-kernel-tessellate/src/lib.rs:679-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"328b897ad02671e15d79cc8f43a5068b74da02c2bd06d31389a409109f8a21ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-ir/src/vcode.rs:2536-2546 | crates/vcad-ir/src/vcode.rs:2553-2565 | crates/vcad-ir/src/vcode.rs:2713-2725 \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 \u0060crates/vcad-ir/src/vcode.rs:2536\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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a06c221ccb453e3e410b09d96ddb5d5d5dda3d14357a9410aa116ebbb1ecd6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): mecheval/graders/src/suite_c.rs:123-134 | mecheval/graders/src/suite_c.rs:196-206 | mecheval/graders/src/suite_c.rs:327-339 \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 \u0060mecheval/graders/src/suite_c.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":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ee9b77b2569db2e458106e5c48939b70310623e0c33d5919f3fcc32d53ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/vcad-ir/src/file_io.rs:451-463 | crates/vcad-ir/src/file_io.rs:469-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/file_io.rs:451\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":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8746f074c7e1afc2ecbb54e0ab81080c99e8925421e4ac28d053c50fa3052d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/vcad-ir/src/vcode.rs:2519-2531 | crates/vcad-ir/src/vcode.rs:2559-2570 | crates/vcad-ir/src/vcode.rs:2719-2730 \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 \u0060crates/vcad-ir/src/vcode.rs:2519\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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d2d8d4b8b6122bc4d882a7ef02869e792802c8cd31d26862a472a16ccc7e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mecheval/graders/src/grader.rs:764-775 | mecheval/graders/src/grader.rs:790-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 \u0060mecheval/graders/src/grader.rs:764\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":"mecheval/graders/src/grader.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"899019af1e127ccb760b05d4235fb38d21786b9c11b728bbdbaa53eed5d6a0ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-drafting/src/dimension/angular.rs:216-227 | crates/vcad-kernel-drafting/src/dimension/radial.rs:122-133 \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 \u0060crates/vcad-kernel-drafting/src/dimension/angular.rs:216\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, \u0060crates/vcad-kernel-drafting/src/dimension/radial.rs:135\u0060 calls \u0060with_rotation\u0060 and \u0060crates/vcad-kernel-drafting/src/dimension/angular.rs:229\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":"crates/vcad-kernel-drafting/src/dimension/angular.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e67249b8916b7daa7d7c2b81a4c5c225d6945f8293a0d1f45c7e770e7491867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:854-865 | crates/vcad-kernel-booleans/src/pipeline.rs:906-917 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:854\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acc580bf55202234628d85ce926a5a396aaf5095282a55a4e126c026c6f38d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/vcad-cli/src/app.rs:325-336 | crates/vcad-cli/src/app.rs:351-362 | crates/vcad-cli/src/app.rs:376-387 | crates/vcad-cli/src/app.rs:425-436 \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 \u0060crates/vcad-cli/src/app.rs:325\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe2e3520ad97b7fb0eee689f9946d4a81f5945e2d911dbebc3caccea29749ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/vcad-loon/src/convert.rs:521-532 | crates/vcad-loon/src/convert.rs:548-559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/convert.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/vcad-loon/src/convert.rs:533\u0060 calls \u0060vec3\u0060, \u0060f64_val\u0060 and \u0060crates/vcad-loon/src/convert.rs:560\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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9223a6ee89a95826082dc2ae6e6786dbc0f39d46abdbc865517f57a4b6df3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/vcad-kernel-booleans/src/pipeline.rs:854-865 | crates/vcad-kernel-booleans/src/pipeline.rs:906-917 | crates/vcad-kernel-booleans/src/pipeline.rs:1004-1015 \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 \u0060crates/vcad-kernel-booleans/src/pipeline.rs:854\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfea5cad4d5e6a2a1a64b560fd0c9e0b0a84855e85e7ef8fb3b1dd09f477d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ir/src/to_loon.rs:409-419 | crates/vcad-ir/src/to_loon.rs:549-559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/to_loon.rs:409\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":"crates/vcad-ir/src/to_loon.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5361793c5f4ee91e1f4f872db564c863f9d147bac8cbd2ecae32094fb84603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:1247-1257 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:1284-1294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:1247\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e5880e5ccb977d155bcd5c9c176de229b54a64a2334d8cad02683cc441b107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-ir/src/resolve.rs:356-366 | crates/vcad-ir/src/resolve.rs:397-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/resolve.rs:356\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":"crates/vcad-ir/src/resolve.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec170b66cddd113832d2bc3335dc14ebb86dd5e70c410281e704520ac21a026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): crates/vcad-kernel-acoustics/src/receipt.rs:345-355 | crates/vcad-kernel-antenna/src/receipt.rs:480-490 | crates/vcad-kernel-fea/src/receipt.rs:265-275 | crates/vcad-kernel-flow/src/receipt.rs:381-391 | crates/vcad-kernel-neutronics/src/receipt.rs:396-406 | crates/vcad-kernel-optics/src/receipt.rs:263-273 | crates/vcad-kernel-orbit/src/receipt.rs:186-196 | crates/vcad-kernel-particle/src/receipt.rs:479-489 | crates/vcad-kernel-photonics/src/receipt.rs:320-330 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-acoustics/src/receipt.rs\u0060 and \u0060crates/vcad-kernel-antenna/src/receipt.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-acoustics/src/receipt.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-kernel-acoustics/src/receipt.rs:344\u0060 calls \u0060join\u0060 and \u0060crates/vcad-kernel-antenna/src/receipt.rs:479\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":"crates/vcad-kernel-acoustics/src/receipt.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b259308b2e31740d1cba91ae126e1ebac097d49a794cc1d58a0f1ceca646374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-loon/src/convert.rs:1738-1748 | crates/vcad-loon/src/convert.rs:1749-1755 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d50e4fd5deca04621b8a4262b6454955d85ce41cc7d950a79aa9a524ef0a01e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-app/src/materializer.rs:966-976 | crates/vcad-app/src/materializer.rs:1576-1586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-app/src/materializer.rs:966\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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d985d025d3c778b4d9b3707c71db0a04e10a75cf1487ed0bb37ddc8512fb03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): crates/vcad-ir/src/vcode.rs:1806-1816 | crates/vcad-ir/src/vcode.rs:1878-1888 | crates/vcad-ir/src/vcode.rs:1965-1975 | crates/vcad-ir/src/vcode.rs:1982-1992 | crates/vcad-ir/src/vcode.rs:1999-2009 | crates/vcad-ir/src/vcode.rs:2021-2031 \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 \u0060crates/vcad-ir/src/vcode.rs:1806\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, \u0060crates/vcad-ir/src/vcode.rs:1963\u0060 calls \u0060parse_u64\u0060 and \u0060crates/vcad-ir/src/vcode.rs:1804\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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84f32e3520331eb7093fb8bd8b632de9f9e1dc2ea35e5a19a50f85cf0991b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/vcad-cli/src/app.rs:575-585 | crates/vcad-cli/src/app.rs:613-623 | crates/vcad-cli/src/app.rs:652-662 \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 \u0060crates/vcad-cli/src/app.rs:575\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/app.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ec3084a51cf7034d9edfcfd32e6c0b69d34afbc40e0ca8c3796c5e42ea7ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-kernel-em/src/receipt.rs:154-163 | crates/vcad-kernel-em/src/receipt.rs:263-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/receipt.rs:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/receipt.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"917a4f318b45e6a0613afbfecbc6425b4fa399bbcd2be7b5294e62d4e426f334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/vcad-ir/src/vcode.rs:1589-1598 | crates/vcad-ir/src/vcode.rs:1612-1621 | crates/vcad-ir/src/vcode.rs:1635-1644 \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 \u0060crates/vcad-ir/src/vcode.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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b1d3aa47e18e5cb38fdafcc5587e7b1fe4ea78ab63abfb5dfb02cc47a9a3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-step/src/writer.rs:781-790 | crates/vcad-kernel-step/src/writer.rs:817-824 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-step/src/writer.rs:781\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"163106c72b15a9de4a7150ad3a151e5e4d08d4ad07d5a69557fdebf2918bdcc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/vcad-ir/src/vcode.rs:2481-2489 | crates/vcad-ir/src/vcode.rs:2492-2500 | crates/vcad-ir/src/vcode.rs:2503-2511 | crates/vcad-ir/src/vcode.rs:2701-2710 \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. 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f320bbf8bf9e5e4fab235ce5a77970949fc7f9875ad9ed72c1fb11da1c8dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ffi/src/lib.rs:503-512 | crates/vcad-ffi/src/lib.rs:568-577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/lib.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-ffi/src/lib.rs:500\u0060 calls \u0060Some\u0060, \u0060parent\u0060, \u0060resolve_mesh_paths\u0060 and \u0060crates/vcad-ffi/src/lib.rs:567\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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33d3866a562d3e05af9ac6cc2cd696fef5424a81b5498b3fb69255c8c0d9f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/vcad-app/src/materializer.rs:972-981 | crates/vcad-app/src/materializer.rs:1060-1065 | crates/vcad-app/src/materializer.rs:1092-1097 | crates/vcad-app/src/materializer.rs:1534-1543 | crates/vcad-app/src/materializer.rs:1582-1591 \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 \u0060crates/vcad-app/src/materializer.rs:972\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"01594109c33e5abbfdabb4ba243eaf5cea92db1ea6b2fabfa550ad3dcc7c075d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-ecad-symbols/src/footprint.rs:2242-2251 | crates/vcad-ecad-symbols/src/footprint.rs:2259-2268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/footprint.rs:2242\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ef8c74285f6ccfa3c3c73a79eb9e28a8b2e5f61c195728c4e530fb53b1df11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-cli/src/main.rs:3664-3673 | crates/vcad-cli/src/main.rs:3676-3685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-cli/src/main.rs:3664\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":3664}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0241245ebca3a448ac60f760ed14689c420f6b210113d7361afa80997d3481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/vcad-torture/src/lib.rs:470-479 | crates/vcad-torture/src/lib.rs:484-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 \u0060crates/vcad-torture/src/lib.rs:470\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/lib.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c763a038038b228a9cb03c1371630126fa953673a9d961b6b4b3914e949da39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-photonics/src/sim.rs:365-370 | crates/vcad-kernel-photonics/src/sim.rs:374-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":"crates/vcad-kernel-photonics/src/sim.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eef1f29a7c6a478f5d879dc8b0bac8652653f01cf9fd57bef3a4f6a37cbbd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:2052-2060 | crates/vcad-ecad-pcb/src/router/auto.rs:2070-2078 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/auto.rs:2052\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"d701b76e1ea0f36934dcc8b9fccb491392aca1a15674d0617e01236843eb3ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-ir/src/file_io.rs:642-650 | crates/vcad-ir/src/file_io.rs:653-661 | crates/vcad-ir/src/file_io.rs:664-672 \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 \u0060crates/vcad-ir/src/file_io.rs:642\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/vcad-ir/src/file_io.rs:649\u0060 calls \u0060to_string\u0060 and \u0060crates/vcad-ir/src/file_io.rs:638\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":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598a6915380ac4e1e887388438ef2b9809388ec7012c98a8113f4295c9793ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-eval/src/cavity_extract.rs:1077-1085 | crates/vcad-eval/src/cavity_extract.rs:1139-1147 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-eval/src/cavity_extract.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bac00d0e3489ed5208045ee0f4d11aa64fb657c438fd1087fee81ef27b47693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-ir/src/vcode.rs:1008-1016 | crates/vcad-ir/src/vcode.rs:1038-1046 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"e641aea93c8b49be4e15ed5d23eb3aa7ed2293477b3e2a0041d69c50b2faaec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-ecad-symbols/src/footprint.rs:2241-2249 | crates/vcad-ecad-symbols/src/footprint.rs:2258-2266 | crates/vcad-ecad-symbols/src/footprint.rs:2275-2283 \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 \u0060crates/vcad-ecad-symbols/src/footprint.rs:2241\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"41200b1cf66e46122932d59e1a1dd0ee1f977ec356a3889d00ea7198a164ec3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-app/src/migrate.rs:504-512 | crates/vcad-app/src/migrate.rs:570-578 | crates/vcad-app/src/migrate.rs:587-595 \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 \u0060crates/vcad-app/src/migrate.rs:504\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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b897e15a292b15c6c7e57cb59a96e3a0425d04c964ce8a549bcd02ff4d71842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-dfm/src/rules/casting.rs:98-106 | crates/vcad-kernel-dfm/src/rules/sheet.rs:92-100 \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 \u0060crates/vcad-kernel-dfm/src/rules/casting.rs:98\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":"crates/vcad-kernel-dfm/src/rules/casting.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d390eff33fd85e880bd0b969b2aa0f3452947fea59a988cd6318e4c95867acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/vcad-kernel-dfm/src/rules/casting.rs:67-75 | crates/vcad-kernel-dfm/src/rules/mold.rs:91-99 | crates/vcad-kernel-dfm/src/rules/sheet.rs:57-65 \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 \u0060crates/vcad-kernel-dfm/src/rules/casting.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":"crates/vcad-kernel-dfm/src/rules/casting.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1e145fdd990cfdd2c2d968a06ecb7b19123497ee12826bf788af57ce51db74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-eval/src/evaluate.rs:1503-1511 | crates/vcad-eval/src/evaluate.rs:1531-1539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-eval/src/evaluate.rs:1503\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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"766c2f864834710091d45eaf154d40aa08d8d9645dc86496e1ef2e22ba1ee32f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mecheval/graders/src/pcb.rs:85-92 | mecheval/graders/src/pcb.rs:116-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mecheval/graders/src/pcb.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/pcb.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b31b8a30d7a64434ebe6391bfd283f9d2525eb42fbc1a84f1e31bee8f6d464e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-loon/src/convert.rs:2020-2027 | crates/vcad-loon/src/convert.rs:2041-2048 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/convert.rs:2020\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"6992edcf0a5051219024fc5a3521be9c52e22ec7b1e954b4d6cce6115780c2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ffi/src/train.rs:586-593 | crates/vcad-ffi/src/train.rs:640-647 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ffi/src/train.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf71377d6024bc4b73c360b12b3d203e33cbad0bd0731ec2070ba7eddc4a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-kernel-urdf/src/reader.rs:20-34 | crates/vcad-kernel-urdf/src/reader.rs:147-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 \u0060crates/vcad-kernel-urdf/src/reader.rs:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"750bec9e8e47db541b7d2721cc18b6456f7ae431ca966ee3f81ef84e863ab019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:1580-1587 | crates/vcad-kernel-wasm/src/lib.rs:1591-1598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e373e94c64b525d292702d5bed5a424f412593e9ac0873697f93699c907f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/vcad-kernel-assembly/src/mate_check.rs:161-168 | crates/vcad-kernel-assembly/src/mate_check.rs:249-256 | crates/vcad-kernel-assembly/src/mate_check.rs:349-356 \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 \u0060crates/vcad-kernel-assembly/src/mate_check.rs:161\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":"crates/vcad-kernel-assembly/src/mate_check.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"320c91ceb1f90d9be07d483d48c3aff7535802659de1aa458f512f3834da118b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-design-constraints/src/lower.rs:214-221 | crates/vcad-design-constraints/src/lower.rs:230-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. 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":"crates/vcad-design-constraints/src/lower.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca4e4691102840912b4aae3dc05f82bd8add1bcdfd95d75915d12d2481a5f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-step/src/entities/geometry.rs:12-19 | crates/vcad-kernel-step/src/entities/geometry.rs:34-40 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-step/src/entities/geometry.rs:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/entities/geometry.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6ebc088c1838184ee343e1b34c6b478e0814504a77e55287de4c8eaeea7c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/vcad-ffi/src/topology.rs:581-595 | crates/vcad-ffi/src/topology.rs:606-620 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ffi/src/topology.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21f4e828c450312d785f137dc084fbc2155a04bfa2e53941dfa0992a6d805e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/vcad-torture/src/lib.rs:410-416 | crates/vcad-torture/src/lib.rs:459-465 | crates/vcad-torture/src/lib.rs:473-479 | crates/vcad-torture/src/lib.rs:487-493 \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 \u0060crates/vcad-torture/src/lib.rs:410\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-torture/src/lib.rs:407\u0060 calls \u0060tangent_cases\u0060, \u0060iter\u0060, \u0060enumerate\u0060 and \u0060crates/vcad-torture/src/lib.rs:457\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":"crates/vcad-torture/src/lib.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"59357471a6b0d85075ce8037bf71566643d3c719e9f1e42f23e434fd5458cccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-torture/src/lib.rs:445-451 | crates/vcad-torture/src/lib.rs:502-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-torture/src/lib.rs:445\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-torture/src/lib.rs:443\u0060 calls \u0060iter\u0060, \u0060enumerate\u0060 and \u0060crates/vcad-torture/src/lib.rs:499\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":"crates/vcad-torture/src/lib.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"4307ea75b6e350bb6bc6e593c9bbecf2354a28983d88fb5d3c2395749f1be621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-torture/src/lib.rs:523-529 | crates/vcad-torture/src/lib.rs:539-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-torture/src/lib.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-torture/src/lib.rs:519\u0060 calls \u0060sliver_cases\u0060 and \u0060crates/vcad-torture/src/lib.rs:536\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":"crates/vcad-torture/src/lib.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a3f2d666a2e34e053c719c70b5a384db19fd67d011a52e668edeba1742844d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-step/src/entities/surfaces.rs:158-164 | crates/vcad-kernel-step/src/entities/surfaces.rs:217-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 \u0060crates/vcad-kernel-step/src/entities/surfaces.rs:158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/entities/surfaces.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4782ce967ab718edc9e5cbefcbe23c184fdb8a24857ecfeccfd88aabd24324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-torture/src/lib.rs:409-415 | crates/vcad-torture/src/lib.rs:427-433 | crates/vcad-torture/src/lib.rs:443-449 \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 \u0060crates/vcad-torture/src/lib.rs:409\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-torture/src/lib.rs:407\u0060 calls \u0060tangent_cases\u0060 and \u0060crates/vcad-torture/src/lib.rs:425\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":"crates/vcad-torture/src/lib.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1deaa062935189d52b0c328acf25db5b78ed0c910bcdb80479f9137f437a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-eval/src/sheet_build.rs:69-75 | crates/vcad-eval/src/sheet_build.rs:93-99 | crates/vcad-eval/src/sheet_build.rs:113-119 \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 \u0060crates/vcad-eval/src/sheet_build.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":"crates/vcad-eval/src/sheet_build.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c32770897c0de3caf4cf5fc059bdb0a59187188ac28d4bd539464b84b991b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-particle/src/chain.rs:1672-1677 | crates/vcad-kernel-particle/src/chain.rs:1682-1688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-particle/src/chain.rs:1672\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":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc58b5c81310d604d79223a8a4d37f87907b1705ed0d345354022f116f49391c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/auto.rs:4297-4303 | crates/vcad-ecad-pcb/src/router/maze.rs:102-108 \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 \u0060crates/vcad-ecad-pcb/src/router/auto.rs:4297\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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":4297}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6510367e91718e357e63ff4a4b69a78d598521506a6ff8439be9378697fc60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-gpu/src/normals.rs:221-227 | crates/vcad-kernel-gpu/src/normals.rs:232-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-gpu/src/normals.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/normals.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1f877149611f463bae009ba43b9847ed7f185075463bf5ab6d6d161eb7328e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-gpu/src/decimate.rs:81-87 | crates/vcad-kernel-gpu/src/normals.rs:62-68 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-gpu/src/decimate.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/normals.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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 \u0060crates/vcad-kernel-gpu/src/decimate.rs:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dd2cd4db975b77643225cd38626b5dfff278079592c092446b26ac1d2b9e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-flow/src/gpu.rs:314-320 | crates/vcad-kernel-flow/src/gpu.rs:323-329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-flow/src/gpu.rs:314\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":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6219e33d06fe5939f250618b0114d8731a7f370de4fdb6c42a1625a358ca212b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:3607-3613 | crates/vcad-kernel-wasm/src/lib.rs:3617-3623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-wasm/src/lib.rs:3607\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1e98792a3a91a696f9021cf06a5d3bd2b820c7a716bc0918b8c2751c85803e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/vcad-ffi/src/engine.rs:62-67 | crates/vcad-ffi/src/engine.rs:132-137 | crates/vcad-ffi/src/engine.rs:218-223 | crates/vcad-ffi/src/engine.rs:277-282 \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 \u0060crates/vcad-ffi/src/engine.rs: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":"crates/vcad-ffi/src/engine.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"073d0751faf3a85e2760255535f07c51fed4ca4f831e82b82dc8f65f8652d913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-loon/src/convert.rs:1996-2003 | crates/vcad-loon/src/convert.rs:2022-2029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/convert.rs:1996\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bfa38b90dd0f716e5dc80b2bda8c0ad527a83332a7d9ecc88de20fb7af253c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-loon/src/convert.rs:2684-2690 | crates/vcad-loon/src/convert.rs:2698-2704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/convert.rs:2684\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8408cd858988fa37dd26ad7f0a171884c3690e049061a07fadd5d78c7b0f4b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-kernel-step/src/entities/curves.rs:113-118 | crates/vcad-kernel-step/src/entities/surfaces.rs:134-139 | crates/vcad-kernel-step/src/entities/surfaces.rs:193-198 \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 \u0060crates/vcad-kernel-step/src/entities/curves.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":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"709e53145464b0a0120ef29befbf0cd18a826cf9d0e7cc59c5ad1b989d962a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-mcp/src/transport.rs:265-270 | crates/vcad-mcp/src/transport.rs:347-352 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-mcp/src/transport.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5f22b07deda5b863c909df40ee8bc5cff431737ebb320ab562c6f7922fdc92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-tool-derive/src/lib.rs:69-74 | crates/vcad-tool-derive/src/lib.rs:76-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-tool-derive/src/lib.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":"crates/vcad-tool-derive/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b4f2f66a5298852823d8bba8acd88f9aafe2241891aa110f73c404bffff40f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-gpu/src/decimate.rs:93-98 | crates/vcad-kernel-gpu/src/normals.rs:60-65 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-gpu/src/decimate.rs\u0060 and \u0060crates/vcad-kernel-gpu/src/normals.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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 \u0060crates/vcad-kernel-gpu/src/decimate.rs:93\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":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa477dab2543dedc872989618448836b539e79b6f91963771935dc0e56e2ae4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-gpu/src/decimate.rs:93-98 | crates/vcad-kernel-gpu/src/decimate.rs:100-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-gpu/src/decimate.rs:93\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":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e356a7db98a013bf721fac657311430d16ce65efd900ddc4fecdb3d9fef2c92c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-cli/src/repl.rs:143-148 | crates/vcad-cli/src/repl.rs:157-162 | crates/vcad-cli/src/repl.rs:170-175 \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":"crates/vcad-cli/src/repl.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"719e288f17e35b08639446104b770705fbf64bc7a5eb00b1375daee845eb10cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-app/src/migrate.rs:371-376 | crates/vcad-app/src/migrate.rs:381-386 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef8a9c27ef51a9a838e031f2fa61b2581d381be13a76d377a569dbc28925e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-step/src/assembly.rs:374-379 | crates/vcad-kernel-step/src/assembly.rs:433-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 \u0060crates/vcad-kernel-step/src/assembly.rs:374\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31108405c42dd2a21223c5c73faf6740f2b45618dd260efecd3847c83017dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-app/src/migrate.rs:631-636 | crates/vcad-app/src/migrate.rs:680-685 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-app/src/migrate.rs:677\u0060 calls \u0060Some\u0060, \u0060insert\u0060, \u0060to_string\u0060 and \u0060crates/vcad-app/src/migrate.rs:629\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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"443a95806cc5c5801de909aef30ea5fabd257a8809c8a0ee7301c8f0e9a8ef32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-ir/src/resolve.rs:363-368 | crates/vcad-ir/src/resolve.rs:404-409 | crates/vcad-ir/src/resolve.rs:475-480 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ir/src/resolve.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/vcad-ir/src/resolve.rs:472\u0060 calls \u0060strip_prefix\u0060 and \u0060crates/vcad-ir/src/resolve.rs:360\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":"crates/vcad-ir/src/resolve.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe17001c73c51b077a7e06873355df082ee0f4693994c42e42673d694dbe5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-parts/src/vacuum/flanges.rs:644-649 | crates/vcad-parts/src/vacuum/flanges.rs:709-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-parts/src/vacuum/flanges.rs:644\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-parts/src/vacuum/flanges.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb4455f96c0a5c7f52020823e08897ba66860ed3bdd6e23a374150dfde78d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/vcad-ffi/src/gym.rs:533-537 | crates/vcad-ffi/src/gym.rs:1076-1080 | crates/vcad-ffi/src/train.rs:687-691 | crates/vcad-ffi/src/train.rs:972-976 \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 \u0060crates/vcad-ffi/src/gym.rs:533\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ffi/src/gym.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6282c0735bb9f84bf8352bc1f6292b00214342d4f469da1c051d4bddcc30921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ffi/src/fea.rs:621-625 | crates/vcad-ffi/src/fea.rs:660-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ffi/src/fea.rs:621\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/fea.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"059f43531ee68a0c53c12f10ad81f21effe5d2970c6d4ff3d7aeeaaf3d271e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-cam/src/turning/ops.rs:324-328 | crates/vcad-kernel-cam/src/turning/ops.rs:355-359 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-cam/src/turning/ops.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"893cb34f58a0200e1987d82b0e729f5c08e90c332c5b98e54dda884856a496f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-loon/src/convert.rs:743-747 | crates/vcad-loon/src/convert.rs:896-900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/convert.rs:743\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb1c447cfc6bd7d86cfa47cc334c1a471e209c0f3b9176247c7c3ad5179b506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/pipeline.rs:2129-2133 | crates/vcad-kernel-booleans/src/pipeline.rs:2135-2139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/pipeline.rs:2129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"47906eb4fadd0b5f34eb1be7a277a4af210ccdc2ccba0b937e20a780bfa8d5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-app/src/feature.rs:572-576 | crates/vcad-app/src/feature.rs:591-595 | crates/vcad-app/src/feature.rs:602-606 \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 \u0060crates/vcad-app/src/feature.rs:572\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, \u0060crates/vcad-app/src/feature.rs:589\u0060 calls \u0060insert\u0060, \u0060into\u0060, \u0060F64\u0060 and \u0060crates/vcad-app/src/feature.rs:570\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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fa9f0699869f0fccf741eeec1ee306e59c6275cb228f4fd505733bd2b7a4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-embroidery-dst/src/header.rs:71-75 | crates/vcad-embroidery-dst/src/header.rs:79-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-embroidery-dst/src/header.rs:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-embroidery-dst/src/header.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d930b876c953b6f5956ad119a01d4d0ed651d968f586629661158d9bf26ca4a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/vcad-loon/src/convert.rs:436-439 | crates/vcad-loon/src/convert.rs:674-678 | crates/vcad-loon/src/convert.rs:699-703 \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 \u0060crates/vcad-loon/src/convert.rs:674\u0060 it does not close everything it opens, so those exact 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, \u0060crates/vcad-loon/src/convert.rs:678\u0060 calls \u0060str_val\u0060 and \u0060crates/vcad-loon/src/convert.rs:439\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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31ce7b6809a2ff23eb414e47fbdf94d804db80934b54913a03f1bbcb7df0537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-loon/src/convert.rs:503-507 | crates/vcad-loon/src/convert.rs:530-534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-loon/src/convert.rs:503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"148d777c20a884c75bfd2cbbe38db6e4d586996feb61b3603794cbc48bfda91d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-design-constraints/src/measure.rs:313-317 | crates/vcad-design-constraints/src/measure.rs:323-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. 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":"crates/vcad-design-constraints/src/measure.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cb9688f1904c83267c327a1ecec3ad42b5218972af55f725f5e74c2ee30999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-cli/src/main.rs:2788-2794 | crates/vcad-kernel-wasm/src/lib.rs:7520-7526 \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 \u0060crates/vcad-cli/src/main.rs:2788\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"332deea1d09cf2fd8adf7a1af129fe27d6eab4003487909f3f8b9ae44b6acf60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-export/src/bom.rs:81-85 | crates/vcad-ecad-export/src/pick_place.rs:52-56 \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":"crates/vcad-ecad-export/src/bom.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a18b86b79a03b3133a6b11596756d3c518119c7de8145dadf990b2e1515bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-pcb/src/dfm.rs:490-495 | crates/vcad-ecad-pcb/src/router/congestion.rs:131-136 \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":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e90e0c4a8a80ec1a668e31703c312bb9666bd976caa184967173e903138fea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/drc.rs:2956-2960 | crates/vcad-ecad-pcb/src/drc.rs:2966-2970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/drc.rs:2956\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2956}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4b84200770b046bceb1ad2c8d56030e096f86aff411a81e95058dceb72aab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-pcb/src/pour_synth.rs:533-540 | crates/vcad-ecad-pcb/src/pour_synth.rs:555-562 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3d3bc4244ee157982a4a93d2b4c0a72752198372f47581a422c06bc4daaec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/claims_ir.rs:234-238 | crates/vcad-ecad-pcb/src/router/claims_ir.rs:270-274 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/vcad-ecad-pcb/src/router/claims_ir.rs:268\u0060 calls \u0060add\u0060 and \u0060crates/vcad-ecad-pcb/src/router/claims_ir.rs:233\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":"crates/vcad-ecad-pcb/src/router/claims_ir.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4b7167ba3eeac001b8d0ea0aec9a96a77b6d8d2740b77402cd99e5424689c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/flow/route.rs:1011-1015 | crates/vcad-ecad-pcb/src/router/flow/route.rs:1142-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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1123bf6ec9ec5ae14e71f7d3d76ee8ef885f4b350232e6ec8753412bd1e495b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/grid.rs:62-67 | crates/vcad-ecad-pcb/src/router/grid.rs:77-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-pcb/src/router/grid.rs: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":"crates/vcad-ecad-pcb/src/router/grid.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"166d660a0419dc9e863f2daf9130de3624326e30f7ab323ce62d5c23136832f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-ecad-pcb/src/router/sco.rs:336-343 | crates/vcad-ecad-pcb/src/router/sco.rs:575-582 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"135ac02187fc60c821a41ca95678d683895efaed82862f2198330e42b983aaf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-ecad-pcb/src/session.rs:972-978 | crates/vcad-ecad-pcb/src/spatial.rs:180-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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ec56e68e306b3d5691b8f6fc703f61a5ac82ff9461fd706e158966334cde1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:918-923 | crates/vcad-ecad-symbols/src/kicad_write.rs:956-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 \u0060crates/vcad-ecad-symbols/src/kicad_write.rs:918\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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be4674bb0cf9d2d1d5f4c9c799185272d7f2004e5989c6752fbe913cf28581a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/vcad-ecad-symbols/src/kicad_write.rs:937-942 | crates/vcad-ecad-symbols/src/kicad_write.rs:972-977 | crates/vcad-ecad-symbols/src/kicad_write.rs:986-991 \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 \u0060crates/vcad-ecad-symbols/src/kicad_write.rs:937\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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d1b91ffe7939c7b87be946d40ff0d68eab719b35bd530074a049c35e9699a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:1158-1163 | crates/vcad-ecad-symbols/src/kicad_write.rs:1172-1177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/kicad_write.rs:1158\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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1800a52f58527eae021a52b3901d22b714d78a5683bb0ba2b411507ceadaa734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-ecad-symbols/src/kicad_write.rs:2573-2577 | crates/vcad-ecad-symbols/src/kicad_write.rs:2582-2586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-ecad-symbols/src/kicad_write.rs:2573\u0060 it does not close everything it opens, so those exact 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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ad52816a21de9ca628441ffc266cf361a8f48effa2802da98607263ab0b777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/vcad-eval/src/kinematics.rs:32-37 | crates/vcad-eval/src/placement.rs:72-77 | crates/vcad-ffi/src/lib.rs:825-830 | crates/vcad-loon/src/convert.rs:3238-3243 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-eval/src/kinematics.rs:32\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":"crates/vcad-eval/src/kinematics.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd23b2d2582c96f6941452cf65ea1010fe501fea23440e4493da6224086abf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-acoustics/src/instrument.rs:284-290 | crates/vcad-kernel-acoustics/src/strike.rs:151-157 \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":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac686fa23fd7611cab46f1fb1da6463fe7c250d3e06793f2f55a3b260568618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-acoustics/src/instrument.rs:593-597 | crates/vcad-kernel-acoustics/src/strike.rs:248-252 \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 \u0060crates/vcad-kernel-acoustics/src/instrument.rs:593\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"4856f5b112ee90823ccdb2eaa6399c919c450c0dccca7b35375306d2be1df381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/classify.rs:1073-1079 | crates/vcad-kernel-raytrace/src/intersect/bspline.rs:67-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 \u0060crates/vcad-kernel-booleans/src/classify.rs:1073\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc61e507dc8b22f626cbdb50b005542b7632066a07859de643ec9403b26785ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-booleans/src/mesh/csg.rs:101-105 | crates/vcad-kernel-booleans/src/split.rs:1036-1040 | crates/vcad-kernel-fillet/src/topology.rs:106-110 \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 \u0060crates/vcad-kernel-booleans/src/mesh/csg.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":"crates/vcad-kernel-booleans/src/mesh/csg.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"669c1703e2138a17d302a6365396cae963ec96f11b1bd4df1d01ce168c0405bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/no_crossing.rs:140-144 | crates/vcad-kernel-booleans/src/split.rs:798-802 \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 \u0060crates/vcad-kernel-booleans/src/no_crossing.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":"crates/vcad-kernel-booleans/src/no_crossing.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b949daa7fecbb627b539538c1f52e30480df62549039e365d07d8495f84778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:2335-2339 | crates/vcad-kernel-booleans/src/split.rs:2502-2506 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff4ff8c98cc172f23ecd37a9468f26f7df5f2dd41caa1d4460dd15324275a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-booleans/src/split.rs:4442-4448 | crates/vcad-kernel-tessellate/src/lib.rs:5621-5627 \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 \u0060crates/vcad-kernel-booleans/src/split.rs:4442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4442}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe242a008a3e370587efd4b9465b91a3820684a59dc5446ff12024f882f69501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-booleans/src/ssi.rs:402-407 | crates/vcad-kernel-booleans/src/ssi.rs:618-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/ssi.rs:402\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3353173a388bec1e503e3998cafe6f2861bf2f56c4e58e372693911d84685a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/ssi.rs:847-851 | crates/vcad-kernel-booleans/src/ssi.rs:921-925 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/ssi.rs:847\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d79e6ef53f1a8d8b952cda976a2a4b95ef22e482078db131298b916a11c3091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-booleans/src/ssi.rs:1095-1099 | crates/vcad-kernel-booleans/src/ssi.rs:1140-1144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-booleans/src/ssi.rs:1095\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/ssi.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe46c81cc7911c6079f6b9293111836009b997402afb8df877c3ae3bf3c5ee12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-cam/src/turning/profile.rs:101-105 | crates/vcad-kernel/src/turning_profile.rs:650-654 \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 \u0060crates/vcad-kernel-cam/src/turning/profile.rs:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/turning/profile.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"349daa001f43fc571a99aacd7aa7c3c654e86e681a65e24ae64bd6d385268106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-constraints/src/symbolic.rs:414-418 | crates/vcad-kernel-constraints/src/symbolic.rs:429-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":"crates/vcad-kernel-constraints/src/symbolic.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb137f4d93b65e64e3a2cd197ad108556c6a8ec181c700c041a8c2e1537937a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:580-587 | crates/vcad-kernel-dfm/src/rules/hobby_mill.rs:1687-1694 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"545033de0023922ea252e06282df36ad975be86a7dd1b21c17125b5453f80d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-drafting/src/dimension/linear.rs:239-244 | crates/vcad-kernel-drafting/src/dimension/linear.rs:245-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dimension/linear.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69520c017befea219d80063d4432e2d38f4b5beb9a9352aa3dfbc885835e3f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-drafting/src/section.rs:486-490 | crates/vcad-kernel-drafting/src/section.rs:600-604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-drafting/src/section.rs:486\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9682888d135d63d4d6a52805f7277c9c61ab7f3e07db2ae9203b620116e0bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-fea/src/buckling.rs:1161-1166 | crates/vcad-kernel-fea/src/modal.rs:1252-1257 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fea/src/buckling.rs\u0060 and \u0060crates/vcad-kernel-fea/src/modal.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. 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 \u0060crates/vcad-kernel-fea/src/buckling.rs:1161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c43aacacfe05276322ac868aacb587e1d2f104d3dcbd39ef7d084cda100553c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-fea/src/mesh.rs:256-260 | crates/vcad-kernel-fea/src/mesh.rs:367-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-fea/src/mesh.rs:256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"100b62791a3ef921648c7ba521897226fd0cf4605d8a1b3e5bc4059ed1224ed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-fillet/src/chamfer.rs:104-108 | crates/vcad-kernel-fillet/src/fillet_planar.rs:140-144 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-fillet/src/chamfer.rs\u0060 and \u0060crates/vcad-kernel-fillet/src/fillet_planar.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 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 \u0060crates/vcad-kernel-fillet/src/chamfer.rs:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e165239a333dd501c40ebf82e9f22ace41580256cbf0b78776c6e163e68a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-fillet/src/fillet_curved.rs:492-496 | crates/vcad-kernel-fillet/src/fillet_curved.rs:498-502 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-fillet/src/fillet_curved.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f080d56554f8e7daa3ca9402325a0ec1459e23238a433e8231b72142c9aae3d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-fillet/src/fillet_subset.rs:558-562 | crates/vcad-kernel-fillet/src/topology.rs:101-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 \u0060crates/vcad-kernel-fillet/src/fillet_subset.rs:558\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b480de75d7a2d315e58e79230b7ec8d04738e645a6dc600cd70f2a7d38ff960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vcad-kernel-flow/src/adjoint.rs:333-339 | crates/vcad-kernel-flow/src/model.rs:442-448 | crates/vcad-kernel-flow/src/solve.rs:686-692 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-flow/src/adjoint.rs\u0060 and \u0060crates/vcad-kernel-flow/src/solve.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 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 \u0060crates/vcad-kernel-flow/src/adjoint.rs:333\u0060 it begins part-way through the construct above it, so those exact 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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee48412404a8013f1abb8e8b3d10f8a7de46557ad5e16cd2cdb345c1789fb0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-nurbs/src/lib.rs:188-193 | crates/vcad-kernel-nurbs/src/lib.rs:724-729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-nurbs/src/lib.rs:188\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":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e9801c14bab614be128a108ff6b8a01cbad743de06e51001ed2bf222b206c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-nurbs/src/lib.rs:401-409 | crates/vcad-kernel-nurbs/src/lib.rs:799-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-nurbs/src/lib.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"961d87891c434d9fc4e7318710ca5c76a78322d6fd2e64d49ab19fd746fbb028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-particle/src/trace.rs:687-691 | crates/vcad-kernel-particle/src/trace.rs:703-707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-particle/src/trace.rs:687\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/trace.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec23fb6293643e6f33a8cdaead9c85ee70d4cecc1734b6c9e5d07b780ea75465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-physics/src/diff.rs:395-399 | crates/vcad-kernel-physics/src/diff.rs:1376-1380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-physics/src/diff.rs:395\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6690ec9a363858e3c8b26ac433bb25e4ba62ac16bdd48f8f08924ed8c62f721c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-raytrace/src/gpu/buffers.rs:106-112 | crates/vcad-kernel-raytrace/src/gpu/buffers.rs:163-169 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7325099cdb42198f4b42b5eb03c2a6758a7490e6cde58ddb241d7d7a3d4fd44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-raytrace/src/gpu/buffers.rs:591-595 | crates/vcad-kernel-raytrace/src/gpu/buffers.rs:1345-1349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-raytrace/src/gpu/buffers.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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dabffb7191d3c2532521288bf9d0e7c579aaf04ed56cb91efaa372e13fbed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-sheet/src/flatten.rs:384-388 | crates/vcad-kernel-sheet/src/flatten.rs:939-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-sheet/src/flatten.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":"crates/vcad-kernel-sheet/src/flatten.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"644246b26ee8d61849573b5c573a03aade1628aad59f706cd355b36a67c6163b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-sheet/src/poly2d.rs:520-524 | crates/vcad-kernel-sheet/src/poly2d.rs:637-641 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"175fb70f090d85ef98f57840b88217a4bb64a134fdc1f09868c56a14dcbd49ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-stocksim/src/subtract.rs:259-263 | crates/vcad-kernel/src/turning_profile.rs:466-470 | mecheval/graders/src/fit.rs:280-284 \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":"crates/vcad-kernel-stocksim/src/subtract.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2c4bb609f8269adf14ecd3d62c221f906763818b5ec83e2add5621efbb10c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-stocksim/src/verify.rs:263-267 | crates/vcad-kernel-tessellate/src/clearance.rs:416-420 | crates/vcad-kernel-tessellate/src/clearance.rs:758-762 \u2014 before extracting anything, compare \u0060crates/vcad-kernel-stocksim/src/verify.rs\u0060 and \u0060crates/vcad-kernel-tessellate/src/clearance.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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 \u0060crates/vcad-kernel-stocksim/src/verify.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":"crates/vcad-kernel-stocksim/src/verify.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6422cdf6334111711af96222bff4f315671ca8e2bc4e41035e66ba723dece3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/vcad-kernel-tessellate/src/lib.rs:5223-5227 | crates/vcad-kernel-tessellate/src/lib.rs:5235-5239 | crates/vcad-kernel-tessellate/src/lib.rs:5245-5249 \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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":5223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29b77ec836b63f290fb4383af7b9f7280dbb051bb4d64d4348ed21ccfaf3bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vcad-kernel-tessellate/src/lib.rs:6804-6809 | crates/vcad-kernel-tessellate/src/lib.rs:7218-7223 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6804}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba51b25a3e71dc8e26f3b2968b36039d7038ad3c4abfb9897321870128d73b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel-wasm/src/lib.rs:7486-7490 | crates/vcad-kernel-wasm/src/lib.rs:7554-7558 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":7486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2caa6e07bd0abf51b394deb9a8b4695855f57e21f5f7871908ed5fd039e957f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-kernel/src/faces.rs:655-659 | crates/vcad-kernel/src/faces.rs:671-675 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-kernel/src/faces.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6b24ad317f18b29620c27bb290fc1e6efd9b4675e3e0b89517d462976c18ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-loon/src/convert.rs:679-683 | crates/vcad-loon/src/convert.rs:914-918 \u2014 both copies are in the same file, so extract the block 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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"650a7b7a5d643cb5981531c57711c7dec6e783713bad87a4f9dc2f215c04563b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-render/src/lib.rs:5120-5124 | crates/vcad-render/src/sheet.rs:414-418 \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 \u0060crates/vcad-render/src/lib.rs:5120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac233968854b52c3ed1e1b055297e3cc187ac1541c6858cafabfccb3683d530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vcad-render/src/lib.rs:5594-5598 | crates/vcad-render/src/photoreal.rs:493-497 \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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":5594}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1de3025bb67e276ff5b6c402b33ff1d89e3b43fb88c3b09a5dce29a9c3a331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201336 lines \u00D7 2): packages/training/src/modal/eval.py:148-167 | packages/training/src/modal/train.py:281-316 \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, \u0060packages/training/src/modal/eval.py:170\u0060 calls \u0060split\u0060 and \u0060packages/training/src/modal/train.py:317\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":"packages/training/src/modal/eval.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdeaddc7270b51ea978d6bd85dbba3ee660c2bae8857ca98be83e8aef1197c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201333 lines \u00D7 2): packages/training/src/lambda/distill_lambda.py:234-261 | packages/training/src/modal/distill.py:229-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/training/src/modal/distill.py: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. 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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1a3185aa0cdd0fba5b3ad79b2b057e9ebc75e79149aceb5f1199da89dba0c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): packages/training/src/lambda/distill_lambda.py:174-191 | packages/training/src/modal/distill.py:162-176 \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 \u0060packages/training/src/lambda/distill_lambda.py: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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7f7faf39cad489eb6469f6b3b8e1169a5c63c3e8a21be0e7599e78412d9c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): packages/training/src/lambda/distill_lambda.py:333-345 | packages/training/src/modal/distill.py:344-359 \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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ef04df6c7b1717798329534a4f596b63a531bf33a42f3b793eaf183620d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): packages/training/src/lambda/distill_lambda.py:320-327 | packages/training/src/modal/distill.py:325-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 \u0060packages/training/src/modal/distill.py:325\u0060 it begins part-way through the construct above it, so those exact 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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b56e61f4f93172a3464cd29fafb0fb79d964cdbcab4921fba89785196f24034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/training/src/lambda/distill_lambda.py:63-70 | packages/training/src/modal/data.py:14-21 \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 \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":"packages/training/src/lambda/distill_lambda.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7d4a717dca450b82d832e5e751e45ad1baf02a843164e1b9eb13436911a55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (118 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4560-4677 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4560-4677 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b70924483e4c9a00fac35b6eef7c54ab275f9c3d3199530a97a7545ea9eb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (74 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4451-4524 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4451-4524 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f915b4b8e102313406a45bf24d93f3417d046baa29dd8cbff7d6195769ec0626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201373 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2631-2634 | apple/VcadApp/Sources/VcadApp/VisionShell.swift:13-85 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:13-85 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift\u0060 and \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 91 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 \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2631\u0060 it does not close everything it opens, so those exact 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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2631}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f265d38288356d596ca4a1997a0818629e8c7043970f39e54b86e3e01662b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (83 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:24-106 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:24-106 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e96b9b3ab74b12870bb0f5936303c8c7ace47daa076cc16b430ff099734222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3511-3574 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3511-3574 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf5e289e0ecdd6015f1a56bcb205883da86f416c97bbb92e9e535489633307c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (71 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/UsdzExport.swift:32-102 | apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift:32-102 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/UsdzExport.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 120 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. 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":"apple/VcadApp/Sources/VcadApp/UsdzExport.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4def75cec7853b297035d2d3952453d57074e88557e26ad4462c5181416fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:220-267 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:220-267 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a43191ac69e409946849043f0c2e1bdfc8c4665a52ec385540ed5b8009cbab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:347-394 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:347-394 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3e012eeef88466fe607de70bc504d93a24172bdf9ac29bc78ca728029d918c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:24-71 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:24-71 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2f786966b53feef91fa0acec4ad518cc70ef8ff75d53a35a21a90d444edce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (108 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4268-4375 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4268-4375 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86f8443cba4937e92e1ffd19a47c4414947255482f38beeced8f7f40bbf2596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:924-968 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:924-968 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ac03c7a3ff0b14894a3de7ea7b40ab03f2ac46125157e02da17a379aa03133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:620-668 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:620-668 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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 \u0060apple/VcadApp/Sources/VcadApp/Shell.swift:620\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf42cc0907379a66715135a1e8b811ecbadf09c014ce934933cfbaf612fa67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (241 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:176-416 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:176-416 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"de53cd034d04e3c908d6a90d27fef0a5730c5b7bbe526b2c088a433e2551f3b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:185-226 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:185-226 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db7189ff6f845b3fe79c3e1e89fd76e1df84a8e9548434b8008ed164fc533a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:199-243 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:199-243 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aafa76df43fe87b151fe8a941e47516795fcb85cf7d2c619556c4b5704089e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:710-774 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:710-774 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"c062917b2922a1a9a654c24b7ec05b1c2e84f3cfac5db7614b06e9e9798fc3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:710-762 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:710-762 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1c56d8fe1aabf43b72cee00e7ef941c4c0a70464de375734768f84bed929b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:966-1018 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:966-1018 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9865f6bf2489975d28b83a0451995bfc514a8619d0980bdfd73d596633a6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1169-1205 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1169-1205 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fa61ac0481d1c34881568ec90320704c0e0099a1df4576eddd7ef78bcf51e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:153-187 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:153-187 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92ffb4706d2b002d0c242842ecb253a08dc1d2de1e3a516f077739d60a99160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:875-917 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:875-917 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"828f831e5732d5ea87c8a200d7c7df7521659fd81bcb6a1c06a13aab052272db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (127 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:173-299 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:173-299 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"34665de713013d257fe9cec7359f8f64df3fd3d52cea43bf0180232440fd2826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2483-2514 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2483-2514 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7d08b149124151ca80e2ffb4f335daa70fe1d12008510e5350431b351b0ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4380-4411 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4380-4411 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4380}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f412bb86b5d47b71753d75e67235fb7e969e5cdae6005e3847e0519bdb4b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2875-2917 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2875-2917 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fb9d589bf6d6fdf149b2c09689593fe3a42a80f6fe0a802196b9e94e581eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:449-481 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:449-481 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a1b281c871914f064669214bea19d4d4d6d18997f94e444982c38584eeccb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3882-3944 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3882-3944 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3882}}}],"partialFingerprints":{"codehealthFindingId/v1":"59547db3423701a2d0516e226e6a141a6fa4f98e2bb3cdad43ea090c64a25b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Chime.swift:37-65 | apple/VcadVision/Sources/VcadVision/Shared/Chime.swift:37-65 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Chime.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Chime.swift\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 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Chime.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a820f425b930e0724c2dcfceab3f6dd184466f0a1224c3a0fb9aaddbb8096c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:628-656 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:628-656 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b155ad52520a836060917e90932cbe5455cd367ea3a885fc0e61a664fc286eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (127 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:93-219 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:93-219 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c590672dcaf453180a533f2da7efd1da63e9a11cf296b69de29f8931cbfc22dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (79 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:301-379 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:301-379 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8461f4fb54172a6d0f54c6cf15d30038529ccf1dd976632d765e17271026f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:189-217 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:189-217 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dbe3edd0197942165524971e3b08934a7755577e91511970bc1e1e72fdd16a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4747-4774 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4747-4774 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:4747\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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4747}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31ed78444245f16e179b17fa3a568c472ac080ad4d5b10232f29193e025b374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:46-73 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:46-73 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f7b0b452e0bbf076a8ce0eb5e6cc9081bfaef6922bf2fd37eb05a35b19809e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201328 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/ModelBrowser.swift:255-256 | apple/VcadApp/Sources/VcadApp/Shell.swift:664-691 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:664-691 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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 \u0060apple/VcadApp/Sources/VcadApp/ModelBrowser.swift:255\u0060 it begins part-way through the construct above it, so those exact 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":"apple/VcadApp/Sources/VcadApp/ModelBrowser.swift"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"529dd6d9926f3d110870d8903cac3b97e0bb5d011ee375773792ca6663040a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1472-1498 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1472-1498 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a04273a340023eea4ebc53e254ab64b7bbd70e8d5b6071f17b2abba9cfcea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:506-551 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:506-551 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e0c99e9c78dde70d493a6ff8a0089aa1ca1fc70dff7fc3a3d4402920e9b6f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3343-3390 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3343-3390 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"562f754c27ab406e24e39b2978312bbb4269f677b73151791e8b93a9e2257c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:130-155 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:130-155 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3a1702008ac1d2bc3b1d472f312cd4b289c10e64a7cfba16893f44f0f6c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3268-3291 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3268-3291 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1483736d6766e7ab8489829dd910aff1f5e7f28f0eea86945b8c2a9fee076680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4030-4058 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4030-4058 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ff20b04183e259b56f3c552790c803c4d7440109a40f740c5f2937289d8255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:464-487 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:464-487 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8dd058136dde48cdf7c3cf1b95f173216341fcc877f02904a79da9b29c87e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:259-312 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:259-312 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e224eab67b1a2ad08d69d7d3acbbaef829a8da1e31b332b8be796d851f7ef74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1393-1415 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1393-1415 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca3f0f8289de821372c79697bb966bb46598c94454bcf60d40cbcd8d85e5f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:22-58 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:22-58 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a90a3cfdbd69365a003d933e9640350f90ed0eb92509fea417ddcc36b94423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:433-455 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:433-455 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"941a52d8857ac8107a9a566958eec37589255b57b6b2e0fb3f0012d881fda562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:546-568 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:546-568 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa8c6bc653d52c47f0584669a19862eaefffc3511e6742158a11e895c311e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:229-251 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:229-251 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"264e35b20cf02d81bbd834e54b4c019b19e97887a6705da4736b9880f8fa900d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2518-2540 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2518-2540 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79dab438e64c4276f9eaed902ed43bc2d64f92db2a6e5762a2991a99b34e165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2704-2726 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2704-2726 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7c1b258f00a63e2e72c0b4880da2291a7373044ab0f8db82d9eb2d0c601314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3615-3665 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3615-3665 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbe4464a6c2b5f300f215d90d3d68c52edfcc7d9046952707198e683040f52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:245-284 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:245-284 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"03efdcbb006260421019ed76eb9f1e43a4cabad0cc6341ea943e74d32d63a8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift:105-126 | apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift:105-126 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 131 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd61e49c229755baa5a677637beb3cc3dcbe14e238df0e64775af49eaedee67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1138-1159 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1138-1159 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"395cac0f600cf708006833754fb27f48c615cbeb8fd945fe7733e4831f2c61a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:571-593 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:571-593 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60ce57ee9386e49d4001acc63e91544844444ad035dd4fa7f93fdf3c42116e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/VisionShell.swift:218-239 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:218-239 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 201 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c4ce1f0b5d9d302d36cdd84d9320fac55680958d9de7cb9dd196556ec290e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:2795-2811 | apple/VcadApp/Sources/VcadApp/Editor.swift:4735-4755 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2795-2811 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4735-4755 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2795\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"56977ff7bc01da661fca03d17c92b237ee6edd0f217eb55e4f9fce3c267d06e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift:21-41 | apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift:21-41 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 131 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ecbdb097e4a2e8beb748024cb2ca90d77e00f498958ddc9cebeeae71d0b4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:318-338 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:318-338 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6fc344df725e9a5aaf31eddd117bbf978b10cbfa75632b5b1575df13aecd7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:237-257 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:237-257 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3c9375b0ac65250bc9668d7b763c7342b3a3fea56bb024a37c9248db5d21df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (90 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2156-2245 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2156-2245 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb2695c465a3d558616cf17e6ebd8fa38a0485e088b5f38927413ef692afc0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4179-4205 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4179-4205 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4179}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9310999b5183fa5a23d53185025a6f8eaff11ae3f9564b105443ae840e7fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift:75-94 | apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift:75-94 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 131 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4d9c516e6342071d646d4850ab36ba01d6f3f73639b0cc0325d08772c3896e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:676-695 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:676-695 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f458da1064ac5bb403c57615e735b94f8ed8fa32cc61bc82301f486a71be48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:702-721 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:702-721 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4f64059c3ccf6b41d60b866e7f14046154093ab6089e0aec8e2898fe148e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:501-520 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:501-520 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ee196bb92b86a1cec391850af59ac7d232f87da3ddc27a6a1069397e0fc2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2383-2425 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2383-2425 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6b25b71c389d9996f8d2ad107f7c003c1969d9156fd77c5723df45e2143a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3581-3599 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3581-3599 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d162613c703b22f81dcacc351e6cf4b5a1849f2e1f4e31170ad0995b4de789e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:404-421 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:404-421 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"267a4838f1019dbf8d68a2607f4ed3e41ea18f2df3c4d219ce6b3a04850ae20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:971-988 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:971-988 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbe8a6da0267c44d2c122ffc974bdcd2eaf55098d092e2bbda4510e265c14b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2003-2020 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2003-2020 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"06842322bc764115342d438ca3a5e59ac5391182bb9929fb7d32ee712cef0832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2771-2788 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2771-2788 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2771\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"82225994285d37a98f4e2b3026946fa059c0986608259b589f1d11b575544e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3146-3178 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3146-3178 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cf5326d1328df418b4781c143ad1236bf0996a2a8f6eaea86dd88eb1c6d518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:211-262 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:211-262 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5c7a6c5ebe793de37eb2531eccbbe4073f7205b5e48826bb6042c299bda8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:617-634 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:617-634 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8af98694a0df1c8ae5cca75bccfa262ee5edad0243f5f71f071e7eabbade2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2843-2863 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2843-2863 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e283b0784cc265de8da2c65e395f2caeb6f11dae1c8f9f17141b9800f937d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4008-4024 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4008-4024 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"f354b39891594a1ba04aee3a15a3d3a2d451fe32d736afd9854201d628000e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4073-4089 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4073-4089 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4073}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae92987f146f1cde53df608c2c0572f4f3ea176cac2fc5c2663cd880e11afab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4098-4117 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4098-4117 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4098}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea8d5b7970912272ab9c49b1f4826cb207083da5536273168cf09b6c9cb4ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:113-129 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:113-129 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b62117ab19e873ca4686a5d7f305c49a308a3bc005df82548027fe40e525fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/VisionShell.swift:154-170 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:154-170 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 201 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"56de204b651b994d62924770cb097c8123ca82ee4a6357740942f1b5cb02e64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:501-516 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:501-516 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9d79c8d6acbf0598f18b4b58259abca68933a387728a4f9d1082a112a90cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201316 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/AssemblyModel.swift:259-262 | apple/VcadApp/Sources/VcadApp/Editor.swift:779-794 | apple/VcadApp/Sources/VcadApp/PoseStudio.swift:158-162 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:779-794 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/AssemblyModel.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1e0e6405f8c34a25a5535cc223c512fa9ff0ecf355a31ff2fde73571479344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1432-1447 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1432-1447 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bcc8a24dd761d29bf2413149557134bac3f33d85f8e8eeb52fd637bd4d1cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2933-2952 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2933-2952 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2933\u0060 it begins part-way through the construct above it, so those exact 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2933}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c056a9e958b7afdb9bf5f7d9704853ff90b52ac2ea4652f6972065c2318cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3084-3099 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3084-3099 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f39aa80bd41666b87616026ca39d4b450c14b6e8dcadbd4bfc9db971df8a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:518-556 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:518-556 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52a7732bf008399d0490b88c7ea534e7d74a386f08370035777953781d9af62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift:130-145 | apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift:130-145 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 131 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"664c2955f2d6d03916aa600ebaedd97cf9ccd9a4e4b895e40f5b2d9c21493787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift:147-174 | apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift:147-174 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 131 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d950f063f87e0b837a98d8e90e440cd9cf7f9524e125874b738dfe5dc95e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:450-465 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:450-465 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ffebb18c5373807e03f726d11e2c14ebc814963e046979ee3a1859a146a3a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:603-618 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:603-618 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"02449e129c531bd11e949681816e29662ccc830d9679963715079619c506e725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:693-708 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:693-708 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce91d5346aa045e8c3a2900b33dbe255650cca2954343d4dd564660c3cadb659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1020-1035 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1020-1035 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"896e44b1820fba0441a935d9b54ef535b0ff3bc1bfa316fa48fb145eda9118ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/VisionShell.swift:134-152 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:134-152 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 201 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c192dd8341104ed7011ba64cccf0b267b4832540054e6f0ec676a8fcadedb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:748-762 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:748-762 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a01b94c31adab6457f3c9cec3499b6986c9c60fe4bae69c6de509eca0f4e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1803-1838 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1803-1838 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ba6b3477e0f49c103039670a878e6ca8600ffd2f6fa595ff5138492a0b86a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2687-2701 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2687-2701 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf7ac54860cb684aff8f054e0b4a20df58e40907b06e65959e6da74800a1419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3185-3199 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3185-3199 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce88b3bc33b72a2086ba0f3845ee42dc8a132ac0264a8f9f841cbc338ffcef18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3425-3440 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3425-3440 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:3425\u0060 it does not close everything it opens, so those exact 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcee0c502dff024e7cbc07d57d6dacc73a0277703bab2c9435b02f4273dec95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3858-3872 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3858-3872 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3858}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa4a1d1addf1402201a0996f87530caccd11f40f9e8eeb4df20d03cbe7e388a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3952-3972 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3952-3972 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3952}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f3e39856bc6b4905c269c1ae3a15b37ae350180c7020a80fa94e43820778b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:204-218 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:204-218 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"da63550dbd1d8c331053c1719407e8d5459b45e7a181ce9aaef1a87c3828d2a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:553-567 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:553-567 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d10c3f594bdb6e4ae01228ac59eb8ab7db9a3fdcc82fdc7ccb35626358e43b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:126-140 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:126-140 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"661fc0d154c557f562a7074e7d0c808d1d0130b480a8fb2fce87fbc4321c5b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:532-546 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:532-546 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1df7dcb7841c4bcd48f7c95e8986f5cf584d7fb4f03b3b6538240e9ebe29938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/UsdzExport.swift:109-152 | apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift:109-152 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/UsdzExport.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 120 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":"apple/VcadApp/Sources/VcadApp/UsdzExport.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1b2157e0aa31fed75e0f36970c67a41794eebb48ac1d6b797d22a2402e9829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/VisionShell.swift:172-189 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:172-189 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 201 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f527e779e931ef41b1b6c325b8d3cb2d3e31feb89fd86aecae12d6111ef072f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/VisionShell.swift:195-211 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:195-211 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 201 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f27e89d89155387dc33d724aadc433b3e25846652cca624934d3e4e54ae3b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Chime.swift:22-35 | apple/VcadVision/Sources/VcadVision/Shared/Chime.swift:22-35 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Chime.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Chime.swift\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 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Chime.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"306f439cae7768deaeeb11f475bd9a8412e2e8bd9868cd717691b81d24f191d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:602-625 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:602-625 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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 \u0060apple/VcadApp/Sources/VcadApp/Document.swift:602\u0060 it begins part-way through the construct above it, so those exact 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"773ce0bed40f7c8a58ba7261be402e8f2f3006d75bd7e180bd0ad6ca8b85e31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:347-360 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:347-360 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"af44c88ed671908679aa22f5cda22cd7c780e2066f33801b544799bc0b63b6f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1586-1599 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1586-1599 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42efbe5b379fed34a5f2256e2328b4f8d4b70fe3c543e7f61d2fda051152890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3669-3682 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3669-3682 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79ce1ed5485eb18f80c8417fd52f59a42b7b88c80c84ea174d275c1e092448a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4529-4542 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4529-4542 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4529}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad5112a3b828427d00733cac131c3a86be4d95ba876f42fd605d966ed36ae84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift:49-62 | apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift:49-62 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 131 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d55955bcd2e4c9864c556b0c2d592e7d6df7e985c37444eca2aae1c42b22444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:156-194 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:156-194 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e9d20472a40fbc11a683df64f24bcedce4a4087119973e8d0f954d044acc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:359-392 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:359-392 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"97735e60da6e4702aef4a6e0102ad6d5e9b8ab3b933b32b0d1127fa29f739036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:550-563 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:550-563 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"af917410d8fd715dca0c7383b7cc6ecee1513c4e1e4301fe23a872bf2241b76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:56-69 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:56-69 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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 \u0060apple/VcadApp/Sources/VcadApp/Theme.swift: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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ce1754fbe21582dce71de084885e7e4cc1d4a92dfca31b33e027fb0a8b3703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2745-2757 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2745-2757 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c478a12b4f57067cdb99d7706119d0dc3f74214764495178ac30dc1a79b8cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3317-3329 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3317-3329 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca559380595e27c170e1cdeef697577ad0990f34b06ccf91fc4e7707524668c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:381-393 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:381-393 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77d442db866b8bdb56e90e0185b1c34671d49e484382a416a0971e8ee1c9174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:816-884 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:816-884 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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 \u0060apple/VcadApp/Sources/VcadApp/Shell.swift:816\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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d155c12cbccba2066772e90d0fb4e5a20e0bac5a03ad0505ada354a92353f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1117-1129 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1117-1129 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e284165b135b4b2d79fc4e4e2dbc90470613598db821731b87a8505882e6e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:250-263 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:250-263 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e6f9f99ec3939be40a6d6df3eb9ca1107cf0dd3e1ad66e6c7a07f4576c3e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:151-163 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:151-163 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"90627c864873988806dac97165c7fd87015b0e511726c8ea79dae5dd5df7c3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:139-151 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:139-151 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"023fc79c567e80e4f1e2faf9069800d3447f4351bea1c583f73b348482f4f144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:219-235 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:219-235 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c9694d1ee1b364b70ae3acde114de58d51b5475821162c0f3fbfc60ee9a2f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/AgentInstall.swift:149-161 | apple/VcadApp/Sources/VcadApp/ConnectClaude.swift:52-64 \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 \u0060apple/VcadApp/Sources/VcadApp/AgentInstall.swift:149\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":"apple/VcadApp/Sources/VcadApp/AgentInstall.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"944cb07c4b2a8e30b7665ddee5c95bd2f7033fef07499fb799e35aba24f41ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:370-381 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:370-381 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca17e56b7fd8b09bc82e5155143b60443a3a7608f1740561729f13028646e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:379-390 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:379-390 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"10eaa1256c0254c20f022a5cbffaabaf2e8035a5a6b6835cf078cc9237ecdb2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1146-1157 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1146-1157 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e1c7590cb6002249c6e02df3bd1d554b197b89a0dbd1c35fb373e8f5085219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3018-3029 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3018-3029 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2468fb09b5e2e245706bde896d64f1c21d8c71c0faa86b76bf66f9554b5bf23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3748-3759 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3748-3759 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3748}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74f08d584299ee52815ff25c2d7ce4b887ffbd85b00c92a2cf37b8d17991f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:462-516 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:462-516 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9089940e1fb38de9e0cf24542554cbb7ef6f8f3af09b3ecc956e954cef199e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:473-484 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:473-484 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74f4056c7fb1f119475dfd4a3936485afdfbb4253d320a05db0e5987412a5d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:78-96 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:78-96 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f18a5aa508813cff12c0e85f9d2dc1f0078740e0bdee3192731f3f1383fec12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:354-365 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:354-365 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1ae59fa23337934670e6625c7d5aec05ae457794d69812c7ccce31157b019f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:168-179 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:168-179 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb6f338c9b44069fd727a9c8388b5ca1f395f484a5d73c6f8eb097b849d1b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:417-433 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:417-433 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca14bf9d4629daeac01cc0279c4f43b8197c26b425d20f50dad4d54446b1bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:437-447 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:437-447 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c5cfc62e1caa07eca2cf17d7c1a48d2784c49059cf716e8c34c40751c20f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:151-161 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:151-161 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc1f43ff029a67ca0732b8d2dd97e8ec04357e567c463d432315ac1b822d581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1933-1945 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1933-1945 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d86d003e3cc60e517c1d12fa486956d971b344a75be1bde12af7cc5bc6c5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2559-2569 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2559-2569 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6222fe256e0bdac78d6b6d9cc75820eeb905d380df1f3ebbecf2b89c8c56249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2954-2983 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2954-2983 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4886f680f9dfd0f06910f1ae1f9db66e749af082a7b185034d492a285d3b5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3704-3714 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3704-3714 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3704}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dd539bba73e1879c76050d1c17a4144a7f51f829d9dfc23c63952600633c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3779-3791 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3779-3791 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3779}}}],"partialFingerprints":{"codehealthFindingId/v1":"f679f0bb294957245294292415ddc396dca24b950a2d0230838d24863877cced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4439-4449 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4439-4449 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d36d1b692753f680671c7b2458590ecaf3bb39e4d1a24339a07c3c0cdb15e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:64-82 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:64-82 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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 \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift:64\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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4becf013433b3c6fb224dcab049df2a5d2afb9eba9377616f03954a5945fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:363-373 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:363-373 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bdfa7e2415ac62714b6d0a8c55da9ed263977987215f834993cdffddf2f946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:757-767 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:757-767 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b90c92c60093d7b6d24338558dfe65e42dcfa3386eff847d4e0faea1f427fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:566-576 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:566-576 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1a08ad663060dc9a4ef3470abf7ad4b2939202297c8be4a98d2aae3a1d14be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:316-326 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:316-326 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"48272a8bdeba5252a42b4580061afd3cc4cb4708093c3e99ce70f87c4af37dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/VisionShell.swift:94-104 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:94-104 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 201 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 \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift: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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1c003e88ed8c40043d78dee7e0d063ed47dd2e5161427c2095d9725045f3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): apple/VcadApp/Sources/VcadApp/Shell.swift:906-915 | apple/VcadApp/Sources/VcadApp/Shell.swift:927-936 | apple/VcadApp/Sources/VcadApp/Shell.swift:939-948 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:906-915 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:927-936 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:939-948 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e0c34e227362ae5faa932f01caef18753aac5cb582202852d906ce6251695c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1112-1123 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1112-1123 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8f1d135f28acd8e7c4db571a941040d71ebff2e294c5e3d1558d2599c3323c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2099-2109 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2099-2109 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2099\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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c8fc927e317b598edb9f04568039e0fb312d8e0b87e7afd56d110f36952f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2343-2382 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2343-2382 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f37343cd41aaacd57d4306f01ff62a71cc6fab3ea16ff5e856bd044e189f7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2453-2462 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2453-2462 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fafe1eb13010c1e6cf66863880ce4271da9bc43f1e2228a596c253f93940f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3301-3310 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3301-3310 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcac762fa3deb1978c8dadb6be4d6a9de482b62ab7400fe4a50ff438d8e3b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3603-3612 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3603-3612 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3810d665700e5296e69bf4ee060af560a6dd0324aef43742c469c4c9c6ec55cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3764-3775 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3764-3775 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d780e56a38405af827fa85aa5475b2a934171d3a14ec7b648e2e0244afd7a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4698-4717 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4698-4717 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4698}}}],"partialFingerprints":{"codehealthFindingId/v1":"68816bcf8120eafbf590fd0981ff129ce304c12f5cf65892ee1831d32b5e27d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift:64-73 | apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift:64-73 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 131 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedd8f95fcbdd4041c89db446b34648157afab8d13c689a3130b229724692d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:322-341 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:322-341 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e9d6dd4ef707f5740b05196f27a6d188a676ffa9c0fcdc8523ee713ca3cdc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1040-1049 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1040-1049 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d7fc9a4b56e2870ebca037f71b5d9408ed646cedf78c4b10105e1fb2912a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:79-89 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:79-89 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"58852217550c29c1ee1adcd0922c3cfa505cf23030f7340eff1ff4884d2c2a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:737-746 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:737-746 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbeacfbfd1010ce71fc189adc8540f0dd6c38014aa2d8334a434321b1767837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:92-101 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:92-101 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4182c78fc1009a2643890fb91536b7a1173815465aee3c9a22dde5f1d1af30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:328-337 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:328-337 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca6d102f8605c45d8b6b6383bc7629267c541672a48fac1944c48c27ab032c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:151-160 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:151-160 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6477037419d15e24f2e35805fc62ff3b72616b235c50fd29403c091e203237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:1211-1218 | apple/VcadApp/Sources/VcadApp/Editor.swift:4685-4693 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1211-1218 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4685-4693 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:1211\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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef17b2e29d1742ff196a96058257e4981229606cf4a88a9c1dac5c5315875f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:2785-2793 | apple/VcadApp/Sources/VcadApp/Editor.swift:4725-4733 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2785-2793 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4725-4733 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2785\u0060 it does not close everything it opens, so those exact 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f335af1f0893063dabdbc8b0873328cbb8ae109384b291b2a98b02163df86fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/ModelBrowser.swift:279-286 | apple/VcadApp/Sources/VcadApp/Shell.swift:624-632 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:624-632 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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 \u0060apple/VcadApp/Sources/VcadApp/ModelBrowser.swift: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/ModelBrowser.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce5aa0457c343c1ac1b6857604ac991fb3d839aa8d466efe9314fe119660b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2676-2686 | apple/VcadApp/Sources/VcadApp/VisionShell.swift:101-111 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:101-111 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift\u0060 and \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 91 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 \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2676\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, \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift:98\u0060 calls \u0060Text\u0060, \u0060font\u0060, \u0060foregroundStyle\u0060 and \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2675\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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2676}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa1301013d25958695deb2f1e478911370d5c79633295a1197bceb58591d94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:518-556 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:518-556 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01777b1aefbc0c8e2fe8fe251223c8810d9231f761d2c0e61436fef7667bf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 6): apple/VcadApp/Sources/VcadApp/Document.swift:567-575 | apple/VcadApp/Sources/VcadApp/Document.swift:586-588 | apple/VcadApp/Sources/VcadApp/Document.swift:596-598 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:567-575 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:586-588 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:596-598 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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 \u0060apple/VcadApp/Sources/VcadApp/Document.swift:567\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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0c7499b2b9bc657c1b7121e392be091c8a77791f2efcf4697f08ada00da0d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1973-1997 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1973-1997 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"37719bc1724d8876cc7da072160d22ef783aadba55f809ca8784ba54a84b461c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2645-2658 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2645-2658 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ce7fad09252c5937576779b9f39b94f7bb210c958fc7ef03a097ab8a220d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3120-3136 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3120-3136 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3120}}}],"partialFingerprints":{"codehealthFindingId/v1":"44027ced58cf26662e08d540f522d25b025b648a6c083b20c03d3febc8125dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3736-3744 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3736-3744 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3736}}}],"partialFingerprints":{"codehealthFindingId/v1":"7522cf65b40e97a37a35ee1fa5d83db15b54c9560ec2920044f9b98a722dd883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4144-4154 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4144-4154 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6308244e19b12c88552679696025cb4caa9edf593942816b2125849da71051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4159-4174 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4159-4174 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce6680fdb25ad09f77d697e793f3377b3269f17f176a35ba16f0a449d3cf62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4248-4256 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4248-4256 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad46beb480d7f072cbcc9b24e4663d52597583957367294b951729d24e770e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:467-475 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:467-475 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57c07f23fc5e2a1fc1c533e1cb17cda0f2c5d9c55244da26925801a7f784c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:479-488 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:479-488 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"715ac622e759ac819bdd6c23c40dfe4d2c196d1c435c06cf63cdc59695691422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1083-1093 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1083-1093 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"824a9587eff9a4629aef1ecb99aa535f97bfe2a0b953ed70e3340e5a9d6f45f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:98-106 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:98-106 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc6f72b512f59cb2a618e975de310b5b47e2c7c52fffa6a4e5afe6c1780fbf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Kernel.swift:251-257 | apple/VcadApp/Sources/VcadApp/Kernel.swift:305-312 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:251-257 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:305-312 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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 \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift:305\u0060 it does not close everything it opens, so those exact 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb9e688c4b33a14dcb1d4e6adee17db40bf053beefd938c83b6a7f632fdbeb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:114-128 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:114-128 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7574b66516cc0eead8105ac7f3f2b7a96c47472a90ff57e01be2e6dd000c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1221-1236 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1221-1236 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e55ef0591a2552d6c8b5f9fe33ddb95ab65783c3f48d06961c3a45fd0aaa6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1530-1566 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1530-1566 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfa0d507b4a835f79fdd06c3c28cfbfa045a4f88e60b6f3d57cbb9cbcd0de33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2042-2051 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2042-2051 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"431a9f3d62f7bb3bd0662c44f36a23509f219be7712b3c5a3ad705bb2974912d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2671-2686 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2671-2686 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d5e8db5f2e7cd4323aa83a5eaa1a7456b0bc292f6045bf4ff6185b8efed52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3725-3732 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3725-3732 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac5ecb8bb8ee3f60f0a057b7813faa55f5b5855acd7967c5cd989abb53c8279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4060-4067 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4060-4067 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf4baaffad8ab52e2ba9ca391258c7e2a1b492f322c4d8ac449196dc80eedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4258-4265 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4258-4265 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf2450db9f21375efa1130077e360761ca95e66e7634d8b148fb504c2479286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:277-284 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:277-284 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b55a72bd566402236023d0bbc16ecd3af41502e0806fcfdbed22c343b768f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:35-42 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:35-42 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61c6a26c892e76f9bce3bc321b21944f28ad3a86c7e869d3752e0f7d2be948b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:375-386 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:375-386 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c882a43ddc3ae50eedf4c7cb933ca88840937fef8fba767e6721bcda8a761336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Document.swift:505-511 | apple/VcadApp/Sources/VcadApp/Document.swift:535-541 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:505-511 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:535-541 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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 \u0060apple/VcadApp/Sources/VcadApp/Document.swift:505\u0060 it begins part-way through the construct above it, so those exact 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca747920c006e3e86e32d21b34b1b742a14bbb1ae172af88dd3bb7bac3c39a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:320-327 | apple/VcadApp/Sources/VcadApp/Document.swift:842-849 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:842-849 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"18165ef6632d8334218390dec452a5937c93da88287f5b236e1a5d214709b920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:106-112 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:106-112 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf737c0bb960a2cfc8077f2273e93d824a09312662d7368cf7ab60923320d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:310-327 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:310-327 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b272ea56c472877921de816c0d09211f8489511879b93849b66c19a3816d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:399-411 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:399-411 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e7dba23742ee6e627cdbabe2d64b69c8a2ba6606899d6ae9fecd85ddcc91e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:486-497 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:486-497 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdafb79f032729ec9e2d9c75f3fd4498f84033893241c9fb68fa3817324e5220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:674-701 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:674-701 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad63a91bae2f2aceadae761f2978ac72080a20db9f3a9987ba86f363bcece90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:784-802 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:784-802 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c33b03943a3769c03948f9dbfc0ef3c92625be0bd3f06e0acee665f1ea43554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:874-881 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:874-881 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c651edcc20df54768be03bec7474bfdec6c714b07cfa7b876385f4700b39947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:887-894 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:887-894 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c742a1dfb8980705fb8668deebd19c4c9d2f7cf1e7004b6d51c4446f220f2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:896-905 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:896-905 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e277297de294e01957765918af8b5450e18b5745306064e6c20cb49bcd84b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1189-1196 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1189-1196 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aba1abe410c53d83a8ad7855809182f97e357e6333d464364e2923b69127db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1717-1730 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1717-1730 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cbcf1487f9987e62e738243dc2d8fdf84db36d853e102b18d91375f09889b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1760-1772 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1760-1772 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e483723f5e85d9d4c0ca9272ad7fb90955151e84522defcf1d7c801b407af66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2428-2434 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2428-2434 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"064032ad4a466b2986d940bb422f499ee73d03166c22a35e0ba818f9fd39610a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2729-2737 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2729-2737 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db148d02ea71247ec3ffd6b01775343fc6a5144a114d1c4ae0ba01279fd6c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:855-857 | apple/VcadApp/Sources/VcadApp/Editor.swift:2925-2931 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:855-857 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2925-2931 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2925\u0060 it does not close everything it opens, so those exact 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, \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2931\u0060 calls \u0060serialize\u0060 and \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:857\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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14be5340acdfacace184a75633760acef85add90efe797a2af84c998288b235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2987-3002 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2987-3002 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2987}}}],"partialFingerprints":{"codehealthFindingId/v1":"0401196a328329472cfd58f5d255d03c37ab9a151cc1e16b35358ee158504b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3059-3065 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3059-3065 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2670eab349ed90692e846e2c1aa7fe125e22e66ed4b6c5b58b87b22f54b9f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3793-3803 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3793-3803 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3793}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d0d229df8db0c4c29aee13c9e1b6a0ce7938397597c0afa8acd6102a031527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3830-3841 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3830-3841 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3830}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b28487d950184daf8b67ab2ad7a2a73d23fff2fd38d66a9d369f24795bbe1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4429-4435 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4429-4435 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4429}}}],"partialFingerprints":{"codehealthFindingId/v1":"df623827bd2e83703c3e41d0ece3fe49ab358d6c49d382294f49a1c3f34c19d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:110-116 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:110-116 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6fde9618c10e3f50d54e3de02bad8884c9d42ebcea099e0d88ff2bd5dbd82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:221-227 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:221-227 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bcbfecd202e94ae8c7241fef7a9598eb03aca2d671d52401fe80001794bd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:266-299 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:266-299 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f37a3064b2cfc6ba6dd2b697b1c080f629d7217b46b5d090c9b9a4feccd9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Shell.swift:814-820 | apple/VcadApp/Sources/VcadApp/Shell.swift:835-836 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:814-820 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:835-836 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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 \u0060apple/VcadApp/Sources/VcadApp/Shell.swift:814\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ab8f71328a58ba1e0147fea1a1f7780e8b47f89e664c803e04c7bc8166c3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1052-1058 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1052-1058 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e004e753d88e0b4e22bcffb45870efd0d40295ed701e168f9de6e64e451004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2687-2689 | apple/VcadApp/Sources/VcadApp/VisionShell.swift:114-120 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:114-120 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift\u0060 and \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 91 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 \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2687\u0060 it does not close everything it opens, so those exact 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, \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift:113\u0060 calls \u0060Circle\u0060, \u0060fill\u0060, \u0060Color\u0060 and \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift:2687\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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d76e26d825c93e5de8ce2dca87a6a96e41e42f26e7eb3e5d87adc92ee6b36fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:741-749 | apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:801-809 \u2014 both copies are in the same file, so extract the block 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, \u0060apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:800\u0060 calls \u0060String\u0060, \u0060Date\u0060, \u0060timeIntervalSince\u0060 and \u0060apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:740\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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddcf7aec3895ea1dda33bfd8598be0972ade5c855394d85b4b5573a17da3398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:829-839 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:829-839 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c08947ea18dbb962f768ddbabdb2a646306410b3f33ddee4b4763cbb508c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/DocumentEngine.swift:424-429 | apple/VcadApp/Sources/VcadApp/DocumentEngine.swift:443-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":"apple/VcadApp/Sources/VcadApp/DocumentEngine.swift"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3812a4bdbbafcf7dbcf450a63492f38882cc71abe156ddbef71d7cf2171accc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1570-1581 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1570-1581 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d4bf58a89aa365cd58d40fb51404f73d879c12722d358e0154e7aa33996e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1735-1743 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1735-1743 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de5345d5779a08f58897f865b95230e5e1785c3752ab6cb446fa5eb8033f78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1956-1968 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1956-1968 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e4db747a362875668a0d428a4ec28663dd0423c57dac478436df51b767d1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2146-2152 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2146-2152 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c3797ab06dfe8ba63d6957778d9edb36d9266fa1a0d369a9b7dba7acd76935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2289-2303 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2289-2303 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64229908224f4673ec71294b5c1947e0fbd15515eed08eae30d41b3d887f2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2758-2765 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2758-2765 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce52cf465eeffb0fc38bbee7de690842411208450bbb4e1145cb354c0dfc3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3842-3848 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3842-3848 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3842}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd42ba5dca7dc9dae756144415224c94c56eb5fff1bbae16eac4db8732664999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/FeatureOps.swift:141-146 | apple/VcadApp/Sources/VcadApp/FeatureOps.swift:147-152 \u2014 both copies are in the same file, so extract the block 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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf52edac19dda1a1c19a0eb339de9e9a435632bbe826c1c2f790a4236e93b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:94-107 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:94-107 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7908927fbddbffb95db305e87b0f21bba58a1a577692c423527418b7ecffe82f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Kernel.swift:63-68 | apple/VcadApp/Sources/VcadApp/Kernel.swift:116-117 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:63-68 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:116-117 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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 \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift: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. 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f87238e72fc0d9e430cc060a35c446f86d3ceaa5adfb93523542eb5fcb33ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Kernel.swift:443-454 | apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift:443-454 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Kernel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddefcaaeedb9bd050878a5100cecef06af29815595fe38fa76a87e6027c21ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:60-71 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:60-71 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d618d30d65c1cf0419709e6d99e0bdcaae3c87cc7657bee4ebb705e0e0d4751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:87-103 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:87-103 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19a57dd0e37bc7889fdde0bcc827aba9a3023e9b61374ae331128c034a13ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:105-135 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:105-135 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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 \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"43abfe6deb2ad536267391a5a9ae2ac810befb2ffc2370a3aba589cbe507b2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SoundPanel.swift:636-641 | apple/VcadApp/Sources/VcadApp/TunePanel.swift:287-292 \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 \u0060apple/VcadApp/Sources/VcadApp/SoundPanel.swift:636\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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e1713a2ef02a8eed214b3d4af0209f5dcbd2b7580aecc16fbcbcb9c5095f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Document.swift:534-538 | apple/VcadApp/Sources/VcadApp/Document.swift:548-552 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:534-538 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:548-552 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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 \u0060apple/VcadApp/Sources/VcadApp/Document.swift:534\u0060 it begins part-way through the construct above it, so those exact 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"7371cbacda7701127d884b649dd2e1822e11476157ebf356b48d38144a83d434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:88-92 | apple/VcadApp/Sources/VcadApp/SceneAssets.swift:106-110 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:88-92 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:106-110 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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. 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"073b0f498201b5092c13698a0f9dd4b97097ca5988bea3ec5e829364cadf1bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/GizmoView.swift:51-55 | apple/VcadApp/Sources/VcadApp/SceneAssets.swift:51-55 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:51-55 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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 \u0060apple/VcadApp/Sources/VcadApp/GizmoView.swift:51\u0060 it begins part-way through the construct above it, so those exact 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060widthPx\u0060 to \u0060Float\u0060 in one and \u0060Float = 1.5\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":"apple/VcadApp/Sources/VcadApp/GizmoView.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"78360f2aa00dc150986ba20617861da764896530cc7e9a337433a3c5c1c2ced1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:347-355 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:347-355 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26257ed5ba8445b3f1d99f5dce280e7b2a3ca36d98838a19dd7646d699b077a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:359-365 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:359-365 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd39dd9dbe7838314d3079e4883494d5c4ac97f8cf215421c1757d521868998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:657-663 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:657-663 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"55277b3977dbc13af4c1b5e7977988f1ff52c328a152d58395461271f93f3b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:807-826 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:807-826 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca7526f9b361c715e06626952d933c8c00e811943927f6db8ba294771bf6f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/DirectManipulation.swift:296-298 | apple/VcadApp/Sources/VcadApp/Document.swift:853-857 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:853-857 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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 \u0060apple/VcadApp/Sources/VcadApp/DirectManipulation.swift: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. 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":"apple/VcadApp/Sources/VcadApp/DirectManipulation.swift"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff57abd90f6e0b006e4f9feea08ab34e5741257c1558c06a1f0139c6516675c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:859-865 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:859-865 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50356b4d24d896d36a761b2de6a11edad8fd4557a6ea60b8bab64ec0818c4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:859-863 | apple/VcadApp/Sources/VcadApp/Editor.swift:2932-2934 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:859-863 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2932-2934 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:859\u0060 it begins part-way through the construct above it, so those exact 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:858\u0060 calls \u0060generated\u0060, \u0060Data\u0060 and \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:2932\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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb71310cdbd7d7887b490ad86430e104592e513986c814c9c39be4edbc6967d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:858-871 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:858-871 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:858\u0060 it begins part-way through the construct above it, so those exact 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d942c9a705f0d700fe0e895affea1d89866f4af034db0bd27c15806dc030e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1357-1374 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1357-1374 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2bb322d5e9bd689aa50919d90c031cd95e3c62ea414a849d3b1f80b74bde86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1622-1639 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1622-1639 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8c3a1ab646b143191d765062c6f79d85248444ed25bd818393ff35b84ab798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1643-1655 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1643-1655 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86cd658b998a68e78dd91db022d2a4a0f64d1b4e18aab427f4800240d2d6b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1679-1684 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1679-1684 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6d35f05e95d82b8c5516922270171846cf553052dae9bb733c0fdc95bb0d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1784-1792 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1784-1792 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aea535579836f6575160627f1197ad639bf87fb35aa0c501615e471c408af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2465-2470 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2465-2470 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87c0f734fc7fb75775f9143e4ef2097afa953e3eaa281c0ddafba138f8d9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2590-2601 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2590-2601 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59e82cf9c2d818dd7d011b78a5e172f3f4af128cd8d5543dc0758c6a2b9f963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2618-2626 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2618-2626 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6528edf48fa94d28e1127c6c035c52cc9b3e55230546dfcc02131a9e9013c438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2627-2633 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2627-2633 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb28924e00f09a109ce3725947ad3cda92b00ee80a4af55c5264a27e3d0cc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4119-4128 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4119-4128 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f74c90d0ab8d625564f1730d90e37fcbf56f5090e5e1415f24bd55a5be5c082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:454-460 | apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:629-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. 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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d999822528a00de236ef76a124102a804c76523318b95ad031c55a7b5f7f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:291-299 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:291-299 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e08c0a008e17536d05a24ac1344da8fdb3fbfc543e43fce6db06ce1a5c40b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:80-85 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:80-85 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cc0cef745ee6e166ad503c0e910bfb0667c3140d3fa43a1e73e40364402db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SceneAssets.swift:305-315 | apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift:305-315 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SceneAssets.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SceneAssets.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 266 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":"apple/VcadApp/Sources/VcadApp/SceneAssets.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf12616f7f91d1a793d63247c1c8d802be304072133423a18cae08ce90542e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20135 lines \u00D7 3): apple/VcadApp/Sources/VcadApp/GlassChrome.swift:486-486 | apple/VcadApp/Sources/VcadApp/Shell.swift:245-249 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:245-249 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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 \u0060apple/VcadApp/Sources/VcadApp/Shell.swift: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. 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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a78435e7866f73e93510cbd56b38a5ced3675d352b42cc6a0428fd9c87835b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:917-924 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:917-924 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a135da926c67875cbc72c042359f45c156044dd3eff689ab613b77f8407119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:350-361 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:350-361 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d4494e1d9375f4209e4a91cf034efa66f22a45ab1aaebc12783a1dc136ac5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SketchSession.swift:1409-1416 | apple/VcadApp/Sources/VcadApp/SketchSession.swift:1473-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apple/VcadApp/Sources/VcadApp/SketchSession.swift:1409\u0060 it does not close everything it opens, so those exact 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, \u0060apple/VcadApp/Sources/VcadApp/SketchSession.swift:1417\u0060 calls \u0060simd_distance\u0060 and \u0060apple/VcadApp/Sources/VcadApp/SketchSession.swift:1481\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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7865c2208a9dc17b39e6337f934a06eda5517c3f2a31d0c083b3586c02ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SoundPanel.swift:421-428 | apple/VcadApp/Sources/VcadApp/SoundPanel.swift:449-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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2788320042bf3a9572aa24699040ec99a2c28bfe08f90e8fd7adda5051a6bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:71-76 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:71-76 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"90910b48f2948d055526eee73cb1b569ba8f84ef59213c3c478b63a377c0069f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentClient.swift:10-23 | apple/VcadVision/Sources/VcadVision/Shared/IntentClient.swift:10-23 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentClient.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentClient.swift\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apple/VcadApp/Sources/VcadApp/IntentClient.swift:10\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":"apple/VcadApp/Sources/VcadApp/IntentClient.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a448087d9a59759d70533a31a56a58e4178790db3ff65fb756968e15fcbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Materials.swift:18-34 | apple/VcadVision/Sources/VcadVision/Shared/Materials.swift:18-34 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Materials.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Materials.swift\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":"apple/VcadApp/Sources/VcadApp/Materials.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa5b2174886e0c1c113fc68f20af2879a7144e1e53ca956a663a485b331a838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:35-41 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:35-41 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1124f054868e102e99fa0f2116e2ddf321afe505c7e831e7490799232f53760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:42-49 | apple/VcadApp/Sources/VcadApp/Editor.swift:50-57 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:42-49 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:50-57 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c7fa1b9c9030a642e57c30f295dfd8a2528da052f6a5db79e0fe30d58e2a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:60-67 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:60-67 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d1285b7506665dd748ff65085a3085ca32b157182da3efdf65a2e0b77f38f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:73-79 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:73-79 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ac0af99140b8ba3bdfd7524b423efe09271badc3cffd54f99407bf28166c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:80-86 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:80-86 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ba3b02ac18f7e8af7848bc104acc41994bec1c6ff645fb7df6dea04fce5f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:126-133 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:126-133 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca7b3b647db3ada4c5d44f2d6344025a11b6f408e2f35fad10336e7942da951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:134-141 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:134-141 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ad8cab453d13a62df905fc76c156657a44cced0421932fd8ab7118674c0318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:171-177 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:171-177 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac350eeaf510d16cdf564f24849b3672398f32d6b513c09ed31e19cf8f3d7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:187-193 | apple/VcadApp/Sources/VcadApp/Editor.swift:196-202 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:187-193 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:196-202 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dcb8cb687bddcbad6f410495d5ec1964bb37be18c937cbb033e149ebe901e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): apple/VcadApp/Sources/VcadApp/Editor.swift:209-215 | apple/VcadApp/Sources/VcadApp/Editor.swift:217-223 | apple/VcadApp/Sources/VcadApp/Editor.swift:224-230 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:209-215 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:217-223 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:224-230 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdc760952f9614b16fe8d99325dfc23ab275aaf71441d3b09620c662596e1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:373-378 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:373-378 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa5df7135352bbc3c2e538f9e54304310bab41b350f4d79db107fc7014500d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:435-441 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:435-441 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f263ba8636a04f5a092d1b3476cc3b0ffe2ca099b389a27f645d7d10de23d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:675-682 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:675-682 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"782f20892bf18861d9e7753e380364acb61ba617acd02546956c3cca449189b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:771-775 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:771-775 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c8759e2939642ad18af7f34cfda1f3543dad2f8d59c5490da2722899aaedf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:807-819 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:807-819 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f45c8766eeef2fb10d39e3b9c3e7c1ab5ea3389838edc37b0bd79821369cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:990-996 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:990-996 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbdd6e0f9ba86fb9f80be0d5eb50df2cd197b5fa552a103c9fec46bb4d87c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1011-1015 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1011-1015 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"530c06d0b6f1a6f0033c38368a1fbfe78b0efd684541ce327ba263168ebc4922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1032-1038 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1032-1038 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"624703e0c9d5a0ec52fa8d29418ab03baa004855c3074bbe5ae97bffea9105a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1073-1077 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1073-1077 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b59af145b89b951946541209625e8cb3e9c8e53e0cb54b8877ec0f2635a0f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1103-1109 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1103-1109 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6299b2e5440c9643b4289ba50f05fc1855f1303124f262bfa10c776011e9cdee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1132-1136 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1132-1136 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"980322657831b689c321e95bbcf2103aac57c0c7bc7d8a6404a4363412ab2237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1139-1143 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1139-1143 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f413445f20302c2e9990c5b196bd5289687e3348582287c9be2240c5adc365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1159-1165 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1159-1165 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbb3e8140d3c594fc6f2567cf9c06027e632d1eca080f9a7a4171cb0d89a634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1177-1182 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1177-1182 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"141bb4b311c71ccc4caa137c922604a703ef9e83319c5a675b994c6bc0ced549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1330-1334 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1330-1334 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"238be4d4267105da7a764c2b8b46ce6b0947879e290041caf3705d30c09f4ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1457-1467 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1457-1467 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbc17bfedbc7d3529ba882e9b76230f4c8846354fdc5eb6616656303da73544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1615-1619 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1615-1619 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04a78024e68242b71a4c9cca4f7f96674f1389d2d53dab5d2431b7fc28b0078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1697-1701 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1697-1701 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f03d4aa3ec795fd6ecb82db05337c12509a081baaa80e0874c9a839e843aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1705-1714 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1705-1714 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a0c1ca36a09f94c3eb8703c754726ce243eedff2a80f0e865aa21f0b2d1526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1842-1846 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1842-1846 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0ffdf1e84cf68396ddc2238e140fd373e3bcc9ed6214fddb5c25759de88e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1919-1928 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1919-1928 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"920b3be34701250176a47e5ff646932d009210a1d618d2452ee5885af10111f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2021-2031 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2021-2031 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"183812e60d225fcfd57cec0893d619e864228e89d8e3868f406846d27bb94031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2033-2040 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2033-2040 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bad2110b94eb92c7a5d4e643c6d606dc945e6baf6c276cfe0416a16f6b33654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2052-2059 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2052-2059 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d05014cced4fc3b5ebd8270e932a320f2d17bda601984009a260a72b1f2dd18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2074-2080 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2074-2080 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f041b391cad7cc11e3bf63a889929be663ee4928849193d1caebe1921f234f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2329-2333 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2329-2333 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acb0a1f582bb9c1a8ca5364ebc206aba2df7e473f194b32fc378e01b81c2981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2435-2446 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2435-2446 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e9fef944fc3c90d2a8e68082ae73d89d58ab6d21ab5fe3545cd1a5aef5d4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2572-2577 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2572-2577 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"057dece066a11cca4acafd6983330732dce6c9d884668f05c9b6bf34a930698a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2865-2869 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2865-2869 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac05646cb059819297077926633ba8e40dfd59a73c0799f94b8c649e461fddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3043-3048 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3043-3048 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"caae036e8cb2c5c1b72601e55a27f7e8b14426098fa1a8d7f422fee46b717e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3074-3080 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3074-3080 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"41437a4a921101ddff52399c77756ce2329c0d4be676be6e1aa46a9ccc71bf5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3235-3239 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3235-3239 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f436a11c3e39cee1af29b02baacbcd3ad616f92770b3545fb5ec9eb48c9b55ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3243-3261 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3243-3261 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2df391757b1c9b894cd068cb7fd0c627d7336af9bffb8de2a629a394b5c68b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3487-3493 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3487-3493 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"67545c1948b03ee97398e260a28f8a3c54b778eec765940e7837f37523637749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3685-3692 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3685-3692 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce6fc0e84f2f879e9de09977b82b7cb53839ed4d29078cf7f98964549c45143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3822-3826 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3822-3826 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3822}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65e99eb868b6fbe23d8682e8622c75ee36f8270a495dc23e18642d051cfa89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3990-3997 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3990-3997 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3990}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b95d9c0e75f7d34707c5ae4c27caddc09448fecf6c3f39512340298036bab3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4000-4004 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4000-4004 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4000}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7e71ca1b7b81a26f6c8a99960ff803947add1402315d65743a2775f3e521ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4413-4418 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4413-4418 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d207592dce8edc082422b8da099ad077754b4e0f45802853198efc9cd67806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:38-44 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:38-44 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3819f01ae9bb482bfd4f4653281153772da4046a72a26764f5fd11ae23ed41f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/IntentBar.swift:269-274 | apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift:269-274 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/IntentBar.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 142 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1f15c59d1f8e3e10c24ee433c80165db51dd53aae4a1539f767eb52fdd36b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:431-436 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:431-436 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e2ce2d88b7b2fa53ba5551a5bac31277eda32c10322d59d840ef1fe29f1028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:438-442 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:438-442 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb551e577cfd5fc74878023aac5284caa5ab8e6a26008ef174dc6586cd8b8bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:444-448 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:444-448 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2f675fe75309b9b081afe0e7b9c156a2d5510ce5c0d3161d0aa0cceedfde57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:493-498 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:493-498 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c6b696edf65ed1f09b7016d5cfa9efeff0960003d9c37f475375fb1c91beb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:585-589 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:585-589 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cc49812b529990ca30f896e5ddc0e6143f36f65d70692751b743ce6f7d3ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:597-601 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:597-601 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"b745da58290940a1f1b60279c87e987d9f61de852012b85734aac3c5877a7fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1066-1073 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1066-1073 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"e893b3346cd441d5e54d0c9788882d0865332c5dadb0ba9985bbcbdaabff2182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1075-1079 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1075-1079 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a60c7aae582a2452cf61d8651933fcd558e3e769e96c1152d9d52891b996562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1110-1115 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1110-1115 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b504c8c6efc194f8323a55a1a136160a61e9a989e7f024ae21f12b56a2bb874"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1229-1235 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1229-1235 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09a3a799117d3862e5759eec8b3f11ad618ea43b141e04b6be01910a989bc0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:46-50 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:46-50 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed14b19bc836ec97ab8b114a7a6355aa75aaee1dfb8376891f799265ff7f9a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:332-338 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:332-338 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"291843014039677feb2ef677f49620bea0fb9a8fa339f7ef0bb836889aa33ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:464-470 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:464-470 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"594dbe111e2205468b7fea5f06e460b79f05dfd97b360bc26a194802c69ea4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:491-497 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:491-497 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f3810f259764e6192004ac8241064369d0a94356afb9218b0c85c7e29c44eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:501-505 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:501-505 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b68b55c53f3229fc4ff1fd5558ce4705fe636e505a5838b9582dc73a6e16fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:509-514 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:509-514 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efa7c3f45f61df223a333dd591645a52c48e3fca44acd1f17f6ba924e018709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:517-521 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:517-521 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"735e89611246c055b1d11460d43911282ab58e52268a9162a5b0d7fdb9a9cc3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:525-530 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:525-530 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a66eeea096df96e045ad2c83aafec1bd134f4c08bf378ef324d8d9c10436cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Sim.swift:608-613 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:608-613 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Sim.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Sim.swift\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 321 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d176c8733ca3b46fc74e54d90dc9e8acfcba3ef233303541e37cfa8109075f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:70-78 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:70-78 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b0c14b5c57c665544d54cc1e018f7bea7ca6557cc2f58dc24caab94ad09ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:409-425 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:409-425 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"901fa4b16ab609b8bab8616c0660b217a972ecaa652a2db848917ae01b75ad45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimController.swift:522-530 | apple/VcadVision/Sources/VcadVision/Shared/SimController.swift:522-530 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimController.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimController.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 291 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":"apple/VcadApp/Sources/VcadApp/SimController.swift"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb361a3be4ce7d9a853728288aed6d4892c63cd3a4c7b8a369557963135714a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:116-135 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:116-135 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0962791670d526ce171f8f42fb7fda7725a3e592d37b7dcec53ef5a3f2c7ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SimPanel.swift:341-347 | apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift:341-347 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/SimPanel.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/SimPanel.swift\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 317 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":"apple/VcadApp/Sources/VcadApp/SimPanel.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b85efadba506c9151a7674532d7d8d23a5289837ab106b8591dac21cd6c98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:136-142 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:136-142 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e124b1c55bc5455ba3ffa8363681e0b43b6935e7d58b95909b3ff14f5babc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:236-240 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:236-240 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9c6b3f858d1d8803b9af7c1e6fcb73d9811602636f3aa6b12e25e0fda4ad2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Theme.swift:241-245 | apple/VcadVision/Sources/VcadVision/Shared/Theme.swift:241-245 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Theme.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Theme.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 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":"apple/VcadApp/Sources/VcadApp/Theme.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a8d79c2b5d11b970fce09aa3b501dfc75d90816ed2bcddac65708060d2986b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/UsdzExport.swift:160-164 | apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift:160-164 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/UsdzExport.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/UsdzExport.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 120 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":"apple/VcadApp/Sources/VcadApp/UsdzExport.swift"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fed3eb132e3711c714af1a7d3d1289435f7db805d78044f774552c2181690e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/VisionShell.swift:87-92 | apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift:87-92 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/VisionShell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/VisionShell.swift\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 201 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":"apple/VcadApp/Sources/VcadApp/VisionShell.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"303ac1764f52fbef36939d40f8481301b7b49a1a78ea1dbe6e913e8d81fe547f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:385-394 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:385-394 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91ffb077c3afcdd9233b74d144136328598ba86769cb58ca67396f32753231c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Document.swift:774-779 | apple/VcadVision/Sources/VcadVision/Shared/Document.swift:774-779 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Document.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Document.swift\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 581 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 \u0060apple/VcadApp/Sources/VcadApp/Document.swift:774\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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd153ff69ebcd826804b27e0422934f656b681f9d31d19e5fe044558207bc3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2061-2072 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2061-2072 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed5ee3cad60090dfc2d8654ce2b92ab79299af4d75d55b193d37911940cd507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1865-1874 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1865-1874 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de43d9455e8bbd2a14866297e3cd2d01cd79015978eb1d81276acad92e3eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:839-847 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:839-847 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e32411e6efe33f619cabd94a4cbf28c4cd845c5818e14c7bee7ac02345fb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1094-1101 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1094-1101 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcf750c6593a934ab484f7f473f850dfcde2bd2bc9f9c0bc6f453f614015754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1518-1525 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1518-1525 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"97676aca09f6b578ffe5123bf918551ceeb9dd89a3cc8a5754da8ae307c052dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1083-1089 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1083-1089 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae8621adc4ca05e85ddaea9890551afd9520d73cf4a11cd7173c80294ee47e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1418-1423 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1418-1423 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"775e03e2da3e6fc96cbbd5ddec9ae37ad0762b88185612bd7673b55bbc7212ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1660-1665 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1660-1665 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6ffe18f7e280079cb56be206ef9cee42e925969aa0e7e3e9c4ce639044c5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1746-1751 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1746-1751 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2153a577cae5a0c624731d796e0333ea24941ad06db1be9da6b624dbb5ab759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1775-1780 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1775-1780 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6afef6ffd8566da9f26496ede6425b0ceb2276d5a9f5a4e144fcc7b63fca6f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2083-2088 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2083-2088 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95b0ac34a62607fe04f9d905855eca4f07591f407a8643d3a94a2c2ac308e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2474-2479 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2474-2479 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18b0cd8906c9ac821521003585f6d651beeab031354129e2a3c5e5cdb9c986f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1206-1210 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1206-1210 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:1206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7900951d474112465266c4053fed1245cf474a5cf1c808b3ea9208c89f43dc42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:1948-1952 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:1948-1952 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41f2dc7a03ff7a6115c432871c3c3e8d2595c14c4474bda33b44c91b78090b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2112-2116 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2112-2116 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e12bf15ea65fed4ea6e7b3163e38bb01bdf3c19973adb78a933d8a41270f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2309-2313 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2309-2313 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d31dfbe303d6a7547370a8f4ebe1dd3eb7c85c69a9c2c1aea844e34abdf0830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2335-2339 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2335-2339 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a21ae3e28aece7362839ae8ff1da23b4c865808dc72007bd8ab13070cda1dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2603-2607 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2603-2607 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9816b991aeaf412fd27527600a245338e3a5d75de85fada49c63201b79ecaf87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2608-2612 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2608-2612 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6a35c84702800a8917e445505fb1c0f127bdb66bfe8654e25b29705f7554b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:2613-2617 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:2613-2617 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd0b494010b0183c7e90650092e67af97456f285b41c29f5cf1bd2edbc5f64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:3005-3009 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:3005-3009 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c0de606c4d90c0a41e5f488d5dc6124105113bb93bf913c3fdcf1e80d7bc6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Editor.swift:4546-4550 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:4546-4550 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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 \u0060apple/VcadApp/Sources/VcadApp/Editor.swift:4546\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef778c61fa3d1292bc6d3e418b61b505b29a2065d9bcbdda4c53867489802067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): apple/VcadApp/Sources/VcadApp/Editor.swift:798-803 | apple/VcadApp/Sources/VcadApp/Sim.swift:60-65 | apple/VcadVision/Sources/VcadVision/Shared/Editor.swift:798-803 | apple/VcadVision/Sources/VcadVision/Shared/Sim.swift:60-65 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Editor.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Editor.swift\u0060 as WHOLE FILES: this scan already matched 188 separate duplicated blocks between them, totalling at least 2896 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb858f87fc4b843298158a04852a5930588f848f531e6245e3938d3a0b607a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift:245-249 | apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift:119-123 \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 \u0060apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift:245\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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e472fa675ada790da80d613c351ed32e7a5c07313702c88e2ca8bbd7ec8e1396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift:377-381 | apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift:386-390 \u2014 both copies are in the same file, so extract the block 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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"622609039a08e54e17d2c55f818dcb98791f6d87164583d9f0c334c036b86800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/GlassChrome.swift:947-952 | apple/VcadApp/Sources/VcadApp/GlassChrome.swift:987-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 \u0060apple/VcadApp/Sources/VcadApp/GlassChrome.swift:947\u0060 it begins part-way through the construct above it, so those exact 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 \u0060spacing\u0060 to \u00603\u0060 in one and \u00604\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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"b572449b569a7a63c5d67590465614ca4f210efbe6ff42a01bc5f5b67eacfe9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/PathTracer.swift:460-464 | apple/VcadApp/Sources/VcadApp/PoseStudio.swift:342-346 \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":"apple/VcadApp/Sources/VcadApp/PathTracer.swift"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"06466f3382359eaaa0f3c8b9de8c78c0c201e2db04e2ae8b699e88826f794084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:886-893 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:886-893 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"230b5f007dff31673d0d0e9317da9fae2fa2949e99c7abf024765b6a2928d7ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:1218-1223 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:1218-1223 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc458637c1084c39c1c0c42bfee8753a9610e5c310bfe4a67801601ea741b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/Shell.swift:895-899 | apple/VcadVision/Sources/VcadVision/Shared/Shell.swift:895-899 \u2014 before extracting anything, compare \u0060apple/VcadApp/Sources/VcadApp/Shell.swift\u0060 and \u0060apple/VcadVision/Sources/VcadVision/Shared/Shell.swift\u0060 as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 974 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 \u0060apple/VcadApp/Sources/VcadApp/Shell.swift:895\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4156e29626c3473df68a768ca36867bc5f0b5187d03d5fcfa9ba561194f6eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apple/VcadApp/Sources/VcadApp/SoundPanel.swift:590-598 | apple/VcadApp/Sources/VcadApp/SoundPanel.swift:785-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apple/VcadApp/Sources/VcadApp/SoundPanel.swift:590\u0060 it begins part-way through the construct above it, so those exact 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":"apple/VcadApp/Sources/VcadApp/SoundPanel.swift"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"275409b24355f71b990a4a65e9006acf5ef1e0f4c0b8e30473a106499ca071bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/vcad-kernel-em/src/spec.rs:300-342 | crates/vcad-kernel-em/src/spec.rs:474-519 \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":"crates/vcad-kernel-em/src/spec.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a17c64dfc37ffcaac1b0645e0ec08ba4b18205e5ea01ae2e768b94acf5c9d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/vcad-kernel-fea/src/spec.rs:23-25 | crates/vcad-kernel-topopt/src/spec.rs:21-23 \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":"crates/vcad-kernel-fea/src/spec.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"55026bc41d3afbbdd88c7fd0145b35c6502b67e92a05cd7f5351392132eebe9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/vcad-kernel-em/src/spec.rs:357-369 | crates/vcad-kernel-em/src/spec.rs:545-556 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-em/src/spec.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3547f9f821365282ace369fcd8ca70df2934e02af68e0298547eeea95df174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/vcad-kernel-em/src/spec.rs:318-328 | crates/vcad-kernel-em/src/spec.rs:502-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/vcad-kernel-em/src/spec.rs:318\u0060 it begins part-way through the construct above it, so those exact 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 \u0060device\u0060 to \u0060\u0026AxisymMagnetostatics\u0060 in one and \u0060\u0026PlanarMagnetostatics\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, \u0060crates/vcad-kernel-em/src/spec.rs:499\u0060 calls \u0060into\u0060 and \u0060crates/vcad-kernel-em/src/spec.rs:315\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":"crates/vcad-kernel-em/src/spec.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b8b85827b47a9baa475798cd6e9c980cab3973d35f546aeeb6fe0d967b2950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/vcad-kernel-acoustics/src/spec.rs:40-48 | crates/vcad-kernel-em/src/spec.rs:52-60 | crates/vcad-kernel-particle/src/spec.rs:43-51 | crates/vcad-kernel-photonics/src/spec.rs:47-55 | crates/vcad-kernel-thermal/src/spec.rs:64-72 | crates/vcad-kernel-tolerance/src/spec.rs:61-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/spec.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8ccef268bc0f221a17bf7c9a909f171524d1dfe7fae9cff351c7a485a5d999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/vcad-kernel-antenna/src/spec.rs:69-75 | crates/vcad-kernel-thermal/src/spec.rs:352-358 \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":"crates/vcad-kernel-antenna/src/spec.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0501a4f93793246c10e4725e43c87de763fe5c704d9f5f3744570024339813b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vcad-kernel-neutronics/src/spec.rs:52-60 | crates/vcad-kernel-photon-dose/src/spec.rs:72-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/spec.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2419cde11fca1d9bad38c03ff851d13d24648750076f91f208b1f17bf698dabb"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project vcad-atoms: vcad-atoms has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1b461f836f876ff38f96aa9d93f3d9ae0205608b07d31babcc451b71ad0035dd"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project vcad-kernel-features: vcad-kernel-features has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3d3d4c97784e2cdbccf97c7098c8d0b0a76d83b8b5099d416333d4a4c5224e90"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project vcad-kernel-fillet: vcad-kernel-fillet has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cc3206417b2798aead9f0b30fcad11f8c70a1b8ae3ce78b5da8cb1a11970f857"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project vcad-kernel-shell: vcad-kernel-shell has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"780a35de4acfaca26fb872d1abadd3b3baefb7edc49b32568610c7ecde4761c6"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project vcad-mcp: vcad-mcp has instability 0.85 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"de028ed927df498680f8bd7410344947fbc08d5aea75124bfb4582aab2970d67"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @vcad/ir: @vcad/ir: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d161ee9291bb16fc777408241bb51562bfbbfc37c823ac5f193b36f87d20dbf8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: VcadUpdate: VcadUpdate: 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":"6b75eadcbf56c6d87cd205ff965a83da7deba2346cd4e1f635bbb3c749bca414"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-crdt: vcad-crdt: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"93254bb86505644cad0a3f217bfdf521e06ede771d1d7e7a44239426aa8525f9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-embroidery: vcad-embroidery: 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":"f02e52f7bc666aaed643b069298823bde0cc9199b7adc1c3a86bc843967fc8f6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-i18n: vcad-i18n: 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":"c567107a7809ea49663eec37eb8b74158f3beaaee6347aa63ed0221924a75ea8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-printcheck: vcad-printcheck: 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":"f19b0b2e4b3c0ce91232e5ec76fe4f60c8b4fa533536e8bea15054dd9121df07"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-receipt: vcad-receipt: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c07ba58811062e50d9911986ce528f4f878d05ef2461ab3b52bd72077d10dab5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-termview: vcad-termview: 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":"0a78d4a69eff20b34f5adc9a3596bf36b869b2d03d8dc7ce816302b7b47b21c1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-ir: vcad-ir: abstractness 0.01, instability 0.05, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 38 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aac91868648e7a048dba99943ba0aa8fb0313f9b533597df1f72503151d0cda9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-ecad-schematic: vcad-ecad-schematic: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3fe248180445e34fd30d416db7594c1d601cb7c69adefda2f1eb57545d95bccc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-parts: vcad-parts: 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":"7acf318d88028a6a4bc19f9e48b6cdc978692ae6bb586de9ea42a6bb221baa8f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vcad-slicer-gcode: vcad-slicer-gcode: abstractness 0.00, instability 0.29, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8a7bd8d2e91499d39eea2151967bcbce3a646944824926db7fdcbd5bcfcdacc5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DimensionStyle (LCOM4 5): DimensionStyle\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":"crates/vcad-kernel-drafting/src/dimension/style.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d4021c6356181daf509e0e72cd2625de33f641ea9e460a175bc84952c0833e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Su3 (LCOM4 4): Su3\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":"crates/vcad-kernel-qcd/src/su3.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c26e0ccb7ec7776b53b996d2a4d8e388cd0783baf421b8507bc307372befac2"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 mecheval/harness/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: preserves B-rep for exact mounting plate example structure: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/__tests__/evaluate.test.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c275c01f0d957f534a80d48bf8e37cdd5c555a0f993ccf14249ba1685024d8"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: detects clashes between overlapping instances: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/__tests__/evaluate.test.ts"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a8dc0fdc51f85302ff309c33951702e1672e745cb3c9e27e892c1e01a5f53"}},{"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":"69ff57731da30313d1d8395799aff0abc4d7e3039b691227a32e4a0519ea872b"},"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":"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":"666eaf7f78c2fa9ace7d1f74d3346f9688cb0a9cf87575ab27c4dfccc1d96331"},"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: apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift: apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in ReleasedOverlayView.viewport at line 997. 22 of those changes were fix/bug commits, and the other 50 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/ReleasedDesktop.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":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fc8996b1f19ea45bd7dfaeb1d6f1a3db46ae467039db36fa303c6cae9b3df7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-eval/src/evaluate.rs: crates/vcad-eval/src/evaluate.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in vcad_eval::evaluate::evaluate_op_timed at line 1120. 9 of those changes were fix/bug commits, and the other 33 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-eval/src/evaluate.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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc85fbc5d68c89fdef849a7d536b3eaddaab37a9607716a2ef9824d0455a851d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/ecad.ts: packages/mcp/src/tools/ecad.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 161 in ecad.routeNets at line 3811. 12 of those changes were fix/bug commits, and the other 13 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/ecad.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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a28c6d44a21f12054e7ff877a12a4c7ce06af1c3db5e6d798ab382748fedd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-cli/src/main.rs: crates/vcad-cli/src/main.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in vcad::route_file at line 1736. 10 of those changes were fix/bug commits, and the other 49 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-cli/src/main.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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d090e40f5cc2d1bba72910f56111701fdc498a24f3c214d992aac196c3bd57bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/auto.rs: crates/vcad-ecad-pcb/src/router/auto.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in vcad_ecad_pcb::router::auto::route_all_once at line 485. 3 of those changes were fix/bug commits, and the other 30 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/auto.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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc1caf2c46b2fbae8f7d79eea19c6329464af5b9724249a91cbf4ca49be1403"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/core/src/stores/document-store.ts: packages/core/src/stores/document-store.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 181 in document-store.useDocumentStore at line 948. 1 of those changes was a fix/bug commit, and the other 13 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/core/src/stores/document-store.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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a565825c3bef280e913d5f713690f7b164f41eaf07bc21d486804d1f6a709d49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/server.ts: packages/mcp/src/server.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in server.createServer at line 744. 6 of those changes were fix/bug commits, and the other 16 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/server.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":"packages/mcp/src/server.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58c7b700c5f8da7ef93b3dfbcc28fcd85bc11a5ba53bb1c50ee5fa591da73af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/Editor.swift: apple/VcadApp/Sources/VcadApp/Editor.swift changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in EditorModel.finishSketch at line 2156. 13 of those changes were fix/bug commits, and the other 59 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/Editor.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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f37c868b5a88fcee0fcf280486e89aa6988ac0bf3697b2b4afb3d3c06bba27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-booleans/src/pipeline.rs: crates/vcad-kernel-booleans/src/pipeline.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in vcad_kernel_booleans::pipeline::brep_boolean at line 1283. 9 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-booleans/src/pipeline.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":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f28689a1459443057abde99e3b1536909439dc403ba903c9d92a7334aada80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-loon/src/convert.rs: crates/vcad-loon/src/convert.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in ConvertCtx::convert_solid at line 2335. 3 of those changes were fix/bug commits, and the other 26 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-loon/src/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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5e67ed0a84a9b882267e626c8525bc95d26ebf4aaa7ccd24d1ae2d1c7e2f07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/maze.rs: crates/vcad-ecad-pcb/src/router/maze.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in vcad_ecad_pcb::router::maze::route_net_maze3d at line 323. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/maze.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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c70849b731d67d5eb1db589624b77054a1c4ee2606eada5595cc3917c52cbb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-wasm/src/lib.rs: crates/vcad-kernel-wasm/src/lib.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in vcad_kernel_wasm::evaluate_node at line 4823. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-wasm/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":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":4823}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b6070b0f8c282fb524b7750c45e0ba638b61b04978d6a4eadee5c946968b50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/descent.rs: crates/vcad-ecad-pcb/src/router/descent.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in vcad_ecad_pcb::router::descent::descend_board_inner at line 915. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/descent.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":"crates/vcad-ecad-pcb/src/router/descent.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"690f03b44ce17d9a91f7fdc4f623bf2851d9ba50b1301af7a8209bed421dc0fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-render/src/lib.rs: crates/vcad-render/src/lib.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in vcad_render::render_svg_impl at line 3009. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-render/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":"crates/vcad-render/src/lib.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b7855be0b8a3be1ecb36cf102ac678474b461e02d1cfd4da03ae9909d410ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-tessellate/src/lib.rs: crates/vcad-kernel-tessellate/src/lib.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in vcad_kernel_tessellate::tessellate_trimmed_region at line 7422. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-tessellate/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":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":7422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e28707463821ddd0f05663fd7665a3fc805e6481684c546dc9f10445c30137b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/complete.rs: crates/vcad-ecad-pcb/src/router/complete.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in vcad_ecad_pcb::router::complete::route_window_complete_islands 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/complete.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":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d25c83fbba3258cb8a14861b88036b11823cd7e7f60d2f63e847dd232dc3c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/kernel-wasm/vcad_kernel_wasm.js: packages/kernel-wasm/vcad_kernel_wasm.js changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in vcad_kernel_wasm.__wbg_get_imports at line 9345. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/kernel-wasm/vcad_kernel_wasm.js\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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":9345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b47e37d6f19a422778ed85183af7d2c7cb7c1e0e8f42397ea6d366c400b507"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/ElectronicsView.swift: apple/VcadApp/Sources/VcadApp/ElectronicsView.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in ElectronicsCanvas.body 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/ElectronicsView.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":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e2b45b1c9b0b7211813432682b64c48a74f43fdec467b8d5a9725673c5e1c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/Shell.swift: apple/VcadApp/Sources/VcadApp/Shell.swift changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in DocumentCommands.body 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/Shell.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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"62755841870382c58a139257800a37f7fb85c7bde3e9874634e50c8f5014b325"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-app/src/migrate.rs: crates/vcad-app/src/migrate.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in vcad_app::migrate::migrate_node at line 336. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-app/src/migrate.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":"crates/vcad-app/src/migrate.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"addc8d58ab4756b3a73957b1c6308615477539f55dfcda604db7fa5d8167267f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-app/src/materializer.rs: crates/vcad-app/src/materializer.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in vcad_app::materializer::materialize_doc_extras at line 556. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-app/src/materializer.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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"121e9e9e4b8d62b1f43442907064041bd0854467dd462c45b0a36122cf9c824e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/GlassChrome.swift: apple/VcadApp/Sources/VcadApp/GlassChrome.swift changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in DockTools.design at line 554. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/GlassChrome.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":"apple/VcadApp/Sources/VcadApp/GlassChrome.swift"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af1b0065abcc77b56f50f23c5e5bbf4dd03abebf46fffceb81f5ed1b69ec4fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/AgentBridge.swift: apple/VcadApp/Sources/VcadApp/AgentBridge.swift changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in AgentTools.call 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/AgentBridge.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":"apple/VcadApp/Sources/VcadApp/AgentBridge.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0ab2fb4bc149e48ae1fb713a9a0850bc1021ff04b67bc4d881c6b13a09b497"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/pair.rs: crates/vcad-ecad-pcb/src/router/pair.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in vcad_ecad_pcb::router::pair::try_route_pair_reason 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/pair.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":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"130b317cb4c9a5e065017b379ee7b0642cf75c595201bde8f4ef33b8820b65e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/render.ts: packages/mcp/src/tools/render.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in render.renderView at line 376. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/render.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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0cde3b6a6da87dad9a5e59c846b0875592f477432e7fd17f881de7f32b629b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/drc.rs: crates/vcad-ecad-pcb/src/drc.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in vcad_ecad_pcb::drc::detect_unstitched_pads at line 2348. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/drc.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":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73d86a3949bdb36467b2dd8ff2bcf5a3067e5910ada6eb3d4ea32c99a89ce70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-fabprep/src/verdict.rs: crates/vcad-ecad-fabprep/src/verdict.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in InteractiveRouter::shortest_path at line 772. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-fabprep/src/verdict.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":"crates/vcad-ecad-fabprep/src/verdict.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9810bde8d2c43ace0a0c0d0aa817dd4ee3a1176031a5082d07e72576da853ac6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/escape.rs: crates/vcad-ecad-pcb/src/router/escape.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in vcad_ecad_pcb::router::escape::plan_field_escapes_toward at line 400. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/escape.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":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fda3e3e7d90dd5fbc8f6185c645b7997c2d2e5d84a6786c918f4fa215a1a61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/Document.swift: apple/VcadApp/Sources/VcadApp/Document.swift changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in DocumentGraph.paramSummary at line 560. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/Document.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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bbaaf9e948432f6325c12daf300182f70a25d17ee1c47b947d3f9f7e333af5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ir/src/to_loon.rs: crates/vcad-ir/src/to_loon.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in vcad_ir::to_loon::op_to_loon at line 193. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ir/src/to_loon.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":"crates/vcad-ir/src/to_loon.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0357d0779976c713a578a7b694789cb6ebf87ca198993dc720028b3016c57c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-booleans/src/split.rs: crates/vcad-kernel-booleans/src/split.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in vcad_kernel_booleans::split::split_planar_face_by_circle at line 1344. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-booleans/src/split.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":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d11b28f9fd03eb9047fd6b73b8c5c65801a51dc90f00f050b82aebc4774b7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-app/src/feature.rs: crates/vcad-app/src/feature.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in FeatureInput::to_crdt_params at line 552. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-app/src/feature.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":"crates/vcad-app/src/feature.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c71c3e95547de4f3536a137942925d80f7be5167c6d883640422779353c160"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ffi/src/drafting.rs: crates/vcad-ffi/src/drafting.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in vcad_ffi::drafting::compose at line 464. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ffi/src/drafting.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":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a5b5e37b2a7aa6c3cb6b977e1bb1c295955624af0c53c9e98811da47e4bf1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/flow/realize.rs: crates/vcad-ecad-pcb/src/router/flow/realize.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in vcad_ecad_pcb::router::flow::realize::realize_wires at line 300. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/flow/realize.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":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"795169ffbe39205abb0874474a5f9873242ecc38c0c2206d76e0b7a38398d30d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/engine/src/evaluate.ts: packages/engine/src/evaluate.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in evaluate.evaluateOp 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/engine/src/evaluate.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":"packages/engine/src/evaluate.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd909460e9631626d08ba09a1f04f17fcf43b5984a19a9d875b5e332186eec56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-render/src/main.rs: crates/vcad-render/src/main.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in vcad_render::run at line 1371. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-render/src/main.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":"crates/vcad-render/src/main.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b390e3649ef2dfd4aeae9acb345ef1141491602dd4bdcbf12fb17cb5772f011"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-symbols/src/altium/mod.rs: crates/vcad-ecad-symbols/src/altium/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in vcad_ecad_symbols::altium::build_pcb at line 468. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-symbols/src/altium/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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9fc0db13962e29dc3e9cbea3886d65798de8f074fde2e84442c9b4e1fc9d1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel/src/lib.rs: crates/vcad-kernel/src/lib.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Solid::fillet_reported at line 1009. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel/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":"crates/vcad-kernel/src/lib.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d31c066944efd69100017f935ae18d72c212dc31e8ef1f4d531b1ebefe253"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-symbols/src/kicad_write.rs: crates/vcad-ecad-symbols/src/kicad_write.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in vcad_ecad_symbols::kicad_write::write_library_body at line 649. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-symbols/src/kicad_write.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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bb2508770210b2d620980e72453b2c2da062874686beda74423be24dfb566d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-symbols/src/footprint.rs: crates/vcad-ecad-symbols/src/footprint.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in vcad_ecad_symbols::footprint::match_family at line 1757. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-symbols/src/footprint.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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6438b93a50db664ad50f7c4580c041d370041c180990debcf74efa0970f6e84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/registry-dispatch.ts: packages/mcp/src/tools/registry-dispatch.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in registry-dispatch.snapshotParts at line 318. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/registry-dispatch.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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1145a8904f9264d3e2cbca7a669a847e08a14ff0d69fa5eb440f6eb789b8228"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/flow/route.rs: crates/vcad-ecad-pcb/src/router/flow/route.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in vcad_ecad_pcb::router::flow::route::route_flow at line 879. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/flow/route.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":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"2922f556765182663a3b8e22d5293cfe0fd0c62ba2de4046d4d72b332aad08bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-app/src/tools.rs: crates/vcad-app/src/tools.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in vcad_app::tools::lower_update at line 333. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-app/src/tools.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":"crates/vcad-app/src/tools.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a06bc8e1ecacfd65fcc7e178cd59e081601e30c4975201aa9b61b74b1483a37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ir/src/vcode.rs: crates/vcad-ir/src/vcode.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in vcad_ir::vcode::parse_geometry_opcode at line 1786. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ir/src/vcode.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":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac8db87029c9489c807a2c050fd14c2cba45bb7bd9e6a5d84e9f0da406f023c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/legalize.rs: crates/vcad-ecad-pcb/src/router/legalize.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in vcad_ecad_pcb::router::legalize::merge_same_net_vias at line 444. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/legalize.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":"crates/vcad-ecad-pcb/src/router/legalize.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2764bd6adc2b79fdac3351578e29c5c59aca085da8175390099ded6fd1a76234"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app/src/App.tsx: packages/app/src/App.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in App.App 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/app/src/App.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":"packages/app/src/App.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e712d124d20b6a4c6dcc1c7b92ef2b3f6028fd0fe89151ad44cce00b2bc59a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-raytrace/src/gpu/buffers.rs: crates/vcad-kernel-raytrace/src/gpu/buffers.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in GpuScene::from_brep at line 635. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-raytrace/src/gpu/buffers.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":"crates/vcad-kernel-raytrace/src/gpu/buffers.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f5d257a1054009d56e499974977a992fbaac3a4b4f1e922ab8cbdc055839f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/SketchSession.swift: apple/VcadApp/Sources/VcadApp/SketchSession.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in SketchSession.loopRegions at line 1270. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/SketchSession.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":"apple/VcadApp/Sources/VcadApp/SketchSession.swift"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97acf1a115890b2e2ee9627b032eba206952e675f855e9e901c32ba7fccf3eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-booleans/src/api.rs: crates/vcad-kernel-booleans/src/api.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in vcad_kernel_booleans::api::boolean_op_reported_untimed at line 369. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-booleans/src/api.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":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1009cdc5fcdd567138e9ad9fbf49e7792f595f06bae5034429ddf8f3ea5e95c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-symbols/src/eagle_brd.rs: crates/vcad-ecad-symbols/src/eagle_brd.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in vcad_ecad_symbols::eagle_brd::parse_eagle_brd 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-symbols/src/eagle_brd.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":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"069cea6f10a72ac97d3fedc478577f6a3e99182d00520c80778997d34cb35261"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-mcp/src/server.rs: crates/vcad-mcp/src/server.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Server::handle_modern at line 818. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-mcp/src/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":"crates/vcad-mcp/src/server.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef71546ea85d77624ee2642c123f73882820d12125c01bc75568c5042f34b539"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-booleans/src/classify.rs: crates/vcad-kernel-booleans/src/classify.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in vcad_kernel_booleans::classify::face_sample_point at line 101. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-booleans/src/classify.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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d723cce6f38458d5e1e83f4fdc7a761a29b12048d1250640368995c1184054"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/Kernel.swift: apple/VcadApp/Sources/VcadApp/Kernel.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in KernelMesh.creasedNormals at line 93. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/Kernel.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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdcb276e65554c349734ad0e4c2c5cf70b02acccf3006a5fc40dda4cb2357d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/SketchViews.swift: apple/VcadApp/Sources/VcadApp/SketchViews.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in SketchViews.swift.buildSketchRoot at line 377. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/SketchViews.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":"apple/VcadApp/Sources/VcadApp/SketchViews.swift"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a1d3971f1133677ead11e6c213594ce2790fc7120b6ea4d568e120d4c74783"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/pour_synth.rs: crates/vcad-ecad-pcb/src/pour_synth.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in vcad_ecad_pcb::pour_synth::decide_pours at line 309. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/pour_synth.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":"crates/vcad-ecad-pcb/src/pour_synth.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa275333764ed47b0fcdcff0a5781481eab1a42d3e26bb0f6998b81e1f11d25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-step/src/reader.rs: crates/vcad-kernel-step/src/reader.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in StepReader::read_solid at line 709. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-step/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":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b70abc972971a49e7c2e53527b99aed8228a6a770b52bd4a441d20f60cf6baf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift: apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ElectronicsWorkspace.commitRoute at line 143. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.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":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3821c80ee548e7dd82d2a11adef8e2652d2e3d7d7ba1a90a5fa16321597bfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/AgentCore.swift: apple/VcadApp/Sources/VcadApp/AgentCore.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in AgentCore.answer at line 208. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/AgentCore.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":"apple/VcadApp/Sources/VcadApp/AgentCore.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"086258ed2a8727af9c3f73ceb9819fa7a7fdac47a2b178364663c8e1508c2240"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-fabprep/src/lib.rs: crates/vcad-ecad-fabprep/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in vcad_ecad_fabprep::run_fab_prep at line 403. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-fabprep/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":"crates/vcad-ecad-fabprep/src/lib.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe607f91947771423bfee50e7fe81c0d5d7755fd2bccf8538d8cbf945279b3cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/flow/flow.rs: crates/vcad-ecad-pcb/src/router/flow/flow.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in FlowGraph::build at line 562. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/flow/flow.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":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc422f0159abc430ed8f19cd5ebcff9001b1d159b69d93aa37f5b84ef1ef5d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-shell/src/lib.rs: crates/vcad-kernel-shell/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in vcad_kernel_shell::shell_brep_open at line 436. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-shell/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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb712fb77fff1a3acac7953460c11cb7d0b6e018cafb886aee90ea191eecaa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/FeatureOps.swift: apple/VcadApp/Sources/VcadApp/FeatureOps.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in FeatureOpSheet.apply at line 450. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/FeatureOps.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":"apple/VcadApp/Sources/VcadApp/FeatureOps.swift"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32d3c8b574bc9dda8b1f85b437043285f7216fbd3eee924dab4ae1987f4f659"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-app/src/evaluate.rs: crates/vcad-app/src/evaluate.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in vcad_app::evaluate::evaluate_node at line 61. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-app/src/evaluate.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":"crates/vcad-app/src/evaluate.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d09ad1679c73e6a050443cdfbe10b932bd3ed0c8d5585f42a6a9bb46d33fc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/session.rs: crates/vcad-ecad-pcb/src/session.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RouteSession::from_pcb at line 282. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/session.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":"crates/vcad-ecad-pcb/src/session.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7366745d253532b3db140008ff5b875e190ffccf5a7c62209ec84ce6eeb0f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/clearance.ts: packages/mcp/src/tools/clearance.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in clearance.checkClearance at line 626. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/clearance.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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"14927c51f422f38adb8f3963e66153e58350d6fd68f47253b05abf902fb016c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-symbols/src/kicad_pcb.rs: crates/vcad-ecad-symbols/src/kicad_pcb.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in vcad_ecad_symbols::kicad_pcb::parse_footprint at line 1020. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-symbols/src/kicad_pcb.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":"crates/vcad-ecad-symbols/src/kicad_pcb.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"098fe360d7d561e2ddd4f32e9c8f3c1d6554a7be9ef384925e567a26098ae911"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/AgentEdits.swift: apple/VcadApp/Sources/VcadApp/AgentEdits.swift changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AgentEdits.adoptDocument at line 121. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/AgentEdits.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":"apple/VcadApp/Sources/VcadApp/AgentEdits.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d268dc32b4d0ae35e987abad1bcd7636829b88bcfe2c9a29c9ca20af07f11e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/DocumentRuntime.swift: apple/VcadApp/Sources/VcadApp/DocumentRuntime.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in EditorModel.adoptRuntimeFrame at line 154. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/DocumentRuntime.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":"apple/VcadApp/Sources/VcadApp/DocumentRuntime.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfffe10f0d0bf4cfc0a45a900763f1ffe57547683e3a7cef9a8e9c0fdcdd7a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/CNCStudio.swift: apple/VcadApp/Sources/VcadApp/CNCStudio.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WorkspaceHeader.body 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/CNCStudio.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":"apple/VcadApp/Sources/VcadApp/CNCStudio.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3dc7a17bf07e87256e0a54cc5ceef548311a5514b5e8475f3fd796eeb5bc38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift: apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ElectronicsWorkspace.tidySchematic at line 313. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b93619821e65561e15e9a0c6b8b3b8384c947aaeb1f1519194e39d6d2a2bd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ffi/src/topology.rs: crates/vcad-ffi/src/topology.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in vcad_ffi::topology::analyze at line 109. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ffi/src/topology.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":"crates/vcad-ffi/src/topology.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"645d16dd5ecb001c64d707eeb42b4c42675bcbee9fd9687b49af2f0399d9d8e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/FeatureOpsPalette.swift: apple/VcadApp/Sources/VcadApp/FeatureOpsPalette.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in EditorModel.paletteCommands 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/FeatureOpsPalette.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":"apple/VcadApp/Sources/VcadApp/FeatureOpsPalette.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"12650b6d5bd9bfc30b45a6f97d07e37b141a70dc56d858bae95c73697888ca89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/app-link.ts: packages/mcp/src/app-link.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in app-link.deliverPush at line 261. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/app-link.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":"packages/mcp/src/app-link.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0d274891a90a9f535edae16d6f6fd706647f90c114706f348b139c09c81b18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/topopt.ts: packages/mcp/src/tools/topopt.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in topopt.topologyOptimizeTool at line 280. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/topopt.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":"packages/mcp/src/tools/topopt.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c059c8e0583ddc8f4974382bf5220d389173d6d4cda3adcf5d2797f66c4b87cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift: apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in BoardPainter.draw at line 47. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.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":"apple/VcadApp/Sources/VcadApp/ElectronicsBoardLayer.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc3e5c30d29d68ef1cc7a7fb1142b842ff62241c9c507b98c90c6a71a87ecee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-runtime/src/lib.rs: crates/vcad-runtime/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in vcad_runtime::run at line 553. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-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":"crates/vcad-runtime/src/lib.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c28fbea675ff7fcad8a5660b7c8de5d3b0e4dcc9344d31b41aeb440cf6a477"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-step/src/assembly.rs: crates/vcad-kernel-step/src/assembly.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in AssemblyReader::read_structure at line 301. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-step/src/assembly.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":"crates/vcad-kernel-step/src/assembly.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"186daffb50e420b0c3d912d054197b7ac4d928942630aad838c8009402851a38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apple/VcadApp/Sources/VcadApp/AnalysisSmoke.swift: apple/VcadApp/Sources/VcadApp/AnalysisSmoke.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in AnalysisSmoke.swift.analysisSmoke 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/AnalysisSmoke.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":"apple/VcadApp/Sources/VcadApp/AnalysisSmoke.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4726025d3e802901a021002daa9fa394a32aa17a402dc7c054b49328e6f84c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/core/src/commands/executors.ts: packages/core/src/commands/executors.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in executors.tryExecuteViaEngine 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/core/src/commands/executors.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":"packages/core/src/commands/executors.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d92380101711a00bc209ce43358295ad4f9e24b7e2cc02b190332015df28ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/flow/embed.rs: crates/vcad-ecad-pcb/src/router/flow/embed.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in Embedding::route at line 397. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/flow/embed.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":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9320a2cfb1521faa70ec2eea36706cd3ec74870bb38adc77658c02bf5c7b4340"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-mcp/src/proxy.rs: crates/vcad-mcp/src/proxy.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Proxy::spawn at line 198. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-mcp/src/proxy.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":"crates/vcad-mcp/src/proxy.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f111f715065783ce3691835354e18024855562ad8b6cbf03eca8f02d07783f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app/src/components/DocTitle.tsx: packages/app/src/components/DocTitle.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in DocTitle.DocTitle 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/app/src/components/DocTitle.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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f399d96adee3be41545f2110a0d07e8ab41a6d176b1a415a473cccf400118f32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/sco.rs: crates/vcad-ecad-pcb/src/router/sco.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ResidualSystem::solve_lm at line 524. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/sco.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":"crates/vcad-ecad-pcb/src/router/sco.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4165b31755dfbcbfa7a891efb67c58f1d4b54c839be33adba29816f059bd5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-fea/src/mesh.rs: crates/vcad-kernel-fea/src/mesh.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in vcad_kernel_fea::mesh::hex_fill_conforming at line 415. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-fea/src/mesh.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":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9281cd73665034e40ae2ffef63819ddc5b1146b5e502bd2d8a444cc33b96c592"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/preview.ts: packages/mcp/src/tools/preview.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in preview.generateGlbPreview at line 155. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/preview.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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce1096d33103678d3f994af36daaac01a420c8774e915f6efa723227a207367"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-particle/src/trace.rs: crates/vcad-kernel-particle/src/trace.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Tracer::trace_impl at line 482. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-particle/src/trace.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":"crates/vcad-kernel-particle/src/trace.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6078136b1f8cdf94f773aff2880972473f4a029f7200a96529fbdf0164b71a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/parts.ts: packages/mcp/src/tools/parts.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in parts.placePartTool at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/parts.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":"packages/mcp/src/tools/parts.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"37029035753950cbbe147e6a4a753fafd3f3b76978aa867aab32b820785258d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app/src/components/Header.tsx: packages/app/src/components/Header.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Header.Header 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/app/src/components/Header.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":"packages/app/src/components/Header.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0247b35dab5ce5e2a855023ac1c0142434a592663de78e50e057c4d7a23f1c0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-topopt/src/analyze.rs: crates/vcad-kernel-topopt/src/analyze.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in vcad_kernel_topopt::analyze::analyze_fields_thermal_warm at line 221. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-topopt/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":"crates/vcad-kernel-topopt/src/analyze.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3293497fbe4038708b24c794e37625a9ce2f8f0889fd6ca07ec041830ae24fb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-mcp/src/transport.rs: crates/vcad-mcp/src/transport.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in vcad_mcp::transport::handle_http at line 286. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-mcp/src/transport.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":"crates/vcad-mcp/src/transport.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4749f1db3feffe9ba8e1591a77e3bc3dcdfe5040b1e26ad6e0376a6767b71ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ffi/src/clearance.rs: crates/vcad-ffi/src/clearance.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in vcad_ffi::clearance::check at line 126. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ffi/src/clearance.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":"crates/vcad-ffi/src/clearance.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a24a34773e93dced03cb9917023c3a979e421484ef1a1f0612cb8a7111dff10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/mcp/src/tools/measure.ts: packages/mcp/src/tools/measure.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in measure.measureSweepResult at line 289. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/measure.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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d60d15336ef9ce3157530e8e5bd7fbcf18ef57f3f467a946893d89cda7bf67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/engine/src/engine-host.ts: packages/engine/src/engine-host.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in engine-host.handleEngineRequest at line 109. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/engine/src/engine-host.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":"packages/engine/src/engine-host.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee44af0c2eb2650c953a2a12c88198027cd6decc416351072bae0b35a4a1471"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-ecad-pcb/src/router/flow/cdt.rs: crates/vcad-ecad-pcb/src/router/flow/cdt.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in vcad_ecad_pcb::router::flow::cdt::layer_obstacles at line 433. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ecad-pcb/src/router/flow/cdt.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":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe9819914b5bf459ede1809ea5ff2b47f389b884e91d4e820f11dd95212d747"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-tessellate/src/mesh_ray.rs: crates/vcad-kernel-tessellate/src/mesh_ray.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in vcad_kernel_tessellate::mesh_ray::strip_membranes_once at line 399. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-tessellate/src/mesh_ray.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":"crates/vcad-kernel-tessellate/src/mesh_ray.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aca79854f47b3be93415442e9ee8833d0b7b8cb6524609fb44c7cea52c0987"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vcad-kernel-booleans/src/sew.rs: crates/vcad-kernel-booleans/src/sew.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in vcad_kernel_booleans::sew::merge_nearby_vertices at line 408. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-booleans/src/sew.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":"crates/vcad-kernel-booleans/src/sew.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f5899c7b6cebd277897fb2f1c2039b625bdf744c15aed6c299266840c7a0a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/vcad-ffi/src/export.rs: crates/vcad-ffi/src/export.rs changed 12 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is vcad_ffi::export::vcad_export_document at line 251), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(step): interop audit \u2014 no hangs, colours, assembly placement, NURBS export (#1126)\u201D; \u201Cfix(assembly): export instances not def copies, STEP posed instances, scalable interference, parse STEP once (#1123)\u201D; \u201Cdrop local needless_update allow (fixed on main by #1019)\u201D; \u201Cfix(ffi): allow deliberate needless_update in photoreal options\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-ffi/src/export.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":"crates/vcad-ffi/src/export.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc690d8e5cc3687a927302de82d1cd4c28e47d66552eec6639acaa5e5d7c7327"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/vcad-app/src/agent.rs: crates/vcad-app/src/agent.rs changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is vcad_app::agent::describe_scene at line 407), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: clear the remaining agent acceptance-run blockers\u201D; \u201Cfix(mcp): clear the agent actuator run\u0027s blockers\u201D; \u201Cfix(analysis): honest verdicts, conforming FEA lattice, closed via meshes\u201D; \u201Cfix(engine): opened documents keep bindings and actuator limits\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-app/src/agent.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":"crates/vcad-app/src/agent.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"434680b4214ac452602f9f568ec0aeffbf4798de1c59bec05d0ddf9617245546"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/mcp/src/tools/document-solids.ts: packages/mcp/src/tools/document-solids.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is document-solids.canonicalNodes at line 116), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): keep node-only modules out of the browser tool set\u201D; \u201Cfix: clear the remaining agent acceptance-run blockers\u201D; \u201Cfix(mcp): clear the agent actuator run\u0027s blockers\u201D; \u201Cfix(mcp): closed-case fit, dense renders, board write cost, fab and receipt gates\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- packages/mcp/src/tools/document-solids.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":"packages/mcp/src/tools/document-solids.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878196c7a2545ede97a03a9453bac4b4f17393822b93f140acbc0a68530e4a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apple/VcadApp/Sources/VcadApp/AssemblyPanel.swift: apple/VcadApp/Sources/VcadApp/AssemblyPanel.swift changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is JointDriveRow.body at line 201), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(native): list parts by name; clearance checks posed instances\u201D; \u201Cfix(mcp): clear the agent actuator run\u0027s blockers\u201D; \u201Cfix(native): assembly joint list follows the pose; names wrap; triad clears the panels\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/AssemblyPanel.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":"apple/VcadApp/Sources/VcadApp/AssemblyPanel.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6064e8a0adf831026c14959a09847255db81608eefce43cdd4f5d29fac0b3e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/vcad-kernel-drafting/src/edge_extract.rs: crates/vcad-kernel-drafting/src/edge_extract.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is vcad_kernel_drafting::edge_extract::build_adjacency at line 281), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(drafting): weld mesh edges and drop T-junction boundaries in HLR\u201D; \u201Cfix(drafting): deterministic edge order\u201D; \u201Cfix(drafting): draw feature edges, not the triangle mesh\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- crates/vcad-kernel-drafting/src/edge_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":"crates/vcad-kernel-drafting/src/edge_extract.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5252d18db0f5cef32cb12a41e0576ebc7c538e251146c7130e81d878ade565"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apple/VcadApp/Sources/VcadApp/AssemblyModel.swift: apple/VcadApp/Sources/VcadApp/AssemblyModel.swift changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is EditorModel.pickedAnchor at line 189), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(native): list parts by name; clearance checks posed instances\u201D; \u201Cfix(mcp): clear the agent actuator run\u0027s blockers\u201D; \u201Cfix(native): assembly joint list follows the pose; names wrap; triad clears the panels\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/AssemblyModel.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":"apple/VcadApp/Sources/VcadApp/AssemblyModel.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b517881f8930b4f0a4e35f07b9b2261b3d31050fc539fdc49ee222190bb36d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: apple/VcadApp/Sources/VcadApp/CamJobPanel.swift: apple/VcadApp/Sources/VcadApp/CamJobPanel.swift changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is CamJobPanel.body at line 135), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(native): CAM fields commit on Return, stale CAM results marked, hide empty drawing pill\u201D; \u201Cfix(native): removing a CAM operation no longer crashes; benchmark part 10\u201D; \u201Cfix(native): Fab panels fit and label their fields; CAM stock starts at the part\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 17:27:34 -05:00\u0027 --until=\u00272026-11-16 17:27:34 -05:00\u0027 --full-history --no-merges -- apple/VcadApp/Sources/VcadApp/CamJobPanel.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":"apple/VcadApp/Sources/VcadApp/CamJobPanel.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad3fa67ffc9e3c1302e8bb6a89901a4cbfc16e1453fae48350e51fbc542757"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: orientation optimization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/analyze.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3628c7d580138585bf347510af1d620e048825f67ca6047f64895a77e97ba90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement CPU picking path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":4416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3453a37ce7f570b8e4e25496cca341879927ff669269c0b181bcc983cb2748f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // shift down by thickness/2. Cutouts (\u0060outline.cutouts\u0060) are a TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":5246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3396aa8f1a9e0d8d2287bf5030a63c6103857bd241b6dc1d8df75188a2d9bbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Faceted ring (true cone surfaces TODO). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/revolve.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1546f1bc62f9e502b858efb2f7898720db91cf52923fc2882d515007f883b7e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// damping. (Joint friction only \u2014 see the contact TODO on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/gym.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0667a0848dbfe0d61b17cc932b7d60db8e0e9ae90b97006b3011407f8621be8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(contact): once the contact ground-plane task lands, surface \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed101bc0fbd0a09e09fc0ce6f1c05032bf02bd830efa567896d1237c4384f63"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060baseURL\u0060 spells \u0060URL\u0060 where 22 names in the project spell it \u0060Url\u0060: 22 of 24 names in project repository spell the token \u0060Url\u0060 (22 of 24; unit: names in project repository containing \u0060Url\u0060). Peers: GatewayDirectConfig.baseUrl (mecheval/harness/src/solvers/gateway-direct.ts:29); GatewayMcpConfig.baseUrl (mecheval/harness/src/solvers/gateway-mcp.ts:33); WaferDirectConfig.baseUrl (mecheval/harness/src/solvers/wafer-direct.ts:21); useUrlSync.useUrlSync (packages/app/src/hooks/useUrlSync.ts:42); bootstrap.resolveWasmUrl (packages/app/src/lib/bootstrap.ts:142). Rename to \u0060baseUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/training/src/annotate.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4f2239c2917c361e8a5268c4e2f3a61577055e0d8ad9b2028bbc8914dea0b6"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060baseURL\u0060 spells \u0060URL\u0060 where 22 names in the project spell it \u0060Url\u0060: 22 of 24 names in project repository spell the token \u0060Url\u0060 (22 of 24; unit: names in project repository containing \u0060Url\u0060). Peers: GatewayDirectConfig.baseUrl (mecheval/harness/src/solvers/gateway-direct.ts:29); GatewayMcpConfig.baseUrl (mecheval/harness/src/solvers/gateway-mcp.ts:33); WaferDirectConfig.baseUrl (mecheval/harness/src/solvers/wafer-direct.ts:21); useUrlSync.useUrlSync (packages/app/src/hooks/useUrlSync.ts:42); bootstrap.resolveWasmUrl (packages/app/src/lib/bootstrap.ts:142). Rename to \u0060baseUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/training/src/infer.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"962cfd7e253b95ed10205fc34b2e0f0039bdfd7716f8601b6624192523fe788e"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060DependencyGraph.getEvaluationOrder\u0060 returns an array (\u0060T[]\u0060) where its 3 siblings return a set: 3 of 4 collection-returning members of \u0060DependencyGraph\u0060 return a set (3 of 4). Siblings: DependencyGraph.getAffectedNodes (packages/engine/src/dependency-graph.ts:101); DependencyGraph.getDependencies (packages/engine/src/dependency-graph.ts:128); DependencyGraph.getDependents (packages/engine/src/dependency-graph.ts:135). Return a set. [rule A4]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/dependency-graph.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b4c45e529db3c70a24cddf52ab4128b86fa27b1ed8400b2f4b30a0a35c95ee"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060Engine.simulateCavity\u0060 takes (optionsjson, paramsjson) where its 8 siblings take (paramsjson, optionsjson): 8 of 9 members of \u0060Engine\u0060 with these two same-typed parameters take them in the order (paramsjson, optionsjson) (8 of 9). Siblings: Engine.particleSimulate (packages/engine/src/index.ts:1873); Engine.particleSimulate3d (packages/engine/src/index.ts:1895); Engine.toleranceAnalyze (packages/engine/src/index.ts:1934); Engine.thermalSolve (packages/engine/src/index.ts:1954); Engine.thermalSolveDocument (packages/engine/src/index.ts:1976). Reorder to (paramsjson, optionsjson); both are the same type, so the compiler cannot catch a swapped call. [rule A3]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/index.ts"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cf7c97ee60f1621d22b680eb9b458264fe6108cbbef1b3f38ca6007090aa3b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the cylinder part\u0022 repeats the code it sits on: 3 of its 3 words (find, cylinder, part) are already in \u0060const cylinder = parts.find((p) =\u003E p.kind === \u0022cylinder\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":"packages/app/src/App.tsx"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"b712ae827df595ac5be10beee0c87b0798cb1ff3ec438aae4e172e0123bc7052"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Handle open file\u0022 repeats the code it sits on: 3 of its 3 words (handle, open, file) are already in \u0060const handleOpenFile = useCallback(() =\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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"547c78e8e551125cf9ba144d27449f740ba726c2ff59919190c1d5913672b6cc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Handle file input change\u0022 repeats the code it sits on: 4 of its 4 words (handle, file, input, change) are already in \u0060const handleFileChange = useCallback((e: React.ChangeEvent\u003CHTMLInputElement\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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a2e7de1d9fee3fc0d4ee452effed30bd72399af9ba0efdc1be38803a877b54"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get storage usage\u0022 repeats the code it sits on: 3 of its 3 words (get, storage, usage) are already in \u0060const usage = await getStorageUsage();\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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3f25a23374fbd8652f1405fd4b63d90f1c65990886d5b5bf8ea1323098012b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Build map of child instance -\u003E joint\u0022 repeats the code it sits on: 4 of its 5 words (map, child, instance, joint) are already in \u0060const jointByChild = useMemo(\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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c498d50529a1869a6533b4e8c1e5fe3ae9e48b21b13c70b6b4e9c30b6ab50e1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Handle pointer leave\u0022 repeats the code it sits on: 3 of its 3 words (handle, pointer, leave) are already in \u0060const handlePointerLeave = useCallback(() =\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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3c345196037d17aac1a2b8a1698466ca499999fa5c17b42deec2009af5dd75"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Camera settings from store\u0022 repeats the code it sits on: 3 of its 3 words (camera, settings, store) are already in \u0060const cameraSettings = useCameraSettingsStore();\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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"93708aeaa7ac6e577d17b69de8aad9e657bb5eadb74deede03ed45022672524a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if trackpad orbit is enabled for this scheme\u0022 repeats the code it sits on: 5 of its 5 words (check, trackpad, orbit, enabled, scheme) are already in \u0060const useTrackpadOrbit =\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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef0ac64fdd791691ae14c887427bb77c4558c03f9645e00242da2919ccf151c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get effective scene settings\u0022 repeats the code it sits on: 4 of its 4 words (get, effective, scene, settings) are already in \u0060const sceneSettings = useMemo(\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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"961591ea573b06cba4cc2e369e7dddad9e0597ecec423a0c03e0a47ae6485a67"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if CAM functions are available\u0022 repeats the code it sits on: 4 of its 4 words (check, cam, functions, available) are already in \u0060if (typeof (wasm as Record\u003Cstring, unknown\u003E).isCamAvailable !== \u0022function\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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b9f8743b585439f2ca49e5e56e5f67b6a9748fac7b3bec9d27fa8048b6b6a1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if CAM is available\u0022 repeats the code it sits on: 3 of its 3 words (check, cam, available) are already in \u0060if (!camWasm.isCamAvailable())\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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7130e6d7ca15fd8b4364c73fe5a921092a7e8ef9a8a094f3bf1b73b6cd6693bd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create WASM settings\u0022 repeats the code it sits on: 3 of its 3 words (create, wasm, settings) are already in \u0060const wasmSettings = new camWasm.WasmCamSettings();\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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e7e723fb2422402e98281a8e6af463ab21c6308b9379f0fc55c9f858eaf802"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find current stage\u0022 repeats the code it sits on: 3 of its 3 words (find, current, stage) are already in \u0060const currentStage = progress.stages.find((s) =\u003E s.status === \u0022running\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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2420fe36d8386da9a6717e74e8a3f70956c05e688a42f9cee08e1cb284574e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022check_enclosure_fit told which part is the case\u2026\u0022 repeats the code it sits on: 5 of its 6 words (check, enclosure, fit, part, case) are already in \u0060const fit = await call(\u0022check_enclosure_fit\u0022, { document_id: id, enclosure_document_id: id, enclosure_part_id: casePart  \u2026\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":"packages/mcp/src/__tests__/accept-9.test.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8886dd7f8eedcdedf946b0bb9ece8d9e961b5d76eb0aae869e3c45b190710410"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022On-board placement is clean.\u0022 repeats the code it sits on: 3 of its 3 words (board, placement, clean) are already in \u0060expect((await summarizePlacementDrc(board)).clean).toBe(true);\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":"packages/mcp/src/__tests__/ecad.test.ts"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4af051c7343fa84d21afaff604dc1d05dd464301024fa1e606567a649bfd721"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Weight centroid by volume\u0022 repeats the code it sits on: 3 of its 3 words (weight, centroid, volume) are already in \u0060weightedCx \u002B= props.centroid.x * props.volume;\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":"packages/mcp/src/tools/inspect.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9b1192164c6efe77a2e7d2be86d8a6e8a032de173206fc232938b5a3ad6a7d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Floor: inspect current state, then retry with corrected arguments.\u0022 repeats the code it sits on: 6 of its 7 words (inspect, current, state, retry, corrected, arguments) are already in \u0060return [\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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded702f8fa6370218f3483d0ec8dbe3ab84f3aac14eb871276795323c85149b5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add center hole\u0022 repeats the code it sits on: 3 of its 3 words (add, center, hole) are already in \u0060baseIdx = this.addCenterHole(lines, baseIdx, p);\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":"packages/training/src/generators/flange.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"15153e991ffd97a673eb4cad64b97e212e81c10ac114e6ea86764ca4927d1b90"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add bolt holes\u0022 repeats the code it sits on: 3 of its 3 words (add, bolt, holes) are already in \u0060baseIdx = this.addBoltHoles(lines, baseIdx, p);\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":"packages/training/src/generators/flange.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa63a0b7fcc50384deb6ac812f6d4fabc7f3d48072b42ecd8acbfcf262d9fc79"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add center hole\u0022 repeats the code it sits on: 3 of its 3 words (add, center, hole) are already in \u0060baseIdx = this.addCenterHole(lines, baseIdx, p);\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":"packages/training/src/generators/mount.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aebdcb9167f55ce6b2a3fb1dba41f1c6629e127ea59deb8898a5f7b11ec0972"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock WebAssembly.instantiate\u0022 repeats the code it sits on: 4 of its 4 words (mock, web, assembly, instantiate) are already in \u0060const mockMemory = new WebAssembly.Memory({ initial: 1 });\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":"packages/wasmosis/src/__tests__/registry.test.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e244752a59e03c1428b809b51823faabc55d11590c05e497070a4b96595a1c66"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate Cargo.toml\u0022 repeats the code it sits on: 3 of its 3 words (generate, cargo, toml) are already in \u0060const cargoToml = generateCargoToml({\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":"packages/wasmosis/src/crate-generator.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ef41e7f6d1a2e14e10e935f3842a84dbcd46db4c486b3a0aef5cd1d2721647"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate lib.rs\u0022 repeats the code it sits on: 3 of its 3 words (generate, lib, rs) are already in \u0060const libRs = generateLibRs({\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":"packages/wasmosis/src/crate-generator.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9b7c679afce48366772fc558da220613347bcf63ac11a31b18fe003f35cbd9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if wasm-split is available\u0022 repeats the code it sits on: 4 of its 4 words (check, wasm, split, available) are already in \u0060if (!checkWasmSplitAvailable())\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":"packages/wasmosis/src/splitter.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b65d43939fbf153c7ebf6866d36c3b74de7eeef38e67b8596098edd41c50aa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update Cargo.toml workspace version\u0022 repeats the code it sits on: 4 of its 5 words (update, cargo, toml, version) are already in \u0060function updateCargoToml(version)\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":"scripts/sync-version.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c365abbbe8210c439ad9772284a119b416a0dadc3703ebbf61d5fdaf6823da1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update Cargo.toml\u0022 repeats the code it sits on: 3 of its 3 words (update, cargo, toml) are already in \u0060results.push(updateCargoToml(version));\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":"scripts/sync-version.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89626ea774c2558aab359a414272167a240480942fc5d00037c549a54494eed"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/app\u0060 (58733 LoC, 415 module-visible types across 25 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efabff042988bc210f82a8d2d62105795ce4321b53cee2764d84803f61cea10"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/mcp\u0060 (57408 LoC, 296 module-visible types across 9 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acdd755f2f36939397effe870ae068d18f727ab49a33104fc1749ab56294297"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/vcad-ecad-pcb\u0060 (50477 LoC, 183 module-visible types across 3 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c92c977a9c50704adc2c372bffa1c96ec3b7fac98dd217d2d0bc1340168f4b"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060apple/VcadApp\u0060 (47798 LoC, 736 module-visible types across 7 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Package.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7df01b428951e2e81c0dbf2fa221e7519f3e48daf884add21d9f25b4d0e16c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/vcad-eval\u0060 (19084 LoC, 130 module-visible types across 2 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3447a1ae8ffda7f1e0190d6177147c68b2bb6fd06a6246d8a03782f045f6cef3"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/vcad-ir\u0060 (18964 LoC, 206 module-visible types across 2 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e95457cba3e9160febfe94cc05dce64193ea6a120c26ad475ce88b3b78ab65"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/engine\u0060 (10752 LoC, 266 module-visible types across 1 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f117bb86fe3f4fe54f2770c6cfd18a107e709e38e2ec806e7eb2f0fc0bd9d0"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/docs\u0060 (6290 LoC, 72 module-visible types across 22 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2038944e165b7cf3a8bd59937c6c8d8a218c2746ea2ab207e4c414b561ecbcf2"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/core\u0060 (13165 LoC, 201 module-visible types across 9 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"543ea38be1cedd4a6bc3b31fb12be13b38cdab8ee1a3e17ab3a5ac006fa4ff73"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060apple/VcadVision\u0060 (10717 LoC, 122 module-visible types across 2 directories) overshoots its size bounds. 10 of 118 build unit(s) (Cargo, Python, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadVision/Package.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"622b18eaf9c55311624a26c6c4f556a5ae217b31c7351fd99d8c602c148cbc0d"}},{"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":"7d1c6a0110ef01796a5ce7b7905bc65e13cab2b78e5e8b9fdade5fce30c2353e"},"properties":{"commitSha":"85042d7a92e87170b1f632d461cf551978d8820d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"ef6994a26fc05ab4694bd9de1f867b982da56f0ab951acfed701b3ef3cf5c855"},"properties":{"commitSha":"3ff74912bd9ff6130e71091968fc9c2e5f816d4b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"15c6fb4b7987cf71175efc51e2e032f227dbb27a66049839039f530ba322e9bd"},"properties":{"commitSha":"dff579cb1d534b72c1683705dc2d266d0c21a494"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"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":"fb362173987ef13e95a73aeba96eb174ead68d6f1ce9920820db1bb817b5022d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15dd43dc1677a4971caf250ee371ecb547b7054cb4687507d03b492766e0fa23"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba93ac799591bec8c3f4d5dedaea4c4f8f98ec52a7ccab674f7bcbf058aca715"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20c5f55efccf0c0011f756c69f7eed54c13ddf39bcb6d46243ed7a526a306b25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"108b0ae7940a0b429b2701c665d7af5845783864509baf18e517b0ca72965feb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe211dba8f04cea8adf1913cd2ef1e076290fec282e832c1666f07fa21edcdf8"},"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":"088394f11c92b60ae93b74e1d788645bebe1420a0202e88316b16dc1d71736b7"},"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91a9a07de525ab8ad2fcc8a0d030e63b249791ca7a01a8c961bcb33d20857531"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9294f7deb8e6616388ab8f82c363c025e26378e26f68c6cb2e93b8c329c0cbd8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b362aa4f8adb4306b3d145674ff15a61aacd3d276d618258794efce080a924e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd8c698bc33856a35850a875259ec8d41f0f03edf92950e02a346580ce07e6af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a913690fe8cab11c1bf034567b6278ece652067eabb5c1894d5604b413f319ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19f2b0f7f0fdbd4ec620a17b9b98906a0eed2dc29f5e89caafa9794981bd25c9"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac8eb79dfa01848c9591d4d3d4639a6823be4bbb96d16a40df23728da77d6f08"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"774e84eaf65696bacc627959839c1af1927b88e5fcbe02a78f7a8b8671c240ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"544c4a2303e57e60958ebdb6fd0080ef710d74b76fe4c14761c1aedd5f552ab7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99c8716916ca0dd9ddee8302208a5745bab6513f34ca12c2672d93f07c07be5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61146628abcb14f96f83ba5669ac6e9257cac15b64555c6536dd7d4f400920ad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af36230d14dcca852b9dc9839e70be3cd5f42c454d65f415953d610a90396f98"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"311f2b1dd969a2ef73985fc36dd91e65e3d6a6cb49a0706cd68e381199f12c7c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9288cb9601314ea9a5685f9e586cf1ba51ab0bb8838969a5bcd635c80eff2bf4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6a6d49203805cdb679d421a8043ac39e7b032144f8312d45a17e6946daaafca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40eacf4c9661dde5370cef87da9c1e9ecbd3e4c37321ed6a3eee0061349745e5"},"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":"7e9323362030c11a89ee75d7211b2720333c55d8869ae68ed4aebea060c08384"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbb3016e08588da0295feed2d3c1aabf07e14aa98db895f7d8608ac6dac5e7fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f1f6b90732b5eea89d75c8eb56c22b34b013eedba4193d1346effc97ca5f250"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b81debfdf26ad72c8d0b6ae327091ed6b094389fdb86a94cad6363ea8f38e48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e22fa714af38036b109f9493501c28af262c3a9a1a2d30d80f7ec23c8ecb75e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e837e05caf65a13dbddacf846b6e18d603ec33575289b0d2e546044f4de06a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dac9efe9aa55e83168a5df4bddc13ee8b77c90a5def1ee14cc57a99b2a338a47"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9321e063ba870b9fa9f8a292ec095251832c5ea6c7adb11644a1beeb0e3cb0fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29a09f4294e5583224d47bcc09ff1c42d42588ec325e84788795a73aec665154"},"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":"80f685af033e0e099551def08b89d30a6670f0f98b9ad406109e5f4b7115f189"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"327da793849e481440b58e14776909c9df46bf992255336f59bd3738a87a7177"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1397014c9f4ef07a7a0f4b8f9180bec7d22fa39520ae243ef38c5d62e5307c92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0a068fb03161e66265b32614aca2ab69c51b34b916068bc58726c6d769510a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09bab50a0a22741ac945ebc2761bd21edd9dff741f1a2bcf8ef2bb7ff60763be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8366f89b425b9e673329082c845c8b6149027e3b6f6e2e455f66ac49af0a9d97"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-668","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb487c23a18cb689439afc2fa8d9f5108d2e2f7f499a97a73c685c43b896d3cd"},"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":"24caf053bb4fba1e91d2636a0fb9b3fc5fee7254fc02d9d46547c37c29553b66"},"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":"0ce614a50d773b62dba2ecd126790ca5ffe5d143575fd80950d2acbdaa87f3e3"},"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":"648b00a132b8ec9f5a987b380df73eebfc32da5bba577bc2d58e84d1ed0a0a4e"},"taxa":[{"id":"CWE-269","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-4","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":"5b21bd381837b7d09b23005cfb96d5caba538406b8920f74eaff0a91d3ab1f8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66c044ea6686c0d0601d23a8736b6b8db2b5f7c19c515ed3766f3969bbdf39bb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"282e57431e3e0042b6aba1c47f36fa0e50fd8a4bb4394639fa55c15f57406acd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94bb28114a4270dd2419a01e4c0aab0da0293efb56e11d58fc0acb37bac51821"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8599f52a618b0d4324963acc638f3beabc13887b83b8b5271b8e3c89c0cd249"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34d1e5a56fbe8a37eb63af9be52bba38c70d631868bfaeb3683a4fe6b82e4504"},"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":"ba6a02f374f1d03e6033712d87335f80e666c91d7411b2ae88d71591ea904415"},"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":"9dc402f4bd8d328daff1ee62feb527dcdbfa5dc3aea033a60ffce1161351bcee"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22fea79ae44d846f061641a3dcd6db0bf65f1a78cb74c81552ac30ff39a3b921"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"248b4d647bf0278957774d8972ef542f30a7b7c5586635a078b52d3242b42f93"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66fa2384199cf66f6221b6e46d7213b8c322d0a59f95ae7594fb44dc9ef8b978"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21a021dd80ef9f9d2c6babe3bfb7cd6add4c8c3efb76eb4aa04749031a3c8d25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3577de7bf6bc613beffdb241b37a300c38a9d276702415f6822499e45d4cf1f5"},"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":"61345540c83775eae211a1c0a5d5b098c4c3e8c4777104152322c6ff8a66c979"},"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":"edc414d86c9438deb5581bc1d494ca3f762c1fd1684e94190aad1316892036d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d35ba3f0c80ef71626c3877883a7f390781f23ffe0e24f7a4401d2752d03882"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e97609a362f4d72b1282dcc5ae18b90bacd72f4c9b9d58b2e1aaa5dc5e31c76"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6a655774a4cda0ecb41d7c401886bf0b6805c6c52182eec88e7ac09c77fd9b1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48c8785c5fc7221f10e80eddb1b5608727440892775df88980f68c88523b8758"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b043c21e2f1fe14030ea0e16012c6fbaa1f907a55995afcf26b7eb965171822"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6f27b8f8251211f0b4cea8d421129f9cfe507c24923c0cad21263bb7bd9e382"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cafa556f209dc5321a062cca8337431915deb60ebca50967390938918b7cfd5c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4dc57d3f5c43267c7cdbdbb496f965395783c2c3a0e401f0757da45180a282f0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5a5b8ac6bba77605712bccbf436530ce9127dd8fce4b96632b9eb6ebed8aa89"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c765c17ac13ff19f8e9a4d5db9e9c984c4dee2767f836fb453ec8a71ca1ed512"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbb30dc9bc942ce9185f29f1004d41151c2bbf1905e5f65ce9d54c9163782616"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f63363f3c00e04d5df9a9ec18f8c62b3a98cc3dca094332392a0807d9c3b03c3"},"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":"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":"79c69997798acfdd03c66f1e87887d84c0fb362054ea769123f5575629b41ac3"},"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":"2381aeb536dbf749916d0c7da778d19ef4a710a478ff7ebfdab2909c2ac96135"},"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":"69fb0d108578cfade3ccbbeb9ff2b67fb19051303b92cb935d4d87403aad49f0"},"taxa":[{"id":"CWE-570","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-571","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"aed75c260ec105bf2f864b33e3ec1cad2e8565128f0b53c44117cc06213754c0"},"taxa":[{"id":"CWE-570","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-571","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"8394cdb6a9e95cd3e37d99792a48159b3edf705cea8de99da99db2dfd0fcabfd"},"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":"503c3b575f9ea30bf64209ee1b400218eb2d90c9e358a6ef828b661b74903e94"},"taxa":[{"id":"CWE-346","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"9a38a6dd705919fea34573e52005e133c4f71836c11ccccedd329e6f2acdf269"},"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":"02fe66691f1c66172b8f20705a2f097643dbba7056cffffcaf96edfb572ce9c2"},"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":"545e66a1055aa06af012faf7ec72307f245ef5cd753f887db7b3c8cc19aeb9a2"},"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":"6c53b7767b8791fb22b70d234f4d23a03e08355f1617e4da59e1468146dee0fa"},"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":"af79246f5b3e41aabde080cf4725ad4a9862b0545f0a90e8e6fe6156ed57ec60"},"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":"986200615f72f0666f12f5d3ed111702172b9a5ecf1cdffecf2338c5a0c185f6"},"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":"8653ab9cc10bd57c5f56a02085224fa0f5e26f868558386e56bd3de44c8b7ec8"},"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":"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":"e807de8a1a94bb72ed921dd71d53aaaeac78c49008aab17add51f5ce275e0e94"},"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":"181215893da5a34fc816cb04903e74163e9036c608ec84443d338a803c7799e1"},"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":"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":"93331c66ff09b473a377a2b2879218a0186bb571ddbb6ec0b21c351930f77f8d"},"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":"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":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"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"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"2","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":"5b8cd370d92a0f9f962ed41430244bfadbd58e59f4c85bbc172f4f78cf89e619"},"properties":{"dependency":{"package":"torch","version":"2.5.1","advisory":"[GHSA redacted]","aliases":["BIT-pytorch-2025-2148","BIT-pytorch-2025-2149","BIT-pytorch-2025-2953","BIT-pytorch-2025-2998","BIT-pytorch-2025-2999","BIT-pytorch-2025-3000","BIT-pytorch-2025-3001","BIT-pytorch-2025-32434","BIT-pytorch-2025-3730","BIT-pytorch-2025-46148","BIT-pytorch-2025-55551","BIT-pytorch-2025-55552","BIT-pytorch-2025-55553","BIT-pytorch-2025-55554","BIT-pytorch-2025-55557","BIT-pytorch-2025-55558","BIT-pytorch-2025-55560","BIT-pytorch-2026-24747","BIT-pytorch-2026-4538","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]","PYSEC-2025-189","PYSEC-2025-190","PYSEC-2025-191","PYSEC-2025-192","PYSEC-2025-193","PYSEC-2025-194","PYSEC-2025-195","PYSEC-2025-198","PYSEC-2025-203","PYSEC-2025-204","PYSEC-2025-205","PYSEC-2025-206","PYSEC-2025-207","PYSEC-2025-208","PYSEC-2025-209","PYSEC-2025-41","PYSEC-2026-139","PYSEC-2026-1856","PYSEC-2026-1970","PYSEC-2026-2286"],"severity":"critical","fixedVersion":"2.6.0","relation":"direct","declaredRange":"2.5.1","reachability":{"kind":"production","file":"packages/training/src/modal/distill.py","line":103}}}},{"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":"d1521d4df38892c8360f4021e3e60a84abee4ddb3bd9a9223f7ca0d504e933c2"},"properties":{"dependency":{"package":"tinypool","version":"0.8.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"2.1.1","relation":"transitive","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":"df8f56dfb92ecb4f71cbe46dffa6af77dc7783ecba0e4d6e3b2479d16b574058"},"properties":{"dependency":{"package":"vitest","version":"1.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"3.2.6","relation":"direct","declaredRange":"^1","reachability":{"kind":"production","file":"packages/app/src/test/retirement.test.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":"5d0a084d1da58d8cd9d6d7c2956f0d261e7d597c6ac872e9536400d84256ff82"},"properties":{"dependency":{"package":"basic-ftp","version":"5.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]","[GHSA redacted]"],"severity":"critical","fixedVersion":"5.2.0","relation":"transitive","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":"6d0202c0af112e7f408d17f99c72dfe7b030d289e4f9d4e8404817b641067567"},"properties":{"dependency":{"package":"next","version":"15.5.12","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]"],"severity":"critical","fixedVersion":"15.5.28","relation":"direct","declaredRange":"^15.0.0","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":"8eadaffed1ce7cf93d5c7d2f9a54cb49017c8fdeafe15dc17f5f236a10357e21"},"properties":{"dependency":{"package":"protobufjs","version":"7.5.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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"7.5.5","relation":"transitive","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":"ba831e8008f54eef34c69d23d60a7349db4fe946ad38a09b1fb71d5742e890f1"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"2.0.8","relation":"transitive","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":"1b422d7d2acf4ec86c8855b185b5bb8a76f746739db2b625b71467e001072cde"},"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]"],"severity":"critical","fixedVersion":"7.5.19","relation":"transitive","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":"6a4cc08f2e7fcf785d9b0f6f190c9745d1d1e7cc1f61eea922f369019ec1c3e9"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"2.1.1","relation":"transitive","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":"a1719c6c95fe6eed88ee229965695947c4b1fea22b394f0a9e0c24517bf0f7f4"},"properties":{"dependency":{"package":"vitest","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"3.2.6","relation":"direct","declaredRange":"^3.0","reachability":{"kind":"production","file":"packages/app/src/test/retirement.test.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":"6e3ebeec64f84b23ef64b65326c3fbeca565053e1cd69e730e412591742dcf89"},"properties":{"dependency":{"package":"vitest","version":"4.0.18","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"4.1.0","relation":"direct","declaredRange":"^4.0.18","reachability":{"kind":"production","file":"packages/app/src/test/retirement.test.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":"568461a6b94639b9a1aa36653e27227b87a331f4bf6433de765559528d9520fd"},"properties":{"dependency":{"package":"aws-lc-sys","version":"0.37.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0042","RUSTSEC-2026-0043","RUSTSEC-2026-0044","RUSTSEC-2026-0045","RUSTSEC-2026-0046","RUSTSEC-2026-0047","RUSTSEC-2026-0048"],"severity":"high","fixedVersion":"0.39.0","relation":"transitive","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":"b5308f9ed219ff7d361ed2b01ab7b5fa7a33b0013fcd35575e7068ccda1d2997"},"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"],"severity":"high","fixedVersion":"0.11.15","relation":"transitive","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":"ca666bb8e33095597ecefcb13784b601b567b856fe3f5877bf4e6b8d175b71e7"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.102.8","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-111943","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2026-6809","RUSTSEC-2026-0049","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"high","fixedVersion":"0.103.13","relation":"transitive","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":"0d5ffcdbd7f1c3ca199a0fa3b1b00feff135e9dee2ce99e4d99f0478b6d04134"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.9","advisory":"[GHSA redacted]","aliases":["BIT-golang-2026-111943","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2026-6809","RUSTSEC-2026-0049","RUSTSEC-2026-0098","RUSTSEC-2026-0099","RUSTSEC-2026-0104","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"high","fixedVersion":"0.103.13","relation":"transitive","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":"6d357eafe05aff91d1c400391ae356b15c4399b451239199b16564195b261cc8"},"properties":{"dependency":{"package":"transformers","version":"4.47.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]","PYSEC-2024-227","PYSEC-2024-228","PYSEC-2024-229","PYSEC-2025-211","PYSEC-2025-212","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2025-40","PYSEC-2026-1977","PYSEC-2026-1980","PYSEC-2026-1981","PYSEC-2026-1982","PYSEC-2026-1983","PYSEC-2026-1984","PYSEC-2026-1985","PYSEC-2026-1986","PYSEC-2026-1987","PYSEC-2026-1988","PYSEC-2026-2288","PYSEC-2026-2289","PYSEC-2026-2290","PYSEC-2026-3929"],"severity":"high","fixedVersion":"5.3.0","relation":"direct","declaredRange":"4.47.0","reachability":{"kind":"production","file":"packages/training/src/modal/data.py","line":10}}}},{"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":"b7ddab1ba79f8e43ac14076c5819d4793d112af9c64498d8d8f617b195108f7a"},"properties":{"dependency":{"package":"flash-attn","version":"2.7.2.post1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-2477"],"severity":"high","relation":"direct","declaredRange":"2.7.2.post1","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":"3f96d4f259fed034bf97e5602b2c9dbf0fe4a45417a6b6ba36452a96f1eba42c"},"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]"],"severity":"high","fixedVersion":"6.4.4","relation":"separate-copy","declaredRange":"^8.0.16","reachability":{"kind":"production","file":"packages/app/vite.export.config.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":"5163547957c66bdf78eec5792bba6ddf14d66ba30a16d2b008813acd0c80adb7"},"properties":{"dependency":{"package":"@babel/plugin-transform-modules-systemjs","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"7.29.4","relation":"transitive","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":"f2f4833b0ea817fe9bf97781527a3e44c5ecfc3d3ee23715ff1f84ccfb6e91f3"},"properties":{"dependency":{"package":"@fastify/busboy","version":"2.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.2.1","relation":"transitive","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":"021a462d634533189c9eb9cbc330b51ce9241ca1886f8e7157f9b9367e136fb3"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.19.10","relation":"transitive","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":"3602f78c557550a27892e5c6fe078966c3cb2f2c785918f4bdf138d7c9fdb22f"},"properties":{"dependency":{"package":"@modelcontextprotocol/sdk","version":"1.25.3","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]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.32.0","relation":"direct","declaredRange":"^1.0.0","reachability":{"kind":"production","file":"mecheval/harness/src/solvers/claude-mcp.ts","line":117}}}},{"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":"7fa3a8c73d04b840ce84c179420c73f20db410528997c18fa4c2d46346013979"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.0.4","relation":"transitive","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":"8b02d0f067b98387f9f48ab47fa24eb4ad8c9209457a4bf4c3a415f86353459a"},"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]"],"severity":"high","fixedVersion":"2.1.2","relation":"transitive","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":"568968e81a1d54f6e7b7def3de5679afd3cd8e0ef7005860b07d53c28f07ea88"},"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]"],"severity":"high","fixedVersion":"9.0.7","relation":"transitive","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":"2cc576f901372b8e3bad787464f3d88f3b0acce915311a5de02eb3c28f224a53"},"properties":{"dependency":{"package":"@vue/server-renderer","version":"3.5.27","advisory":"[GHSA redacted]","severity":"high","fixedVersion":"3.5.42","relation":"transitive","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":"9eabe50e921d2c2a306c1659895f52c11083f6a9b5afd9baccfb22db496e06e7"},"properties":{"dependency":{"package":"body-parser","version":"2.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"2.4.0","relation":"transitive","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":"41c0dc7f96cda89db9be9c054a92a44ac417ea5f847a19bbd6a7e91777859867"},"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]"],"severity":"high","fixedVersion":"1.1.16","relation":"transitive","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":"384a0892f51a77ce6e1097a5154e203805ee2ad75d30693634ca5b796c0008c6"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","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":"5ca84da454ac61c198d7e9c07ef4fbb4c0f548df1f0b6cbfcb06653d0ba89184"},"properties":{"dependency":{"package":"devalue","version":"5.6.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]"],"severity":"high","fixedVersion":"5.9.3","relation":"transitive","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":"c8b7a7ef828a221922c2cb3defa7f826bbd651905bbf3a5c2f1cc8244ee63fa8"},"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]"],"severity":"high","fixedVersion":"3.4.17","relation":"transitive","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":"dd5b5bb5ff8737ef29043af986439961876b394145dd0284a62660211f33da4a"},"properties":{"dependency":{"package":"extract-zip","version":"2.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","relation":"transitive","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":"2567ea2f56ae79977dadd3bf380bcb8e0d5204997d0db598b3e49e1891ff5525"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.3","relation":"transitive","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":"2bbbda2d59cf2db56a7961ace2aeced7c05e0274c6e4717fe3840959a422ced1"},"properties":{"dependency":{"package":"minimatch","version":"5.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.1.8","relation":"transitive","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":"a51cd9bac6da640e38cf883c1ea361c13f6e25c446f4643782afc1591a1c03f1"},"properties":{"dependency":{"package":"flatted","version":"3.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.4.0","relation":"transitive","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":"8645c87b8e8cde81724180b15f178db8239ce7561d62a3e6e45f51db28c7a5d0"},"properties":{"dependency":{"package":"form-data","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.0.6","relation":"transitive","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":"99ce6072697b63011fc367992107817b347f6d58c60197d2f12ea3ebcf7bb6e4"},"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]"],"severity":"high","fixedVersion":"3.15.2","relation":"transitive","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":"ee757e45cf0ecd72bcfa928048a96444188e226dd76badca75c89093a0598286"},"properties":{"dependency":{"package":"happy-dom","version":"20.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"20.8.8","relation":"direct","declaredRange":"^20.6.1","reachability":{"kind":"test-or-tooling","file":"packages/app/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":"a59d8b1453f784b335dd86e14fce5925604dbea6330bfc74d7748c50a4a540ea"},"properties":{"dependency":{"package":"hono","version":"4.11.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]","[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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.12.25","relation":"transitive","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":"0e15528936368bbc2bdf9334b3a19e3d20fb04dfc15527dd4136931f5b47f9e5"},"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]"],"severity":"high","fixedVersion":"10.3.1","relation":"transitive","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":"3b25924ff22459f967a15f90b500d8daf8c7a4bda9d8ad9f7eda1429296c8faa"},"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]"],"severity":"high","fixedVersion":"4.3.2","relation":"transitive","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":"ce9074a8ca02728fcc1d03753ea9d91376f00dae795aa598fd65fddb2b7fb34d"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.18.0","relation":"transitive","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":"2945fa19de2f278a5af6193f7b1cf9aa2c63f3f992b2a74f8e8269d5a4fa6c37"},"properties":{"dependency":{"package":"dompurify","version":"3.3.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]","[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]"],"severity":"high","fixedVersion":"3.4.17","relation":"transitive","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":"4b504b680cd035afc6796c71586b5aa7fd1b2cc25f32620dcf774af307d8d286"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.4","relation":"transitive","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":"70f544d431e25afe918100b209322ac6d76a89bc6df9fb14cb0d4233612c3528"},"properties":{"dependency":{"package":"nanoid","version":"3.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","relation":"separate-copy","declaredRange":"^5.1.7","reachability":{"kind":"production","file":"packages/app/src/lib/doc-id.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":"afb4d3536a6ba8c19d2eb7ec61032053689d47f4973e22bb641b35c4601e43ee"},"properties":{"dependency":{"package":"next-mdx-remote","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"6.0.0","relation":"direct","declaredRange":"^5.0.0","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":"a1e03b14734319d875bd0dac1f97ef300c97b23c9a470ff6af28213112e543c4"},"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]"],"severity":"high","fixedVersion":"8.5.12","relation":"direct","declaredRange":"^8.5.0","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":"c8f0d92c2ef7b82bb7e52325daa4cb2b1dbc14b013940332eed15e39c28f8a03"},"properties":{"dependency":{"package":"path-to-regexp","version":"6.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"6.3.0","relation":"transitive","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":"b71e29a6b9244c14827e7af3e6d442c539ebfefc5e829bc64a68e028e38153f2"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"2.3.2","relation":"transitive","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":"26d5f75a0d82ebf7bb6d798799d516a1274998c898cd6e86e6ff6e15e48bc980"},"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]"],"severity":"high","fixedVersion":"8.5.12","relation":"direct","declaredRange":"^8.5.0","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":"a9847e81eec745faf231324d7aca0d393d31f4239a97e2ce24191828bfa4abd2"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","relation":"separate-copy","declaredRange":"^5.1.7","reachability":{"kind":"production","file":"packages/app/src/lib/doc-id.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":"80ecc048fdc844bf084e8c5be4ffa844a1aa96ff8e26e803608a0222847a4a7c"},"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]"],"severity":"high","fixedVersion":"3.4.17","relation":"transitive","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":"968d088e6f5642e35caa5050db0797206d0d795d6387923699fbe8367a89f8ae"},"properties":{"dependency":{"package":"rollup","version":"4.57.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.59.0","relation":"transitive","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":"6fbc5a7c89cead5b8b347ba84bc1ec1d833983221aa99e26d3a329f4831cd890"},"properties":{"dependency":{"package":"path-to-regexp","version":"8.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.4.0","relation":"transitive","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":"87839f7289af0999d94a99db6eefa4a0c9cb8f6ea36e8599abd5bd35ced532c8"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"7.0.3","relation":"transitive","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":"9ac7e4fc946bb3706acd0f81c1dcd621af46b7d1ade09f7cc6e4dcd9c55ab36b"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"0.35.0","relation":"transitive","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":"a143e49def50f6267786be10dea52190e0d09245364207bf6c8be5fcae3b49ff"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","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":"6532f69593dd3d2ea46577ad478f1657ba969b6919f855a6261cf5feb9c06e85"},"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]"],"severity":"high","fixedVersion":"6.29.1","relation":"transitive","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":"cdacb73335d46145fd9547396c51bb6a1b5fd21b94c9714ee28395cb093dd159"},"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]"],"severity":"high","fixedVersion":"6.4.4","relation":"separate-copy","declaredRange":"^8.0.16","reachability":{"kind":"production","file":"packages/app/vite.export.config.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":"729326480c9073bc2d1d31a2fa7989ce0f536e0fb275bac7945769af24201c3a"},"properties":{"dependency":{"package":"minimatch","version":"10.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"10.2.3","relation":"transitive","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":"6eb70a44131f70ee269ff9a7a1575e538c09b4c1e9580734cc7cd873eecf826b"},"properties":{"dependency":{"package":"rollup","version":"2.79.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"2.80.0","relation":"transitive","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":"5ccda73bd0143d5fffd3dfb7039e432d604944b26bd87c7e38e3f0435928ff6c"},"properties":{"dependency":{"package":"ws","version":"8.19.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.21.0","relation":"transitive","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":"87acedc051cb89a8ce4b5f36de7264e8d1c5c5fd3ed662cda178e80e0c31f9d8"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","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":"d2024823dac9ffd51fe8b624d880bdf223e10b7620fb891b0c88fb32ae04489c"},"properties":{"dependency":{"package":"nanoid","version":"5.1.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.1.16","relation":"direct","declaredRange":"^5.1.7","reachability":{"kind":"production","file":"packages/app/src/lib/doc-id.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":"62bbf88de6da3a507a579b49f409634842dc8438e54d9df9136d44b3ceec1cbf"},"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]"],"severity":"high","fixedVersion":"1.32.0","relation":"direct","declaredRange":"^1.0.0","reachability":{"kind":"production","file":"mecheval/harness/src/solvers/claude-mcp.ts","line":117}}}},{"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":"46d0e3d1b1375ac21ded97593a29153e4fcf476a8a23dd4bd90dd897d986b144"},"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]"],"severity":"high","fixedVersion":"10.3.1","relation":"transitive","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":"0bf096d3db1cb3c0338bf4b86f3fb2e074fad4a222bc6be5e5c835efa80c443d"},"properties":{"dependency":{"package":"nanoid","version":"3.3.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","relation":"separate-copy","declaredRange":"^5.1.7","reachability":{"kind":"production","file":"packages/app/src/lib/doc-id.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":"a123c7a8538ef5659aefc6b6b9bf5ef92557f2acc40c94c7874d873c9193a516"},"properties":{"dependency":{"package":"postcss","version":"8.5.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.18","relation":"direct","declaredRange":"^8.5.0","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":"bf2e0b1b1f098885f39223033b513eb00091e859ae76e7f14d15bd084af91ffa"},"properties":{"dependency":{"package":"vite","version":"8.0.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.1.6","relation":"direct","declaredRange":"^8.0.16","reachability":{"kind":"production","file":"packages/app/vite.export.config.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":"28671dc76a9274e13985f14e2223adc92b0df444cae6eb0c649be674d8f60315"},"properties":{"dependency":{"package":"nanoid","version":"3.3.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","relation":"transitive","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":"1296fee0441ac9823134bf069b1f90f292a29fa6a381ab50311c2ec2f3bfe8c1"},"properties":{"dependency":{"package":"postcss","version":"8.5.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.18","relation":"transitive","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":"120026b435b015740a87175d5a93e2891c8152b0c941dcfaa6a50af0ae03f654"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","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":"283790bba631a60d9bfb9dc8d8bb8470750ac40f041e821f82d36c849b1fb23b"},"properties":{"dependency":{"package":"vite","version":"6.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"6.4.4","relation":"direct","declaredRange":"^6.3.5","reachability":{"kind":"production","file":"www/vite.config.js","line":1}}}},{"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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.100","advisory":"RUSTSEC-2026-0190","severity":"medium","fixedVersion":"1.0.103","relation":"direct","declaredRange":"1","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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","severity":"medium","relation":"transitive","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":"904cd12f65d71ca63d739c739b4c100bf718e7d129ce5630aa4dba7fa6968b6e"},"properties":{"dependency":{"package":"bitmaps","version":"3.2.1","advisory":"RUSTSEC-2026-0247","severity":"medium","relation":"transitive","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":"ab113f4511e48d081edf02734f13997952fa6a37abe69cb57e9ba1799ef70f7c"},"properties":{"dependency":{"package":"bitmaps","version":"3.2.1","advisory":"RUSTSEC-2025-0167","severity":"medium","relation":"transitive","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":"7cb949b0dfc97628adeb5867f44cfbeefa3a6a1068b707709bf0e421e653ea4f"},"properties":{"dependency":{"package":"bytes","version":"1.11.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"severity":"medium","fixedVersion":"1.11.1","relation":"transitive","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":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","severity":"medium","fixedVersion":"0.9.20","relation":"transitive","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":"899d657a460ee3b23a677240291f1b37781f467768f31667811bc348446cd417"},"properties":{"dependency":{"package":"imbl-sized-chunks","version":"0.1.3","advisory":"RUSTSEC-2026-0292","severity":"medium","fixedVersion":"0.2.0","relation":"transitive","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":"525150c79769e3a8552e1d639a767bc181c181d5c769963ba9e0faa9d03741e3"},"properties":{"dependency":{"package":"opentelemetry_sdk","version":"0.30.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.32.1","relation":"direct","declaredRange":"0.30","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"transitive","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":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","severity":"medium","relation":"transitive","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.36.2","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"medium","fixedVersion":"0.41.0","relation":"direct","declaredRange":"0.36","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":"2b12450bdf9717b94caab76a31df6989726f3f28292dbe6c6bdee37762db576b"},"properties":{"dependency":{"package":"quick-xml","version":"0.37.5","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"medium","fixedVersion":"0.41.0","relation":"direct","declaredRange":"0.37","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":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","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":"d44a25813d8a9e18eb42fa5350a972c298292d454155c6472f091bfb670363df"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.8.6","relation":"direct","declaredRange":"0.8.5","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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.3","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","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":"22995033016ae3861d571b2c92ada6244555e3aeec08bc870b909cda12b35c06"},"properties":{"dependency":{"package":"rustls","version":"0.22.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.46","relation":"separate-copy","declaredRange":"0.23","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":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.36","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"],"severity":"medium","fixedVersion":"0.23.45","relation":"direct","declaredRange":"0.23","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":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","severity":"medium","relation":"transitive","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":"c795587949c2d040aea2ef2c169f9ae19b065e8fcc367a8f18a406d7f9fe8cad"},"properties":{"dependency":{"package":"suppaftp","version":"6.3.0","advisory":"RUSTSEC-2026-0271","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"10.0.2","relation":"direct","declaredRange":"6","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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.49.0","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.51.6","relation":"direct","declaredRange":"1","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":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","severity":"medium","relation":"direct","declaredRange":"0.25","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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.5","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.0.10","relation":"separate-copy","declaredRange":"0.26","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":"d43a6895772e1e5693b01bbcc70c6626bdbb2ddeccef34d99ba0c292a13e40c8"},"properties":{"dependency":{"package":"datasets","version":"3.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.1","relation":"direct","declaredRange":"3.2.0","reachability":{"kind":"production","file":"packages/training/src/modal/data.py","line":9}}}},{"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":"dbcfe01935d9c0c8d82e3e6bfd7ac40665b3f5ed78a291db2c7e5bea3a45e42d"},"properties":{"dependency":{"package":"accelerate","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3804"],"severity":"medium","relation":"direct","declaredRange":"1.2.1","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":"1409039748496dc48e5dfcee3f5328ea5109011969bd96498f53bd87105eb11d"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.0","relation":"transitive","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":"8db941d41b8ebaaf90340ee17d7a1817c437d896dbd5e0ca45f3000109266464"},"properties":{"dependency":{"package":"@anthropic-ai/sdk","version":"0.88.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.91.1","relation":"direct","declaredRange":"^0.88.0","reachability":{"kind":"production","file":"mecheval/harness/src/solvers/claude-direct.ts","line":176}}}},{"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":"455a08150f34cd4ab74f8c926252bb3347ffab1e4300f760f6117067f2859928"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"6.14.0","relation":"transitive","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":"aa571a47ecd9af55f36a3364edd0ddcf29c643ee1a3b19589e5f86cf9b2dd947"},"properties":{"dependency":{"package":"@humanfs/node","version":"0.16.7","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.16.8","relation":"transitive","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":"a22ebdfe529365cea4a832418b7e52104fc40be0d8c8e0bf311ebbfcb5e3dcba"},"properties":{"dependency":{"package":"@opentelemetry/core","version":"2.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.8.0","relation":"transitive","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":"4dca4e3069721a2702a13718c748023cc5af2f9f574cb83dbe67c9185f41a187"},"properties":{"dependency":{"package":"@opentelemetry/core","version":"2.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.8.0","relation":"transitive","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":"bedb965e8be2448d6e8f339ed0c258baf1527044db6d2249bf1634a84a1e8008"},"properties":{"dependency":{"package":"@protobufjs/utf8","version":"1.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"1.1.1","relation":"transitive","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":"b3a8801651cdc622a38d0b9b55d519a39aa75a4ce8aae921d0e297cfee0f2e24"},"properties":{"dependency":{"package":"ajv","version":"8.6.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"8.18.0","relation":"transitive","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":"31c3d6c21fd27e5bf9c1a1dd1722d0a58bab730ba40e275105143e79d1c2c07d"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.11","relation":"transitive","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":"08169fc1c5d5e46ec968510ed37158c8feda39851b600687905b57c121bcb3dd"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"8.18.0","relation":"transitive","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":"43427bab5dea8e4a9974d0d31081f6cee7984ed96dc960bd2c33af06bc12237b"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.9.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","relation":"transitive","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":"5d1a84b870a7744d5e38db3b26b85c52e9aed8a5be699c95772fff2489b0b582"},"properties":{"dependency":{"package":"esbuild","version":"0.14.47","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.0","relation":"transitive","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":"68000737525979ea24f79422ab17664a7194c74ee7c522cce0c5ff2439d92d10"},"properties":{"dependency":{"package":"mermaid","version":"11.14.0","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]"],"severity":"medium","fixedVersion":"11.16.1","relation":"transitive","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":"f1f0bc6569043a7a6098431f3be71d829b0a8be45c9fcd91bee9044db588c60e"},"properties":{"dependency":{"package":"uuid","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"11.1.1","relation":"transitive","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":"c98a45274708a8d77bc0379519bd153f209d8e140753a4013f877e2a841ab85f"},"properties":{"dependency":{"package":"fflate","version":"0.4.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.4.9","relation":"separate-copy","declaredRange":"^0.8.3","reachability":{"kind":"production","file":"packages/app/src/hooks/useToolDefinitions.tsx","line":68}}}},{"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":"98645b36f3d8a19e1462b10ae8d23a6853b810993981c4fc4065e762fff2771b"},"properties":{"dependency":{"package":"qs","version":"6.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"6.16.0","relation":"transitive","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":"6c42ba4e479076a57e4543353b1f6f4ce36698859285abad4469ac93e9303776"},"properties":{"dependency":{"package":"svelte","version":"5.49.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]","[GHSA redacted]"],"severity":"medium","fixedVersion":"5.51.5","relation":"transitive","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":"5543bcf4390f3dc89eedeae417ebd0c712132f32f7516c8b1ec8900053c198b5"},"properties":{"dependency":{"package":"fflate","version":"0.6.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.6.11","relation":"separate-copy","declaredRange":"^0.8.3","reachability":{"kind":"production","file":"packages/app/src/hooks/useToolDefinitions.tsx","line":68}}}},{"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":"2aff223913c8faac18b1374e3183ee3416d1f118e5fd10d0e4a4ec6552bd5345"},"properties":{"dependency":{"package":"turbo","version":"2.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.9.14","relation":"direct","declaredRange":"^2","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":"373b1531bb4af6c1e6348beab3c2a8d0abae27f2e33b0b4b84debe373df17ed1"},"properties":{"dependency":{"package":"uuid","version":"10.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"11.1.1","relation":"transitive","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":"254e159535de5a467ea5671a4a81fbc3bf399623b11dcd1fc4071f2230ac5cd0"},"properties":{"dependency":{"package":"glob","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"ecb1107154e802ec55ca85cdbe70d70a0d97d489f92c05a139296378c387cde9"},"properties":{"dependency":{"package":"yaml","version":"2.8.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.8.3","relation":"transitive","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":"c9d630a677257afe7734b42c8c2fe58d6afea6d62626d339ab5fd148adc7e559"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.0.18","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.11","relation":"transitive","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":"2d7c8846e5c2786ac6f200262a5ae377f0a0f36f03fcc336f877638db9b57f15"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"7.29.6","relation":"transitive","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":"8c7d1077e4a00749199d4f937c10098ae6dac026a670c7633bdc6377a9b072fd"},"properties":{"dependency":{"package":"katex","version":"0.16.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"0.18.2","relation":"transitive","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":"66ba6f0c7098eca3584b4b69e7de81443725c7074a0b9235a4bb7be0f17d6c4f"},"properties":{"dependency":{"package":"@ai-sdk/provider-utils","version":"4.0.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"4.0.33","relation":"transitive","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":"3681e0b0dced2dca00be692922bda4012adb5a0234c1d22c53a13969ab5dd823"},"properties":{"dependency":{"package":"esbuild","version":"0.28.0","advisory":"[GHSA redacted]","severity":"low","fixedVersion":"0.28.1","relation":"transitive","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":"da0e144a5d96699fb6e6f9acfa6948ca16a26cfb990f46194219ac441f67b270"},"properties":{"dependency":{"package":"@ai-sdk/provider-utils","version":"4.0.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"4.0.33","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ElectronicsWorkspace.swift \u2194 pcb.rs: \u0060apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift\u0060 (context apple) and \u0060crates/vcad-ffi/src/pcb.rs\u0060 (context crates) sit in DIFFERENT parts of the tree yet change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060e10051f2\u0060 feat(native): net classes, zone stitching, teardrop view, auto-annotate; \u00600617d352\u0060 feat(native): symbol browser, footprint library save, sheet symbols, \u2026; \u0060ff43831d\u0060 feat(native): footprint and symbol editors, hierarchical sheets, pair\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/ElectronicsWorkspace.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f1d70d384910888d08a7be383236265e4f4ee465794ed049d14f632f36354"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ElectronicsView.swift \u2194 pcb.rs: \u0060apple/VcadApp/Sources/VcadApp/ElectronicsView.swift\u0060 (context apple) and \u0060crates/vcad-ffi/src/pcb.rs\u0060 (context crates) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060e10051f2\u0060 feat(native): net classes, zone stitching, teardrop view, auto-annotate; \u00600617d352\u0060 feat(native): symbol browser, footprint library save, sheet symbols, \u2026; \u0060ff43831d\u0060 feat(native): footprint and symbol editors, hierarchical sheets, pair\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/ElectronicsView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e19267f0290593def4ac5af69c5a6700d85fc125fa451895ffcb549a9868ff8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: repl.rs \u2192 validate.rs, vcode.rs, writer.rs: \u0060crates/vcad-cli/src/repl.rs\u0060 changes together with 3 other files \u2014 \u0060crates/vcad-eval/src/validate.rs\u0060, \u0060crates/vcad-ir/src/vcode.rs\u0060, \u0060crates/vcad-kernel-urdf/src/writer.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":"crates/vcad-cli/src/repl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f305479993a47d0a82d5844f9f8d2edc2594ee54af9e28b2484899cb54294b97"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: sheet_metal.rs \u2192 sheet-metal.ts, vcad_kernel_wasm.d.ts, vcad_kernel_wasm_bg.wasm.d.ts: \u0060crates/vcad-kernel-wasm/src/sheet_metal.rs\u0060 changes together with 3 other files \u2014 \u0060packages/engine/src/sheet-metal.ts\u0060, \u0060packages/kernel-wasm/vcad_kernel_wasm.d.ts\u0060, \u0060packages/kernel-wasm/vcad_kernel_wasm_bg.wasm.d.ts\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":"crates/vcad-kernel-wasm/src/sheet_metal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad3ccc9b0f3ccac68c907fc85626ac84f6f66dcdf07e2ea45c9885e5340073a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 sheet_metal.rs, index.ts, sheet-metal.ts, vcad_kernel_wasm.d.ts, vcad_kernel_wasm_bg.wasm.d.ts: \u0060crates/vcad-kernel-sheet/src/lib.rs\u0060 changes together with 5 other files \u2014 \u0060crates/vcad-kernel-wasm/src/sheet_metal.rs\u0060, \u0060packages/engine/src/index.ts\u0060, \u0060packages/engine/src/sheet-metal.ts\u0060, \u0060packages/kernel-wasm/vcad_kernel_wasm.d.ts\u0060, \u0060packages/kernel-wasm/vcad_kernel_wasm_bg.wasm.d.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 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 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"414e29e611dffeafe0f846bf265a052567252029a752e9c80ff0d9c75d4005cc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: evaluate.rs \u2192 validate.rs, to_loon.rs, vcode.rs, writer.rs: \u0060crates/vcad-app/src/evaluate.rs\u0060 changes together with 4 other files \u2014 \u0060crates/vcad-eval/src/validate.rs\u0060, \u0060crates/vcad-ir/src/to_loon.rs\u0060, \u0060crates/vcad-ir/src/vcode.rs\u0060, \u0060crates/vcad-kernel-urdf/src/writer.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":"crates/vcad-app/src/evaluate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"778d3a75cbf20e0fd2cc5104dcc4af03565ed510d55e21729615734d5341c50d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: vcode.rs \u2194 writer.rs: \u0060crates/vcad-ir/src/vcode.rs\u0060 and \u0060crates/vcad-kernel-urdf/src/writer.rs\u0060 change together 79% of the time (15 of the 19 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 15 shared commits counted here, the most recent 3 are \u00607fced6b1\u0060 Sketch on face: sketches re-attach to their named face on every rebui\u2026; \u006051cdded3\u0060 feat(ir): SpurGear primitive with pressure angle, bore, mesh phase; \u006091029ca9\u0060 feat(loon): sweep-rotate swept-volume op for joint clearance cuts \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a6a19f0d92e2fefb76ee527bce82157eb5de7e84b1b18d76b3a2afff28e1a6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: validate.rs \u2194 to_loon.rs: \u0060crates/vcad-eval/src/validate.rs\u0060 and \u0060crates/vcad-ir/src/to_loon.rs\u0060 change together 79% of the time (11 of the 14 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 11 shared commits counted here, the most recent 3 are \u00607fced6b1\u0060 Sketch on face: sketches re-attach to their named face on every rebui\u2026; \u006051cdded3\u0060 feat(ir): SpurGear primitive with pressure angle, bore, mesh phase; \u006091029ca9\u0060 feat(loon): sweep-rotate swept-volume op for joint clearance cuts \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28be7544e14d724aa9073a9d0412e93a684fa6b3618467b80071cf36389f08d9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: validate.rs \u2194 writer.rs: \u0060crates/vcad-eval/src/validate.rs\u0060 and \u0060crates/vcad-kernel-urdf/src/writer.rs\u0060 change together 79% of the time (11 of the 14 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 11 shared commits counted here, the most recent 3 are \u00607fced6b1\u0060 Sketch on face: sketches re-attach to their named face on every rebui\u2026; \u006051cdded3\u0060 feat(ir): SpurGear primitive with pressure angle, bore, mesh phase; \u006091029ca9\u0060 feat(loon): sweep-rotate swept-volume op for joint clearance cuts \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"574307a2f28b365ee1f1eeacc0a86bbfb2716d48c2bd38c2e0388f915cc0a20b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: server.ts \u2194 main.ts: \u0060packages/mcp/src/server.ts\u0060 and \u0060packages/mcp/viewer-app/main.ts\u0060 change together 74% of the time (14 of the 19 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 14 shared commits counted here, the most recent 3 are \u0060fb2f9ef9\u0060 fix(mcp): bound the preview payload so big models render instead of f\u2026; \u0060c32515e7\u0060 fix(mcp): make MCP session loss self-announcing, not silent (#704); \u0060d5954061\u0060 fix(mcp): always attach inline preview GLB to mount-tool results (#626) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bf65a81bcd973992cd87bdfed939dccd261ed0b7485e8eebcff6099a50f508"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ReleasedDesktop.swift \u2194 VcadApp.swift: \u0060apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift\u0060 and \u0060apple/VcadApp/Sources/VcadApp/VcadApp.swift\u0060 change together 62% of the time (13 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060400ba699\u0060 native: SolidWorks / Onshape / Blender mouse navigation presets (#1203); \u00606c6038f8\u0060 mac app: unsaved work goes to Recents, no launch recovery prompt (#1192); \u0060acdac55a\u0060 Document runtime slice 1: scrubs off the main thread \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/ReleasedDesktop.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"befcaa4661219a9762040c01c38c1674773c02005aa8357fbf06e30de1af8a2e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppShell.tsx \u2194 Header.tsx: \u0060packages/app/src/components/AppShell.tsx\u0060 and \u0060packages/app/src/components/Header.tsx\u0060 change together 57% of the time (8 of the 14 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u006002f9d8d1\u0060 refactor(app): comb out Borland-era UI patterns for v3 polish; \u006072723273\u0060 feat: rename log viewer to DevTools, dock between body and footer; \u006077a021f2\u0060 feat: sidebar drill-down, URL state, iTunes-style \u2318K search bar \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AppShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bde49ede9b2337c4fb9473a2ec44c08975246fea750c27523f931d842d3eac"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: FeatureTree.tsx \u2194 PropertyPanel.tsx: \u0060packages/app/src/components/FeatureTree.tsx\u0060 and \u0060packages/app/src/components/PropertyPanel.tsx\u0060 change together 52% of the time (14 of the 27 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u006002f9d8d1\u0060 refactor(app): comb out Borland-era UI patterns for v3 polish; \u0060cf72da66\u0060 feat(ux): two-pane sidebar \u002B breadcrumb \u002B tree mirrors sub-features; \u006087d459e1\u0060 feat(i18n): expand translation coverage across modals, panels, tutorials \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78661ef2cce5d05eb31c13f5911f77ffc94e8c3d0982a55c85abfb29a522bc00"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SceneMesh.tsx \u2194 SelectionOverlay.tsx: \u0060packages/app/src/components/SceneMesh.tsx\u0060 and \u0060packages/app/src/components/SelectionOverlay.tsx\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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u006044d7089e\u0060 chat: higher-level AI tools for common geometry patterns; \u006077e39693\u0060 fix(app): polish selection UI for a subtler, more professional look; \u006081f16fae\u0060 perf(app): optimize viewport orbit performance \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2306dfe9e97607a88c24abaaa9be3478cda808b58c8d18b06e9a4e4c5b569c"}},{"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":"25c67546e61034a911e061f475b510845b139a400f8bde81e3f175b66aafaf0a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1c87fd2a760738d254ef322df420b636a5cf508fb5d3d09627781856b87930"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eb0a957c4c357d528cdc68f3b8974d1d7a33aee6e66fc6dfc22330f935a10d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef419e1650c0bb2fbfb97614a117ec4005f55946e00c310f07cd41bbeca2daa0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ca4cc25ae19f49ef31e29d50a1ff75700f0974a12add527cf00166cbd50453"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7b2518eafe651980dcb7b651f4d561fbe1ba033e23cead308bb5fe63e5206d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38e74bcf3c182a618d6a41cf2923d6600c86581a2fe6cdf939ae3731742cfe9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51dc49d4206f92b4c12304933bcbdafb4839f35b0ed60655200ef15fdf197cb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"903eef393500c4071134a45e0928993081b5929b4658f7758d45eac2a1f7ff6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CameraSettingsPanel.tsx"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba88ace65d5fd7e5b10a2c12732bd3450b9847c564e42d4fdc45221f9db58cd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b472b9f52bee54b81197583c6852af3d9c374cdbe7659b5ddd95ff84671d2d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CompressedFieldOverlay.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba4ba1f8d1f5ffeb944ad376921174e5845a7238fe6958ea276fde5f47dcc17"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e902325467eef2e4169881036d83907c2cee47fc02cc0e5fc4eccc7709733a4c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68e8a0d492a358e236a2640d2316ab3a4fbebcc6af0b668603a3fe31b2b6030"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DimensionOverlay.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a16b768ac5845b8cb8b572f871ad817b9e41ef8722aa93a519f1d7c1a1e02b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d52b94498cec86864008f232028ccd4f6a952afab9caf167b5904d1aa6f07f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8494bb347f7668263bc70dcf7741cba017773e6b0d8f9b48fa0e4097640d0240"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"10baeba6c8f19dc9dbe18044446476c28f43a88405bcc9db5dc8cd5c4e65c4c1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9342906beb09234ab7d1f1b3d56dad769e9f3adbfb5777a810ef27752cf91d7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e10a680754ae5f1833efce79062030aae43bf920e7bf71970e41ad1efce674"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ExportAllPage.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11ff126ef25b9831a2aa3ccd84b526f20e5858942c81a677cd79504670a05ec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2da2792240e2c606b4a48aed545c5f1bc244247a7bfe983cee538e7c1eaa35"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeedbackModal.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cbe137a16107c4f460de1f8bdf80306cfa1dc705a80823f9292c8f09f2bed0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e91dcee5ec6720f9d43dda992b7bb47b8fcc9309215ccd8732c3a73d40a683"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafbf9d2c1063f9dbce233b97327ea89304180841c49d1906e50ec2607d58779"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e377fa387426526e5c33a5243aeb27e82bcb3b6f675eea6e63a20c1faa18a47"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb013c1712d8a0f0f356d4f4deb4ecdb2e3f8bacaa380380609ce3a2902f3c90"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5004abd58894823a3e1e419b86e78c0d85b068486ea29eec4b8d3231b3cc9522"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"920adbc8810a63d6dc067cfe62809a4e609999ab8a025ed5a6f5d73a980567ef"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1b2b19f37c5e54eb3431d5b0421e845a94c7716be6abfd390973d0e482a124"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b6290268549416d04329e5e376d0abd2f1c8c4e7aa374e57846b9223a8e813"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"28270cb8b379d0a7636e88e6adfdb9ceff9a2719e286767f4f6759973423329a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b837edb9cc0bd6ced99d5d6a4a2097738e6213bc9b8b8bc73dddcb044308d590"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b58bf2b472d0d2cec37f190a23a64bbf3e0ec3a210f1ce2c67fd02e2bb12c4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9977880023c639b8ec72f8e5da75def2c009ace2e747cdcea5d2a27962821d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f935c5c3704b6387ab0cc3626fae86648b3767dfdefee2cad07fccbd0cfd65"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b4692ccf4bad933fa6d1493fa1025696d2c136f7828a3c43a208297d3aa232"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4e6314bc6e99c68382e341f6f2ccda4fae8db09c35c1e1817a1b531c59fb5b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a4aa993226b2f6e158d2d0e84af0d65ca638232346ce4857734c222b33ad2a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5774562f8aee68b80b9981005dfecbda27772302be5b5f4d3655d1f7d7e34ea"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e235e0f9a895236e984fa407d4ac4a66eff5d78529352630847828369a830751"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d629af104d459ece8ab7ef3a2478bb51a54817e67ee9a58954e48248d1eb70d2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"175cded070da561bbdfb5d80fbeb39a8427f804ec9e19b3fc36d04825beb1a33"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1366dac695218aa9428527e670635072104e4bd0719c3b49b2edc42ab68e5883"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1ce9e8aa428df55636d6630ed258ed9b8a063b792c1c06424929516a9cf889"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8690c04bdf6fb2e7c6e30c279c683a711a66de4c7656bc9293d7834a0089e901"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9941bf628484cf0417a8371bd03c32ecdd7624d0e4a0deffa8f394c67ef6bc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"23536fc03536fb4813dd7eee06a0eddd4ebd002c9a8dd7e4dc04659dee98fb7a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29171c1538aeabb36d61f0752feb8b416b22ec3d09bf01ff521a95ef98b7bbd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4965acba91fe054801bad4887dc7555cd1b6906c4e3f3bb5bc065359973912"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf6b5aa38d4f007f65b6516b01e0a8f15646557509afe707f1a942a0c93f027"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d8451ca43de2e021f83e7c3b3a2f724f5f7ded4ea1ca7364646a8bbd447b5f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cff2c48738c75b7c7dc25e43b4debff18821bb80cbc6866132684eca8bc983"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0464fa52df199cae6358a0170bb2ba42668ea41276ac7aa3e88c42281d1a565c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9ee8e348e395fd330ed469ac85b5d21af10cacf470e04b352ff2190c95a214"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89582ee0ce436de7f0f465b1d4bdf59683b310866615d255d33f3b3f7392599"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fb516399261c06e0f87d66a82f4839ec43d7ae79450f13a0a9ee83f60306a1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecdbbf8787d45ad84bbf3c7bc1ad3e164933657ca463402f75440ba79230d8a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ae8d9ddbf725731d720788eaa5560a01f8e8e65240ea60c9c531fcabe5fce"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"324fc83b8d9383603073aeff0271235390db80105dd8e68527b3ed8bf8a9ce82"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"74decdf16561853a3ce82dc6b8428b476d94f199d11e50968a0dee13bcefee11"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74e4368513ab3e8ad5b5f26c96f5d4211aad3d22bb02820b32c0b61935d4c49"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc6da9c575c80b2690c7279fbaff697b4a2c1127e960f4017fd027cb06056be"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eb54549eddcf62c415ce433286ae62321c9762facaf4dea87754d9f8d67d1b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b41210a0460db76435f918c964f51f92f856a789d908ead19f46d7266630bb7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c760dfbb426e105564384a02d0d505c50134904422a01d20cb4fb856879f3c5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fc8b06f91188749ec3557ea783d4a5d3c2f5d3a839d2b432f860ca2fffed92"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dcde80b90a4c64427aca51f5904914257bc600b4ea8ccee671d4f0f15901c7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"91918c52645fa75f8453d811643a7aa5921fed1e2b3988f357adb523dc30b952"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb35818a7112ac8435bd41603b828e3c51c6b8e65fe55ffaaecf05e80e0b324"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeecb545ee79110d0db8941fcffceacf3146b485c3c68c60c062c8f7e81f2808"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5409a12ef0d1ae802c75ca592ddd9810fd4961e255d614e83dc8ce3aee8576f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e6ae3e2331068dd0ff89e9201fdeb7ab327a87aa06b5a90e0c1002dbaf2639"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1aa22732123f5a144461a7eb56aba9a18a2398267e578e44458ad0bd5d6157"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb336fa8693901045d6ba7d9451bfde4f3f08b495517b4d021bd3c82db5cedf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"214adc69744585facbe316f045ec35f998cbb29f28bb69269caac2a53088884c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"17af2ddcc7d8707a2eec6a365bc7d98fba826422e560aff59bee07ff15ceb82c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd1942364f3d143789a7eb263425baab9042f73c1a30d690c6f2d91f5e3fb54"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1eef0a69d2e37d38de75c35117d4aac9d14a7aa1f53b42b029f453915076aa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"352921e17f64265d80de852e8b7247e4dab900fadd8c76512ba497749ba1b7f9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a6104bd5db292e58b7c4fa5c43d93bd7f4b123cc90934ca262b68fcd06f8fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"72efc81c0f8492a2d9893b2b00192545af8abb00e316cac94910fe2127216bec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6b5e4d23f2e2562ff4285c0c44e93cb9d83ff164e77743b8042f639dd30ea1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3131f0eed42a16c420b9c93ef332da702517bef99b17360c3917923fa19b4757"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7828337a9b6e9e2c6d36a1703cee88fca37160a013c5774e65ebaae62f82f9a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddcd22d1295f20b0beecad49be93c25aef9479be4221829e49ab4d2d963790b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fe91aea3fdd68b53784668038c873d55219c7f9e1de95e66cf1adb8e1a4e39"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"910620fa99500517ff0e451f9e36507d2d27add2b392fbc4bf783b358345b6f5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3868212f35fe5fc200b1e910930eecdabfe4d06c4d8760e51fcbefb4fa8c0414"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"440b13c83531733dcf03da51e3964f4701c7105f815639dd292a8214d06642d2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e648dd93f9888c9257b8300b21b8181c5dce8c7eb48838d195da01b610e570"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba185ffc8bbe8633ae667e7c2d32ea5fb5a24a6ad88c2af7275b12aa35f4f3b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"82406dda34d60189a5b1458cee779aab671587c8912619a63e6cc77d5e3feeff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04d6180338bfdccc1e77afb8372d9bac2f578da61f1e7e0b98d1a5e7f573a6c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb023c3c5dc8ba53e3c35a562833e24a967a9aebb18b9ecdee6787aff9f29e5a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3e714b9fef1f7ff143c597aea902139c71d2918082ca9a6de662c64c98ef1b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c14c84ccbf5e8dc4509c621fe0b5978a9cb5ec9a3dd657773a2bcffd7c5eb9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5353bada21643b0d6e93eb65f754a2a0720c0b2d2a93df6288bab36608f934"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6bd19204a3eef53be66e67be4985e5f3d7f3d2fc0c62ed911bf55cb586e403"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c0373108de07bd4ca6a8a4128938ede6034bccf7785d0ccaa52247e95dad12"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a87437bc7f2a1cd80d13162d9fad3271c5e935c7fe8923739c71476226aa2d4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7fc6e2409c206756a815c463af6fd6eff50e3b7201364821a822b8ff3beb6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db6409c5684b3d290b2b3d8984c8085fe4cff9b0e45a782cb6e4076647796e8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"527316c6db0f8c4fe22500fdfed7fed57977e73a6fc77593533356408ee341da"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2d0c917b446943b5ac1803e186622178e432c3468731465f73f3f797290622"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebde26da5c970d0ec2a4aba1a03ed2fe21bb4c9249185ec7673aec7ade9a3e5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"32513705d9881a004f698a3ec12357c5a2720b03bc8d64193a683bf4029236be"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b2fd60ee58144184e160e2698dca1bf3c3127ca9da4349465bc7c6ba7f0a26"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae53ceafcf999fd499cbb4a82ea22da54138e6e40c974839c8e846d09bc0acd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47fdba7486a7ff6f8637dc4f95da919b6d88e7ad0aba1c6778e5515bd7168d7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e86431864d26886c6e2150caeabf8b6bc9ac834abf38d0a72b33fb292d5535b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d770b48b3d8cfcbe9fed15cb668a5b8d8f00e2a9d2fd77e861cff4e0cc46019"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a32099054056157d93837322819c7c6dcebb92b52b04ce164cbd6387b80c506"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e87066a45fe27cf47c26beb25ea6447c80f504046f050661997d71107c118c7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8735ded9890c7e54dc46c5d216fddb29ab28c4a3076a318df8b075b687cd58"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ebe68de2ef3eb6f355000d18042d35fa7c8bac86d6c9408afc0a072032a43e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d64710d0f40196112373ccfd5431a74ac69ac7a5760a990067813133aeb321e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6964e81649eeeee291531c8ad6df4db787c3e8e976022e6a8dbfe598d8376e9f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0007a3668227b8cd2278aa00d19dd5ec504bba61bb0af568b721d0a94bd1a50e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f854268cfc41d301642eb523c5f439569a9440513badfe0c9a93087417d9c89b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a1490dc46e244024569384c2bd774d9d188e74be00d1cb93868c1ff4de0e0d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6a1963982a7670a109e56159c98a0af9734e022a585ff2eb904a5c5ddb295a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"378e8ab9eb869311c8a653b52541a5b97f35fb830548e1631852eb0388cf10cb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dda653d0d6c18fa0f44f0e5dc4a25a6acdb9c149e7d10974ccf25a136c7c5a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abad84c84e390ff4a2f7ebeadfd093ec9e8e964ad83862e7a7911f3a8e2cf10"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c883c1a1adeadd599b9c255b8fb7fe2420a1bfa471a4ea431bed3f9bb71568"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b8823688962c22c2edef148a16d37bbb919fb1dd38811ca7d272a7e29fdb9d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"630dfd09042a3e2301d0a59182b4a532c35917a3440a6a516d1d690419caae8e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b381d642e0d294f6150374a220fa6526b1b9d0def7973c8885a7908ef10831"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"91782611e319bc092fc9318f10a0673556f3576ff185e5dbb96f4c3f738d714d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"792a516609ac0c618bdbb0abcf9d2aee99d74984ca35547e4c95109837b37256"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfe2b645bef53cbb9110448f98a9b5f828a441421de0ca7932f3b1c1df93c2c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a853eb7091e603a40ee5d74fea55c9ebbe6a4f7f6db4a92fc5dffae062eea94"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9827c61ac68e89619be087ace7ab56c9bc8745386270f6aac97297b2a047ed09"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"586cb5efeb6acf6c64765b05d71fbd7bac1913fe2bcdb478cbcfc561b096708a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1129414a5676433166495c5d183ecadf90bef2992bf29eb444302a6bd547163b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8da1792be9a454b1b89f9eb6975ec82e53c687095e8276e74db5ba121405f1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"775ff5781f5fe8b41e101c94b967b0e530ea22f45ef5665b746342deae59fdf6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"50674f8eb26cc4c60079247385bc8b15dea04f497348c24823ebab612d08c57e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d2c6278e0cc7e643dc4225d4427225eb2ea65e6b547e183ca8f9196f01f629"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6437159f6b30fbba8ccca9cd007d09bc1d8039c11bcca7c6a53057ab414e5d5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff01f30cee513132694b4a851de19911636cf7a8dafb8fcd7a3e8c5fb99ccb2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b3f46b120a39671537040f7623759def4d2d2b7416c1161c7b9474fcee59d2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf0d7503181dc7f2366b9d856ddacec905ae23cfc4be26ceaf1960b2e296cef"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LayerPanel.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"622db7abc5ab37f7c06d07c6fca949281165956ae31ee939907be0297dbd2184"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LengthTunePanel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"819860fe2786a777e3ebe6e8fa0e176cdcbf30ee8ea665159ce2232fe1aeb107"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LengthTunePanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f27fed7332916a1376dd47e5e2cca843fce09096908c975dee069cbaab24e5c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LengthTunePanel.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4aefc29b74ffebf56c5c4a35bb528c0bda48c5633e161ddff0f88df3857d7a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LengthTunePanel.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"004786e75e16944ccbfc098c10866bb5fed9c25fe87025789226c26e455c3ef1"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cline\u003E: This \u003Cline\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"727262c51ec08d6b6b37e472b1aa7af2f8c55eaac61a3192b6e4703c19b16e7f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59de6850f6e39707d01afb8cc60a5a6a41e365bb866d10f3361d6dcf3a652e4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aed51b8ae45e49c5fee74a1260ec50b7a3572401ba394b0765d6fd04529da43"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c598920be31bbf28e11f9141b3ac5e78e7a2f6ee8c290a456f220d46a6a4ae7c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"916f54d63279bf0c95d3dacdb7718b33599a4243d5cc92f7712a5dbe7a3e6f9d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1904c805f16abb06e6de1b2bf40c20d2f061f233fd3771d7e12e9091cb9dd0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edbff865ed6ade4576616414b416355d2f317aa379faae13cb62ad8028a6fa7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6435ff35af059fdc0052996f95f50df54253f15f8ec3f47888706b7edc452725"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f74b92bcfcae3024adf472b74790baac363f65617a0cf2a90543df0182310a8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryProperties.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cf6aa03efd324b8bf64aa0c8258d34674a2696266a058898f0595fb93bb372"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryProperties.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb508ec8a849b6449552129177a2c36e647726c2e83fe3a8e9e9d71a549f6fb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/CursorCoordChip.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"105828f45674c0a60dfa95d6f04f8826ddb8393b8e5cfff82e1ebac85371a2c4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"961916849a9c3981c939d37d27f94d4aae47172445f7e3ef5e29a1ec4115dec2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac8e9ebe390a6bff0ed92749acfefe97ab115f48af3f8df78d37d409d82c4e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/CategorySection.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa74aeeb96b5975f0ca27aacfe799c5d50219222e6f41796200d73e3109f5da"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cc39d0defb6ab91e5f0e5e856e4298b13f2c20fa7170f02fb58fc7d42e6672"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9662f3b0efa19274e96be636d9c238d476f6364ac35d4da3105c7fa70458f47"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1791bc8f65b9853519e5dd66cde5ed97746a49ddc5cd86f0ca49506bc1ce42c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8923458c203ed1bd6d57f4fb3185bbeebd9425df0735a3f67c26e2b5e30c69b7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b58237985d819967f432e964b11304747adc6118fc4d4cb5a2f56510b3fc56a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"155c63f0bc072e54643c3585d63cb3509b3ff8f87e4eaa20d654e3fafa808526"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feaeaebc8ec94b1ea78f323e87c1e52222653c5039804aa5118adb9fc4f9411"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f54a8b239b958d36efd051f848ed53bbcb902b2e90c87470462d72a9050dcc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd82c873fd007cac16983162a0c16e6b914d7bcf050fb5c7438dd3e015b8242"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba25daffde16c868ed0e76be2f0f93130c61f356dcb1248bb641e78fb99b3d02"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"235066c8971ea9a77a126204746556f61bafc805e7ec2f0629881af1fff7a1a7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"322c99281d88c67154733521d4d1119553514cc614573ff0b1b2f12191a46275"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d30dad9e1594c2fcdda8773c3499f99ee0cb04e263c363b09eb4869bf52c59"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b21b5c2e46172fb184b1d60be31eb57e8fef6e0cef54fd2636ec93ce90fcda"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPreview.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"614bd6a2d22ba1ba99ba6872efce1965f69d74997a1026576945be5c74daae9e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfcd1ee23ada70ce7e7c146ed94bfc0707f05dcef137af9874788a203e857a5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4924a8a4be8ed8081af990046a14b273f0dffc9485090ca686d2292832a29ca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d969a131cc3130a03fb05319dba125d88bdaaee3cec132830fd484b8e27e24b2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e04e7ea074a0e543431c802b43b88839735f2db243ff82a708d1a7feff0d80"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e723a0c921d0e3c70652bfbe21d36e54c8f1757cbf9ff6f9a765cdb886a9a78"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed820463734ec731f5b96634219edd64b2fa46856e685c72080c4847e7a1e4dd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5d9f5fb977f8a3076f1730aba6381fa896e0dd375732234415dd66fb7ff6c3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"257add03510cb0d931e5868e5ab8eab0c88807119a4209dfb76bb2757f872ce9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c01344ce0fdd051b16e698ae9eb57cbb08e7c70e63a8694b18666bcd9cd0d62"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6518d6b44be9dc5fa74240a3643f0bc10501e50b47cf201c6772927d0d6fab"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"58019e8ab950f07e561185896556e3648635eafbf0974354ea081044f730535c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"106d0ecec1877305c5e1d6e107d3b6f0fa06bdd0c7ee9646ccdb6e9334e192ae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1ae5e4de268b91526d88e9247839369d55c6ba7aa771f0cc538d359b57bb77"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e56f31726c718c1008097dddd78ed5f2a1d41d03c2af0927e4ac92d1407404"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/tree/InlineMaterial.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce519856ade2315947c81ff215f6ce1f5be2941ef18df88dc1205245faa7c060"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/components/Header.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee820765b28dd8f3cf72a843a444480a86d7140617fa4952c4e67b12ad605ee"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/components/Navigation.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ffcf1ee0c1bfb4938a1732db6f2b2a70ee4446657f22f524a03afa83dacbe7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/components/Search/SearchDialog.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3663ae77102da97906e3e2237d8a2997dee12b3f9a37df9b8d14409d21ab82"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/index.html"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddce4fc7b9b403c1fb5f156afb1edc498c0fec623ef9c1ff2757c90171dd1e71"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/prove/index.html"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8da60d52670f996594c3126ca6cb7275cb5fb64d495e058c3f0e973f8bacbec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/prove/index.html"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e32fc756c8395a2064753ff97ba476b591b48533970c26abfe29beb90eeb54"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/index.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78e121ee6646ed3b3e4633604ecfeab877138264da2ae8f6d3a13f3d792def8"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a9f946257f327e7f68daa90f1d8a2f456ffe943bbedccf4d88be7a169392a8"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/splashscreen.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b3f762f63cdf6f3985cca986a0e2859192adca29ad7691381b53ad20788c06"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CompressedFieldOverlay.tsx"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d43f6c1ec953d293c46cf050148d4b0d1d0ed3930805b727f1b8dd37e73286"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/app/gallery/page.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecbb6f25af40790a48f03e87b4b93e35393e07a10839d89a78c37eb921f0b86"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/app/guides/[...slug]/page.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1684bd325ef135bb9195991db08e9124eb299401b42d051fb8ab91ea4dfac9cd"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/app/reference/[...slug]/page.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8afc5f948ec9623ed5a864a99c703235b22701ee45b3e52eaaeec5c035a94"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/app/tutorials/[...slug]/page.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf7f8243da065829ea14949b975294e84ef22e798fdf3157ae0fc645def7520"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43b4bc24cdb713bebfe67e80d08db0fe24fe22f5091b2248d18b02dc60b3f05"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/email-templates/confirm-signup.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd21aaabbee8cbc25ee022fcdbcfee98256ff9687df7c776ba8709cfb7c9a00"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/email-templates/magic-link.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"346e2ca19d714d87f889ef27827814860522322de27eff456a6b2beb882e5be1"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable role=\u0022separator\u0022 that no keyboard user can reach: This \u003Cdiv\u003E announces itself as a role=\u0022separator\u0022 and is operated by mousedown, but nothing can put focus on it: no tabIndex={0}, no key handler, and nothing in its scripts moves focus. A keyboard cannot produce a pointer drag, so the control cannot be operated at all (WCAG 2.1.1). Give it tabIndex={0}=\u00220\u0022 and move it with the arrow keys in a key handler (with aria-valuenow for the position it holds)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AppShell.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f0523a47ee9e7c84dc9dcc0ce0f95f5573e9c90ad58994be5d248e9b07e1cc"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0}."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DimensionOverlay.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0cc16a9374516f8ae5602dcbd4ddb603e9e4c22c339d7076542ea1f7df9fa3"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0}."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ddc1e0b344441504bd83e46f184472d9fd11529f4810fed6802775c487e37b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Csvg\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3e3ec38206dc4522f08523c815a41e743aa3a9c676924e065993013c41b87d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cg\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b05dbe03e72ef85048a166a78280ae37b67097eb49791ab5c5bd5da8acbe59"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0}."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ea20ae2d065d87e845780da2641eeb1ee3f829327bde476877c12adf3c346b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0}."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57ec85d447b48cea9b00511a6ab24db5893300477d5f12b27636941de2689e2"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/MoleculeTree.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b71a70b61b9445af3a2cbb989199144b90479def94e7cef7891ca721d23509"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bcce82b918fef3fde371cbbc702100e17dd103c7f78ff2275072cbf485954d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"52090247f7ac548d8bc0dc9922a7aba11ff7e8280a3cefb01ccae065ac50bd93"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a29fd51ef16587ccf4b20d12f0680f8ba86e00f963ce8eded247d7425a2ee8"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cli\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb878ce5199434c51e812c1b2205cae296738d50dadaa21a82482baad0dbd68"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0}."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e49fb1576efd204122063a8b7d6e857432748362d09f7cc6db73aa39879171"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LayerPanel.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9097f373de605f034035bdb3477580b44949d9f70b99258637e6a98e9bbc784d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LayerPanel.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ecbf3a96841ac623f15bc7c58c3e97a0a43cc0138c22f6a8aabd9cff582ac4"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Csvg\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"219ac04c65ba2e5cd02ec2a2be3e950fb45e4ac2794062c90bfc71ce6c98878f"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cline\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"09adb5f04c3869e41f8d4ea39ef93832596c53e7f760cb0fbfaf27aa2f74cd37"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctext\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"e394470df949775a4dd5b3f165d7ad8cd1a0e97daa4dc227024c26577b1c5293"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cg\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d3ca01f46878dc245d165ea1551c7eed73178c87b3370883b10243e6d5279"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cg\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"580f81970336973c6cf4d9f9574d7b4c8e956c18f0d05d7be00e00a85f7c2ac1"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cline\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/PcbRatsnest3D.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"713a8e211d38795acd38fb920f9840f124560938dfef78198dba1c8b31c184d6"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/notifications/DecisionCard.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7156000abbaf54e1f18faa2fc2b8958c2d8019dfb48d6b739a522e475f287467"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/components/Header.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d479e67219ae4a6caf565eeceb2d8e08fca7af1881176e452b92324bca72a79"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/components/Navigation.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a756ff4f6055a380cfcfa92d02890d1cb731f286b6e54b4cc473873d923490e9"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a662f6c533b4ec956e5a612d37d1593e8501b56634af9180f2edb725d1ca5f"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .terminal with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/agents/index.html"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56e6a05005e6541bb75fcdbdf3081a195821ced9417043b00925348c72b0003"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.progress .bar\u0060 moves (\u0060animation: slide 1.2s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/auth/popup.html"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9481fea8391e6d31b56011b5a497594db70907dfceda7ee65a303894920f1c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.btn.primary\u0060 sets color: #ffffff on background-color: #f92672 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/auth/popup.html"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7430405d27f8ad50b94df016e49223439423e2d115e4f750f96f16214dc71d5c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060::selection\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a530b0fe55529aeadbc1d7242f2c2d17ea26c73425cad37d6b490fe11455e55"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060a:hover\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c306dde5c68598b4eb30d382d81bb69cfc59e5505169841b114606a1a267768"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060a.hero-btn.primary\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e4d4d72afa1d93f06e29af0f2389d2e6575f4c163871c583cbdd582b220f62"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060a.hero-btn:hover\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dfe96cfe579e1dd1c822c84425a07d54a31276248b77e0b362f0e556dbb10a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.step-btn:hover\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9c218ddc45c731074673e5e2e726b87315c97a32a80dec889846dff9a877de"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.deeper:hover .deeper-link\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/index.html"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"766490f0d5e148338e7c04f4a0f6417fd4aebbf165295b9ad54654db321b5eec"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.bar::after\u0060 moves (\u0060animation: slide 1.2s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/splashscreen.html"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2089d8f434151f7133fe399bf21b72ed4bb234634bbec1dc1265afede4b3de7a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aabc7874138b7b7fef55d4af8dd4ad1881340e41436b80b056ef4fcdc643dd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DimensionOverlay.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b73e5ef199c9b6421e97d1856ee6b3b8b2789f2fb994068d6a180c3feec5cc8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b9429ff923eeec9937fe0c2a35b0f75fc2e70a07ead67af5536f8dd297972f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff62a9046d6bc479955f65be0748f173c27cf23603f0feb3ce1a1ccd40fa59b9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d1eedfb6250dee9375413e99c6cc8d66ce62e4e23dda8b1fd7728b2bcf9656"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"817fd4f8f0574235dc398714be5849c484c126f4ec5f63f6783dafe6c1942a7b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.8:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b1ab5c1f84e069b64c5bff978918e6f75fadd9ef4211468f6b461a3494069"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeedbackModal.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae82809a0083e93e0159ad1842385e0475e1a389028272c09f37593b66e07d71"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/Header.tsx"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed5984c2234f4fe316117f3f60f21d1f4ddfbc99d1cc8b0838d30c25aa5dc82"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dff5ea8b55ccc1db9cc6e486570790b922676743eb43ea741f471e92f7433a1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0958e404ed8533ac4de24e130c0274fad720110f5f0ce878f0ffd13b04398269"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97494a395f14a8747e28c133e1ed226e2e6c5c332c75638d525bc9d708cefbc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb088e8654cef5fe9a872ea54d24b30051fb323d20be762779c565f0b2907fb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ReadOnlyBanner.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6ad131007aa4978b0e665f00cf177736a12e381fd89b454c2df9482c9e383c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"20045e04b95fe11db5f19e9bd4a76892e9e32ba0cbd3df1f583ee1318c1f0428"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eb4e9c65f742d21ca6ca348c0b9ca59b06a78bcb4bad1c88947cd9222d3bc4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its \u0060animate-[splash-slide_1.2s_ease-in-out_infinite]\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/Splash.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35d7dce33f894ba0c2083deb9263f825d8d7883aa04dbb9be024d9efd43ebd2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d081a3eea8368d73d112e8d251113e3fa1ae24d5c99a6325ac776a84445fddbe"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f131ba8dbd2d4e0e63a55059253367858736a611e9be966c79e2cefc7a2242"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"432361e26786668159ac2e722f506571797280c7138c361368ae21de15876765"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd310221c201690603f2f4de8206d1125d18f0d64909cf14c4fa5b51664b02c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c666585aff08ea42b03320dcd05794cdee21d2053e225013b0e705ff7a16e92"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9d42ae091aae87836a6a14ee563bb1f1e241976d6e785782756568c2a8db07"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6434def67d345d025056dc78f04ea83b865e39227ff4bd6adf30f46e38337687"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eddba6712d8ce56effa4b68958687f67b8fb5fc1ae320e7c1440fa5b972ee4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aa928ab8b48e155d8331caebab30daa927fb44d63aa7d14b434beb0a2b23d7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryProperties.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe9d845a958d2cfd7b0f66f5684efaa76b54d8ce29d34b382583c27f0dc878a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/CursorCoordChip.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ec9de4b69c14cdc9b056bac30e4a13c878f24b5440882c0d0bd8380539460a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its inline style sets \u0060animation: vcad-pulse ${pulseDur.toFixed(2)}s cubic-bezier(0.4, 0, 0.6, 1) infinite\u0060 \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/KernelPulseChip.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2a0208b833b07c4c55dbdd75724ddafadbcc3602aa34017925ca6f2b995430"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d819b16ffb494476fd9fd79d30f848cf229922dda8510fa63ca0851646add2ca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"971953d07f3ec181f777b72265992cf004bd30ad9eb4cf479906699f2cca1762"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd19ca433f0ae8f298c2130e9d79467b29150910482e109085bfa3799985da31"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cac970f31c3735d5f1c3915476dafd0229b92939b8a0fabadf0cf94224ff72b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"459fb334417ecd033e06f350dfde508f406d42f1cc13731eb55f57736d79ed34"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.3:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"297c3589e903c5e0e3ac264da160052ba90aeec9aba8a3b07f77a35e656a8805"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/input.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a9b4a26f674a120d08142b6e5824bb81527b662485b22f45f82e6a059f639e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/textarea.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8279827d61f17ad9e1ad874f405a5d6392f8470b5e4ff7d0fa6c7f8e0f69758"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/tree/InlineMaterial.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fe7d06662f05e8be7c45f8eed91c883c7d60c059339391cbaaf0fad4048aac"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47402a58713b21e7d3f7f5c356aa09fdbff4b09f3b350f411b451d597cb0e6e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9850ad07279b6ac9520cac3f6f727fb3cfdf53dadfd4739701edeb0f840c61"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/components/Search/SearchDialog.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a33e36e5faf897065f9f42d8e2827daa8adf3871e370dec0b8cd39a41907ac"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#ask-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/index.html"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a129dee4ee01956c344f590618092eb8512c121bcbfd5e0b9b023f08e2136ce"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#tp-speed\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/index.html"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"71803e254dcbe02ada076125e2b6defbd1c04f3bdad970b0b52c036e0c664244"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.btn-brand\u0060 sets color: #fff on background-color: #F92672 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/index.html"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cf8b7ce78426b201b94dd4a9116906247a4870c0a6c820b2ed14e5f8da736c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060#ask-btn:hover\u0060 sets color: #fff on background-color: #F92672 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/index.html"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"78781dc077765e63eec4150a6bf4f4603f84f63805932d0007ef41512dc0e4a5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.6:1): \u0060#tp-live\u0060 sets color: #999999 on background-color: #F4F4F5 \u2014 2.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/index.html"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d870a855759f097b95b00c4983307ae8f166a00c6d9a59fc9b876b353f26a7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair (3.8:1): The inline foreground/background colours fall below the 4.5:1 WCAG AA minimum for normal text. Darken/lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/email-templates/confirm-signup.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"519372a6722fc3999a24abafdb3b2095ae2921be186c9d9a4236e56828b5d57e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair (3.8:1): The inline foreground/background colours fall below the 4.5:1 WCAG AA minimum for normal text. Darken/lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/email-templates/magic-link.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08bdf8a2dd64186e634eb0560008aa10ffdf034e21d406f774f0afd63b2d13a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060::selection\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/home.css"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"80de48d48ec02aeee7ac45ef6d7d57249fb05e4427bd6f3ae10d4cd472a4794d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060a:hover\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/home.css"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd710a5265f9c3674a48349405aa5b2855030c9874e39c8f93db5c703fac22d4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.nav-links a.nav-dl:hover\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/home.css"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"495d787d62ef4f928f0cd78e13b2ed19882fa5311ac432a4b0cf94e012cb1466"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060a.btn-primary\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/home.css"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"05117f267205f94175dfbfe5edc95da3f81cce133aebc97a2bb222ea6fa63cdd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060a.btn-secondary:hover\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/home.css"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec68067103428b20f962bb7aca9f603d7c55d4411c565f28fa4d3140611078aa"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.replay:hover\u0060 sets color: #fff on background-color: #ff2052 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/home.css"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b2534bd898d52dd842ba5853df5188b64632fa4f6bb34134d18136e628ada"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060::selection\u0060 sets color: white on background-color: #F92672 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/src/app/globals.css"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"317fec18441432467c04f819c03b94493ffb1be5824ddd82e7b9e3144de337a6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.bottom-toolbar\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8114d268816219a91508c7dd0c3126fa10d379597d1817418d837ded4d681e26"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.bottom-toolbar :is(button, [role=\u0022button\u0022], input, select, textarea)\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dbbcb68cf0640a7bb07d68dfadb463123da096c85c41179965cde04cf2cf94"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.bottom-toolbar :is(button, [role=\u0022button\u0022], input, select, textarea):focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"75def4d7a4e15ca34cb157bc6c5ae45111ee83063f3688374a93fad91132fc8d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.ex-status-bar i\u0060 moves (\u0060transition: width 150ms linear\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/home.css"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaebc997f89a2162d1855d5bb08786643863ab05cfd73ea43012de97fdf6a065"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.kgate-bar i\u0060 moves (\u0060transition: width 120ms linear\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/style.css"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b903648762393fe90e7ea766f8cb2c1931ac5efa5567ef06c6248810618fcc17"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.vcad-job-indeterminate\u0060 moves (\u0060animation: vcad-indeterminate 1.2s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcbb7bbe955a24494adfadfa8ba39ab79581cec4d2d7ccd656e6aec0e250cd4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.vcad-footer \u003E *\u0060 moves (\u0060animation: vcad-chip-in 0.4s var(--ease-spring) backwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7110100c7fdb5c14c41ebce68c688ed56d4b726b245e7d40bdd5398f353217e4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.changelog-tooltip\u0060 moves (\u0060animation: changelog-tooltip-in 220ms var(--ease-spring)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a283bc2117b5fbd4ad1151514d840e3e780c4e0a14b2a6f7093743e1cf73c3ae"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.upgrade-content[data-state=\u0022open\u0022]\u0060 moves (\u0060animation: upgrade-content-in 220ms var(--ease-spring)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb144f4e2b762f51ae031775c4fc1e56ac7036c8604facedfd727e3bbbd50c35"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.upgrade-content[data-state=\u0022closed\u0022]\u0060 moves (\u0060animation: upgrade-content-out 140ms ease-in\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"23571cff4ba09633b56fab2771276b1b10e67ff85e13fb34be4b72d13199ca7b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.upgrade-cta::after\u0060 moves (\u0060animation: upgrade-sheen 2800ms ease-in-out 600ms infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6344af947b2b7e02dfbe375efd209ceeb7bd96536a2f300db2f45a82ff9b927c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.auth-content[data-state=\u0022open\u0022]\u0060 moves (\u0060animation: upgrade-content-in 220ms var(--ease-spring)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c625836f0afb8080f9fe16c39fdc8d5393fc9f3114cd81ae8b949276db1d091"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.auth-content[data-state=\u0022closed\u0022]\u0060 moves (\u0060animation: upgrade-content-out 140ms ease-in\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce0558eeda86519164869dc6a5ed9aa5100665b284fec13490fb57eaf341327"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.cta-press\u0060 moves (\u0060animation: vcad-cta-press 220ms ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e926f5f4982d3d430f127da1f025bb3ff8318a518d6b6b4cd4e588a3313774d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.auth-success-in\u0060 moves (\u0060animation: vcad-success-in 360ms var(--ease-spring)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/index.css"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de0cd111b751047a29f33a50dc1d9be54d712e544a844f10221a0e0295ef733"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060push_user_message\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/chat_session.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d6aab3e3c18067bce498a53c1ab84d67571d183218b1d710412e2e9e5f3d7d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060drain_chat_events\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/chat_session.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3690a2281ca6e42856b6ab24a2b914e491e054013435d8c2f259d0b7076157a2"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060init\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-i18n/src/lib.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2143503695565b49fde7279e14a190884ba77002ba8d185bac72b646a72f9c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060write_layer\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/dxf.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae347087a31e3b89b38dbde2b7f3c0d19d529aa42ca2706d5b4a6d0b7f6a994"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060write_line\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/dxf.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c49474025675f197a018a4e654678d4357357c85809e697e5c2420fc969e74"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060tune_filter\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/circuit_sim.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabeab00f119fa4dc1dfc05558ad31daaac7133d703a6b8374edb3838e5b5ed9"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 2 ADR-shaped document(s) detected by content \u2014 \u0060docs/design/stdlib-and-social.md\u0060, \u0060docs/plans/timeline-editing.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: packages/training/README.md links to \u0060../../docs/features/vcode.md\u0060, but \u0060docs/features/vcode.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":"packages/training/README.md"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"789fa3697207c0ed6ef96dd44978f86dbd5edd69b61c7f6b14796a86987baf89"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: packages/training/README.md links to \u0060../../docs/features/text-to-cad.md\u0060, but \u0060docs/features/text-to-cad.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":"packages/training/README.md"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e0ffe97eb166553609099df9af90c5be75851b9a0c12afd656c65f4f66d2c3"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 7/20 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/vcad-kernel-constraints\u0060, \u0060crates/vcad-mcp\u0060, \u0060crates/vcad-render\u0060, \u0060crates/vcad-torture\u0060 and 8 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/backfill.ts\u0060 reports through \u0060console.*\u0060 at line 61 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/backfill.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"789259d3af4381fa0217e8b92207162f0da2061609c7ce3e2e77212d9da94c59"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/backfill.ts\u0060 reports through \u0060console.*\u0060 at line 90 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/backfill.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"186243d54838451b6da9068245b4d9cfe13244660887c701a0a6ee8b840773a7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/backfill.ts\u0060 reports through \u0060console.*\u0060 at line 96 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/backfill.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baab1155e17b3fa8b10b5dee0183ad64b444ab526b9473f7958b812ea6b0bb0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/backfill.ts\u0060 reports through \u0060console.*\u0060 at line 103 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/backfill.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb494c88aa705b7c873edd29bd74b47f62cb8ee13f34149558eb01d5e5ffc138"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/backfill.ts\u0060 reports through \u0060console.*\u0060 at line 155 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/backfill.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc86a9682dbde5917e9412b77665b97c17cb319043b70c1d731546afc50d8db8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/browser-inference.ts\u0060 reports through \u0060console.*\u0060 at line 369 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/browser-inference.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a3941b70511bc90cea16c9b6c3e5f57884ba37516edb02a3696cc6d37fdccb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/crypto-polyfill.ts\u0060 reports through \u0060console.*\u0060 at line 16 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/crypto-polyfill.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8476032dd34c9376d5105028af7b0e9599b259be08b068cb7e686f4a061ad887"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/open-document.ts\u0060 reports through \u0060console.*\u0060 at line 27 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/open-document.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27a4cd933fb9326334c41879963df1454194aa13430745d74242ad137e060e0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/save-load.ts\u0060 reports through \u0060console.*\u0060 at line 47 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/save-load.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6283918643d037218278b914a37c72acb853dfad2c528ffeafe54be64bfaab"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/lib/urdf-meshes.ts\u0060 reports through \u0060console.*\u0060 at line 297 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/urdf-meshes.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b969d444e687f121c139f01863335665a586c239e5b8e00eba35b2ae7236d93"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useAppCommands.ts\u0060 reports through \u0060console.*\u0060 at line 514 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a30bc5538a5a63388deff762798cdbad438240f7109c95a13f703e6ff4a3ae"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useAutoSave.ts\u0060 reports through \u0060console.*\u0060 at line 38 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAutoSave.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"773205e73a546f914d5b6788cdf44806f7447b67090fe76ac19dfc745eae3ab4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useAutoSave.ts\u0060 reports through \u0060console.*\u0060 at line 88 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAutoSave.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7d4a141c3aa8ad76b2eabcadf5a8266b29b91c89c92bceec8be3d202526cd7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useCircuitSim.ts\u0060 reports through \u0060console.*\u0060 at line 70 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useCircuitSim.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af14fa4f0ded287ceb887ad15bccd0bc13e00114da13a4e9af92f49d93edb1f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useKeybindingPrefs.ts\u0060 reports through \u0060console.*\u0060 at line 49 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useKeybindingPrefs.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd24a78655a1576c31f4aa72663a86fee097efaff7e50710132d49638e38e4a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useKeybindingPrefs.ts\u0060 reports through \u0060console.*\u0060 at line 54 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useKeybindingPrefs.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"964d00062375dc49434ebf1626403193fddafdb76698a43646be3aabc7f13f97"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useKeybindingPrefs.ts\u0060 reports through \u0060console.*\u0060 at line 68 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useKeybindingPrefs.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d419e34dc876584f7bbc14671dd31cad13707e5c6386578a23b8c1979cc9b2ea"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/useOperationPreview.ts\u0060 reports through \u0060console.*\u0060 at line 147 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useOperationPreview.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c5935e592a6380048a2c26758118d0a5d04647d5482113241dbdf9101b4415"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/usePhysicsSimulation.ts\u0060 reports through \u0060console.*\u0060 at line 53 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3036cd56d80610c566345288ee9bd0f6297f52e11489cb5518af07ec6330f741"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/usePhysicsSimulation.ts\u0060 reports through \u0060console.*\u0060 at line 126 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1a6f205057d59a569f988754b6cace0ca20dda0fc38bf79c950ca37aac19f8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/usePhysicsSimulation.ts\u0060 reports through \u0060console.*\u0060 at line 130 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7980fea49f3f883446f5405ad376091b6979dceb1b24cb2150b87cc6040891"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/hooks/usePhysicsSimulation.ts\u0060 reports through \u0060console.*\u0060 at line 257 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"649a86405061114dddfc3f281fcb2def1f97e98a4fbc4e70bb66c66ebaa29dfe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/CommandPalette.tsx\u0060 reports through \u0060console.*\u0060 at line 233 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a945f6dfc4d1f4c993566cd2b2d6e5614efa6f7120eb398cc3dbc6eccb3daf2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/CommandPalette.tsx\u0060 reports through \u0060console.*\u0060 at line 304 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"544c4d877972110f11af8c5311e0d7ea335a77f7d30399444ce06d4d3094d132"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/DrawingToolbar.tsx\u0060 reports through \u0060console.*\u0060 at line 74 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ca7e5fe4dea7fd94107d08019276f5363b1a9a0a84e948eb6cb74504c16e65"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/PostProcessingBoundary.tsx\u0060 reports through \u0060console.*\u0060 at line 27 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PostProcessingBoundary.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aec3cfcfdb05ba6e34a97536e5bc05215888192eee6530b741df5b77f2facc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/SceneMesh.tsx\u0060 reports through \u0060console.*\u0060 at line 717 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bd5fe6c6794fa56e63e6a8687784b2f5a4bb97832d8a1a399dc0af4dfa7ffa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/SceneMesh.tsx\u0060 reports through \u0060console.*\u0060 at line 831 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9417a9a3e6e1e09ea0c10a9730ab432a9491f35ea03edc87b3f72ed495731d2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/SheetMetalView.tsx\u0060 reports through \u0060console.*\u0060 at line 57 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SheetMetalView.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b5d28c1f2a714693ad43fdb410f05ce204557caa3d70b91e8fc11605c56e8f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/SheetMetalView.tsx\u0060 reports through \u0060console.*\u0060 at line 70 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SheetMetalView.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4971f7d66ae3c4557ab6600254d0b8557296217ccd16fb599b07b449cf71c9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/print/PrintPanel.tsx\u0060 reports through \u0060console.*\u0060 at line 160 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd3530da71970b7a8482719c5730a52fb3418e40a024cd2ce3035d9188eec20"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/print/PrintPanel.tsx\u0060 reports through \u0060console.*\u0060 at line 184 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"78acc8d693cd170db41c8fe7165bf765a07519e6346d4c972a0022ee57b5845c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/print/PrintPanel.tsx\u0060 reports through \u0060console.*\u0060 at line 233 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7ce5f3efc54e68afb0a3c11762f3c334b346f05a4d303f24e2889277e03cb8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/print/PrintPreview.tsx\u0060 reports through \u0060console.*\u0060 at line 95 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPreview.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b210871243a6e2a4d472c96b950a48ee6d860cbb4164d0615734b577ba16612f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/print/PrinterSelect.tsx\u0060 reports through \u0060console.*\u0060 at line 94 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4eedc67ddb77ddce8917f0bf41aecd33bd62bdb8b7d5ef219a6d42e4f11e61"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/embroidery/EmbroideryPanel.tsx\u0060 reports through \u0060console.*\u0060 at line 103 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1a26fa2c825715b87bf178f95faeb4759e405d2deb0b3c45b3d0dbcfd1fdc8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx\u0060 reports through \u0060console.*\u0060 at line 128 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d771e89da56636502b5f776237d05cd1af980e55271c9cb6b83883dcacab87"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx\u0060 reports through \u0060console.*\u0060 at line 136 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4e888e36b1bda1bf0c428d47357c6b293aae618e9aa41dd31f60428e77c79"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/app/src/components/cam/CamPanel.tsx\u0060 reports through \u0060console.*\u0060 at line 217 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbb0ed4272d8aef8fabfcea1c1c81c5c9e99bfc573ab5e74babfb15d931f899"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/engine-lifecycle.ts\u0060 reports through \u0060console.*\u0060 at line 78 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/engine-lifecycle.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e766952c635832941ed4f6f4e926d029b07b54431130a390cd09a9729f2a8e18"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/utils/save-load.ts\u0060 reports through \u0060console.*\u0060 at line 192 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/utils/save-load.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4db906d5fde75d3200a6700633463e4efec3b10a6a6ff247b55f3e37eabf714"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/utils/save-load.ts\u0060 reports through \u0060console.*\u0060 at line 438 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/utils/save-load.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe0a060c6e332d2b93d5dfb197437651ddaf90f4326e0ed2b664adf2689d6f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/chat-store.ts\u0060 reports through \u0060console.*\u0060 at line 417 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/chat-store.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4c2634b7ca6764ab110ee7d6f26289429fc56cb992fe3328851c947ddaa78e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 914 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b2286e54c68c548d89183ee2620cc04759ef8ff9d21dfbf119c1ff51fb7527"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 931 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e42b6181b5ff434ee37ecc259f201d2571f6300b276f2c1c70a6b0b645c8edf"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 983 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fdbf372061b3c6237c460d367773ebc2f3398f9f5876752b34bf8c30d5c5ca"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1080 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0864753abac0b761f3e141d6f511e47784a4a7fe1106a05ca755b1c02bd3025b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1093 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a05b067753ab94de3811d0598a256f887e441f3e25baecd42fbdd7f77469dd5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1102 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00f9263b0f0bd966a972646979a7683e2fcccfe22b7faaa6c668da1f9900f49"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1115 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2934e657c0b5e775973489b931e4d2f0a3551861fae7d840f37b0785ecf804eb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1146 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"215a096fae4a7b42e61cbc91dcec5f122a7dde88f471659e5830874acc76a99a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1296 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c902e74a4767fe1c41f326411aa3e73850ca5c76cc88429814628ab15b521dc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1325 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"36400bbf4ea9daa0ab87e63110e1abb30d701fc1f59acd06dc4791a8f777a704"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1346 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"367053ae5e3880ca5ea8e86d9825ca3387ea4876f12110e9906795cd04b8d0ce"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1354 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab1d9378cf9ecfe6f071eb9722db8f59fbc379b52440b61a794b88ecac6e2cd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1408 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8898254949e7c609c481ad1eb2eafeb0a82894a06358465c97a8ae307aa7482"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1427 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a466dd96a97fd41d2515a867ea75a024fccea9e60f2e00608734b64a172314"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1541 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"92660849ae8f0f062e1945712bc4a0370c3163bcaac8d4f855e6dfba27054278"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 1742 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"675bca0cd8403d38c67d8e9f2365d5a8331aace422557afc431ba7177bbda0fd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/document-store.ts\u0060 reports through \u0060console.*\u0060 at line 2351 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74644ca0a60612d60acefdaab29e3219120f73233690cd656da8cfb26b3e4ad"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/engine-command.ts\u0060 reports through \u0060console.*\u0060 at line 51 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/engine-command.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b09a35977a2832194f9103ac45b04b5c41087551b88e6cf70e82dd2869a78f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/engine-command.ts\u0060 reports through \u0060console.*\u0060 at line 67 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/engine-command.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7b217e735600f2337053cb135d5737dba727caa5d59b91da5fbc40c63b851d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/parameters-store.ts\u0060 reports through \u0060console.*\u0060 at line 123 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/parameters-store.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c789d7a9da7713bfb5641218fcec8cd571e14f6a2ddb618bb76b00f43db64c96"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/sketch-store.ts\u0060 reports through \u0060console.*\u0060 at line 586 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d9f6934167449d067b689562c301dac4c111f0402838562d72c047becb7283"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/stores/sketch-store.ts\u0060 reports through \u0060console.*\u0060 at line 616 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd56c021e79dfa4ed1f3fbd257e9338a5d0ea1900a2e2ccb71add1507c78b5c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/core/src/commands/executors.ts\u0060 reports through \u0060console.*\u0060 at line 514 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/commands/executors.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"945791d25047c8e12e1b235a3e936c8f7c4ce398b3d35bb9dcfc7bf9b9886c81"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\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 entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf68ee1ea2969cbbdae4336ca738b5320c565628ea6ee894219d523831dd0f17"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060callback to createServer\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":"examples/pcb-motor/scripts/mcp-bridge.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50ba5b16bf0556d972b5caa0747d94c06287101989727f7707ffbefe87e42ca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadAndInit\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":"packages/engine/src/wasm-singleton.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac7683dcfeec8d3707d3131ff78208a4a8a68ee4eafa66e7cec1fe547446fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060loadWasm\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":"packages/mcp/src/tools/resvg-loader.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"294f1f1b180771c25d4a92dce3ffd7abada51ec8ce0cae33e16cd27552386d11"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060saveDocument\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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0123e852f97f40abbb4da0165ce269fc7ed0bcda0578daf347666a120882708c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060saveDocument\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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afb984e26973827a53948172d227e438a3ca40392bf47329b71d9081b6a2d70"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060loadDocument\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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a93b4f8c85ad8aaf8c49eeed935f92a7699d4f66901d38af437686c8ab92ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060loadDocumentFromPath\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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ef522a10a71f72d8d9fd62f29419d367ace9c6977c4f928f87b9c4a907c25f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060verifyPart\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":"packages/mcp/src/tools/verify.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4978ce41608dc6c87549cbc8d7bc5dee688f8d2124b9ebfec9f37be23e53f1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060verifyPart\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":"packages/mcp/src/tools/verify.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1edb2dead96224a0aefe4ed63339dbb9ed542764bf91f39e278600c882fdeb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060verifyPart\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":"packages/mcp/src/tools/verify.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5017d0f8191442fdadbd256f904a0332ec95bd58451ec25855423ffd973617"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060verifyPart\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":"packages/mcp/src/tools/verify.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5368254436eac4db337b0d6316178143290c82b279299b3a204318797c9d5be9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060generateImageIRPairs\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":"packages/training/src/multimodal.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d98e805ec81582582e1e319e51e33bd7b90e99037e858aed3ddd79fd237930"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060generateImageIRPairs\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":"packages/training/src/multimodal.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b235c0fb0aee26063484d2c8f63fce7212631158506425e091fbc7694ad00cbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (45 clone groups): 45 duplicated blocks under packages/app/src/ have copies in at least two of the sibling directories components, hooks, lib, stores \u2014 19 of them are reported below, and 26 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 45 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 45 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 45 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4e58c0b62972c9dcf61f1ee2e1b9d4f665c11a41a58f3cd188dc74928e5ba2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 7 sibling directories (36 clone groups): 36 duplicated blocks under packages/ have copies in at least two of the sibling directories app, core, engine, ir, mcp, training (\u002B1 more sibling(s) not listed) \u2014 21 of them are reported below, and 15 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 36 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 36 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 36 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9385630fcc2d383052e58c91479426b3d9985939852bef95a3345e1c3c77ac3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (21 clone groups): 21 of the duplicated blocks reported below have copies in at least two of the sibling directories apple, mecheval, packages, www under the repository root. That concentration is one structural fact, not 21 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 21 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":"packages/app/public/launch/launch.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee8ca3a19a9a696be86e04ddc9a3c2f7c49d4811bbde5c7940d07974dd0678"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 8 sibling directories (15 clone groups): 15 duplicated blocks under packages/app/src/components/ have copies in at least two of the sibling directories cam, dialogs, electronics, embroidery, footer, materials (\u002B2 more sibling(s) not listed) \u2014 7 of them are reported below, and 8 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 15 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 15 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 15 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":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1645c625191ccdd7ff9a1f3b46ba4a803373db4721a120a81fa431d9decef1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (163 identical lines \u00D7 2 files): packages/app/src/components/materials/InstanceMaterialSelector.tsx:6 \u00B7 packages/app/src/components/materials/MaterialSelector.tsx:6 \u2014 these 2 files are line-for-line copies of one another \u2014 163 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":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a2868914e211a76e4034774c402c4eb3ac697d0afe231a49236c058a71fd95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (133 matched lines \u00D7 2 locations): packages/app/src/components/shadcn/dropdown-menu.tsx:9 \u00B7 packages/app/src/components/shadcn/select.tsx:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 504 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":"packages/app/src/components/shadcn/dropdown-menu.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"581c8634f6b4a496a854876151f3553647fa631fa36e12c60c694fdb723ad527"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (94 matched lines \u00D7 2 locations): mecheval/harness/src/solvers/claude-mcp.ts:367 \u00B7 mecheval/harness/src/solvers/gateway-mcp.ts:145 \u2014 the two spans are one implementation copied and then locally edited \u2014 473 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"44196676997297d801d11f2423c613ed660b6923c18e852d15e956a939b9069c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (71 matched lines \u00D7 2 locations): packages/app/src/components/ui/toolbar.tsx:131 \u00B7 packages/app/src/components/ui/toolbar.tsx:253 \u2014 the two spans are one implementation copied and then locally edited \u2014 448 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":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07d69881ad623d1aa10ce0fedff0dd1971129b3359d3efaf7889c14cecbe9a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2 locations): mecheval/harness/src/solvers/gateway-direct.ts:56 \u00B7 mecheval/harness/src/solvers/wafer-direct.ts:40 \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":"mecheval/harness/src/solvers/gateway-direct.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfe69fb03a2bc886d140975ea97cf609bfbf29e5a1ffa00e6e22e2016c22c0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2 locations): packages/app/public/launch/launch.js:99 \u00B7 www/public/kit/gallery.js:211 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a557c58069d04e9d4d9b3b911836649ac45e3b9100b1da2f90d3e9c2fe3c6c20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): packages/app/src/components/StatusBar.tsx:310 \u00B7 packages/app/src/components/StatusBar.tsx:393 \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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"359bc399fcbbf2bb4d6e99d6744500fae8d0418c107643df221e2ce64bdcd28c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (53 matched lines \u00D7 2 locations): packages/training/src/multimodal.ts:81 \u00B7 packages/training/src/multimodal.ts:202 \u2014 the two spans are one implementation copied and then locally edited \u2014 291 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":"packages/training/src/multimodal.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c541540fb76bf6cd0b48ffc5bb1ef35c5a64f77d8965504be9923e872d12ead"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): packages/app/src/components/ui/notifications/ActionResultCard.tsx:8 \u00B7 packages/app/src/components/ui/notifications/WarningCard.tsx:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 272 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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c37dd876f9eb9f7cd5d497c74af1e357986d229760a6eb448bc26eea26c4a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2 locations): packages/app/public/launch/launch.js:221 \u00B7 www/public/kit/gallery.js:333 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f44bd76cd81247bb686c1e5cdd99a8bcdb7babecd5d42d99f0ffc908493ad88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): packages/training/src/generators/array.ts:113 \u00B7 packages/training/src/generators/funnel.ts:101 \u2014 the two spans are one implementation copied and then locally edited \u2014 326 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":"packages/training/src/generators/array.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d05261b5c89f0357b1da8b23a7419de77d049b07a13ff1b3af98c8c54c6993"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2 locations): packages/app/public/launch/launch.js:373 \u00B7 www/public/kit/gallery.js:546 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"35681465a007332ef039fcc76c61199da9b2993bdc2c27702cca456fc1f4f4d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): packages/training/src/generators/radial.ts:170 \u00B7 packages/training/src/generators/scaled.ts:149 \u2014 the two spans are one implementation copied and then locally edited \u2014 413 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":"packages/training/src/generators/radial.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab4e32827af101ae542a97ba9ca261c32d57225fdc6e6e9543d756660cd0b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): packages/app/src/components/dialogs/FilletChamferDialog.tsx:17 \u00B7 packages/app/src/components/dialogs/ShellDialog.tsx:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 243 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":"packages/app/src/components/dialogs/FilletChamferDialog.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe7a8ecb2c902be17b893df271595f74bbd14040c6d889ffdf1d4963d36e445"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): packages/app/src/components/cam/OperationList.tsx:479 \u00B7 packages/app/src/components/cam/ToolLibrary.tsx:95 \u2014 the two spans are one implementation copied and then locally edited \u2014 235 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b95bd3e836dd642af3f1c5859d1c7c60917f1f3e5201aa328867f6f1c320794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): packages/app/src/components/dialogs/MirrorDialog.tsx:21 \u00B7 packages/app/src/components/dialogs/PatternDialog.tsx:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 223 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":"packages/app/src/components/dialogs/MirrorDialog.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd7b0a70e032e2da0bc2246545069ed06bf11c52ea660b12858c661edb6fcf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): packages/core/src/commands/executors.ts:530 \u00B7 packages/mcp/src/tools/parts.ts:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 376 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1376b758572a47c9575a3090e6b082331848e7ba968a7a802439af837f14fd41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): packages/app/public/launch/launch.js:426 \u00B7 www/public/kit/gallery.js:599 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"216cacd8f7330365f0b15ab9c15883f8a402b7f778be3739986eda29a7a8e4ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): mecheval/harness/src/solvers/claude-mcp.ts:314 \u00B7 mecheval/harness/src/solvers/gateway-mcp.ts:104 \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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b690821d9625df03c6de9756d394b8df40267f008d89cdc1dc4a6725b5fa17f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): packages/app/src/components/SceneMesh.tsx:169 \u00B7 packages/app/src/lib/sub-feature-geometry.ts:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 398 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"671cab7fc2319d88760a9c5e0cdde2d81cf50947eeef7ea42b4802dacb88dc87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): packages/training/src/generators/hollow.ts:134 \u00B7 packages/training/src/generators/scaled.ts:143 \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":"packages/training/src/generators/hollow.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa21714bb02251d5c509e27049adc9fe6948f186f04db8511d28a071f5bdf28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): packages/engine/src/index.ts:3040 \u00B7 packages/engine/src/index.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/index.ts"},"region":{"startLine":3040}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eec19fa884c0fb42e85eb46ae03142c52f69ea1d52f03c4c3792f1deb2ecf0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 3 locations): packages/mcp/src/tools/physics.ts:73 \u00B7 packages/mcp/src/tools/structure.ts:150 \u00B7 packages/mcp/src/tools/topopt.ts:79 \u2014 the 3 copies are spread across 3 files, 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":"packages/mcp/src/tools/physics.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0f90a7df26230f0ddc834463e2975967e1743e9de42932836cac3c53bfc62b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): packages/app/src/components/FeatureTree.tsx:426 \u00B7 packages/app/src/components/InlineProperties.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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ff31d1eeca8e70a5565e2bb7febd9adb08b5f0e3431ffa83f5fa2299633ade"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): packages/training/src/generators/ball.ts:121 \u00B7 packages/training/src/generators/turned.ts:136 \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":"packages/training/src/generators/ball.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a872b37562c8f2e1744267dc0530eda686d096d6b14dad7380e85aa9ff49c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): packages/app/public/launch/launch.js:201 \u00B7 www/public/kit/gallery.js:313 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ff42fade15ef00626f15dc812cf6a9892fbd2c80824fdc030fd77e1cca7b3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): apple/VcadApp/scripts/vcad-app-discovery.mjs:55 \u00B7 packages/mcp/src/app-discovery.ts:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 278 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":"apple/VcadApp/scripts/vcad-app-discovery.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"089bb6744c94b202607db34a72848fd744f832e7b83106d7298ee01fb5f450da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/app/public/launch/launch.js:481 \u00B7 www/public/kit/gallery.js:666 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabe0278982b3c8874afbbfafabfe984e6e92da91cb8444d96e516e36966f84e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/app/src/components/PropertyPanel.tsx:1085 \u00B7 packages/app/src/components/PropertyPanel.tsx:1271 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"485f738ea3e416abcb1459569c2ecff61cd5ef85479d7af07ac1c44636773c12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/app/src/components/StatusBar.tsx:331 \u00B7 packages/app/src/components/footer/RaytraceChip.tsx:140 \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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7df8aa33f81e938a24c41ddd981e6f672a57c0cf3d23d9229a00f80b6c6e88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): packages/app/src/components/cam/CamSettings.tsx:71 \u00B7 packages/app/src/components/cam/OperationList.tsx:258 \u2014 the two spans are one implementation copied and then locally edited \u2014 183 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":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3948a73a63acead09de92a17c6abbd5dd1d25bc19181de27f7882c869f099cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/app/src/components/ui/notifications/Toast.tsx:50 \u00B7 packages/app/src/components/ui/notifications/WarningCard.tsx:61 \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":"packages/app/src/components/ui/notifications/Toast.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0994664d03550b79bb0d63e84f5ff77eebf04d45078eaf1dc155cc9beb344ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/mcp/src/tools/import-pcb.ts:64 \u00B7 packages/mcp/src/tools/import-pcb.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/import-pcb.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8f31a820a9e881cd4f6f186c04fda97752ce5108fe6cb1b0b58020d464aaf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): packages/training/src/generators/clip.ts:132 \u00B7 packages/training/src/generators/scaled.ts:148 \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":"packages/training/src/generators/clip.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fc968abc634f6113d6cb8fab0c2f960612ec57704f4ece280c6144f4c832be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 4 locations): mecheval/harness/src/solvers/claude-direct.ts:192 \u00B7 mecheval/harness/src/solvers/gateway-direct.ts:97 \u00B7 mecheval/harness/src/solvers/openai-direct.ts:115 \u00B7 mecheval/harness/src/solvers/wafer-direct.ts:81 \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":"mecheval/harness/src/solvers/claude-direct.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65a2ee6e6a9f8ef0b752cf978cef8ef839c0a036f6a6f634aaac13740a6a0c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): packages/engine/src/evaluate.ts:73 \u00B7 packages/engine/src/scene-convert.ts:24 \u2014 the two spans are one implementation copied and then locally edited \u2014 243 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bb634da414fb6bcaa7c9888f7a7a72ec4aaf0433e878e94bc70ddf3c804891"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): packages/wasmosis/src/source-parser.ts:107 \u00B7 packages/wasmosis/src/source-parser.ts:546 \u2014 both copies are in the same file, so extract the block 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b552702f186ca6bffcf921d16fbea3a1d38d24fdb7fb4617adbef91cd3ec106"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): packages/app/src/components/tree/InlineDimensions.tsx:48 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:86 \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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0420c664923d27cc729e4e28968c36763b07775d5a47cffef30e248ffc8f853c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): packages/mcp/src/tools/neutronics.ts:211 \u00B7 packages/mcp/src/tools/tolerance.ts:236 \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":"packages/mcp/src/tools/neutronics.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9379bacbfec84487ed0b2b87b4ad62757d26884b919d2de94d2f65fa5ec5c20c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3 locations): packages/training/src/cli.ts:151 \u00B7 packages/training/src/cli.ts:184 \u00B7 packages/training/src/cli.ts:217 \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":"packages/training/src/cli.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e2d342c7071876b86d75b17b07905eb28eec92411dac7d91742aaf5eeba454"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): packages/wasmosis/src/source-parser.ts:152 \u00B7 packages/wasmosis/src/source-parser.ts:605 \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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ad5b2d2ef6093293cf50655abd0fcba96f9f1ea5f0c6884563ef0b7825404e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): packages/app/src/components/DfmDrawer.tsx:427 \u00B7 packages/mcp/src/tools/registry-dispatch.ts:919 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80d12cc6b13e526080428dcd1aa9c699abe64070a206ba91f0b607538c03e4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): packages/app/src/lib/urdf-meshes.ts:107 \u00B7 packages/app/src/lib/urdf-meshes.ts:163 \u2014 the two spans are one implementation copied and then locally edited \u2014 322 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":"packages/app/src/lib/urdf-meshes.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56af84be5a9cecd2e06cd4689c53ff6089b97f6816195ff8cc21c8a9b39353e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): packages/engine/src/ecad.ts:759 \u00B7 packages/engine/src/ecad.ts:793 \u2014 both copies are in the same file, so extract the block 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":"packages/engine/src/ecad.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1ec3d94364d9d00048b635ee7529be0845f269a47672229e3246d9f41a6709"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): packages/mcp/src/tools/render.ts:950 \u00B7 packages/mcp/src/tools/render.ts:1193 \u00B7 packages/mcp/src/tools/render.ts:1357 \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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"3892c5e3e27fca8734fb9d3a1f717db5964536da625deb403ef3644262443fbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/app/src/components/AboutModal.tsx:146 \u00B7 packages/app/src/components/ProductModal.tsx:107 \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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2752ae30505fe610a1a4a2a478e674c3e3503f1c85292e7673b11c05b03c6b65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3 locations): packages/app/src/components/PropertyPanel.tsx:623 \u00B7 packages/app/src/components/PropertyPanel.tsx:647 \u00B7 packages/app/src/components/PropertyPanel.tsx:671 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5db0f2c0b65fc4c15b0d5d0d0f4eb7b6da5ee5f10549d3ca129998af9c6f98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/app/src/components/SketchPlane3D.tsx:418 \u00B7 packages/app/src/components/SketchPlane3D.tsx:454 \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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85960eef3ed396991dd321cc631a7b1997d5aa441dcc1348127ab378eec5e13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:7515 \u00B7 packages/mcp/src/tools/ecad.ts:7598 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7515}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2ebc95a85595555823a3d6e665a80fc0b4dc11a1c18946645660f41493de36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3 locations): packages/mcp/src/tools/import-pcb.ts:226 \u00B7 packages/mcp/src/tools/import-pcb.ts:323 \u00B7 packages/mcp/src/tools/import-pcb.ts:483 \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":"packages/mcp/src/tools/import-pcb.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca101dbe70d8f1c6db1f61d238f5d997ded39c8a66d2964d654138c4b0b0476"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/app/public/launch/launch.js:84 \u00B7 www/public/kit/gallery.js:196 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec00cc03ebccd009168f6dcc9325f0a937dd8b62ba7ddbe94d35da0cf6b6ef3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/app/src/components/InlineProperties.tsx:100 \u00B7 packages/app/src/components/InlineProperties.tsx:140 \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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd84550cc5c356cd535e079513776adf13f487be55f77f127b898ed3dd1f3a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): packages/mcp/src/fabricate/adapters/generic.ts:36 \u00B7 packages/mcp/src/fabricate/adapters/jlcpcb.ts:69 \u2014 the two spans are one implementation copied and then locally edited \u2014 108 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":"packages/mcp/src/fabricate/adapters/generic.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"969a805685f855c6620ac8f4e4d8de0e6617a5ed57e92c63a712c5a58e77450d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/app/src/components/SplashMolecule.tsx:10 \u00B7 packages/app/src/stores/molecule-store.ts:113 \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":"packages/app/src/components/SplashMolecule.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"228081620186c8724225f3c6ddd89bf706f82d58b9f38ee94849937f13c2479e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/app/src/components/electronics/SchematicCanvas.tsx:610 \u00B7 packages/app/src/components/electronics/SchematicCanvas.tsx:680 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dce901a0b2f7fa18c22d33bbe4502164ccfd58cb686ecf96656ce2f635d1dd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/engine/src/index.ts:2344 \u00B7 packages/engine/src/index.ts:2387 \u2014 both copies are in the same file, so extract the block 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":"packages/engine/src/index.ts"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"822c9fd458753f3823928db33d49d47abb8c691587afe2eac4b44658dd7397a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:9043 \u00B7 packages/mcp/src/tools/ecad.ts:9105 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9043}}}],"partialFingerprints":{"codehealthFindingId/v1":"409249d1158d843ca0fb70c88f395ad17d7a047c10c17db8a9fbd06fdb39f100"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/mcp/src/tools/gym.ts:754 \u00B7 packages/mcp/src/tools/gym.ts: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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82a4c79d703e0f4de65f2fb72403862992dcd0ab43d993fc632042c7692cfbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/mcp/src/tools/physics.ts:24 \u00B7 packages/mcp/src/tools/topopt.ts:30 \u2014 the 2 copies are spread across 2 files, 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":"packages/mcp/src/tools/physics.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"90740b60ded1330cec3a5703189242e6930559583d7db0d4cbdeda7b653f2b9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): packages/app/src/components/PropertyPanel.tsx:86 \u00B7 packages/app/src/components/PropertyPanel.tsx:122 \u00B7 packages/app/src/components/PropertyPanel.tsx:161 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a64fbb976507c34f4b6b9e6124f67e07437d2fbc9109f8d81dd679ec31c1df3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/app/src/components/SceneMesh.tsx:262 \u00B7 packages/app/src/components/SceneMesh.tsx:290 \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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4986ad0860da336c0f880f1a030bbbfb654b97349ba98e9d2c8c3cf50f0951a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5 locations): packages/app/src/components/cam/CamSettings.tsx:22 \u00B7 packages/app/src/components/cam/CamSettings.tsx:44 \u00B7 packages/app/src/components/cam/CamSettings.tsx:78 \u00B7 packages/app/src/components/cam/OperationList.tsx:265 \u00B7 \u002B1 more site(s) not listed \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":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ef9f8ced8e442d3f9139dbba2c8deba15eeb8d8e81c97a373f86f167abb3cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/app/src/components/dialogs/MirrorDialog.tsx:30 \u00B7 packages/app/src/components/dialogs/ShellDialog.tsx:22 \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":"packages/app/src/components/dialogs/MirrorDialog.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c9a32a8465e724ae6863ee20c365a2efb09c9902ddf127a3811fc61e4d00b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): packages/app/src/components/shadcn/command.tsx:148 \u00B7 packages/app/src/components/shadcn/dropdown-menu.tsx:173 \u00B7 packages/app/src/components/shadcn/input-group.tsx:123 \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":"packages/app/src/components/shadcn/command.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9511ec1b15766c476d12a0cb9c4d687ce20d5c9d40050a2013ab308f1a2ed149"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): packages/engine/src/analyze-worker.ts:33 \u00B7 packages/engine/src/eval-worker.ts:68 \u2014 the two spans are one implementation copied and then locally edited \u2014 137 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":"packages/engine/src/analyze-worker.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"db75fcb6a3d675f166bce420455a19043562c06c0929f6c9a4f1554087e065b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): packages/engine/src/mesh-cache.ts:15 \u00B7 packages/engine/src/solid-cache.ts:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 150 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":"packages/engine/src/mesh-cache.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca20ffa57c31651c728a54d570754c955a2ef4272048377128b88f5cd3dda398"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/mcp/src/tools/em.ts:253 \u00B7 packages/mcp/src/tools/particle.ts:402 \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":"packages/mcp/src/tools/em.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9712a9de55829b1382aea940615ed79c5b38e55dbdfc7e4701986442846299fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/training/src/generators/bracket.ts:88 \u00B7 packages/training/src/generators/plate.ts: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":"packages/training/src/generators/bracket.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75d509dfaa8d7eba738901a8e9aee40a48b539693a952da3c398faa13031519"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): mecheval/harness/src/solvers/claude-direct.ts:158 \u00B7 mecheval/harness/src/solvers/openai-direct.ts:71 \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":"mecheval/harness/src/solvers/claude-direct.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba61c5fa53718a793bcec4df838dc2c90db5837201e67323cdcd8af2217d66ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/app/public/launch/launch.js:364 \u00B7 www/public/kit/gallery.js:537 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"8575de7cf36a44ba9058655cc8690c7bf01fbc64cd18ae83b658688e515bf64f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): packages/app/src/components/SceneMesh.tsx:143 \u00B7 packages/app/src/components/SceneMesh.tsx:172 \u00B7 packages/app/src/lib/sub-feature-geometry.ts:31 \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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"99136b03469235f2f0bd76418784b03756f1a9735c046488fa2d78da66ab82f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/app/src/components/SketchPlane3D.tsx:150 \u00B7 packages/app/src/components/SketchPlane3D.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6528748fff03eae818b52afa0ffa4a11e3a6ede8ffa9bbf530b2b84e3e8803a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/app/src/components/SketchPropertyPanel.tsx:528 \u00B7 packages/app/src/hooks/useOperationPreview.ts:98 \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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"659f06d659f8ba7e7d949b69ab9dd5f0ec4ad172fe91472ba34c0edaefd2ba38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/app/src/components/cam/OperationList.tsx:116 \u00B7 packages/app/src/components/cam/OperationList.tsx:291 \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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d420a65075cc93cedb1d1682283b846102060ef92a73deead9aa8142258918f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/app/src/components/tree/InlineTransform.tsx:32 \u00B7 packages/app/src/components/tree/InlineTransform.tsx: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":"packages/app/src/components/tree/InlineTransform.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a857b08fc9f20b18f1ed2e104f4d6cf0c79c59c50aa46483126d3a7c457d3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/app/src/components/ui/notifications/AIProgressCard.tsx:132 \u00B7 packages/app/src/components/ui/notifications/WarningCard.tsx:127 \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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6119cbf0ec3f46b52761ab68259912dc59476cfaf79c8eeb502e6a3c979cfd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/app/src/hooks/useEngine.ts:50 \u00B7 packages/app/src/hooks/useEngine.ts:132 \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":"packages/app/src/hooks/useEngine.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5d428e3f9fe87078127c4d3758cfdbdf6715cf5eddd28bd4f33cc66e8307f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): packages/mcp/src/tools/animate.ts:722 \u00B7 packages/mcp/src/tools/animate.ts:1034 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"219580e03698880ca27520b3f7ff7819959729f08c662e053a47e6e8933b3bce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/mcp/src/tools/flow.ts:17 \u00B7 packages/mcp/src/tools/thermal.ts:25 \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":"packages/mcp/src/tools/flow.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b1bf5b9918a015dbd138837c38a65e14e98bc6ffeaa7cbc754fe742e4aa1b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/mcp/src/tools/gym.ts:347 \u00B7 packages/mcp/src/tools/gym.ts:861 \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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e449236bc49349f4a9f1485edef0257f1c0d6add068bbd4a82e59c05bcedfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/mcp/src/tools/gym.ts:489 \u00B7 packages/mcp/src/tools/gym.ts:931 \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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5ec8b6cc7f7a8abb1af62f8bdf13a8906f3e3de45099f816b158495bf3c63b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/mcp/src/tools/structure.ts:398 \u00B7 packages/mcp/src/tools/structure.ts:498 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/structure.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee97048f997cbd7d8f3f695017515d5679976ff979e6d6517aa7f8b9fddb512"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/public/launch/launch.js:18 \u00B7 www/public/kit/gallery.js: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":"packages/app/public/launch/launch.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b2bc8f474f564e8b1813f4fdd4d4c3b010db36e3fa7f39549ad1088ca39b23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/src/App.tsx:337 \u00B7 packages/app/src/App.tsx:770 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/App.tsx"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dc9e7679670b88f0ce253bc3b7866af9a39fab6802408b41a32395a23d1b2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/src/components/FeatureTree.tsx:907 \u00B7 packages/app/src/components/FeatureTree.tsx:1005 \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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad651c0f9bf80412b3e4973a43a96a915e2d2d5494a8868a6fb5bf06aa11309"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/src/components/cam/OperationList.tsx:171 \u00B7 packages/app/src/components/cam/OperationList.tsx:206 \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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ad43f438af3f8f27e3ac6a2a85303f864ab3b3e76223cfadaddaf88ebf6e15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/src/components/dialogs/StitchDialog.tsx:79 \u00B7 packages/app/src/components/embroidery/EmbroideryPanel.tsx:201 \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":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8fdb9ceb46aa3be1a1d7474a6f0bf1570e1c5e33b89754e63e277b3ac49efe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/src/components/electronics/EcadFeatureInspector.tsx:74 \u00B7 packages/app/src/components/electronics/EcadFeatureInspector.tsx:103 \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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d3a4a22283c04d63de609a70fa4beea9f87a25cc23c87d0fb97fa8f5f6e08a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/src/components/electronics/LengthTunePanel.tsx:45 \u00B7 packages/app/src/components/electronics/LengthTunePanel.tsx:64 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/electronics/LengthTunePanel.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6549cd9edf4fb11901cb4bdc6cd45c2e86f188f68a445d3e4c7b90c21dbbed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/app/src/components/materials/MaterialSwatch.tsx:14 \u00B7 packages/app/src/components/tree/InlineMaterial.tsx:16 \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":"packages/app/src/components/materials/MaterialSwatch.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a552014f4ba61ddcbfc94a6eea594bd26a056c469282d9f2c8dd92d73ff6c4df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5 locations): packages/app/src/hooks/useToolDefinitions.tsx:944 \u00B7 packages/app/src/hooks/useToolDefinitions.tsx:963 \u00B7 packages/app/src/hooks/useToolDefinitions.tsx:995 \u00B7 packages/app/src/hooks/useToolDefinitions.tsx:1013 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"33975286f2c48ab396621e13b8b277212aa24c43c7fc1d37b490d0dc90d046ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:2079 \u00B7 packages/core/src/stores/document-store.ts:2129 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f2877103afd13747b9d7a3613a97c1a77510feb1c68aaf8290b969ab9058c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/engine/src/gpu.ts:112 \u00B7 packages/engine/src/gpu.ts:143 \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":"packages/engine/src/gpu.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0ee038bea80d4241f60296b0508b512d226d66e003ee229d42911be2aa9c91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): packages/engine/src/index.ts:2201 \u00B7 packages/engine/src/index.ts:2233 \u00B7 packages/engine/src/index.ts:2265 \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":"packages/engine/src/index.ts"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5839f6531d4403dc2ec23fecd5c06ec0236e89fc96276e3f5c1b2b3de935781f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/mcp/src/tools/batch-edit.ts:304 \u00B7 packages/mcp/src/tools/registry-dispatch.ts:493 \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":"packages/mcp/src/tools/batch-edit.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc3fd77e82d2070c790cbe057b3e58eadb941b1b65c3b1b6abeac14d028c13c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/mcp/src/tools/dfm.ts:213 \u00B7 packages/mcp/src/tools/dfm.ts:266 \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":"packages/mcp/src/tools/dfm.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c3451fd267a6900a01503fec6d5bdd89ee35b71627fbdc4c516ca003c8e2b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5 locations): packages/mcp/src/tools/em.ts:255 \u00B7 packages/mcp/src/tools/flow.ts:158 \u00B7 packages/mcp/src/tools/particle.ts:404 \u00B7 packages/mcp/src/tools/photonics.ts:105 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"packages/mcp/src/tools/em.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b02efe8ba7a8d9d9146242344950d5a0b17ef9d974c6095b36a4ad2c20ba328"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/mcp/src/tools/render.ts:1073 \u00B7 packages/mcp/src/tools/render.ts:1301 \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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"428c3ec6e3860d022ac76bc253b87ddb67a1b10ecccdeba0525ca336ba2fc175"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/app/src/components/RayTracedViewport.tsx:278 \u00B7 packages/app/src/components/RayTracedViewport.tsx:337 \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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d549fdf5cc139c2149b789131333b22d0f198227a49f36c2482be1685ac51bb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): packages/app/src/components/dialogs/NewPcbDialog.tsx:144 \u00B7 packages/app/src/components/dialogs/NewPcbDialog.tsx:181 \u00B7 packages/app/src/components/dialogs/NewPcbDialog.tsx:222 \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":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"640fe5e87289d7fda8de9b0dbbaa8180b93060878826a171c4f21a821e117883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/app/src/components/shadcn/select.tsx:143 \u00B7 packages/app/src/components/shadcn/select.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/select.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ad57da1b012ebf5c19e4b62e6b470c88da52d03c11a4d2186abf717dd065e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): packages/core/src/stores/document-store.ts:807 \u00B7 packages/core/src/stores/document-store.ts:827 \u00B7 packages/core/src/stores/document-store.ts:849 \u00B7 packages/core/src/stores/document-store.ts:871 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13a96da29a6da5bb9189dd782e1a72890d7c30c77a2a5a6edb675e4a9f78c86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/engine/src/evaluate.ts:237 \u00B7 packages/engine/src/index.ts:3185 \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":"packages/engine/src/evaluate.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa89421f0b155b65848f91c523723443635b94b9b737030669bc6e74fb0aa25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/ir/src/index.ts:1116 \u00B7 packages/ir/src/index.ts:1138 \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":"packages/ir/src/index.ts"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"85102355f6b561b3d1bb606ba03e7409eb13a44a5e401d19cee8476a1ab9438f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/mcp/src/tools/dfm.ts:245 \u00B7 packages/mcp/src/tools/dfm.ts:297 \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":"packages/mcp/src/tools/dfm.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef7d5f72871914ebd213e32eb42191f39ececa186a34c81c28ec53496de0425"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/mcp/src/tools/neutronics.ts:150 \u00B7 packages/mcp/src/tools/thermal.ts:386 \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":"packages/mcp/src/tools/neutronics.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddbb6ac2b5e731120da1c3b886e39fd84064305a6527f2e8535d2ff73164e59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): www/src/hero-engine.js:248 \u00B7 www/src/wireframe.js: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":"www/src/hero-engine.js"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e67640c33533d245d706a8cc5492316aa06bcbf433fae8cd09e1b570d71636"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/app/public/launch/launch.js:338 \u00B7 www/public/kit/gallery.js:511 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c376f124c6fede3363d4ed84f161c122e458bf6935873e123b20f3799566919"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/app/src/components/PropertyPanel.tsx:263 \u00B7 packages/app/src/components/PropertyPanel.tsx:302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8060d6dba2a0c6cf976cfeef38f74c8597b7ccc45cd1888f9f7302b40b228634"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/app/src/components/dialogs/AddJointDialog.tsx:149 \u00B7 packages/app/src/components/dialogs/InsertInstanceDialog.tsx:81 \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":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"555d1b5bb1c82fdc0be1ce1990c10e79cee64450a4b317ba5cf33d7fa87b9511"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/app/src/components/dialogs/PatternDialog.tsx:143 \u00B7 packages/app/src/components/dialogs/StitchDialog.tsx:147 \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":"packages/app/src/components/dialogs/PatternDialog.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"55449dd69b04e1380364f2ca9ca0f08ebf53a9d7967be63ceda025daf03e7681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): packages/app/src/components/tree/InlineDimensions.tsx:192 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:219 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:246 \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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b6a456684db26d7d390a71047db18beff17b3367af70a9bb5d855746901208"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): packages/app/src/components/tree/InlineDimensions.tsx:212 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:239 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:266 \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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"85078deee7615861da90016e9c2bda24c4664c164b14aff850e678a500f528cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/app/src/components/ui/dialog.tsx:51 \u00B7 packages/app/src/components/ui/panel.tsx:17 \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":"packages/app/src/components/ui/dialog.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b282c0564097e0feede71dbc494607a9b17e173fe720986090f1234f145f4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/core/src/engine-lifecycle.ts:59 \u00B7 packages/mcp/src/server.ts:824 \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":"packages/core/src/engine-lifecycle.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97dc2f678bdf2fc467523610d05d6f17b6d1d3487d0169f87ff164557d0989d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/core/src/stores/sketch-store.ts:211 \u00B7 packages/core/src/stores/sketch-store.ts:229 \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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2c075eba135e860fab468713369f6916a4c0175637998ccb0c143698e02a3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:4908 \u00B7 packages/mcp/src/tools/ecad.ts:14453 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4908}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ad1d3b7e6d015d80e4ef5049ef15e51b50af74c4bed3554e06cb9f12521d0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): packages/mcp/src/tools/import-pcb.ts:195 \u00B7 packages/mcp/src/tools/import-pcb.ts:371 \u00B7 packages/mcp/src/tools/import-pcb.ts:443 \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":"packages/mcp/src/tools/import-pcb.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6ddd817aa513edee8074ba6c7b209f602e0405a0246427ae09d7e8d3ae91b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/public/launch/launch.js:63 \u00B7 www/public/kit/gallery.js:150 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8ac05aa419bd15ececead0c259157d6f1c9698c7580e9b4fad6a746ebab3b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/app/src/components/DimensionOverlay.tsx:228 \u00B7 packages/app/src/components/InlineProperties.tsx:178 \u2014 the two spans are one implementation copied and then locally edited \u2014 155 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":"packages/app/src/components/DimensionOverlay.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"74834dd9b62d733f884b9b96fd5aaa4fd3d97d432dd61eae3c8569441898c616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/src/components/DrawingToolbar.tsx:179 \u00B7 packages/app/src/components/DrawingToolbar.tsx:207 \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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"858786227c1bc2f96a7398894685ae7afc7cc6534916c05d78fb4b10df462b70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5 locations): packages/app/src/components/Header.tsx:492 \u00B7 packages/app/src/components/Header.tsx:536 \u00B7 packages/app/src/components/Header.tsx:562 \u00B7 packages/app/src/components/Header.tsx:602 \u00B7 \u002B1 more site(s) not listed \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":"packages/app/src/components/Header.tsx"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e311aa0e6c5de8535637019ebe229b62d4305d1ed97c98e7ef11b44df4055ffb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/src/components/PropertyPanel.tsx:1010 \u00B7 packages/app/src/components/PropertyPanel.tsx:1041 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"83668199d7bb1a3bf89d62fd155dec77f19885e9da80ea1fa3a45895caa9a496"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/src/components/ViewportContent.tsx:1321 \u00B7 packages/app/src/components/ViewportContent.tsx:1440 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b4363c37a0b6673014a899dc1029e137467ea06ce4cf02bcafabae0b9e8a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8 locations): packages/app/src/components/cam/OperationList.tsx:87 \u00B7 packages/app/src/components/cam/OperationList.tsx:105 \u00B7 packages/app/src/components/cam/OperationList.tsx:131 \u00B7 packages/app/src/components/cam/OperationList.tsx:149 \u00B7 \u002B4 more site(s) not listed \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c38f2ddbd1f0c9e531bc6ad105345c9ccc7c953264a06c23039ec20b96833a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/src/components/electronics/EcadFeatureInspector.tsx:226 \u00B7 packages/app/src/components/electronics/EcadFeatureInspector.tsx:251 \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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcc58f3e6cfd12dae7524dc0d188ae9b0b68b9be63df1f7346be2875b68b7c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/src/components/electronics/PcbFootprintGroup.tsx:69 \u00B7 packages/app/src/components/electronics/PcbFootprintGroup.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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a10dc21368e711aa49b8276ae5a58451b403adebbc8752b42adcc1860d154f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/src/components/electronics/SchematicCanvas.tsx:920 \u00B7 packages/app/src/components/electronics/SchematicCanvas.tsx:1022 \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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cd73f4e119d8ec4ad40424837171935b3a1e707681d54801de486245c59cf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/app/src/hooks/useKeybindingDispatcher.ts:154 \u00B7 packages/app/src/hooks/useKeybindingPrefs.ts:36 \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":"packages/app/src/hooks/useKeybindingDispatcher.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"562e96d22b95d417acda006a04911f0e75ae3f3c496de6d3d9a6aa4dd7c3c728"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/app/src/stores/electronics-store.ts:479 \u00B7 packages/app/src/stores/electronics-store.ts:495 \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":"packages/app/src/stores/electronics-store.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc35d752c9d531667f1f8038b4ea9a362db0dac87c4226c32721de43f95edd18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/engine/src/index.ts:1878 \u00B7 packages/engine/src/index.ts:1919 \u00B7 packages/engine/src/index.ts:2158 \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":"packages/engine/src/index.ts"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b7070424b87501a054b7f60fd330360db9a6fcf4cf59d349d45814289ee3d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:5429 \u00B7 packages/mcp/src/tools/ecad.ts:5462 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5429}}}],"partialFingerprints":{"codehealthFindingId/v1":"30712ca539fb15bf3cbaf9737896e5aa23d0b404e79d6c3fbfe009bfbaa3da3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:9709 \u00B7 packages/mcp/src/tools/ecad.ts:10711 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9709}}}],"partialFingerprints":{"codehealthFindingId/v1":"015d74e506d57f904aaba368d234b1d2f8aec4ad53804a0a23629ccc81683a95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/mcp/src/tools/faces.ts:337 \u00B7 packages/mcp/src/tools/joint-range.ts:385 \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":"packages/mcp/src/tools/faces.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"614a891c6b69bbd48533370568f9ad095be45cdcc9b1a569d191d11d5b22e463"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/mcp/src/tools/pcb-validate.ts:67 \u00B7 packages/mcp/src/tools/pcb-validate.ts: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":"packages/mcp/src/tools/pcb-validate.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7839cfc08e86de16776a78a3607a0d5ede00c03fd622bd4f0d00e1cae319e41a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/mcp/src/tools/thermal.ts:450 \u00B7 packages/mcp/src/tools/tolerance.ts:205 \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":"packages/mcp/src/tools/thermal.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3a61b23f7920ec6328be9f51078de388cd8aee29910a15a784db43effe3946"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/training/src/generators/array.ts:186 \u00B7 packages/training/src/generators/array.ts:253 \u2014 the two spans are one implementation copied and then locally edited \u2014 225 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":"packages/training/src/generators/array.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2642366328c8983221af9b3f0807fec30ffe3e7bd13e9da80b7d280b911a242"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/wasmosis/src/cli.ts:170 \u00B7 packages/wasmosis/src/cli.ts:407 \u00B7 packages/wasmosis/src/cli.ts:521 \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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7ed522c118d8b9cc8a334a4509684bf610d4a6dbb1c8e72dc146f9f8e49d0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): packages/app/src/components/CommandPalette.tsx:296 \u00B7 packages/app/src/components/InlineOnboarding.tsx:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ee43f213c53e68bb268452b843fab8897b53df042c4acfcfc33b61bc3c1205"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/app/src/components/PropertyPanel.tsx:406 \u00B7 packages/app/src/components/PropertyPanel.tsx:423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"46454a931bd156215e6871a1336b2773441de7050807facb49376fb3d8bb4e73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/app/src/components/PropertyPanel.tsx:587 \u00B7 packages/app/src/components/PropertyPanel.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d496b44cae64328d1f9369b0d747328eeb8327567ee551a86061e3fa0cf7f19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/app/src/components/SelectionOverlay.tsx:133 \u00B7 packages/app/src/components/Viewport.tsx:156 \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":"packages/app/src/components/SelectionOverlay.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"97686db64bc6cd0bb178aaac54f968e85d9922a913b5389d65636611d2be6a8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/engine/src/index.ts:1581 \u00B7 packages/engine/src/index.ts:1715 \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":"packages/engine/src/index.ts"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e7bd472a4861deb99532fd53fa98d2cf1ca4bd6117f05fc0325ecd94a3a9d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/engine/src/index.ts:1998 \u00B7 packages/engine/src/index.ts:2097 \u00B7 packages/engine/src/index.ts:2795 \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":"packages/engine/src/index.ts"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86bcc6d0a4b00c597dda27ef7a26aae9850d2f7a69c06df9836d266e9bfc492"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/engine/src/sheet-metal.ts:437 \u00B7 packages/engine/src/sheet-metal.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/sheet-metal.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38fa7487c4bb5d68dca1445581992876df28c4b94f007818c20d89e340c8ca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/ir/src/index.ts:1355 \u00B7 packages/ir/src/index.ts:1370 \u00B7 packages/ir/src/index.ts:1385 \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":"packages/ir/src/index.ts"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"615e224c467d54d770aa7419c53b5c8422630f546cbe310a5139c4ebd1b34062"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:9067 \u00B7 packages/mcp/src/tools/ecad.ts:9130 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9067}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ba3c870f9aa50a79ccb74504e12a208f22d0dc0335499b4e2e8d2b1a8efda0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/mcp/src/tools/joint-range.ts:421 \u00B7 packages/mcp/src/tools/measure.ts:468 \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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f5c14f99480bc4ce81dd943947b1ac256fb733ccb75eba95daf0effb60cbaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/mcp/src/tools/render.ts:1223 \u00B7 packages/mcp/src/tools/render.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f9695c93af98199a12ef7e8934240f96118679eab766153d637b020d51af55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/training/src/cli.ts:517 \u00B7 packages/training/src/cli.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/training/src/cli.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d41718a298b7046e56fbc12f6aba55c8c0a5a4f51193515c9fd71ab04f4e6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/training/src/cli.ts:743 \u00B7 packages/training/src/cli.ts:758 \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":"packages/training/src/cli.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"590a37be4490a919d26811cc95fd4297570c3c377113cd1c4d5321696c43ca7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/training/src/generators/bracket.ts:135 \u00B7 packages/training/src/generators/shaft.ts:164 \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":"packages/training/src/generators/bracket.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac65060df84b999428a5582a0f7abde3059b8ac4bf5bb38e6d674580270fc660"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/training/src/generators/flange.ts:234 \u00B7 packages/training/src/generators/mount.ts:246 \u00B7 packages/training/src/generators/mount.ts:273 \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":"packages/training/src/generators/flange.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d03b56ffc074531c49541dafa9d9899aa0db3999b2ac91a49a6ca36787b5785"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/wasmosis/src/source-parser.ts:640 \u00B7 packages/wasmosis/src/source-parser.ts:668 \u00B7 packages/wasmosis/src/source-parser.ts:690 \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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"65487ff59bfad3910fa9d25861aea8c384ab02475e7930d9bba648025c94f6d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/app/public/launch/launch.js:322 \u00B7 www/public/kit/gallery.js:487 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"048c41649ef54ded3dff131033eebb74050f252948eb94f8d55de6ba72633450"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/app/public/launch/theme.js:2 \u00B7 www/public/theme.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":"packages/app/public/launch/theme.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f3f0ee6b2259ec1dab7a068a2e4735e5751c4ba723f23129e34bb450fca047"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): packages/app/src/components/InlineProperties.tsx:66 \u00B7 packages/app/src/components/InlineProperties.tsx:79 \u00B7 packages/app/src/components/InlineProperties.tsx:92 \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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa845100d13f38e3186b37c1832737214a2a249e71d072be57a2a9472f8b73c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/app/src/components/RayTracedViewport.tsx:408 \u00B7 packages/app/src/components/footer/RaytraceChip.tsx:37 \u2014 the two spans are one implementation copied and then locally edited \u2014 146 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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3fb6cd8142ea9efea1c5dfc14a1a56ceaacb7b6f319c8f5936200f25c26420"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/app/src/components/SketchPlane3D.tsx:385 \u00B7 packages/app/src/components/SketchPlane3D.tsx:447 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81fd27b9a196dc80b7644edda1fb3df732f19155822c6f18105acf727ba8c8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/app/src/components/ViewportContent.tsx:251 \u00B7 packages/app/src/components/ViewportContent.tsx: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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb800492aef903966e27841faeeb193760951cbf13962d9642a5763e6aa8e45e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/app/src/components/cam/CamPanel.tsx:21 \u00B7 packages/engine/src/ecad.ts:128 \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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa29ea651abe4166a4d6c76a1ec87320e7a71bad9ff204d90f93186b58d6bead"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5 locations): packages/app/src/components/dialogs/NewPcbDialog.tsx:183 \u00B7 packages/app/src/components/dialogs/NewPcbDialog.tsx:210 \u00B7 packages/app/src/components/dialogs/NewPcbDialog.tsx:224 \u00B7 packages/app/src/components/dialogs/TextDialog.tsx:69 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb25bbb04f774765b97fb2897a76839c45ec53e318a5e1f7bde9ac3f656bdb39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): packages/app/src/components/materials/MaterialEditor.tsx:40 \u00B7 packages/app/src/components/materials/MaterialSwatch.tsx:26 \u00B7 packages/app/src/components/tree/InlineMaterial.tsx:26 \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":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c9f055c714a7523a5ebb7980ef43d0d02fc9469a813c0e45d969edf9ee704"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/engine/src/ecad.ts:1352 \u00B7 packages/engine/src/ecad.ts:1958 \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":"packages/engine/src/ecad.ts"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"2288f2b77bc58598a14fb038deac5ae8efea9a34fb4271b63f051d41d63de22b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/engine/src/ecad.ts:1835 \u00B7 packages/engine/src/ecad.ts:1896 \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":"packages/engine/src/ecad.ts"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9280209f02983ef3fb4fa3c7b27127bbb389be25e4b24923bcf0b9a2d753883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/engine/src/evaluate.ts:903 \u00B7 packages/engine/src/evaluate.ts:917 \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":"packages/engine/src/evaluate.ts"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abb10ad79c80868ba34386cf3dc8184868b5c5984a6d50ca13ac2b8d90f80e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/ir/src/index.ts:1294 \u00B7 packages/ir/src/index.ts:1308 \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":"packages/ir/src/index.ts"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dabdcbd57f670f75c0b8d36ac84e863728a10cbd256d707b319c8f4e38efcad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): www/src/hero-app.js:6 \u00B7 www/src/receipt-art.js:6 \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":"www/src/hero-app.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a443ca3f782ec0f7cf1d38667a4b773addd6245e8205e563a9d2350261ca14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/App.tsx:430 \u00B7 packages/app/src/App.tsx:489 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/App.tsx"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee2b760de29936bc323d33d4841d98fd68291249f652b5822d24411c1d7824f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/App.tsx:552 \u00B7 packages/app/src/components/embroidery/EmbroideryPanel.tsx:76 \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":"packages/app/src/App.tsx"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8325362ed7dbcc43d9ae4cf6ee9ce1de2f28ed8b55f959f348fb361ffbaeea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/components/AnalyzePanel.tsx:245 \u00B7 packages/app/src/components/AnalyzePanel.tsx:293 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c511e54dea730ef9f77b0c052b53607f5ffa9190f7a29735b64596bfb637608"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/components/DrawingView.tsx:1092 \u00B7 packages/app/src/components/DrawingView.tsx:1107 \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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"55257238a3a3d4d5f983fee971267a6a3b32610c475037efe443f3d83c53c8e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/components/FeatureTree.tsx:549 \u00B7 packages/app/src/components/PropertyPanel.tsx:1646 \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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba8d558b63055211aa8a2b38b4e374ae8411b89c2220524059f09f9345b3db7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/components/SceneMesh.tsx:783 \u00B7 packages/app/src/components/Viewport.tsx:160 \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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba98fd2389ee7e10f228978243b22f0c4340e22fd13a1cf16aee276e73ec6238"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/components/dialogs/TextDialog.tsx:75 \u00B7 packages/app/src/components/dialogs/TextDialog.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c1de20e573a12cbd013a42a6479e723019bb75a16f7916f9e2eb461b25730b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/app/src/components/tree/InlineDimensions.tsx:307 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:319 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:331 \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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"351017757c7ed4b2b6dc23bb93e1e3ad3f16294b5368d2c77b4ce3be269c4148"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): packages/app/src/hooks/useCameraControls.ts:126 \u00B7 packages/app/src/hooks/useCameraControls.ts:167 \u00B7 packages/app/src/hooks/useCameraControls.ts:186 \u00B7 packages/app/src/hooks/useCameraControls.ts:205 \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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dd4856d21d818afc316883c13da7da7b46631fffa9fa2d7a7a6fff768a8a08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/hooks/useElectronicsSync.ts:125 \u00B7 packages/app/src/hooks/usePcbAutoFit.ts:57 \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":"packages/app/src/hooks/useElectronicsSync.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83afc9d8549a69e9b8a7666fcfccc5ea3fe33fbf3652b9a00aa2e403aa81302"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/lib/bootstrap.ts:274 \u00B7 packages/app/src/lib/bootstrap.ts:292 \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":"packages/app/src/lib/bootstrap.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"25239595bee354ea821ba49a6dd1b29029f0b16077031f2251c15f27e10a6b98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/lib/storage.ts:222 \u00B7 packages/app/src/lib/storage.ts:249 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/lib/storage.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85f6e35a178b038e262e5e977511a3ab41709013dab8d271db654d1e5dba0a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/app/src/stores/analyze-store.ts:306 \u00B7 packages/app/src/stores/analyze-store.ts:355 \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":"packages/app/src/stores/analyze-store.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b089474600cf57e0c51f8653dc7379a9fd4fc4201eabcdd5eeafa46cf6db0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/core/src/utils/geometry.ts:10 \u00B7 packages/core/src/utils/save-load.ts:6 \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":"packages/core/src/utils/geometry.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a99476b84f30bb60cd1ec505aab87745f1fa3eb6fff10d7a5b59fda4c1d681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/engine/src/ecad.ts:1676 \u00B7 packages/engine/src/ecad.ts:1730 \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":"packages/engine/src/ecad.ts"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5ba354019d466ebc799c34a853ed4559e1574ff960b39d97820c11ae1d4b1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/engine/src/evaluate.ts:769 \u00B7 packages/engine/src/evaluate.ts:907 \u00B7 packages/engine/src/evaluate.ts:921 \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":"packages/engine/src/evaluate.ts"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"6850773fdb21da5e1df95f187d3a9368b612d11790b999bb09fe1909d08d7132"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/engine/src/index.ts:2109 \u00B7 packages/engine/src/index.ts:2325 \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":"packages/engine/src/index.ts"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8d2424e39d7d26027a1ae84669b5c46a533c5466c3fe6e8f7228049b6178f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ir/src/index.ts:1135 \u00B7 packages/ir/src/index.ts:1157 \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":"packages/ir/src/index.ts"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e67c0f388d14ed08eb20a5f70b74a9f493a2c8aa6883c1d0acb7dbc57628cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/ir/src/index.ts:1160 \u00B7 packages/ir/src/index.ts:1178 \u00B7 packages/ir/src/index.ts:1193 \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":"packages/ir/src/index.ts"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3428e46124a45b67d5ba4fb74b1a57f42ed3bf93781dafc5163b1813b02c0f8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:3041 \u00B7 packages/mcp/src/tools/ecad.ts:3053 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4e32267da81abb4cc10294e405e91103d8f571d319f52815604c25b3b9e93d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:5968 \u00B7 packages/mcp/src/tools/ecad.ts:14750 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5968}}}],"partialFingerprints":{"codehealthFindingId/v1":"f306ae295a10df3e4d74484e255513ca946d9ee8350eaffe8241e03a736e73cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): packages/mcp/src/tools/ecad.ts:9444 \u00B7 packages/mcp/src/tools/ecad.ts:9537 \u00B7 packages/mcp/src/tools/ecad.ts:9633 \u00B7 packages/mcp/src/tools/ecad.ts:10604 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9444}}}],"partialFingerprints":{"codehealthFindingId/v1":"464558ed6076d284e86255da3efa1e0e9c0612c61775703a029fa44bbf906273"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/mcp/src/tools/gym.ts:727 \u00B7 packages/mcp/src/tools/gym.ts:782 \u00B7 packages/mcp/src/tools/gym.ts:1075 \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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24c477c91a98669e970d877b13f9dd2ab2f44f6bfc92403da2d82e9a42ddf32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/mcp/src/tools/render.ts:1033 \u00B7 packages/mcp/src/tools/render.ts:1246 \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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"c251ea8d25b428f662624c8478ce36185a7312f1d0da6c2468fe23377043a0c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/mcp/src/tools/render.ts:1180 \u00B7 packages/mcp/src/tools/render.ts:1344 \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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2ebb840f43d54c47638cbfff2db117783a8488ed3516efb6427fd89ddad602"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/mcp/viewer-app/main.ts:925 \u00B7 packages/mcp/viewer-app/main.ts:939 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac73f93e42df48c762eb69929c5a67e89f360606626fabbba6efc655df0f03f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/training/src/annotate.ts:89 \u00B7 packages/training/src/infer.ts:98 \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":"packages/training/src/annotate.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e93e19414629a7e76a3267a4ff5980f10d1257582c7f91fbf807181cd39516"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): www/src/hero-engine.js:233 \u00B7 www/src/wireframe.js: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":"www/src/hero-engine.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bd91aaed41edb2c76757dea931a8faf5dfd7854d408012b6be583eb2f12dff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/CameraSettingsPanel.tsx:109 \u00B7 packages/app/src/components/CameraSettingsPanel.tsx: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":"packages/app/src/components/CameraSettingsPanel.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1fa3ac131bed852aeab86e2bbc447eff1acdc5c8104b16382789b4d785564b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/CommandPalette.tsx:502 \u00B7 packages/app/src/components/CommandPalette.tsx:520 \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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8a28415528ba9b8a1238323ccaa6c62c3fc94f47bbed7f0598b0b403214850"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/DocTitle.tsx:121 \u00B7 packages/app/src/components/footer/CursorCoordChip.tsx:182 \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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"86631f542705793134513dc6f2b2db78e98977124e1bfcb09d59a6b814053feb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/DrawingView.tsx:319 \u00B7 packages/app/src/components/ViewportContent.tsx:1090 \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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aea02a6951d91599afe5105e5711a24706cebb4762b18be61901228580c3549"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/app/src/components/FeatureTree.tsx:254 \u00B7 packages/app/src/components/FeatureTree.tsx:280 \u00B7 packages/app/src/components/FeatureTree.tsx:321 \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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a7998ad8eb21317ba7bf5da5371755ad4dad43e29423377fad25e929ae7c67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/FeatureTree.tsx:1197 \u00B7 packages/app/src/components/FeatureTree.tsx:1209 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc6901ea61fced45d58861c62837f0b1721a49b1a18aeb961d1d8833cc58248"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/app/src/components/Header.tsx:533 \u00B7 packages/app/src/components/Header.tsx:559 \u00B7 packages/app/src/components/Header.tsx:599 \u00B7 packages/app/src/components/Header.tsx:623 \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":"packages/app/src/components/Header.tsx"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05c8e93f3301c92b1ef040cb49c47584e500dcc5edea281a1dc756f50aba095"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/ParametersPanel.tsx:399 \u00B7 packages/app/src/components/ui/expression-input.tsx:69 \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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a729878b6ab437805eff6c675a41b20e2deb0d0a655ea14291179886c6159a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/app/src/components/PropertyPanel.tsx:213 \u00B7 packages/app/src/components/PropertyPanel.tsx:269 \u00B7 packages/app/src/components/PropertyPanel.tsx:308 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ef9d092f2d6cef24927bd1bad6185fff80114a53f338205339d7d8f5e9eaa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/app/src/components/PropertyPanel.tsx:251 \u00B7 packages/app/src/components/PropertyPanel.tsx:291 \u00B7 packages/app/src/components/PropertyPanel.tsx:320 \u00B7 packages/app/src/components/PropertyPanel.tsx:755 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cd414d6efb0356d5f64b345fee1886dfa909ad66906c85e8096f82211eebd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/app/src/components/PropertyPanel.tsx:362 \u00B7 packages/app/src/components/PropertyPanel.tsx:373 \u00B7 packages/app/src/components/PropertyPanel.tsx:384 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2337eae59dd2c92bf58a8603d38f9d57da519f3a633d7b68fedc457bac0f7bbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/SceneMesh.tsx:381 \u00B7 packages/app/src/components/SceneMesh.tsx:652 \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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"31853630b4a8fb308fb21013af7abcdf3eabe01f4764ae58bd103a41499c1a0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/app/src/components/SelectionOverlay.tsx:321 \u00B7 packages/app/src/components/SketchPlane3D.tsx:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 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":"packages/app/src/components/SelectionOverlay.tsx"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c34ef0faca2f2d3e1d14b8c018adec05493a4765b3feb652327dcecd96fdac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/ViewportContent.tsx:1714 \u00B7 packages/app/src/components/ViewportContent.tsx:1726 \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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a25f1240a107b47f1291b4de13e71e362a0cdf70a0d982409db82c27f7907a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/app/src/components/electronics/CircuitTabTools.tsx:292 \u00B7 packages/app/src/components/print/PrinterSelect.tsx:109 \u00B7 packages/app/src/components/print/SlicerSettings.tsx:55 \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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fd31ef414332ba8cb0a3def72fcb795356924e4838274cc85ebf7d48882c23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/electronics/CircuitTabTools.tsx:405 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.tsx:285 \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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b2f82ed8925a450545fa6ddb5504f8348321d6a1fadb561988f59eeead9609"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/electronics/pcb3d/PcbScene.tsx:166 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.tsx:203 \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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed440d03389e654993484c7c7a10bd6dea869441b65564df9e222e7a4e50dd62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/app/src/components/tree/InlineDimensions.tsx:20 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:31 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:42 \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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0929be148049b267eb12abb58cfa54653a4a2c27acd88134cd7958d01f0ef42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/components/tree/InlineDimensions.tsx:363 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:374 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6d024d6d3aecb0ac8785cfe793b43ac72110c72dad68464f17f6dec9df2af6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): packages/app/src/hooks/useCameraControls.ts:110 \u00B7 packages/app/src/hooks/useCameraControls.ts:130 \u00B7 packages/app/src/hooks/useCameraControls.ts:171 \u00B7 packages/app/src/hooks/useCameraControls.ts:190 \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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"731cbc9ce31af62dba20d0723f7d019b17e8fed7d1840a85e1a799e6441bbcd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/app/src/lib/drawing-sheet.ts:97 \u00B7 packages/core/src/utils/export-gltf.ts:14 \u00B7 packages/core/src/utils/export-stl.ts:25 \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":"packages/app/src/lib/drawing-sheet.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7def2b7beb23f9eca721d3b0444236efe985b055541089aa57e2430c36fafcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/app/src/stores/embroidery-store.ts:76 \u00B7 packages/app/src/stores/printer-store.ts:104 \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":"packages/app/src/stores/embroidery-store.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eae8d2482faefb6f5d7d8da3355ab33ea677bb72dafa478c33cc5eea49575e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/engine/src/ecad.ts:316 \u00B7 packages/engine/src/ecad.ts:1081 \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":"packages/engine/src/ecad.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"452f7f7afcd6c72e1c7f7d1aa2ff261ca9d7e445101714166bbd4947a16bcc83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/engine/src/ecad.ts:701 \u00B7 packages/engine/src/ecad.ts:735 \u2014 both copies are in the same file, so extract the block 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":"packages/engine/src/ecad.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"e280dec84e36ae29b10ebc458cbf4f0bf363e0191713035d2ed99ba378b9629f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/engine/src/index.ts:1653 \u00B7 packages/engine/src/index.ts:2362 \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":"packages/engine/src/index.ts"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac86bc72d6edcc806a9e2c389aa85787bf697df0dd02a275c3315b1b96c6f073"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/engine/src/scene-convert.ts:91 \u00B7 packages/engine/src/scene-convert.ts: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":"packages/engine/src/scene-convert.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"04366be198945a440e8273584b8662a9a2060c61333d7572e557aaf8300c81a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ir/src/index.ts:622 \u00B7 packages/ir/src/index.ts: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":"packages/ir/src/index.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32e39f4247970f1f0270d7e63c0c8ba3c4b6d5d84789a498bf98ff391428d05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ir/src/index.ts:1209 \u00B7 packages/ir/src/index.ts:1348 \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":"packages/ir/src/index.ts"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"67498cd983dc4a6e05db28d8f8e40221908ce960f2f3c5d3a66dcaaa4824b47b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/mcp/src/session-store.ts:134 \u00B7 packages/mcp/src/tools/continue-doc.ts:49 \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":"packages/mcp/src/session-store.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"868dcf3f3c8f1905259bbeb9d4a1ed6646cf486362cfbc1d57b899d8a9e7a3e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/mcp/src/tools/bom.ts:610 \u00B7 packages/mcp/src/tools/bom.ts:637 \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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc145b7d9becf59cab3c9eb0d51cf94fad2cc81fae4a1f406cdab8ce740dfcfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/mcp/src/tools/ecad.ts:9763 \u00B7 packages/mcp/src/tools/ecad.ts:9953 \u00B7 packages/mcp/src/tools/ecad.ts:11320 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9763}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e2d3112fed67c47c3a40802ec1d60a1cd6959ea5f3065b1f7e3678825e11df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): packages/mcp/src/tools/gym.ts:714 \u00B7 packages/mcp/src/tools/gym.ts:769 \u00B7 packages/mcp/src/tools/gym.ts:812 \u00B7 packages/mcp/src/tools/gym.ts:999 \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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d4cc21a57baa2d99176cf66653912feab4c10cf66b7153ef886a6566c9b210"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/mcp/src/tools/physics.ts:192 \u00B7 packages/mcp/src/tools/topopt.ts:277 \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":"packages/mcp/src/tools/physics.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ce097fb0745470520b0b172807d2d925653a21465286e75959c52416342ed9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/mcp/viewer-app/main.ts:898 \u00B7 packages/mcp/viewer-app/main.ts:912 \u00B7 packages/mcp/viewer-app/main.ts:1130 \u00B7 packages/mcp/viewer-app/main.ts:1270 \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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d19623c9aaa8a5a12bfa9c82937c5b8393baf49370f4fbd817194a4e799488e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/training/src/cli.ts:556 \u00B7 packages/training/src/cli.ts: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":"packages/training/src/cli.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25955b871ed72910809e1e888bf54898ece2ca00f3f71aed59d66e741681283"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/training/src/generators/clip.ts:185 \u00B7 packages/training/src/generators/clip.ts:247 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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":"packages/training/src/generators/clip.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27598ec1c9f8e173e8db8b2dd76b3d77566681e8da77352d359b11dcd9acc6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/training/src/generators/enclosure.ts:171 \u00B7 packages/training/src/generators/shaft.ts:170 \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":"packages/training/src/generators/enclosure.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"83004e9f76aa931f31570707c07416b5963e87ac577611747d9a6b7c9d4ebbc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/training/src/generators/enclosure.ts:321 \u00B7 packages/training/src/generators/mount.ts:309 \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":"packages/training/src/generators/enclosure.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"324b4122b7b4cbd1f0b27fd0b8dd44e61cb508543e585cfc777015090d6bd595"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/wasmosis/src/cli.ts:37 \u00B7 packages/wasmosis/src/cli.ts:145 \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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5479968edcd96c30c9efc9269a1a227547f87a0c883a764c54b66d35815112d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/wasmosis/src/source-parser.ts:192 \u00B7 packages/wasmosis/src/source-parser.ts:651 \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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9e672d9da64b93d4c96f9cc76b53e30d082fc2bda49c7da4e4250977f89a80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/public/launch/launch.js:187 \u00B7 www/public/kit/gallery.js:299 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c82d0b5c7cf97ce0ef440665ad9d4ec26ab70b72bb38828e84f2e7bd166087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/app/src/components/DrawingView.tsx:784 \u00B7 packages/app/src/components/DrawingView.tsx:803 \u00B7 packages/app/src/components/DrawingView.tsx:820 \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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"124f18d94164da1953f9c3264506bcba0b3500371a79b13fecaadc0c4283f2ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/InlineOnboarding.tsx:67 \u00B7 packages/app/src/components/LogViewer.tsx:115 \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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b089dab68ab766604d428020d163cb335f10aa302c001e6b20f7471dce0ad7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/SceneMesh.tsx:480 \u00B7 packages/app/src/components/SceneMesh.tsx:1004 \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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd7f26c7db4e479f55a092799b476942d8e1c0cf066e9d0886f6bee6b30b59d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/app/src/components/electronics/CircuitAnalysisPanel.tsx:323 \u00B7 packages/app/src/components/electronics/CircuitAnalysisPanel.tsx:333 \u00B7 packages/app/src/components/electronics/CircuitAnalysisPanel.tsx:343 \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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87bf421e77a3fdbc73f10547911abf10eb236927d18ce00b9e49a53233cb427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/app/src/components/electronics/EcadFeatureInspector.tsx:171 \u00B7 packages/app/src/components/electronics/SchematicCanvas.tsx:110 \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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b20620b3fe3e83abadde0894f22a2f30d39090eb68d618978bf37b93193cd0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/electronics/ReceiptPanel.tsx:38 \u00B7 packages/core/src/utils/receipt/render.ts: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":"packages/app/src/components/electronics/ReceiptPanel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fb8998dd5f8930117777b5ac1753c8e5f4a44fa686d7a70cc381fc705807e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/electronics/pcb3d/PcbScene.tsx:120 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.tsx:155 \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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9200799dc4bbc041c50243afec964a3f6a8162fe605a55e5f88c672ce578294b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/electronics/pcb3d/PcbScene.tsx:179 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.tsx:215 \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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0274dfb726fb8d7546520c66e8e41b70da1ec3ed209d4360303abd031de84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/embroidery/EmbroideryPanel.tsx:296 \u00B7 packages/app/src/components/embroidery/EmbroideryPanel.tsx:341 \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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"467f49c83efbb55a86fffc20f45a1dbaed35a01fff9d2474a4ce02ce6d9fe77c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/print/PrintPanel.tsx:169 \u00B7 packages/app/src/components/print/PrintPanel.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"196f41ae144f888e71d960f363a03bed0c308e528d67fc2f4f5a4a3475c7efbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/print/PrinterStatus.tsx:74 \u00B7 packages/app/src/components/print/PrinterStatus.tsx:85 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/print/PrinterStatus.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0613bd137d3aead8e872850e8684917884599f11e0cea0bf569c46bf600a94a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/app/src/components/shadcn/dialog.tsx:5 \u00B7 packages/app/src/components/shadcn/dropdown-menu.tsx:5 \u00B7 packages/app/src/components/shadcn/hover-card.tsx:2 \u00B7 packages/app/src/components/shadcn/select.tsx:5 \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":"packages/app/src/components/shadcn/dialog.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d15c7577beb578bc6fa0334caa8a362e17ce53f2961172a2ede7325552d0f3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/components/ui/notifications/AIProgressCard.tsx:81 \u00B7 packages/app/src/components/ui/notifications/ActionResultCard.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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffcdad6e12e7ec433c1876e3b7aa9fde3c4c41861eddd4ca2a56cc6b7deb220"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/hooks/useElectronicsSync.ts:67 \u00B7 packages/app/src/hooks/useElectronicsSync.ts:82 \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":"packages/app/src/hooks/useElectronicsSync.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8f4e3b65188f731106fbc606da5dffaea2370eae2b742f67e8fdc602b21ef8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/lib/browser-inference.ts:328 \u00B7 packages/training/src/infer.ts:229 \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":"packages/app/src/lib/browser-inference.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882a80cc0b66925febd98ca42e4c3d1f570982aa13bcd1b945fa8ee08013c9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/app/src/stores/molecule-store.ts:175 \u00B7 packages/app/src/stores/molecule-store.ts: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":"packages/app/src/stores/molecule-store.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a3f82c074453a98332d13f5261aad7ecd71edb05aa87cab3618714a6e20c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/core/src/commands/executors.ts:99 \u00B7 packages/core/src/commands/executors.ts:340 \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":"packages/core/src/commands/executors.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c082f215e73a64fc7177ffcdfa64665313050a3a2bf75899dc057dc63f2c370f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/core/src/stores/document-store.ts:1620 \u00B7 packages/core/src/stores/document-store.ts:1631 \u00B7 packages/core/src/stores/document-store.ts:1642 \u00B7 packages/core/src/stores/document-store.ts:1771 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf894e823aeb2633cd230a5af030d12f7271979f15121489a4c80d4a684ca93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/core/src/stores/sketch-store.ts:435 \u00B7 packages/core/src/stores/sketch-store.ts:449 \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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a659b79b05c7ab5f9fd673ddf2cd3fc069f9c49a07a4a854d16b849405afbd94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/engine/src/ecad.ts:1934 \u00B7 packages/engine/src/ecad.ts:1967 \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":"packages/engine/src/ecad.ts"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace05eedf89f4db3ffe68788d1f6800ed2f262b4b6d3df6ca7d0d7058d53a959"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/engine/src/gpu.ts:193 \u00B7 packages/mcp/src/export/stl.ts: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":"packages/engine/src/gpu.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6788336ee809fdf7678a46b367c0dee9ab1742864b22362d20fb3e4ec1aaa695"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:2902 \u00B7 packages/mcp/src/tools/ecad.ts:8472 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2902}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6abd94ad22367beeea0294e2ca18cc31a264fae83a55dcc8b187aa76f393ea8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:4745 \u00B7 packages/mcp/src/tools/ecad.ts:6607 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4745}}}],"partialFingerprints":{"codehealthFindingId/v1":"be025549866d3e2df24d9406036751a4de2eed1a409b973ecd40445cb7aa2d1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:8443 \u00B7 packages/mcp/src/tools/ecad.ts:9191 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad5c48f553b39af8b143b17f294cd47431ee1e5c941d76a03c158babd127d4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:10225 \u00B7 packages/mcp/src/tools/ecad.ts:10241 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74c9c8396c2dc35d4d75f3bea0759ec990acf8399f3a067a1296489799ddabf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/mcp/src/tools/em.ts:428 \u00B7 packages/mcp/src/tools/neutronics.ts:205 \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":"packages/mcp/src/tools/em.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf2a531787db9efbeea7468a5f7e1db4a338a19625fd1e958bd89d417bdd5c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): packages/mcp/src/tools/gym.ts:603 \u00B7 packages/mcp/src/tools/gym.ts:714 \u00B7 packages/mcp/src/tools/gym.ts:769 \u00B7 packages/mcp/src/tools/gym.ts:812 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"461dc7355212f4165e5bdef9b8f6751ef342d7cd4e0c4626e82318fd6d73a905"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/mcp/src/tools/gym.ts:645 \u00B7 packages/mcp/src/tools/sim-replay.ts:150 \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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea2a2b2f0f9beddb1bc174e8c2007941ca9b378bd65cd62088307540acd473f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/mcp/src/tools/sim-replay.ts:147 \u00B7 packages/mcp/src/tools/sim-replay.ts:244 \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":"packages/mcp/src/tools/sim-replay.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb400de9304abd52ab03b71ccc6f3f6085936345b5fb2e1ac8dc0e9ce15ab72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/training/src/generators/flange.ts:133 \u00B7 packages/training/src/generators/radial.ts:158 \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":"packages/training/src/generators/flange.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"734ee3b8fac264de40ad68358a514d9f80b985af8690d3e5333de218aa819030"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/training/src/generators/funnel.ts:129 \u00B7 packages/training/src/generators/plate.ts:98 \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":"packages/training/src/generators/funnel.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"598c3a805ee49b62f8fca7ddf90f3915ea7361e950928098818bd60c6a9ec7cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/training/src/generators/profile.ts:139 \u00B7 packages/training/src/generators/profile.ts:204 \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":"packages/training/src/generators/profile.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b924fa2623f0d89328f7432ce9e4db108022f19e92a07de578d87d93b8bf83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/training/src/generators/shaft.ts:178 \u00B7 packages/training/src/generators/shaft.ts:197 \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":"packages/training/src/generators/shaft.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2476914ce4ceafe0f41c6dc6d076b5ad0e4fd5b6d223ad2b1f7e9daa8c30b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/wasmosis/src/cli.ts:53 \u00B7 packages/wasmosis/src/cli.ts:387 \u00B7 packages/wasmosis/src/cli.ts:493 \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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1402aece6849df25bc684b49e0f1212d6351e50f5ae4a78b6c3f24bcd6d2e11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/wasmosis/src/source-parser.ts:664 \u00B7 packages/wasmosis/src/source-parser.ts:687 \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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c89259aa344d23dd94bc8e71f9f85da5481b37b86c01372b95207878a81bc53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): www/src/hero-engine.js:418 \u00B7 www/src/wireframe.js:77 \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":"www/src/hero-engine.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dceae00d0d9c136e46c8bf6157faa2d3d7eefb8e94f5714f41cf45cddf999f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mecheval/harness/src/solvers/claude-direct.ts:139 \u00B7 mecheval/harness/src/solvers/openai-direct.ts:36 \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":"mecheval/harness/src/solvers/claude-direct.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec1c1ea694a561b9b09660c877299c3a9353f390378598017a22e4b20d0c9ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mecheval/harness/src/solvers/claude-mcp.ts:102 \u00B7 mecheval/harness/src/solvers/claude-mcp.ts:182 \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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"038431701c658dc8b74c44d2c4d2692c25e87c377c44d9e60e79456ab0792d20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:220 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:438 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28b861cb5979a7df801a498399541a641b720448293be79e6b9211b202c2d46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:395 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:409 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63d0017c723bab4957f551ac8f0c51522fe8831d25e1e9f3a93cfcacb8b0a73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/app/src/components/AnalyzePanel.tsx:285 \u00B7 packages/app/src/components/AnalyzePanel.tsx:311 \u00B7 packages/app/src/components/AnalyzePanel.tsx:441 \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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1872511407457476b1436fbb4b2ffbece9cc98a652ae4d16dfe3ae3c0d55bc81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/CommandPalette.tsx:316 \u00B7 packages/app/src/components/InlineOnboarding.tsx:82 \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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd77c34dd8594b940863c2703621785c1c943924ec76b5840af8fe608802e9da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/DfmDrawer.tsx:414 \u00B7 packages/mcp/src/tools/registry-dispatch.ts:892 \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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d124b01e3d384129ecbb6ba9fd1e5d02781704d850aa5ac8cdfd53a29b9007"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/Header.tsx:405 \u00B7 packages/app/src/hooks/useAppCommands.ts:75 \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":"packages/app/src/components/Header.tsx"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9de9120a97771601fce37ef66c4bc2813fda1fb68e9c434965621c60786c5f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/Header.tsx:556 \u00B7 packages/app/src/components/Header.tsx:620 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dd152dcdc33f573d410a964d930d86c7586e6ece04e4a872b9c4e77c54b01b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/app/src/components/InlineOnboarding.tsx:70 \u00B7 packages/app/src/components/LogViewer.tsx:118 \u00B7 packages/app/src/components/QuotePanel.tsx:175 \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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a0fb13c8bf65c777b080d47843f8974814f2a1dec30b8be85f999130ce81c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/SceneInspector.tsx:163 \u00B7 packages/app/src/components/SceneInspector.tsx:172 \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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d093076d2ca12dd9f9b8febc92a0a68f7e483121ed6da8b00149bddd957bb4ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/SceneMesh.tsx:457 \u00B7 packages/app/src/components/SceneMesh.tsx:964 \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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"029d1c623100bf89ce5924038aa0de149790bf2aef61df642fec57d7368b9bec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/app/src/components/electronics/CircuitTabTools.tsx:72 \u00B7 packages/app/src/components/electronics/PcbGettingStarted.tsx:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97f10401d2892da4f7e7ef42ab7ce94d8ab5d9580ffd8e0431313baa99d94a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): packages/app/src/components/electronics/EcadFeatureInspector.tsx:212 \u00B7 packages/app/src/components/electronics/EcadFeatureInspector.tsx:228 \u00B7 packages/app/src/components/electronics/EcadFeatureInspector.tsx:240 \u00B7 packages/app/src/components/electronics/EcadFeatureInspector.tsx:253 \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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a864415645fb5fd6646ab1828a1e244d60d4af4176081d2436ab11cbae6ec1b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/electronics/ElectronicsPanelHeader.tsx:154 \u00B7 packages/app/src/components/electronics/ElectronicsPanelHeader.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"489c1e5e2618abad550d9afc2b23f9f3720140228d6a7100635e8f52c2314f35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/electronics/SchematicCanvas.tsx:332 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.tsx:64 \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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5d4ac417c6511bc5ec76500f0102c57d44c7014f796ebaba51c4df8e3ce4eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/electronics/pcb3d/PcbScene.tsx:97 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"623e4c083281a2fea532c2ae726345f51c872db84c9b0bc9e978e211d606e202"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/footer/KernelPulseChip.tsx:183 \u00B7 packages/app/src/components/footer/KoanChip.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":"packages/app/src/components/footer/KernelPulseChip.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9023dfc0b792ae0e499b47f86a012edb565d6863d2a898a9c124bec1d4ea696f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): packages/app/src/components/shadcn/collapsible.tsx:1 \u00B7 packages/app/src/components/shadcn/dialog.tsx:6 \u00B7 packages/app/src/components/shadcn/dropdown-menu.tsx:7 \u00B7 packages/app/src/components/shadcn/hover-card.tsx:4 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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":"packages/app/src/components/shadcn/collapsible.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f7c6e63dc9310a9997c9b71cc6a62a36a934d628a671bacec0938a6c3e8821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/components/ui/notifications/DecisionCard.tsx:83 \u00B7 packages/app/src/components/ui/notifications/DecisionCard.tsx:118 \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":"packages/app/src/components/ui/notifications/DecisionCard.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f78fc4b37d2ffcfd822c13a8771257c7816e9a5972cbd6ba4c1aedb9a863c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/app/src/hooks/useBackgroundLuminance.ts:51 \u00B7 packages/app/src/hooks/useBackgroundLuminance.ts:74 \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":"packages/app/src/hooks/useBackgroundLuminance.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff25cad31bddbbf492b8aafbc309685a39d909cca360a1cdeb2f4a7f7faeacb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:1546 \u00B7 packages/core/src/stores/document-store.ts:1557 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7481ff4077de757b4b360e3993a163915fb208a4dff13b4797ec7cdaa2ff2c28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/core/src/stores/sketch-store.ts:619 \u00B7 packages/core/src/stores/sketch-store.ts:630 \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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ddb1b1aef180648e74badd3fb6c0a496b9313adb8cb537b6846e6695062639"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/core/src/utils/import-stl.ts:74 \u00B7 packages/core/src/utils/import-stl.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/utils/import-stl.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86abb425d1453f06570d9c50f7ab3d1d03cf562290fc511da135b40e4c1badf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/engine/src/evaluate.ts:289 \u00B7 packages/engine/src/evaluate.ts:303 \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":"packages/engine/src/evaluate.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd46625b7fa8146cf21f4435af86e7725af10b25e970cf7b3f04c96933315cdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/engine/src/evaluate.ts:589 \u00B7 packages/engine/src/evaluate.ts:608 \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":"packages/engine/src/evaluate.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4f341747d9ab4547bb119fb08f6deedb65a53658e22c6e092cdfcccb922d47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/engine/src/evaluate.ts:694 \u00B7 packages/engine/src/evaluate.ts:712 \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":"packages/engine/src/evaluate.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe15616e18abfc43d53e0586d91f68d85d7133d07b03110c41726a2707712e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/engine/src/evaluate.ts:877 \u00B7 packages/engine/src/evaluate.ts:970 \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":"packages/engine/src/evaluate.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf912036b56013ec70c851fc8e221694b2c1f91f364bed792d10af50fc894817"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ir/src/index.ts:552 \u00B7 packages/ir/src/index.ts:600 \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":"packages/ir/src/index.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8cf54fc56a688d0c939fda5dc16cb38a416ca6f5051520e55cea7a3ed7efb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): packages/ir/src/index.ts:1106 \u00B7 packages/ir/src/index.ts:1165 \u00B7 packages/ir/src/index.ts:1183 \u00B7 packages/ir/src/index.ts:1198 \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":"packages/ir/src/index.ts"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6360da83fa47bc6d3b8ef1356e64a9ec6c70136a4c1067cc0913ce1763cb784a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/fabricate/kerf/client.ts:188 \u00B7 packages/mcp/src/fabricate/kerf/client.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/fabricate/kerf/client.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b641685fd945a45d59ce8ae1ef87138b4fe1fe38a326003b91b5fc3fa17c17b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/animate.ts:1166 \u00B7 packages/mcp/src/tools/render.ts:750 \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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"12de8460e9eb5f8491fc9ec492546919b7fb43f7f8f100ad1ff7e4938036516b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/bom.ts:539 \u00B7 packages/mcp/src/tools/bom.ts:603 \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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6360497061aef16c7949bfd64369304d43e452af3e6a62e49b5b47a9b9395f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/bom.ts:702 \u00B7 packages/mcp/src/tools/bom.ts:715 \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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a22f1d4f7120893ee3873818ba15046287e50e83d5d5a36134254e79d1b6d40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/mcp/src/tools/ecad.ts:4817 \u00B7 packages/mcp/src/tools/ecad.ts:9453 \u00B7 packages/mcp/src/tools/ecad.ts:10618 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4817}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82aae2df04c86b4df216270abba067de6c3172c97720716d1ef212737421c71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:7819 \u00B7 packages/mcp/src/tools/ecad.ts:7904 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7819}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fbffe2538cea2b0becf6149601e1b1c4d6bdd7874e8e13649e82553ce3b123"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:10367 \u00B7 packages/mcp/src/tools/ecad.ts:11283 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3add580ddfa130058c49294bf06db66b8646bebd9aefb3ae58d037b888efe7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:13690 \u00B7 packages/mcp/src/tools/enclosure.ts:121 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13690}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaf9026352718e79ab2afa00373e7772b5398430a701d7f72d461b9e28ec42f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/record.ts:200 \u00B7 packages/mcp/src/tools/render.ts:458 \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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"399cdeb6889519ba3d5d5b1573ccbedfaad76d3811262ec10934d66f3667888f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/src/tools/sheet-metal.ts:369 \u00B7 packages/mcp/src/tools/sheet-metal.ts:538 \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":"packages/mcp/src/tools/sheet-metal.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcf71c28a8db5ada5c61634dfc68b477bdb0b195ff78cefbc0c841ec8c2b655"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/mcp/viewer-app/main.ts:1643 \u00B7 packages/mcp/viewer-app/main.ts:1652 \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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b204ac9e99058bb3542d3ced9757525207a41bed948ee07c3947108b9f31971"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): packages/training/src/generators/enclosure.ts:262 \u00B7 packages/training/src/generators/enclosure.ts:285 \u00B7 packages/training/src/generators/mount.ts:255 \u00B7 packages/training/src/generators/mount.ts:282 \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":"packages/training/src/generators/enclosure.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b834beccbf6f4aa2504409d93e9d0a962bccf3fd7aab5bedce77b0f77219d67b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/training/src/generators/plate.ts:99 \u00B7 packages/training/src/generators/profile.ts:101 \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":"packages/training/src/generators/plate.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f7caef75854064297937b3aecf65597bf2b6f0482c88e3f657c04f978ff98a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/gen-ir-types.mjs:39 \u00B7 scripts/gen-swift-types.mjs:353 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 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":"scripts/gen-ir-types.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3309a1390e1e7c5ed32269d4e8d5825378072211343d253eda88de20742d5587"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): www/src/engine-card.js:12 \u00B7 www/src/engine-card.js: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/engine-card.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0802eeff7b82c826100c000321c1c5429832bd3cf99311907b9016a3d7d7c15a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): mecheval/harness/src/solvers/claude-direct.ts:150 \u00B7 mecheval/harness/src/solvers/openai-direct.ts:59 \u00B7 mecheval/harness/src/solvers/wafer-direct.ts:34 \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":"mecheval/harness/src/solvers/claude-direct.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbdf79ab877cd9764bf4c544b72f6a575a6b6a8e7a4b8521781f77c8f833eda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mecheval/harness/src/solvers/claude-mcp.ts:176 \u00B7 mecheval/harness/src/solvers/claude-mcp.ts:194 \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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d06c956aeef1f3f53d86d0237adeca556517d7700e7a33408cb7812c6ab3ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): packages/app/src/components/AnalyzePanel.tsx:181 \u00B7 packages/app/src/components/PropertyPanel.tsx:641 \u00B7 packages/app/src/components/PropertyPanel.tsx:665 \u00B7 packages/app/src/components/PropertyPanel.tsx:689 \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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46fe3d969d4a47820f8545564f7aa96838221132a8f81856337a9b7ae62b059"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/app/src/components/CommandPalette.tsx:144 \u00B7 packages/app/src/components/Header.tsx:356 \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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6de37427128813c31a28840abd4736951b6b973319090fdb5f46fadad9d696"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/DfmAnnotations.tsx:181 \u00B7 packages/app/src/components/DfmDrawer.tsx:457 \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":"packages/app/src/components/DfmAnnotations.tsx"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b34f903951941056f0e80e9344bb372b2cac5fb0d6354916e37196ba465ca1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/DrawingView.tsx:340 \u00B7 packages/app/src/components/ViewportContent.tsx:955 \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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e7459aaeede97a926b82cf7729e85033ff5a57fd9a5d60bf69ba8c2fefc07a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/DrawingView.tsx:807 \u00B7 packages/app/src/components/DrawingView.tsx:824 \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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36ddf0a403374df5be63bd32ceede81343d27c017f74e394c6400244abfdbe1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/FeatureTree.tsx:930 \u00B7 packages/app/src/components/FeatureTree.tsx:1028 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"38849077212301db652ab649b17a833a199b620d2c6c63b3099873b9ac63150a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9 locations): packages/app/src/components/PropertyPanel.tsx:326 \u00B7 packages/app/src/components/PropertyPanel.tsx:529 \u00B7 packages/app/src/components/PropertyPanel.tsx:582 \u00B7 packages/app/src/components/PropertyPanel.tsx:620 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7511aa0eceda2b93e5606442d5ceb12341e6ec666b5e3842bde43e9737cee71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): packages/app/src/components/PropertyPanel.tsx:526 \u00B7 packages/app/src/components/PropertyPanel.tsx:617 \u00B7 packages/app/src/components/PropertyPanel.tsx:854 \u00B7 packages/app/src/components/PropertyPanel.tsx:899 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d43d640d82a92da97e1a9402836c53ba78c885d2f1b96d19e7d59f853276d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): packages/app/src/components/SelectionOverlay.tsx:47 \u00B7 packages/app/src/components/SelectionOverlay.tsx:55 \u00B7 packages/app/src/components/SelectionOverlay.tsx:64 \u00B7 packages/app/src/components/SelectionOverlay.tsx:72 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"packages/app/src/components/SelectionOverlay.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd67df843c95b4a391cbb0c82262a37d928d652369145e6cde8a3c9b21b28ac9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/SketchPlane3D.tsx:93 \u00B7 packages/core/src/sketch-math.ts:160 \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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"919db90ecbdeea94c09c02c58a7ce21ecb6f704a61b5203d99312d8362b70ef0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): packages/app/src/components/SketchPropertyPanel.tsx:85 \u00B7 packages/app/src/components/SketchPropertyPanel.tsx:108 \u00B7 packages/app/src/components/SketchPropertyPanel.tsx:162 \u00B7 packages/app/src/components/SketchPropertyPanel.tsx:173 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c998aa15a62c1cda6b32c2561bf87b86665a7c4cbe83665a0ba0f8c90a15898e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/app/src/components/ViewportContent.tsx:550 \u00B7 packages/app/src/stores/analyze-store.ts:215 \u00B7 packages/core/src/camera-framing.ts:89 \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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"105f4295d613ce912c2168be4f9da7a039f13acb83c82016215556b24afb95d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/electronics/ElectronicsPanelHeader.tsx:33 \u00B7 packages/app/src/components/electronics/PcbGettingStarted.tsx:18 \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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"190b0b8908a06c08e607f5988aba1ace107914ca3b65deac75c1fcd3d13243de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/electronics/ElectronicsPanelHeader.tsx:103 \u00B7 packages/app/src/hooks/useElectronicsSync.ts:109 \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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d080d51caed949b339f3be6080a3e2be4cafff52601c3533c9407c0140d1aa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/components/electronics/symbol-icons.tsx:38 \u00B7 packages/app/src/components/electronics/symbol-icons.tsx:49 \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":"packages/app/src/components/electronics/symbol-icons.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b5faf5a7ebcb991710ca6c0f95798a19b0ab879a6bb1181279c5c3203355ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/hooks/useAppCommands.ts:319 \u00B7 packages/app/src/hooks/useAppCommands.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccd0692226f132236bba9c5cf7c056702d5498a312f9501a973ff7e65dacde1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/app/src/lib/camera-controls.ts:75 \u00B7 packages/app/src/lib/camera-controls.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/camera-controls.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e015abf9315abb9240fbe7b835b2f3e8c0c1f590ce2a3f19716ffeaf822d4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): packages/core/src/stores/document-store.ts:2025 \u00B7 packages/core/src/stores/document-store.ts:2062 \u00B7 packages/core/src/stores/document-store.ts:2071 \u00B7 packages/core/src/stores/document-store.ts:2112 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee136ca12b1093199c2fe0cde98c9b707c270328fe1cdb3f702cd0f569215bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/core/src/stores/participant-store.ts:106 \u00B7 packages/core/src/stores/participant-store.ts:115 \u00B7 packages/core/src/stores/participant-store.ts:124 \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":"packages/core/src/stores/participant-store.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"82902f6a3449bc901304805b78a0aed03af00c69df33d889233806656c78b243"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/core/src/utils/receipt/engine.ts:90 \u00B7 packages/core/src/utils/receipt/engine.ts:98 \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":"packages/core/src/utils/receipt/engine.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"777e02507963ea2e8395d1de435c11c03c7da62afb4bc369cb313324a9b5574e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/engine/src/physics.ts:245 \u00B7 packages/engine/src/physics.ts:257 \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":"packages/engine/src/physics.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"304dac3bcccd4271ad0c3cfba801d78b9594414e4b401cf168daedcb7942e8cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ir/src/index.ts:1397 \u00B7 packages/ir/src/index.ts:1412 \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":"packages/ir/src/index.ts"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"645abec2262788229253ed8584f3917465f2c4c31db8561e78049952cb3f0208"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/animate.ts:1059 \u00B7 packages/mcp/src/tools/render.ts:465 \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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce60fae6c69fa52853bc0a130e0f451f1c07b3d899058c08a6793d32d1326391"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/clearance.ts:435 \u00B7 packages/mcp/src/tools/preview.ts:345 \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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c40f70addf4f5a98f5576c413eeec0af88826c88e0b3eff2c4fc14fe7c3bf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:3097 \u00B7 packages/mcp/src/tools/ecad.ts:3106 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3097}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0fa6aae9ee3ea7af11aa743a64468ee7e0f07cd62c6db2d4230f83025b672e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:3443 \u00B7 packages/mcp/src/tools/ecad.ts:8884 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf1b77b68a305008bf7750dbcb529d989b521417a047035d6f7fb074cc8856c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:6173 \u00B7 packages/mcp/src/tools/ecad.ts:6323 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da81a78d5f70a4362928b7f25ca5f15761917b75a5bd9f9e06bca798090ff48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/mcp/src/tools/ecad.ts:9562 \u00B7 packages/mcp/src/tools/ecad.ts:11334 \u00B7 packages/mcp/src/tools/ecad.ts:11616 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9562}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eab79154e86e424499d4d6b4a8daadf83523d1c89b1a5a00e1f6dbf0ddd154"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8 locations): packages/mcp/src/tools/export.ts:105 \u00B7 packages/mcp/src/tools/flat-pattern.ts:173 \u00B7 packages/mcp/src/tools/sheet-metal.ts:271 \u00B7 packages/mcp/src/tools/sheet-metal.ts:414 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"packages/mcp/src/tools/export.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f55191179c1e78afb3b5b50477b5357ab1e099efb39b9639a426196d49d814"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/faces.ts:375 \u00B7 packages/mcp/src/tools/faces.ts:524 \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":"packages/mcp/src/tools/faces.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7f097e4fde20c4429fbb9c4d073d2b55a866f2f3ac2cd74562fcabc0a190d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/inspect.ts:332 \u00B7 packages/mcp/src/tools/sheet-metal.ts:363 \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":"packages/mcp/src/tools/inspect.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea71543d6039759f19c926d086447dfa5e07123096bebac0715c231c5cc2d0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/integrity.ts:265 \u00B7 packages/mcp/src/tools/preview.ts:233 \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":"packages/mcp/src/tools/integrity.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd1364b3358e28b4b82798d449937464e5775b768310a20b0fde383a2d08c77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/integrity.ts:490 \u00B7 packages/mcp/src/tools/registry-dispatch.ts:426 \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":"packages/mcp/src/tools/integrity.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7477b007885b5ed628db109b550306b9a4cbac584484fc479ef0078aac497c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/mcp/src/tools/pose.ts:52 \u00B7 packages/mcp/src/tools/sweep.ts:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"packages/mcp/src/tools/pose.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c36fdab828b751013b22d7fecf1a2571f9869271b6d6fad9a6a7846c7c6fe41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/mcp/src/tools/preview.ts:659 \u00B7 packages/mcp/src/tools/sim-replay.ts:37 \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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73d0516b3ac50244f93c31c4ab146b780ff6a950222f11d28a6c59b00129cd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/training/src/cli.ts:209 \u00B7 packages/training/src/cli.ts:765 \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":"packages/training/src/cli.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2cf0061784fa5434f80e2057536cadf6619c416f51451fc3e227294972dec3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/training/src/generators/profile.ts:164 \u00B7 packages/training/src/generators/profile.ts:227 \u00B7 packages/training/src/generators/profile.ts:264 \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":"packages/training/src/generators/profile.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0ebb82a3ae7766878f2f06061e59325910e2548968bd2324bc4282135793d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): www/src/hero-app.js:26 \u00B7 www/src/receipt-art.js:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 280 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":"www/src/hero-app.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f53ec6a823ac41d19150358f89f6b32bc7a77ed7d13ff5da8ec12490797ca50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): mecheval/harness/src/matrix-cli.ts:96 \u00B7 packages/mcp/src/tools/verify.ts:128 \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":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c47e5586c5c7a5cdc1bed6b5953ec96b2a9207fb667bda702dc4d5784f322e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:341 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:348 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:355 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0d5ced0b87ddd1972e8e0a9bfcce11153f53cd564a0d0eda2cb8d847ed5d11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:471 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:494 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:510 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:549 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b53101b82cc0b8ccd44bab71cb609f9ceadc2727339e0314ae58e27ca1c2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:643 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:678 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"b490d630e369a2ebf6ba4491f766f88b1c9dcfb0c05815392ed6b97ae498e46c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/public/launch/launch.js:48 \u00B7 www/public/kit/gallery.js:119 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0ebae5acf63f0a8fc20d1c097871db6e5f93a7bdb6009470b696c8ca69a8e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/app/src/App.tsx:532 \u00B7 packages/core/src/stores/document-store.ts:1524 \u00B7 packages/core/src/stores/document-store.ts:1714 \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":"packages/app/src/App.tsx"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"516be7ff32cff264d17c0407de721c885744317bd20480fe5119d85d27312962"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/components/AtomInstances.tsx:365 \u00B7 packages/app/src/lib/sub-feature-geometry.ts: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":"packages/app/src/components/AtomInstances.tsx"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df9ed6eb54a673f2544520ccc3b360137f116a8d892ac48df10186e08ff433"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): packages/app/src/components/DimensionOverlay.tsx:254 \u00B7 packages/app/src/components/FeatureTree.tsx:552 \u00B7 packages/app/src/components/InlineProperties.tsx:216 \u00B7 packages/app/src/components/PropertyPanel.tsx:1647 \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":"packages/app/src/components/DimensionOverlay.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"672a602e7dd07dca2ad2c9692fcc301c126da0a15fe6b3517fcf5b82b75e64a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/app/src/components/DocumentPicker.tsx:137 \u00B7 packages/app/src/components/FeatureTree.tsx:454 \u00B7 packages/app/src/components/InlineProperties.tsx:36 \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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bcb5ddd3c05fce397780e64b71eed603fc8f5cb3fc30385c9b88bddbae2251"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/app/src/components/KeyboardPrefsPanel.tsx:99 \u00B7 packages/app/src/hooks/useKeybindingDispatcher.ts:201 \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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eaa1654d375c0a8cdd5d9be7632984411b1059919e12709f956d2c52d77a29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/components/ParticipantCameraOverlay.tsx:218 \u00B7 packages/app/src/components/SelectionOverlay.tsx:173 \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":"packages/app/src/components/ParticipantCameraOverlay.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c90ebd472fc8108d11a8ce629bdb9bdc28265dab0ab2a12f942447f0b148bd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/app/src/components/PropertyPanel.tsx:1053 \u00B7 packages/app/src/components/PropertyPanel.tsx:1060 \u00B7 packages/app/src/components/PropertyPanel.tsx:1067 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1612c40f9694572f8e03b0b7d30e9bf29ba173cc7eacf5cdd00318f0c7f00c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/app/src/components/RetirementPage.tsx:41 \u00B7 packages/app/src/components/RetirementPage.tsx:63 \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":"packages/app/src/components/RetirementPage.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc929e9dbe03fd50bf8bb214cc64dd321c28e3cdc936c4fb23e755b69c84a68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/components/TriangleInspector.tsx:59 \u00B7 packages/app/src/components/TriangleInspector.tsx:70 \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":"packages/app/src/components/TriangleInspector.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab1900f5472925b49aca66e7311be2d85f983458c9cae57f93b61a7119ca10d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/app/src/components/electronics/PcbGettingStarted.tsx:21 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.tsx:307 \u00B7 packages/app/src/hooks/usePcbAutoFit.ts:76 \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":"packages/app/src/components/electronics/PcbGettingStarted.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0af012d60a2594fe65bcc7dcba83cc45d82d54f63ccfeb5d60b5a43c7e47853"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/components/electronics/SchematicCanvas.tsx:504 \u00B7 packages/app/src/components/electronics/SchematicCanvas.tsx:573 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a91248ac2bab59aae13de96144c2b9051e7fcae5d4548197df0cd572b2bd62c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/components/electronics/pcb3d/PcbBoardMesh.tsx:22 \u00B7 packages/app/src/components/electronics/pcb3d/PcbBoardMesh.tsx:34 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/electronics/pcb3d/PcbBoardMesh.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d93347e0fa59223f5eee8a18cd6f5e9a0fb249a5df388357721dd93c8a1f3f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9 locations): packages/app/src/components/tree/InlineDimensions.tsx:6 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:58 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:95 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:127 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f1f6186250a4247acf65c7e0322a8ec65c78d50992172b1067b6fb4fd2047b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/hooks/useAppCommands.ts:258 \u00B7 packages/app/src/hooks/useAppCommands.ts:298 \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":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"827fda5ab48707d08c1a338f7a3cf9bf16165024f7a241ad5829456294f678d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/app/src/hooks/useCameraControls.ts:178 \u00B7 packages/app/src/hooks/useCameraControls.ts:197 \u00B7 packages/app/src/hooks/useCameraControls.ts:216 \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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf39693154ae7cc7718f5e02d1e3975a3768b7580fa2a41aa3d90310b4ebe59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/hooks/useCameraControls.ts:250 \u00B7 packages/app/src/hooks/usePcbAutoFit.ts:38 \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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b1a3c885e9043da4c7704d02445a5aaa48287125908cc95f6b05c0e6472e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/app/src/lib/bootstrap.ts:394 \u00B7 packages/core/src/engine-lifecycle.ts:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"packages/app/src/lib/bootstrap.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"92afaf82b73bf57d4c889a50e93c922998077ebd7584273b66f660a387202560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/lib/circuit-analysis.ts:100 \u00B7 packages/mcp/src/tools/circuit.ts:81 \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":"packages/app/src/lib/circuit-analysis.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a86f921ddea027199edfbda5addc9d68a4bc2007e3bb93807a72ed70f0bea2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/app/src/lib/retirement.ts:58 \u00B7 packages/app/src/lib/viewer-state.ts:111 \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":"packages/app/src/lib/retirement.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c94375a8793f650846712e9704bcb5431f8250ea3639767feefb4e0697eba9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/core/src/stores/document-store.ts:1209 \u00B7 packages/core/src/stores/document-store.ts:1845 \u00B7 packages/core/src/stores/document-store.ts:1939 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc84f6ddae167a4e9dd95a1f7f213a03a6aae83ec93bfd10c7bf0218f6a9ac9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:1457 \u00B7 packages/core/src/stores/document-store.ts:1472 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1f6497803e062b7747ce2f1df89e98f07ff04b3da16a908e57a344b7670810"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:1879 \u00B7 packages/core/src/stores/document-store.ts:1900 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fcc79b5282191779fee3e9515d05fd341e0c34542fb3f840e9903e46a075a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/core/src/stores/sketch-store.ts:662 \u00B7 packages/core/src/stores/sketch-store.ts:671 \u00B7 packages/core/src/stores/sketch-store.ts:680 \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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"1064125f6d121c0a6203c3060b1b3e7d6b277e61726a0e085a9fc3e2368aa1db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/engine/src/parts.ts:171 \u00B7 packages/mcp/src/tools/part-stock.ts:132 \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":"packages/engine/src/parts.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c012e316d35aa27dc88d85182e0a95e2063df0ed0d0df1110ee608319100cc27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/ir/src/index.ts:485 \u00B7 packages/ir/src/index.ts:556 \u00B7 packages/ir/src/index.ts:604 \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":"packages/ir/src/index.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"3660b2085d4d3e5a140b0f9d366b5c11000b11027b794011333cd43689a58a49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ir/src/index.ts:912 \u00B7 packages/ir/src/index.ts:919 \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":"packages/ir/src/index.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"048532f73798156789ed57e861969386460cfacbcbe54867279ed6c5797f3671"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ir/src/index.ts:1067 \u00B7 packages/ir/src/index.ts:1081 \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":"packages/ir/src/index.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a419b0ce1f96856cb3e7a5e3ba0b32f69f873033da803752e385e05e63dee9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/mcp/src/tools/claims-ledger.ts:1040 \u00B7 packages/mcp/src/tools/claims-ledger.ts:1154 \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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc3a9a17ff54408512de5b4f0ff0cad8dfade43fcee1a4dddf8eee5db3318e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/mcp/src/tools/clearance.ts:658 \u00B7 packages/mcp/src/tools/measure.ts:445 \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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7e3c01f805e5c5e6070fa9c6618d44dd59a25661216c629134cd2e27fc39e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/mcp/src/tools/design-constraints.ts:29 \u00B7 packages/mcp/src/tools/parameters.ts:42 \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":"packages/mcp/src/tools/design-constraints.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"208701fd6fa697a7f34ea530abfcd675c0d817906b1138cef6fb6947839b5c3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/mcp/src/tools/document-solids.ts:154 \u00B7 packages/mcp/src/tools/registry-dispatch.ts:298 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 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":"packages/mcp/src/tools/document-solids.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab2a039a06acd72ecc2919c17d4819947500f26d47a2cb6ada574b44522ba35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/mcp/src/tools/measure.ts:163 \u00B7 packages/mcp/src/tools/measure.ts:237 \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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"69331803635f0760b99e63375544759c9591fad3225d7020dad645d6e54eef86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/mcp/src/tools/record.ts:111 \u00B7 packages/mcp/src/tools/render.ts:231 \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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2688722310a732d0e3b48d73c0065a7eeec26b033a4e6107986cb1e891257c36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/mcp/viewer-app/main.ts:1127 \u00B7 packages/mcp/viewer-app/main.ts:1251 \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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"67019ab02c9a89bfd0ead82c5f4a093cdeb10ea871ca9973c6a266df7308d7bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/training/src/cli.ts:98 \u00B7 packages/training/src/cli.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/training/src/cli.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c1b9df25327ce8ab10c65112ff2c58abcaac94bb36356a41d1bb50346ae9a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/training/src/cli.ts:874 \u00B7 packages/training/src/cli.ts:1020 \u2014 both copies are in the same file, so extract the block 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":"packages/training/src/cli.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"b346c75307c72291cc9e8d05bfe0b7449ef3a8fc356928856d2bb9380ec9b2fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/training/src/generators/ball.ts:165 \u00B7 packages/training/src/generators/ball.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":"packages/training/src/generators/ball.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a40d5908f11ada04176a8f103b2300e3bdf8c939a8e6fb6a8f8ed635e1a008"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/training/src/generators/bracket.ts:162 \u00B7 packages/training/src/generators/flange.ts:201 \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":"packages/training/src/generators/bracket.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f877cf81fb7be48b7e6902df91ed4c35e63e5ac652ea398298b0f8cbeacbd8e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): packages/training/src/generators/flange.ts:185 \u00B7 packages/training/src/generators/mount.ts:212 \u00B7 packages/training/src/generators/mount.ts:227 \u00B7 packages/training/src/generators/shaft.ts:234 \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":"packages/training/src/generators/flange.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a66e9bd0ee619ceae05ffca8877e1b6adec4f8d71bc44084ce2a13b3fb38d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/training/src/generators/turned.ts:225 \u00B7 packages/training/src/generators/turned.ts:293 \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":"packages/training/src/generators/turned.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ca60bccfe63dc4ba453d0b093b2f67c3b97964f5db82fc6ba20ead2d558bbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/training/src/generators/turned.ts:249 \u00B7 packages/training/src/generators/turned.ts:292 \u2014 both copies are in the same file, so extract the block 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":"packages/training/src/generators/turned.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"659316117fc91bf993f8000361f6f0fe7342c0d94834a3c2d205668018cabc3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): mecheval/harness/src/solver.ts:164 \u00B7 mecheval/harness/src/solver.ts:170 \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":"mecheval/harness/src/solver.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8995ce1027db00c1e8c8ad585d87112c256ad23c33f87ca07f638d7a95ecc54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:264 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:464 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f802835c5a57e6503894c48bec2b89d52d37afc5eeaf34beaed85ef8625c7477"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:270 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:279 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:338 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:621 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"957bce5de6e5d484c20136e53bb25f6287f0c751e47bbfb4e20538588e43f2d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:315 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:485 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:622 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3c48e0cf8e8830d5bd960d6121158be9d5bea06175a8a09a89a3356bf82963"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:321 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:373 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:540 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:551 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f521e731a7faaf0d856df92e825b141d5000c99a26fcdc49f137ca78b081862"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:404 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:418 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:431 \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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4337fd3c984fcd873959c1a86d00da28b5911f52dc581d9edf44b19820605dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/public/launch/launch.js:294 \u00B7 www/public/kit/gallery.js:407 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"79560de00e9222abd78427431ba8b7d661e71177b2abfa85fefa11685d4984b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/public/launch/launch.js:314 \u00B7 www/public/kit/gallery.js:479 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52c720f9d5decde11df5a6f47be2321bfc9241d3fcb6efcba60697c68e3ff10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/app/src/components/AnalyzePanel.tsx:132 \u00B7 packages/app/src/components/SelectionOverlay.tsx:228 \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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb221c2dbb77057702444aa4cc64eb5fe157cdd898f6bb851f9331e9ebf45c15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): packages/app/src/components/DocTitle.tsx:18 \u00B7 packages/app/src/components/FaceSelectionOverlay.tsx:4 \u00B7 packages/app/src/components/FollowModeToggle.tsx:8 \u00B7 packages/app/src/components/cam/CamSettings.tsx:1 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 8 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c1572ee3430c7af3b2136e02c5ce98037d63c4fb781161272499edf4198ef6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/DrawingView.tsx:496 \u00B7 packages/app/src/components/DrawingView.tsx:681 \u2014 both copies are in the same file, so extract the block 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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa8d360dfbf98209bfe81f3a3ba32b3cd647685aa934c9a77f32fa9d2c1da0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/DrawingView.tsx:1051 \u00B7 packages/app/src/components/DrawingView.tsx:1132 \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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"de512b55d8c962170ea56b5d8dbc1b78be10b1377aaff84c8a3141881b092064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/PreviewMesh.tsx:14 \u00B7 packages/app/src/components/SceneMesh.tsx:697 \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":"packages/app/src/components/PreviewMesh.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca83852cb5d81710d5b045dd40ef8f4457c81b6f56067f1deedd5b6b04e7ea21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/app/src/components/PropertyPanel.tsx:862 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:63 \u00B7 packages/app/src/components/tree/InlineDimensions.tsx:100 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eda0e128b10607d6c9ba869e2e58c161d10e92058dc99f8c035e9a22b7597d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/app/src/components/PropertyPanel.tsx:1374 \u00B7 packages/app/src/components/SceneMesh.tsx:211 \u00B7 packages/app/src/lib/sub-feature-geometry.ts:84 \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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5c93e4283eb5c13170d3888fa80ac502ab3f2fd8c56f5b6c966b1e4c07a1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/app/src/components/SceneInspector.tsx:17 \u00B7 packages/app/src/components/materials/MaterialEditor.tsx:14 \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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2496e9df8b3db137e8ae618e3e51c5a75f996a801d4194076a73fee17a7998"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/SceneMesh.tsx:289 \u00B7 packages/core/src/utils/geometry.ts:49 \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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3266e66573109d8324932405a791dafd22efb32a35028d349228155d4ab528cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): packages/app/src/components/SketchPlane3D.tsx:788 \u00B7 packages/app/src/components/electronics/ElectronicsPanelHeader.tsx:35 \u00B7 packages/app/src/components/electronics/PcbGettingStarted.tsx:21 \u00B7 packages/app/src/components/electronics/pcb3d/PcbScene.tsx:307 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6fe29829ddcd12f38a13928f4580b03a0f9d3fe9d62841e640840699663b0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/ToolPalette.tsx:112 \u00B7 packages/app/src/components/electronics/SchematicCanvas.tsx:306 \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":"packages/app/src/components/ToolPalette.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2e73e3cfddfa8788c0ef33b756309dc4e7f0d4497c7d3ad75d4731710cc66d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/TriangleInspector.tsx:82 \u00B7 packages/mcp/src/tools/integrity.ts: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":"packages/app/src/components/TriangleInspector.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4927a354a1095844817d4708ed9c42b9e1dbfd8c5fb50adecdbbc807e79817"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/electronics/SchematicCanvas.tsx:56 \u00B7 packages/app/src/components/electronics/SchematicCanvas.tsx:129 \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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e0c39c0481b6519a6714bff6895d0012cb07c4e6e585a6d1779fca78029e80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/app/src/components/electronics/SchematicCanvas.tsx:77 \u00B7 packages/mcp/src/tools/ecad.ts:14882 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"020afff1859fc6e84199bdeeea5c075d3cf703de1bd20a9e83ab9927edaa845c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/components/xr/XRGestures.tsx:303 \u00B7 packages/app/src/components/xr/XRGestures.tsx:326 \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":"packages/app/src/components/xr/XRGestures.tsx"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cb6fe7080f4476005ec25487bcbd267bdb7bdffb31d2445bc44bafe6495318"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/hooks/useCameraControls.ts:29 \u00B7 packages/app/src/hooks/useCameraControls.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"034e2be5ffc80a4a0ba9a982c2f64657ebf3eae0f26b0df9ee2e66cb8f16f737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/app/src/hooks/useCameraControls.ts:80 \u00B7 packages/core/src/camera-framing.ts:85 \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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ef90e061dd9c9a8deaf600e349bfa715cf2ed6021c0100cba36124ed730367"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/app/src/lib/slicer-client.ts:107 \u00B7 packages/engine/src/analyze.ts:135 \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":"packages/app/src/lib/slicer-client.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"05226ef9a6b50a2a5f1f0e6168d8cdf6f08b2668c1d806363c71ed6cdcda8fba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/core/src/commands/executors.ts:134 \u00B7 packages/core/src/commands/executors.ts:145 \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":"packages/core/src/commands/executors.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ee9cc20d61498745ed3ee5cc3053453d0a1432d71efe012aa1c0047d25f4ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:1182 \u00B7 packages/core/src/stores/document-store.ts:1191 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2ddf50f6518fb131029844669e85db2ce8bd504bfc52f4b11ac293a0eb6c5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:1226 \u00B7 packages/core/src/stores/document-store.ts:1902 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d73ea0f6964fe8a834cf82120dc8009870ae5fbfb659d26bf6f1b5289ad8344"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:1568 \u00B7 packages/core/src/stores/document-store.ts:1584 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7d1497d8ec284c3005c0b816c0c50d6d58195a5fe92908dbddfc3013803778"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:2049 \u00B7 packages/core/src/stores/document-store.ts:2060 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"b850b1524f086dfcd009835f91da697c8b9f1d26869bb44b0cd17043a2e1698a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/core/src/utils/save-load.ts:331 \u00B7 packages/core/src/utils/save-load.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/utils/save-load.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4187728b323d8474f6f00194b679ff81f31324832064687c58e241109fb1518"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/engine/src/ecad.ts:1802 \u00B7 packages/engine/src/ecad.ts:1951 \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":"packages/engine/src/ecad.ts"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"32df2edd6ca4ce986bd4bf597cc990083f54967d4cdc152232f83052834b41b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): packages/ir/src/index.ts:1030 \u00B7 packages/ir/src/index.ts:1053 \u00B7 packages/ir/src/index.ts:1065 \u00B7 packages/ir/src/index.ts:1079 \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":"packages/ir/src/index.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a2791229774911d4a1473232150f6b18d879db40e2d4fffe8b29a369263f44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ir/src/index.ts:1572 \u00B7 packages/ir/src/index.ts:1579 \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":"packages/ir/src/index.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c25fbdc51f324630d8acb2e1eab3687a6f003d6e03df8a7b19d83cae4e40f8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/mcp/src/server.ts:1718 \u00B7 packages/mcp/src/server.ts:1834 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"packages/mcp/src/server.ts"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"9595ef0ed3091b09583b35152f3ac3a4e05b61852fbc79f57fc7aa57c1d0eb07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/mcp/src/tools/carry-electronics.ts:127 \u00B7 packages/mcp/src/tools/registry-dispatch.ts:374 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"packages/mcp/src/tools/carry-electronics.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3017ae7688273d6adef964e48ff35934dd1319dc9b87d6b577458d8f96ab3fef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:436 \u00B7 packages/mcp/src/tools/ecad.ts:3571 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c6aecdea29e9b28085c7fb8f842c691776e218c86c82f8d85015ea1389177c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:3948 \u00B7 packages/mcp/src/tools/ecad.ts:4956 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65e1d49cb228029a1d48bb9813f3cdaff033f6987427fd5abcf6d4ec469814e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:11897 \u00B7 packages/mcp/src/tools/ecad.ts:11959 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11897}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2ec0bdc3b56365303753d29a5379f7a4d4496106526a9d7bd6f25ef2a55ed3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:13316 \u00B7 packages/mcp/src/tools/joint-range.ts:91 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5713f1322a7ff026b6e3470b75d1fe89df9a3c22a4eee022f0d78c843c286f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/mcp/src/tools/inspect.ts:178 \u00B7 packages/mcp/src/tools/integrity.ts:288 \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":"packages/mcp/src/tools/inspect.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8ed072d450db3c00a2b38ac36133c93c4c802461e0d894e63ead42ba134c92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/mcp/src/tools/parts.ts:157 \u00B7 packages/mcp/src/tools/parts.ts:198 \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":"packages/mcp/src/tools/parts.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c0bfa8a22b81e590f95389da86588cf301fe13507fedd6d4388e3e2c540de0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/mcp/viewer-app/main.ts:960 \u00B7 packages/mcp/viewer-app/main.ts:1253 \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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed70f31e77f4d1618c801870075580304a1181ee23510cfdbafca12afe4738b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/training/src/cli.ts:866 \u00B7 packages/training/src/cli.ts:1014 \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":"packages/training/src/cli.ts"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f296129b552032c7c165e11cf82cc4bfc2427e99ee049895d0fe2a9cb583eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/training/src/generators/bracket.ts:175 \u00B7 packages/training/src/generators/bracket.ts:189 \u00B7 packages/training/src/generators/enclosure.ts:313 \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":"packages/training/src/generators/bracket.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae629f8ac11f06dd5bf0243289982a0623d970ba413a2e0678ff8029e052631"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/training/src/generators/radial.ts:260 \u00B7 packages/training/src/generators/radial.ts:300 \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":"packages/training/src/generators/radial.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"89daaa83080cf4442036eeb752fbde1e63659cb02440bda7a0f123fd2cb64b41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/wasmosis/src/manifest.ts:100 \u00B7 packages/wasmosis/src/manifest.ts:113 \u2014 both copies are in the same file, so extract the block 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":"packages/wasmosis/src/manifest.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01141cf95797072bde58946b3c98145a3248235ed7004af3ae426aa431c6406"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): www/src/engine-card.js:112 \u00B7 www/src/prove-demo.js:87 \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":"www/src/engine-card.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a434c155e9d12c20942c906b9d394a0c7e8e4391beb26c1c313fc19643b45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): www/src/hero-engine.js:277 \u00B7 www/src/wireframe.js:52 \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":"www/src/hero-engine.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cf97325d4df325b3d2897004160a841901f43a09acefab6d623f2688653fc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): www/src/wireframe.js:71 \u00B7 www/src/wireframe.js:101 \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":"www/src/wireframe.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12cbfa9ff1accbfd5ace95e822ec79f3fb93b3876359aba3290b5db53b31fbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): apple/VcadApp/scripts/vcad-app-mcp.mjs:25 \u00B7 packages/mcp/src/app-link.ts:53 \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":"apple/VcadApp/scripts/vcad-app-mcp.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"df854054f671f5d0981406e4ccc93ecce65696190e46a6f58e65be58506f3e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mecheval/harness/src/leaderboard-cli.ts:69 \u00B7 mecheval/harness/src/leaderboard-cli.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/leaderboard-cli.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"997d088026b984f317cf2d4e1bd858a8fc3b8bc818b3dd5a530bda7b7c7192ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9 locations): mecheval/leaderboard/scripts/gen-task-refs.mjs:447 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:467 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:488 \u00B7 mecheval/leaderboard/scripts/gen-task-refs.mjs:543 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b47eb771c5b161e9640be7578bbf1801193cd2294b89420a645fad7db0fd4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/app/public/launch/launch.js:620 \u00B7 www/public/kit/gallery.js:702 \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":"packages/app/public/launch/launch.js"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b2b6501f48356cfde4e0fa5a4ea8d4441be10668eda886600874e0e53ba27c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8 locations): packages/app/src/App.tsx:259 \u00B7 packages/app/src/components/ContextMenu.tsx:89 \u00B7 packages/app/src/components/FeatureTree.tsx:886 \u00B7 packages/app/src/components/SceneInspector.tsx:43 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 4 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 8 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":"packages/app/src/App.tsx"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47d0a80ad9bc2aa93b223ebbfaf71870269c4bec65399449ec6e808a982cc38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 121 locations): packages/app/src/App.tsx:240 \u00B7 packages/app/src/App.tsx:246 \u00B7 packages/app/src/App.tsx:251 \u00B7 packages/app/src/App.tsx:256 \u00B7 \u002B117 more site(s) not listed \u2014 the 121 copies are spread across 60 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":"packages/app/src/App.tsx"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"af268b89ce658243bdeacf5f256d535a89235b5454415925352ac53f0d38d68c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 123 locations): packages/app/src/App.tsx:241 \u00B7 packages/app/src/App.tsx:247 \u00B7 packages/app/src/App.tsx:252 \u00B7 packages/app/src/App.tsx:257 \u00B7 \u002B119 more site(s) not listed \u2014 the 123 copies are spread across 63 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":"packages/app/src/App.tsx"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"871ce5eeb19978be3c1eaa4e4d00b8a327ce8da8343e883f6dad44f4223f4d95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9 locations): packages/app/src/components/AboutModal.tsx:67 \u00B7 packages/app/src/components/CommandPalette.tsx:160 \u00B7 packages/app/src/components/DfmDrawer.tsx:48 \u00B7 packages/app/src/components/FeatureTree.tsx:70 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 9 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"69083d1214ce164316fb42341dbc6c25ff9dedc63fe7d4854b21afa8f2f16edb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 51 locations): packages/app/src/components/AboutModal.tsx:65 \u00B7 packages/app/src/components/ContextMenu.tsx:84 \u00B7 packages/app/src/components/DfmAnnotations.tsx:34 \u00B7 packages/app/src/components/DfmDrawer.tsx:36 \u00B7 \u002B47 more site(s) not listed \u2014 the 51 copies are spread across 43 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cd69c6f8f3dcf542cebf3df2be2ede5b61e8f7a5cf3bf55d078fa2294e79be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 51 locations): packages/app/src/components/AboutModal.tsx:65 \u00B7 packages/app/src/components/ContextMenu.tsx:84 \u00B7 packages/app/src/components/DfmAnnotations.tsx:34 \u00B7 packages/app/src/components/DfmDrawer.tsx:36 \u00B7 \u002B47 more site(s) not listed \u2014 the 51 copies are spread across 43 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47ef84dfc3f3b188734356176654957e19ffab44778c87dd814ced03d87680c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): packages/app/src/components/DfmDrawer.tsx:48 \u00B7 packages/app/src/components/electronics/SchematicCanvas.tsx:292 \u00B7 packages/app/src/components/materials/InstanceMaterialSelector.tsx:41 \u00B7 packages/app/src/components/materials/MaterialSelector.tsx:43 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e112335ba39b28ff70aae44b9028b1f2ff8f32a80d3d15f3716a1b44dda33682"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/app/src/components/FeatureTree.tsx:881 \u00B7 packages/app/src/components/FeatureTree.tsx:973 \u00B7 packages/app/src/components/dialogs/AddJointDialog.tsx:57 \u00B7 packages/app/src/components/embroidery/EmbroideryProperties.tsx:24 \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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cc613b9413d46a585d973a4a11d04cb7e74926cc13e3b1921ab0b7a35a8fd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/app/src/components/InlineProperties.tsx:202 \u00B7 packages/app/src/components/SceneMesh.tsx:783 \u00B7 packages/app/src/components/SelectionOverlay.tsx:137 \u00B7 packages/app/src/components/Viewport.tsx:160 \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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9c0fedfba22fc6047c929052d6caffe7edce704183b12f537ce42b587288ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/app/src/components/LoginNotifications.tsx:49 \u00B7 packages/app/src/components/LoginNotifications.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/LoginNotifications.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf323391a996e9020c4ec3db5b286b48cb12631d492fa5221d161365b9416310"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/app/src/components/ViewportContent.tsx:719 \u00B7 packages/app/src/components/ViewportContent.tsx:1298 \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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"0889e201891a8ffd0caafb68f54f4c289e60add498d72c06d3529b39a03db126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7 locations): packages/app/src/components/cam/CamPanel.tsx:37 \u00B7 packages/app/src/components/dialogs/FilletChamferDialog.tsx:21 \u00B7 packages/app/src/components/dialogs/PatternDialog.tsx:27 \u00B7 packages/app/src/components/dialogs/TextDialog.tsx:17 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 4 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 7 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4668fc6e6b30f04056b32366f41c7bfbad25b78a40138c0081ad99e3e3b3a9ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/app/src/components/dialogs/StitchDialog.tsx:35 \u00B7 packages/app/src/components/embroidery/EmbroideryPanel.tsx:54 \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":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0cef174ee1288c1df78cd02a9c3b5764a3afc289e65be9a3899f6957be7fe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/app/src/components/electronics/EcadFeatureInspector.tsx:20 \u00B7 packages/app/src/components/electronics/ElectronicsPanelHeader.tsx:218 \u00B7 packages/app/src/hooks/useElectronicsSync.ts:34 \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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b4dbe3e693d30ebaafd6fd0eabc8c8983e1abc78abfa9dd428bd2504b624c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/app/src/components/print/PrintPanel.tsx:71 \u00B7 packages/app/src/components/print/PrintPreview.tsx:80 \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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dee0261e67cd72f5f6c7560adc066399b3cfd31d2688db744dfd7fd749f85a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/app/src/lib/urdf-meshes.ts:117 \u00B7 packages/app/src/lib/urdf-meshes.ts:126 \u00B7 packages/app/src/lib/urdf-meshes.ts:171 \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":"packages/app/src/lib/urdf-meshes.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"340cb973acaa04c77aba8072efab184a18a4b2af913326c3db80c07b210fcba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/app/src/lib/viewer-state.ts:105 \u00B7 packages/mcp/src/tools/session-core.ts:219 \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":"packages/app/src/lib/viewer-state.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a85a04a2ed2da483583828490d1b4ef0a0b6855664e8562a4c5f3da899ba61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/core/src/commands/executors.ts:144 \u00B7 packages/core/src/commands/executors.ts:155 \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":"packages/core/src/commands/executors.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb37cca3af8f9a4eda5db693d0dccabeffed9f46e04670a551f35363a5b53ccd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/core/src/stores/document-store.ts:2138 \u00B7 packages/core/src/stores/document-store.ts:2148 \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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"661b4be6246ffd2c622fae2a1b34299715bdd64ce36352b300040d940ed064ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/core/src/stores/participant-store.ts:120 \u00B7 packages/core/src/stores/participant-store.ts:140 \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":"packages/core/src/stores/participant-store.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fea62a23c10be100b11ad65f67cb6bd8a93532dbb033c1e862ed93e52bcf18e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ir/src/index.ts:1001 \u00B7 packages/ir/src/index.ts:1007 \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":"packages/ir/src/index.ts"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cff27db1d8569b7b8260245c84e553be97a149a729de3b3d0469068dbe44aaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/ir/src/index.ts:1288 \u00B7 packages/ir/src/index.ts:1303 \u00B7 packages/ir/src/index.ts:1318 \u00B7 packages/ir/src/index.ts:1337 \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":"packages/ir/src/index.ts"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a182216a443fb85d388136d0f50392f19eee82e53febdfc3b6ea71e1018aa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/antenna.ts:137 \u00B7 packages/mcp/src/tools/particle.ts:301 \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":"packages/mcp/src/tools/antenna.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63671442117ff1f5267a1197915b839b2ff92b589b0844fdd09e9444ce28c9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/antenna.ts:262 \u00B7 packages/mcp/src/tools/particle.ts:482 \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":"packages/mcp/src/tools/antenna.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f83be38dfb68b20e4b99479bf280e25ed93564bec4d095aef5c4bfe95c3e5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/mcp/src/tools/assemble.ts:11 \u00B7 packages/mcp/src/tools/enclosure.ts:46 \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":"packages/mcp/src/tools/assemble.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c82d9dbef977f931b92e328c41154ab91cd27cbe522c89dec4d60bdc4fea28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/constraint-claims.ts:62 \u00B7 packages/mcp/src/tools/constraint-claims.ts:175 \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":"packages/mcp/src/tools/constraint-claims.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efc6457e0fb8fe88796c2a0869c8e5d18af8d0d642911dcc70469ea7921229b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/mcp/src/tools/dfm.ts:61 \u00B7 packages/mcp/src/tools/ecad.ts:135 \u00B7 packages/mcp/src/tools/enclosure.ts:40 \u00B7 packages/mcp/src/tools/render.ts:941 \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":"packages/mcp/src/tools/dfm.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"993d45515febf6852720c8cf9e62d478e0cbdf3177e8d52cb1ad7fbc16d64e71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:2411 \u00B7 packages/mcp/src/tools/ecad.ts:2475 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b634fdd01a90500cfea70bcb1f4a20c5b5264a63259430c19c917cd1686bbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/mcp/src/tools/ecad.ts:3842 \u00B7 packages/mcp/src/tools/ecad.ts:11657 \u00B7 packages/mcp/src/tools/render.ts:1154 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3842}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c35e496d0b38989af5883f89a07777b985a9c98cdf214f056d11e4041b316f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:7789 \u00B7 packages/mcp/src/tools/ecad.ts:9964 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7789}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce5b80285c5ae3d580c99639d179742d7326986f49096102afdd748c94874c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:13408 \u00B7 packages/mcp/src/tools/ecad.ts:13728 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13408}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9b1cd40dad651a276c33045ac2db42606368ff041df684bae1f9af49894033"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/ecad.ts:14711 \u00B7 packages/mcp/src/tools/ecad.ts:14722 \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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14711}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b6c6bf90eb643b5a4ff4b56f352c297bc16e288b20cf7192d4eb693f75ba91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/import-urdf.ts:157 \u00B7 packages/mcp/src/tools/loon-assets.ts:98 \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":"packages/mcp/src/tools/import-urdf.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ef13622753b3d8ebe036c8928d6a6a85514afe7b664fe8ea2f95554265279e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/tools/sweep.ts:315 \u00B7 packages/mcp/src/tools/topopt.ts:177 \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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"009fcb58c79c9c2b9e629db7cfbf6d231177349a87fe34a24b1956bf5988c48c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/src/wasm/ecad-diff.ts:38 \u00B7 packages/mcp/src/wasm/ecad-diff.ts:45 \u2014 both copies are in the same file, so extract the block 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":"packages/mcp/src/wasm/ecad-diff.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"881c37dc47162a2ceea62efb319a3e3dc24274fb9437782692c68637fdcd9fd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/mcp/viewer-app/main.ts:530 \u00B7 packages/mcp/viewer-app/main.ts:2432 \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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb0e9353b133ab2e84d15dad62a71106502310cdf1c0b648fcf38df8184dd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/training/src/conversation.ts:43 \u00B7 packages/training/src/conversation.ts:208 \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":"packages/training/src/conversation.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"81909f46f162135a4b1d77d6a1e801f3d900e8dc42951391b9ac1b6cd89e40d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/training/src/generators/ball.ts:224 \u00B7 packages/training/src/generators/plate.ts:128 \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":"packages/training/src/generators/ball.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1b5d06b86cf4ef74275afbc67cee98a04a694e6c42a624e18c307e6840a85e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/training/src/generators/enclosure.ts:239 \u00B7 packages/training/src/generators/flange.ts:194 \u00B7 packages/training/src/generators/mount.ts:204 \u00B7 packages/training/src/generators/spacer.ts:145 \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":"packages/training/src/generators/enclosure.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1637ae06921b7bc99900e782da201524893b23743e57bb60843ca68c6fe18e70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/training/src/generators/spacer.ts:136 \u00B7 packages/training/src/generators/spacer.ts:145 \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":"packages/training/src/generators/spacer.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eae0aae0e4fe239aff98021261cd2d92a3b32422b83df90c7588644f941e21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/gen-swift-types.mjs:84 \u00B7 scripts/gen-swift-types.mjs:89 \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":"scripts/gen-swift-types.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1507dd9888a08d389366e750934df46a37cfa4d86cab4ac3843b1ac18b353f13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): www/src/hero-engine.js:267 \u00B7 www/src/wireframe.js:42 \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":"www/src/hero-engine.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"262f02f3c787b04533e434ec3b9967fb47dfcd3e099a6c14e74334b943ba0b69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): www/src/hero-engine.js:401 \u00B7 www/src/wireframe.js:110 \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":"www/src/hero-engine.js"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"99461a83f65996d104188c1c2a7fd94953de6f724e154c6888eb11cd1286b696"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/app/public/launch/hero-worker.js:4 reaches into another package with a relative path (./kernel/vcad_kernel_wasm.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/hero-worker.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaa6a49afceb8149524d0f6c9db34374167a8958a44e83e79d67fbca952e062"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0e9312a0364d30b732676eccf1a353f18bc23685ac9d071d285fc41db54d71"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:3 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a1edfde53fa36899f3e15aa7b7badb7bc6fd1b3998543902bbd0faa4a92d78"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:4 imports @phosphor-icons/react/dist/ssr/PencilSimple, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfc821d24ae0e0614afa48ee17b0e770eea564d067bdb704c01b4080195394e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:5 imports @phosphor-icons/react/dist/ssr/FolderOpen, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a9dd6b01a3f6dda370283f94e2248379ac5ecb356a700055e920fe07affe95"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:6 imports @phosphor-icons/react/dist/ssr/Play, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54fb39df7c165d7becad55216ed5a2c9cdd8b668ef763b2ca620b0319bc06f6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:7 imports @phosphor-icons/react/dist/ssr/GithubLogo, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad91a0babfab11bbdfad88662083b7d99aa76086a83ef7d429589af2b794d016"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:8 imports @phosphor-icons/react/dist/ssr/Book, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e8a58413b82a78bf9cee99c51bea65975a1784cb6aba7ad07d9a647824fd96"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AboutModal.tsx:9 imports @phosphor-icons/react/dist/ssr/ChatCircle, 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":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"85121cc45c45d442a05672627ea49775fb567bae265ecdcf07277838a3edc806"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnalyzePanel.tsx:10 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b48d0d698a1e3a7d8f245d787c6dad1dba6349927258a18ab45b0d628f486c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnalyzePanel.tsx:11 imports @phosphor-icons/react/dist/ssr/Play, 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0602d7f90793c686a8dabeaba3e98cdfb3285e79691f63d7f868870f57ee74b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnalyzePanel.tsx:12 imports @phosphor-icons/react/dist/ssr/Spinner, 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0666a33f5bb65b0c71df404146bb3e014c403939d2ab93fdfdffd068cbbef4f6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnalyzePanel.tsx:13 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c31977c2029c7ba54d4be8d3ce24c37b8f57dde03ffdb0bd7f8d514ff9d42"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnalyzePanel.tsx:14 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dbb358fb0d394f7297e63e26f00dbef98a07b5a6582606a0d121ae883c6de8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnimationTimeline.tsx:11 imports @phosphor-icons/react/dist/ssr/Pause, 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":"packages/app/src/components/AnimationTimeline.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db3f9100743fff1e86222b197094c64e99074c9ffae87aaac999b93f8e204bd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnimationTimeline.tsx:12 imports @phosphor-icons/react/dist/ssr/Play, 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":"packages/app/src/components/AnimationTimeline.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"27452c8a1307c75ce3f84ff4c2d12c3cfcf9a5ce9b7c79409a26d718ecf864de"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnimationTimeline.tsx:13 imports @phosphor-icons/react/dist/ssr/Repeat, 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":"packages/app/src/components/AnimationTimeline.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf266e2fe5f42c267556f56f7cd21a5aae3769c19114ed52b06ccb7e3a35fd6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnimationTimeline.tsx:14 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/AnimationTimeline.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcd5c6a0574619431225903e84c9c23234eccb0726086f22c22117e95f45e66"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/AnimationTimeline.tsx:15 imports @phosphor-icons/react/dist/ssr/FilmStrip, 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":"packages/app/src/components/AnimationTimeline.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8046625a4f863152251fe3bee050c8dc1559c5e073fe3d152b827c94965ecc9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:4 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a8c39b868d5e948d520f2ed7159de03a0c92214cdfbf2bcf686d52cafbf46c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:5 imports @phosphor-icons/react/dist/ssr/Cylinder, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5235f23bd936d8ab805a9b56c7390ce60282763101fb43646302c06832314de"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:6 imports @phosphor-icons/react/dist/ssr/Globe, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"259536ac7cd4c326fdf1ee4bda68803b752b682aa28a2029111c4d3f3a94f597"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:7 imports @phosphor-icons/react/dist/ssr/ArrowsOutCardinal, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be5056904aead07c14c633ecb4d1158722554f60e7130ae52e29727e3d1599a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:8 imports @phosphor-icons/react/dist/ssr/ArrowClockwise, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df029f10a826f68f47dc714f5653ed905323122a9d561957b367be437367581"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:9 imports @phosphor-icons/react/dist/ssr/ArrowsOut, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab9d624200c43d88a216a31d2ad05cb0d187879f8e250d78af59d479ae4d9ef"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:10 imports @phosphor-icons/react/dist/ssr/ArrowCounterClockwise, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa9c7824be24f82b241ea7fd9ff570ad7989d89f0a7f7bf984004f40bcee75c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:11 imports @phosphor-icons/react/dist/ssr/Unite, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92a36981cf003822a5234e0f4ee5365c3637d7034c3d21b214d9e6b1a939f44"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:12 imports @phosphor-icons/react/dist/ssr/Subtract, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4472816e039090a2169c479f36ae00e757aca108f8754abaf89cad93d5522e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:13 imports @phosphor-icons/react/dist/ssr/Intersect, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"018056facad07c66f49ba93e255b565a39fc7e1096b8b1d4c6a2c72fcfeb43b9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:14 imports @phosphor-icons/react/dist/ssr/FloppyDisk, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c1bb2e5b4fabc0d077779522e0195dab2d416f02e4986d37c8dfe49833ad54"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:15 imports @phosphor-icons/react/dist/ssr/FolderOpen, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2844149824485163bd2b969b69e1064e1155e4de74ba90b38d1df271e98eecec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:16 imports @phosphor-icons/react/dist/ssr/Export, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b52531b8f5f0a6c81353f846555eb8d3e7c2ca764b73c9c4b7d1b63a520338"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:17 imports @phosphor-icons/react/dist/ssr/GridFour, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7b133891b93746a95dc850bca77fb9ac6a5bd9a9ae55f8ddba102e4636fb5d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:18 imports @phosphor-icons/react/dist/ssr/CubeTransparent, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"131dc1a049a1409f9bc4008bb2c02e571a13e30c5f3a3d218874425c85c6587e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:19 imports @phosphor-icons/react/dist/ssr/SidebarSimple, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6a30dfcf57ed4bc7da299506e3194a32b5aa1b95ad8d258d5edd5b6353f374"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:20 imports @phosphor-icons/react/dist/ssr/Sun, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c26ef2d8ceb80fe69ef0087521b54fdc5a7b1b28e47eb38a5cfeb6dfb51d779"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:21 imports @phosphor-icons/react/dist/ssr/Info, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3111f8e30b033c32d2e669c0a15d065f43a7a4833ab190c107459e49cb85d8f1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:22 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b63baa3d2a08698f1f4ff584ce8ab4758a8d0d2befcf8e33f95d99c4a3ffa1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:23 imports @phosphor-icons/react/dist/ssr/Copy, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ccafa4a2e356131480300020c30457b478b851a028c8f4b8bc2207e3c234db"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:24 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"40141fc56c3637c6a5621450f4687d591475760f75efb0892e21e319254912b1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:25 imports @phosphor-icons/react/dist/ssr/MagnifyingGlass, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f519c14ffebe1f6e8153010f35f4239f541b83934c90e84b1711c6a084271c4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:26 imports @phosphor-icons/react/dist/ssr/Package, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3d3303c0048a4e382a30d9ddc85238fecf2cfb134c2e71b904fe3fb0ea9a53"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:27 imports @phosphor-icons/react/dist/ssr/PlusSquare, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb98b9c4343610f65c1112888f06f15775c1eb9d35a4f1e6a729e105e6d46564"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:28 imports @phosphor-icons/react/dist/ssr/Anchor, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad07497430dd89b259899ee7352e2f45510963e6443701440df1028b73fcf4fc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:29 imports @phosphor-icons/react/dist/ssr/ArrowsHorizontal, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"088411fdb620aae13d39ca5fc14736d748b775bc8eb41095b7d44ec362226438"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:30 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cf38c32aa05e641f796aaa17c8d6145405a654ad3f363e2b82e145671fdc56"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:31 imports @phosphor-icons/react/dist/ssr/SpinnerGap, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5981c4f22874413625ec0f14f800a215c6528d2f3422b59ca3c26d5a37ee8f63"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:32 imports @phosphor-icons/react/dist/ssr/Play, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a89267bf573100b1e16b55d4fda3a0531db6c4d876e84b6ae80c52399e473b1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/CommandPalette.tsx:33 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"077171c6d5b7fc9bd53307d919734035b090c2fad9cdc892e15ef9cc443ea92f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:2 imports @phosphor-icons/react/dist/ssr/Copy, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccea635652396acf3d42de3a57e070732f4dc2ddb8ffda09c04a45260b8e50b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:3 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19c38ebf857fa95b67bc633a2554c0a981f576e24ac8457bce41c05bca0dca5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:4 imports @phosphor-icons/react/dist/ssr/PencilSimple, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5753f7dc73a2a27c125fac9154e0773271332e1a980ebc77316649f736068105"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:5 imports @phosphor-icons/react/dist/ssr/Unite, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ce938d2c290ef62c6549d033dc07d3bd42bad0d22965bdccf854381520d727"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:6 imports @phosphor-icons/react/dist/ssr/Subtract, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5bc9d1d7dfa7847753051ef56cefe5b08600e5eeb2a2c03d7dae3e9ec6abf3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:7 imports @phosphor-icons/react/dist/ssr/Intersect, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49fee09f2599cfe2f2f4a774fd5034e5cc9428a71829624fb8cb4b7bd07c123"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:8 imports @phosphor-icons/react/dist/ssr/Circuitry, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc235c23d4f517386ba5118119a6e85e0984f780dd7753ec08fb8279622a4158"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:9 imports @phosphor-icons/react/dist/ssr/CrosshairSimple, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52f38b2985ee0fc84f84aba09f2ce2af6059c07a5586452385d30b1a52e9d8b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ContextMenu.tsx:10 imports @phosphor-icons/react/dist/ssr/Check, 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":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb243def59237bf6ea746ecc46dfdb9658af52fec0e9edfd30f66ac88d893f6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DfmDrawer.tsx:16 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e412cb6a60abf09e4bd0da9ba2d27a1fe79aa4f3587979294c908ce3e0115c2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DfmDrawer.tsx:17 imports @phosphor-icons/react/dist/ssr/CaretRight, 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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96d0637dc129b7582f1c8203ecdefcff28a7916dadf76fd4aa340db9d975150"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocTitle.tsx:2 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8ac0c000606f3c36a9a5386336a41b932784369ed141d3c1746bd80d9299cd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocTitle.tsx:3 imports @phosphor-icons/react/dist/ssr/Lock, 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"836333052825bc52178aac3bbca4d7496f7964b3926e2c9400de531df0aed3b3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocTitle.tsx:4 imports @phosphor-icons/react/dist/ssr/CaretRight, 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8789dc25377e02c637d4b06827769033073efafa5c566a0d03cd6d9c6b8bd6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocTitle.tsx:5 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4a1d568da9ebfe8036e2fe7fefb3a4a2b1346d53350a1a6f6d3e4d4fde9c14"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6c60808dd2a68464be2ede1d939203fee1fe92d4509dbe6306e679b58950e1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:3 imports @phosphor-icons/react/dist/ssr/File, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ac015e315fb2f52eebc11019780fbec25b133a7c4bb9194cbea78b5d3b41fe"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:4 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb64b191860850218f37ff587a2e4f524650faa6977207743784d39c6d25ba46"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:5 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2c25d0261b1fa249a8683d1f2583a40eeed3cb634dd1c9e244461505b8ffe7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:6 imports @phosphor-icons/react/dist/ssr/Pencil, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0632ada9783c729146f2b2a15a42f426bdf3c927f21d0a8ab7de96f193fb43f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:7 imports @phosphor-icons/react/dist/ssr/CloudSlash, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb09fe6f8d2384b3111c20c01022791bc23cde26d5fc323a6096c285bfdd965e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:8 imports @phosphor-icons/react/dist/ssr/Cloud, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c78dd14c92d9b85fb3ba4580fa3c963c5f391b90a11d27103a1f76cb30c7316"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:9 imports @phosphor-icons/react/dist/ssr/CloudArrowDown, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4f4b13f2ce7e41f3005030c97145716e23fd4ef05f86568ed67aae9e9411e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:10 imports @phosphor-icons/react/dist/ssr/HardDrives, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3929507b651f33b9842da79dddb73800d8edf5def1863d6daaf218af87baad3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:11 imports @phosphor-icons/react/dist/ssr/SpinnerGap, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"13be4b036ec1ea0d8af899fc1edaf2b816e20910872decfead31e523fc90c6e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DocumentPicker.tsx:12 imports @phosphor-icons/react/dist/ssr/WifiSlash, 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"171e96313b51845716d9bca68b26fe471e9690c83a39148b96d3a64ddd53f4cd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:1 imports @phosphor-icons/react/dist/ssr/Eye, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2037c38d55e8e3acae903a201aaddb722061d5c0bad6f271075e2df4379838"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:2 imports @phosphor-icons/react/dist/ssr/EyeSlash, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55cee837ff6649b9fbfeaf62a2410d6ef837d8caf0c58eb7627165cb8f7029e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:3 imports @phosphor-icons/react/dist/ssr/Ruler, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46f6f9db0c8f4e6b28b352178d042e34636ebee1bfd78cfa46283e02bdcb958"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:4 imports @phosphor-icons/react/dist/ssr/MagnifyingGlassPlus, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba06a9ca786ee1407150e3f85f8eb4b2a8cd8e970b8c56a29694b79cee6410a8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:5 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"301da64de63b2638c0dfe1170f2d040e55d7febc72ee1bd7c815c7d229b34a5e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:6 imports @phosphor-icons/react/dist/ssr/Download, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e30d8255eaf5703d023e8393292a569eadc69bc892ac76c8a1f35f933dfd24"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:7 imports @phosphor-icons/react/dist/ssr/CaretDown, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a943b2b4440319b68d8fe1d3abf2309664fae8c2514f55891f2a2c09a0f938f9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:8 imports @phosphor-icons/react/dist/ssr/Scissors, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"016453d7a03f84ce613133378b9375e06972fb33a85b90df3fd4e5111afa8319"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:9 imports @phosphor-icons/react/dist/ssr/Table, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ebabd6fd7b6c375698c5819cc5a0478f1feda51c0f72d13d14e187c350f916"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:10 imports @phosphor-icons/react/dist/ssr/Article, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"32232dfef3e6fd08802a00e8076e935471ccfe2387fa342c9bc3803fff67b0c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/DrawingToolbar.tsx:11 imports @phosphor-icons/react/dist/ssr/FilePdf, 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb3588c54771af1c86cb611f4eb80090b5630bc6c43ec76f5c6d4291715c645"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FaceSelectionOverlay.tsx:2 imports @phosphor-icons/react/dist/ssr/Crosshair, 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":"packages/app/src/components/FaceSelectionOverlay.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60dfc7e399f74c746c8bc86a134de857671384800294ceaae9a6b509409a1e3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FaceSelectionOverlay.tsx:3 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/FaceSelectionOverlay.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0b1c71c1d2e49db7451c599f8a15279e31e0e80510ce9b89fa915ac8e20332"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:22 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9845ac56053fd69b175d57c1df4efd941d042c99017fe382b0300b27b5922c31"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:23 imports @phosphor-icons/react/dist/ssr/Cylinder, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcdc7cf74d20e5132863534fb7739ac2febac502206a03ad0a6f309827e489f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:24 imports @phosphor-icons/react/dist/ssr/Globe, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"927d61454043474b66d0410d646bdd34f17cc128fdd38f03632ff2b672569af1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:25 imports @phosphor-icons/react/dist/ssr/Sliders, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0fd7331c04f2ba6e144975e5b13943c4243691e57ee7bebb86c963c596bf72"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:26 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59c0ff98d952b2f3d323e8c0846588977bd62e575556f75055ea763af013f46"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:27 imports @phosphor-icons/react/dist/ssr/Intersect, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b705368b2c34b8bad6c76667b19f26c404337e972ad793f83bd15c639c01d8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:28 imports @phosphor-icons/react/dist/ssr/CaretRight, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84afdeba938b51d02184ae6b57578a9965fca3462cedb5173280f0f8417db0e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:29 imports @phosphor-icons/react/dist/ssr/CaretDown, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"313b8df404b4acae6c97278c28de714d8385f7942a3b1aa6220acd691cf06734"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:30 imports @phosphor-icons/react/dist/ssr/ArrowUp, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f87f8f6d17f233d92a8374fe448db875c3e3b8add8e726cbcc10c3d1fb49fc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:31 imports @phosphor-icons/react/dist/ssr/ArrowsClockwise, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"543449757859368125ef631a65354b6410b78661c3f14a268522a2d3e8667cab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:32 imports @phosphor-icons/react/dist/ssr/Spiral, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb680276051d85d5448ba40f016c40d133c7da2843250ec9ea6d47afba7b8a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:33 imports @phosphor-icons/react/dist/ssr/ArrowsOutCardinal, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e13f7dde3922bb66a3497cf0f0fa7731601e6368de38b39849f067af611def1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:34 imports @phosphor-icons/react/dist/ssr/Stack, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0096fd60c397eaa769925a277ebd5b40c02dfbe6fc0c6e64bd96e39de06c4b3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:35 imports @phosphor-icons/react/dist/ssr/Package, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7eb9c91a56e7dc3dc369b9a3b36f7ef040183fb30a575acde9fb053cbd7581"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:36 imports @phosphor-icons/react/dist/ssr/LinkSimple, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8d027eba53f02817cf08e7d8010fec3e671e50ccca4c9a096953960ca4676a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:37 imports @phosphor-icons/react/dist/ssr/Anchor, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"469e9ad4de2e83cc7110be9193a66081993256e760713a56cda53f800520f215"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:38 imports @phosphor-icons/react/dist/ssr/Copy, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ced2904a67522c088f192882e97f3e0419ece6b6639b516381023f19a5fa281"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:39 imports @phosphor-icons/react/dist/ssr/PencilSimple, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df5918e07f11fdffee292f11b1ade7ddbbdb2467be405f5395c11a385007e31"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:40 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"25db17e4df580e6477dc6ab9f8be5d9917d39695e968239e95e21fad9021df2d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:41 imports @phosphor-icons/react/dist/ssr/Octagon, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e642770b7a4903d87f106415cd121df20523b67ad9a20f8737f41f983a283"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:42 imports @phosphor-icons/react/dist/ssr/CubeTransparent, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8407528b4c5050d083aee5ae2fb78dccf25372c02c45e0eed3e001420656c8d7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:43 imports @phosphor-icons/react/dist/ssr/DotsThree, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c54f47c5fc0cd22191bd01c8a1726a995a817faa3bca6fb977ab6fc73c3aa91"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:44 imports @phosphor-icons/react/dist/ssr/ArrowsHorizontal, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"261108af86fc75e07d27457819e63b6202406643913221e9e28bb08607a535cf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:45 imports @phosphor-icons/react/dist/ssr/Eye, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b487651412bceeb8af229d8468b7f0a55aeaf09f799f10b2b0cc94d9edaf3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:46 imports @phosphor-icons/react/dist/ssr/EyeSlash, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10733b4ed37ba917fabb1160fda80e02cede357e977bd096af57b1820d6b46d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:47 imports @phosphor-icons/react/dist/ssr/TextT, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d4a1d75eb26438776afe2685f772a4687b2326777ef17c3e97dcf742cf9c38"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:48 imports @phosphor-icons/react/dist/ssr/Circuitry, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58a2c8680899cdbd6ec7233a4c269ecce48f88b7f8006ee527f8e2c08f618c8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeatureTree.tsx:49 imports @phosphor-icons/react/dist/ssr/Scissors, 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d744b0eb9836ff043fed36581d8873f9df7cc6ec2b40f2bbc4fe8f1261ad410"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeedbackModal.tsx:3 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/FeedbackModal.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7d20a547fcbfe50f9d2e74b33c46c7a7ea4bbff38d9863294be1d57ba901c4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/FeedbackModal.tsx:4 imports @phosphor-icons/react/dist/ssr/Megaphone, 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":"packages/app/src/components/FeedbackModal.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcf5db892c7caae1e4d8d7b580ccdb94fc902e280cdc726e1be415b7b194e0b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/GuidedFlowOverlay.tsx:1 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/GuidedFlowOverlay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb5f8dc73b67d739c57fe2b486f9f7c6f57c07c50d244a2368010d86d855f41"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:2 imports @phosphor-icons/react/dist/ssr/BookOpen, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"093a65b4631844c2978a7da37f8c323fa9caf219ca9cfff9b339457166364c53"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:3 imports @phosphor-icons/react/dist/ssr/Mouse, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95ea953e0f2e5423845c45eaa4c3be74dd432cec9dde7eac2e761c2b158cfbf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:4 imports @phosphor-icons/react/dist/ssr/Goggles, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04499c9b627c2fa99479910dccb1293f0c7afca987ffe2a55b7a13ea6f2c309"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:5 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9351a14a9cb2f5170daa2c2c0cb931d8eb096c58d35ebe4a89877911f0e6ca2f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:6 imports @phosphor-icons/react/dist/ssr/CaretRight, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"619cd261af91d677a9502728999ab88ad0dcfef26018fbaa48a369504640cf6c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:7 imports @phosphor-icons/react/dist/ssr/Export, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86c99b71d2f5ff4e45b866b4e25902c3685b709b0c15fca22ed5693b574f2ff"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:8 imports @phosphor-icons/react/dist/ssr/MagnifyingGlass, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"015604f8a3888a9be0ffa4122cb9d15914ef639406f271a7db99c91eb2dac0cf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:9 imports @phosphor-icons/react/dist/ssr/Bell, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aa79c6baff6a29c50b94e00bb2fa98257418ec3cb2f4a0e49f83639ec9f33f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/Header.tsx:10 imports @phosphor-icons/react/dist/ssr/Megaphone, 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"598ae954212257b81256614df8aef82e7c3964398f205bd4097af0523823bb70"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74688baca2cad008c4666cc2cdab1cf521aef4e4877ea5b9bff353df5f45c54"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:3 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82adb2aa5b92b1104a0f4cef26454679b2c2bc046eebbcf581162f2163fa6e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:4 imports @phosphor-icons/react/dist/ssr/FolderOpen, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bf8c246fb354751c80ce608080821a174d5ddaca24793145a888556ce48b72"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:5 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e98fae6cdd09e02fcb4ccd2ec12fd7a1f0552b3cab9bde3154db061abcb3f9c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:6 imports @phosphor-icons/react/dist/ssr/Wrench, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f73849a39d741f38515a8063b882463fc835dbe3aefcbac73312a0b2c8a8d34"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:7 imports @phosphor-icons/react/dist/ssr/Package, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d708596ce07e73a696ac201270f587a9f2dd2ef154f4254be7d4e81e3a690452"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:8 imports @phosphor-icons/react/dist/ssr/GearSix, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bc425dc38a1dfc32aa43c35b5c719315794483b6fd0be135181c7445c4ab81"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:9 imports @phosphor-icons/react/dist/ssr/FlowerLotus, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f036ab56283cc90c3e52fb106347dbf503f6f310897b2bcf6b85e32aaccca651"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:10 imports @phosphor-icons/react/dist/ssr/Robot, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"748d5f7b28fe6fd92b290274ba17f681252e84a5f45748016349bd7df3e90631"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:11 imports @phosphor-icons/react/dist/ssr/Wine, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"da206acb96d8bce8f70ca5c739d53a9285ae28e264b65aac1c0b90957fc3bcdb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:12 imports @phosphor-icons/react/dist/ssr/Smiley, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f46093da4ccf36298c3a1a5711a0204fc919500dc64a0ef6107ec94709bbfc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:13 imports @phosphor-icons/react/dist/ssr/Square, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2261f5396102c2b31cb6d2b6fa7c5cabf9f866f2fca273c153a1802ba4857e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:14 imports @phosphor-icons/react/dist/ssr/Waveform, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7941a2d49e3f5b6d59514848247a2de92f6562b03a1e90f7a81d32707ad8d3d0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InlineOnboarding.tsx:15 imports @phosphor-icons/react/dist/ssr/Star, 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":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf738701554a89d0f548af4b825552c0d267f0057a931749914827294269d3c3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InputPreferencesDialog.tsx:11 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/InputPreferencesDialog.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8f875be7b7b75945794d7a97617f994178c0238f6264c7262ec6b7cf485570"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InputPreferencesDialog.tsx:12 imports @phosphor-icons/react/dist/ssr/Keyboard, 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":"packages/app/src/components/InputPreferencesDialog.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fac30d2cecdad89bdfbd1e6a309c614221e16151af195230ef9584aa2cdfd6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/InputPreferencesDialog.tsx:13 imports @phosphor-icons/react/dist/ssr/Mouse, 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":"packages/app/src/components/InputPreferencesDialog.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d1be409d532851835897e13133d2522a265a6c116426b23df9a10c0690572a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/KeyboardPrefsPanel.tsx:13 imports @phosphor-icons/react/dist/ssr/ArrowCounterClockwise, 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0db81e472174c6718e546f9ed701419762a0f4e6e82c7783ca0d2904a5f3f0c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/KeyboardPrefsPanel.tsx:14 imports @phosphor-icons/react/dist/ssr/MagnifyingGlass, 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b036f9844aa3afd1fb87cd058b2514cd674f4bd2dbc00483bf387c6aa5214686"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/KeyboardPrefsPanel.tsx:15 imports @phosphor-icons/react/dist/ssr/Warning, 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f2cb74cde992aaa7d6434607ad6917977bd9c5568d2898d5e7ea946d3e5f6f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/KeyboardPrefsPanel.tsx:16 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2a4aaedd9a4508b34f4989146362b14e2438b1b4253527293bc8e5f22c4e34"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/LogViewer.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/LogViewer.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deda7df350c8f72fdb8a9aa8a3e79b28f92424f22884547687b08578af8e019"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/LogViewer.tsx:3 imports @phosphor-icons/react/dist/ssr/Copy, 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":"packages/app/src/components/LogViewer.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e570d23f481a5e25d6ac78261c34ced94de208c690db99fe8b452757c72949a0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/LogViewer.tsx:4 imports @phosphor-icons/react/dist/ssr/Prohibit, 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":"packages/app/src/components/LogViewer.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"906c3d9900a1dd697856f71802d3d8b33cea6f8f0adcd67be8b5ac65fe40ccf6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/OfflineIndicator.tsx:1 imports @phosphor-icons/react/dist/ssr/WifiSlash, 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":"packages/app/src/components/OfflineIndicator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd661fc7c73599667ac60f3dc6b23b533064ca9fa29cf999f2b6832c6ef847b3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ParametersPanel.tsx:2 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba5475ca40768c07408e88e8426170c8c48a9d2389cfe2624108cb1102ab636"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ParametersPanel.tsx:3 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2558df78d4f33d3e845e72a7a1b72374d6fdb6095253c4b9ca41ed127390007f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ParametersPanel.tsx:4 imports @phosphor-icons/react/dist/ssr/CaretLeft, 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff53ac52670246a4a7f0be92afd5b875382a229d35968c28251fcc2b1354431"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ParametersPanel.tsx:5 imports @phosphor-icons/react/dist/ssr/WarningCircle, 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70bf5c0001c3197775237d874adb99e1a2d8be93709514145161a50290338b7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ParametersPanel.tsx:6 imports @phosphor-icons/react/dist/ssr/ChartBar, 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c051779615925108339bd398ccf8bd2a84d8672fe6f8a5285a71b6996fd61b5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"51de2dd6f16a4a259cece6359957e57cf4ffb70f5d5f24755f8c5e2226d4cb70"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:3 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2130ef45641e66bfd272cf05d166c130da26584014178078c2341a6491715698"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:4 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ff5ecb88f78fb0f85e140cd53e2a5f667004960dd296aa156ec447438f2a78"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:5 imports @phosphor-icons/react/dist/ssr/FileArrowUp, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39100797ef7efaa47139c2919c414983cbad6408759942e8da910c362fe76c2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:6 imports @phosphor-icons/react/dist/ssr/Globe, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92fcb0b7983a3b53e96f21ad3b3249c15d156f77ff8e3891501cccb9cfe8a7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:7 imports @phosphor-icons/react/dist/ssr/GitBranch, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"47366c60f59375e9aca069514b1e3cc29b374f1d787110a999c2954d7813dbd2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:8 imports @phosphor-icons/react/dist/ssr/Lightning, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b92ede29b2bad7cdfa607b6cd1e581b7250b673065d48a61072a491f48cc28"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:9 imports @phosphor-icons/react/dist/ssr/GithubLogo, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb352f1b0b450c0c75c19c8724f495ce098fe718263ddf281bb56c44d8c36337"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:10 imports @phosphor-icons/react/dist/ssr/Book, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b47dea37cae4d9de1dee559ba2a06893c1be39d2117cb624ff610154805c9f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ProductModal.tsx:11 imports @phosphor-icons/react/dist/ssr/ChatCircle, 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":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf89698e36e7363999d84142ce563cb7406e2108f64b7e9c80f65062745a2cb4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/PropertyPanel.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7c4bb60cd94ce765235cc38470c678a1a2825039c2a8e75e820a3bf0104abc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/PropertyPanel.tsx:3 imports @phosphor-icons/react/dist/ssr/CaretLeft, 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a710a6054d50771046ad684e7002912f2f06ce93c733cdf0cddd086c42c9a4a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/QuotePanel.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ece7feb9391b182db3ea0c0f67442f159ab1581ab8f4464eed634751980758"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/QuotePanel.tsx:3 imports @phosphor-icons/react/dist/ssr/Package, 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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc7c83b3f5d93616c2e07d7ce8eeac68547f94fbe0998131204c3475b55d071"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/QuotePanel.tsx:4 imports @phosphor-icons/react/dist/ssr/Clock, 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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f95da8445af3979edd2d43107258b1230fcd3b766b47d449069900aa4f3023"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/QuotePanel.tsx:5 imports @phosphor-icons/react/dist/ssr/Truck, 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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"717d5095b6dd3b2b06cfc64a467c124fc80059fb73e0080f5e46cf17159c33a8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/QuotePanel.tsx:6 imports @phosphor-icons/react/dist/ssr/EnvelopeSimple, 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":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6126117186e7115dec237369e18f0e662c9a5069563125223b51a2613f04bfd8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ReadOnlyBanner.tsx:1 imports @phosphor-icons/react/dist/ssr/Eye, 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":"packages/app/src/components/ReadOnlyBanner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b49c44541af20fce7fee8a2665134d965c71419479087e5ee8ae00164b04c6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SceneInspector.tsx:1 imports @phosphor-icons/react/dist/ssr/Image, 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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfbccf848694d26d85da2bff227bc5e06b07011d13a0a2b42cec92e005f6117"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SceneInspector.tsx:2 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5968bd9f4c590a07a2642dd4c1bd93c10a1e30bf8d855a55e6f7295e6d7748d5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SceneInspector.tsx:3 imports @phosphor-icons/react/dist/ssr/CircleHalf, 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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1293c44984e6916b8a5b3eb7b2b57cf607e1e6fe4ce7cc034e0f3bd18855509a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SceneInspector.tsx:4 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b15fdbf49408a1bcf49f7791a617e39dd63ca0fc28b79f3b3f526fc56c2712"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SceneInspector.tsx:5 imports @phosphor-icons/react/dist/ssr/CaretLeft, 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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4834976b229bf105b615f8df14dbfaf392d989f032017e14223c1c19fb8ee14"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SceneInspector.tsx:6 imports @phosphor-icons/react/dist/ssr/Globe, 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":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1855338652e10b300d09a23026090d9290aab0bc1bee33a05ca19a48796186b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SketchPropertyPanel.tsx:2 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"00644ffe3a4cdbd2f469daf9cb5cd445a09452922e04b69d7ba3d7349814374e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/SketchPropertyPanel.tsx:3 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6ebd04bf675798e5d7dcf892e67acb84511f30b60f6491dcf8330915404434"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/StatusBar.tsx:2 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6879fdce60ca247a6790f49d60f3301002bdce0f01ec3385872b152a15057005"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/StatusBar.tsx:3 imports @phosphor-icons/react/dist/ssr/Terminal, 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7270c6adfc9d3e8afca46bb6a5d03f6c17eeeca77671d081813e8fdfe1fe0193"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/StatusBar.tsx:4 imports @phosphor-icons/react/dist/ssr/PencilSimple, 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2419ddcb59f243169cdc710ec3b6f6615b3c4a03a1c1ceea03c6cf128df85ce7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/StatusBar.tsx:5 imports @phosphor-icons/react/dist/ssr/GlobeSimple, 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a711fc225c1ede48c92131f96e52b732a7fc2c41e6f982d05f4fa51f41acfd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/StatusBar.tsx:6 imports @phosphor-icons/react/dist/ssr/Check, 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0270dff0024be86991d4fd7370a80185874d62be41fc5395223af5999829ba08"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/StatusBar.tsx:7 imports @phosphor-icons/react/dist/ssr/CrosshairSimple, 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"97980838967e843798adf4a4931f17e367fa7d1260eaac3212f4cb6b10043a6a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/TitleBlockEditor.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/TitleBlockEditor.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e88f5dbf307c228fc7d8e0ed88a11f651d4b9513db18ed8be263725c5254e7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/WhatsNewPanel.tsx:6 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/WhatsNewPanel.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e45127e7100fa62b88daa0ef1baa72246e61a39f6d876e572c866b3240ff780"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/WhatsNewPanel.tsx:7 imports @phosphor-icons/react/dist/ssr/Rocket, 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":"packages/app/src/components/WhatsNewPanel.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2630578d6fbfe5c284bc13f939d91e0f2a78ec807352364cbcf6a3cdcc88749"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/WhatsNewPanel.tsx:8 imports @phosphor-icons/react/dist/ssr/Bug, 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":"packages/app/src/components/WhatsNewPanel.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acb93329518531f4eb510f3a30067a768a151cbd6c04bb43a87c237dbe4eb8d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/WhatsNewPanel.tsx:9 imports @phosphor-icons/react/dist/ssr/Warning, 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":"packages/app/src/components/WhatsNewPanel.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de02ffb2424c86a97b2714dd7a0692864edad00a3440ad9b33f74a836363e2b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/WhatsNewPanel.tsx:10 imports @phosphor-icons/react/dist/ssr/Lightning, 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":"packages/app/src/components/WhatsNewPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35d90c2afd888f03939441a186ae33325425ae44bde6e2d9bcbe5bd7d7582a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/WhatsNewPanel.tsx:11 imports @phosphor-icons/react/dist/ssr/Book, 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":"packages/app/src/components/WhatsNewPanel.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"79503d8186277825281e9d314937df8e8a76328021a662d24d5d97c0979d2a2c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamPanel.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eb5950441171271db5395f3d2cc36f74ca8af6ed4c3bc84e1a83d744db53b6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamPanel.tsx:3 imports @phosphor-icons/react/dist/ssr/Gear, 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1a93e65af38f3305efa04713703bfa4abdd2043a5e3b4741c74794b5ba1a25"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamPanel.tsx:4 imports @phosphor-icons/react/dist/ssr/List, 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0022a841d66998851a4eb86e19c64b0bfc22a909470d8e55ea88a265e8caa488"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamPanel.tsx:5 imports @phosphor-icons/react/dist/ssr/Wrench, 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"163d4fce8c530d9677aee32f2c6a3276c8cbada573047c2de1c821ddd7f9ee6d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamPanel.tsx:6 imports @phosphor-icons/react/dist/ssr/Export, 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd7e2c424f84a7ed1616f18c9ed1aee2199861b5744b7f735106e42ddb47f45"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamPanel.tsx:7 imports @phosphor-icons/react/dist/ssr/Spinner, 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"176cf3d6ee72e8fc1c44e0a1c409a66537ae57d085a6c3dbfec2150c8f88a42d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamPanel.tsx:8 imports @phosphor-icons/react/dist/ssr/Play, 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a568f4c74311fd2b82109a1aa2b5b58951bdbf17438b3c2fe4ee0bf5f2db2806"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/CamSettings.tsx:2 imports @phosphor-icons/react/dist/ssr/ArrowCounterClockwise, 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":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0354f0657546baedcdd9fcb4ca395d96d1fee6a1321c90fe5a3a440c4c0d62e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:2 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"763f040ad41945dc949eb3e257046f25da161a3a006d48f4cced37a8115ce9b1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:3 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"495e8f009327ef40cf868856320e7594fa82fccff2a12b301c41897fd180df3e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:4 imports @phosphor-icons/react/dist/ssr/ArrowUp, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6369dff7c48332d9185a71cd08333f28a74042056fa99a7203cf39a7cf2cae4c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:5 imports @phosphor-icons/react/dist/ssr/ArrowDown, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfe8aceb4315048602a30619161438c54621d66c1d34cb7750db43d4b497271"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:6 imports @phosphor-icons/react/dist/ssr/Eye, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"515233bf05460af5ee2230ef5356f851201d38bbd157d35434ecc34d92f8162c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:7 imports @phosphor-icons/react/dist/ssr/EyeSlash, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f44dcfc90a091ef866b0d790ec50f0f9992ed14caa6ba48c6e7b1a61477e575"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:8 imports @phosphor-icons/react/dist/ssr/Square, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed1450698dc56894516944a2a657f3d20cc64c65d556b1bd3b266ecaab3679b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:9 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969311155bd43da617d926a6b62bbd50afcbb8cf2491d650c0601f1fd78b6ed"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:10 imports @phosphor-icons/react/dist/ssr/Path, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1930a6b842bac0e32e51ca401cda15ab629bb7933b8a7d6ac6fce61df17d2f1c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/OperationList.tsx:11 imports @phosphor-icons/react/dist/ssr/SelectionBackground, 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcfd2e55c10fb35f42c7ba40df61dd02910dadd58e82d849c25e90640e9e659"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/ToolLibrary.tsx:2 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce93f22332af447a1ed39fd09f2970ef2b20f813949ba16e5ecea74662cfc06"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/ToolLibrary.tsx:3 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a602ebba48cf8f5b312a6e9f959fc9db3514658a0a0ebb6c1fefdb8e6c878f4c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/ToolLibrary.tsx:4 imports @phosphor-icons/react/dist/ssr/Wrench, 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":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfac1d5f79923c51670474517c68899e388e4084eece9748665ea5c8abe9b35c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/ToolLibrary.tsx:5 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"955691e5cb37d3ce98672a705e963f8e770030accb0dfbf35bb55c8793f08cd8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/cam/ToolLibrary.tsx:6 imports @phosphor-icons/react/dist/ssr/ArrowDown, 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":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11fc394b2849bdef2baaeed260b15bd8a02fb003e2f9a3c7a9e1dde9b7b5baa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/AddJointDialog.tsx:2 imports @phosphor-icons/react/dist/ssr/Anchor, 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":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f309117d6a4cfb3a966ea907fa977f78c0a5baeacdabc3eb8d73231a9cc6766c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/AddJointDialog.tsx:3 imports @phosphor-icons/react/dist/ssr/ArrowsClockwise, 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":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05178c02700d7165a39020d40918a00d5c2745ba21e2228f37a7376282a5936"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/AddJointDialog.tsx:4 imports @phosphor-icons/react/dist/ssr/ArrowUp, 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":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8949b63d5689a8ef2abfddef2e7d03156b0999072c6abf7d0caac1a1bfed9376"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/AddJointDialog.tsx:5 imports @phosphor-icons/react/dist/ssr/Spiral, 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":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"824931d3f1ace7ee9178945079180186fc0f950b33e5c6743b5e3c4c90f4acc3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/AddJointDialog.tsx:6 imports @phosphor-icons/react/dist/ssr/Globe, 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":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8dae26172a02545c342d9058b5271ed15fcd407dc19b2766eb662465dc4701"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/AddJointDialog.tsx:7 imports @phosphor-icons/react/dist/ssr/Check, 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":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fee901515bdb584a80c9e87edf26a8c2513b341b4834419d3fbd6d341171a5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/InsertInstanceDialog.tsx:2 imports @phosphor-icons/react/dist/ssr/Package, 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":"packages/app/src/components/dialogs/InsertInstanceDialog.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"969b6cac7709ceab837ac56ae84d46169ac92d5e2175612e3b59f7748ae23e54"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/dialogs/InsertInstanceDialog.tsx:3 imports @phosphor-icons/react/dist/ssr/Check, 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":"packages/app/src/components/dialogs/InsertInstanceDialog.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab16a1b89fbf14f4287b9fea15ac8abc9d98cf8828e653da2480f354243391ec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitAnalysisPanel.tsx:13 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d977b29f51cc1290e9aac7bda75cbc24a2e3134b82b78c888752f2e3c52359f1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitAnalysisPanel.tsx:14 imports @phosphor-icons/react/dist/ssr/Play, 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc0190bff1c5448a9bcfe7fde2d918ac58db263e00027407b99b4932437e79"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitAnalysisPanel.tsx:15 imports @phosphor-icons/react/dist/ssr/Warning, 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae33b470c66c102db750b2a5b3d72627a5039bc6a011e66d5df96135a61522d7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:15 imports @phosphor-icons/react/dist/ssr/Cursor, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9530499a3639f50c2acf2298faf2f151fdd21c4722e1b56ab1b216f60ca0ff06"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:16 imports @phosphor-icons/react/dist/ssr/ArrowsOutCardinal, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0216e6c67d669988ceb27fc608408d9651a4f3276bf14a1a4b289db6c5c50fda"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:17 imports @phosphor-icons/react/dist/ssr/Plugs, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"486a002fec0f4adec5b831928b281933198f9b7582f40679b2db36192ef52cb8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:18 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"78181d455b284cf002ed0a3dc094ed2a5620c908e0d662ebcd104242c6fc3d07"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:19 imports @phosphor-icons/react/dist/ssr/Cpu, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1cd539720ae8020db8beab43f3a5658ca29a3a017b86c7eb0e553b451b2dda"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:20 imports @phosphor-icons/react/dist/ssr/PencilSimple, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e30167274fb99fab0fd9fee9b13e7e591b272d8148f2103646b884a8bace48"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:21 imports @phosphor-icons/react/dist/ssr/Tag, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f80a081658aeeb9e57cbced0b6aa7211fbbb0fcfc9d384c1531590d3eb7c60b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:22 imports @phosphor-icons/react/dist/ssr/Path, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"29be946f73e3ef7c5b0a83223d6d21c28acfc060fb01f73aaec9024527051b37"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:23 imports @phosphor-icons/react/dist/ssr/MagnetStraight, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfd4a8c32de401c39866443b80dff16670b594c8c49e612197d46346a330cdd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:24 imports @phosphor-icons/react/dist/ssr/Angle, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4653c733c884bcfe464fb1c2e818b205c17cb50fe3a51e1d125f6af1401a990a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:25 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"827f8019cbba7fe78f7edeeb993b2b0f6f3e04e2402563e8315207a737db7e67"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:26 imports @phosphor-icons/react/dist/ssr/Ruler, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a16b8800510e0cc00cd74965cb4e563284ccb164649015ea987b0db884b249"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:27 imports @phosphor-icons/react/dist/ssr/ArrowSquareDown, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c981ad388e130a5f21f7ecc32954fe9e8ecd86d56825e22ad74363af333b5c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:28 imports @phosphor-icons/react/dist/ssr/Lightning, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54db40a54773c4cf923eb00719deb015e2fcf563c454b7615cb9de2ef085dca"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/CircuitTabTools.tsx:29 imports @phosphor-icons/react/dist/ssr/ChartLine, 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3456d9dc12219d62b0a84299a8d5b3de6e1cd890588ab861bb419912aef78d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/ElectronicsViewToggle.tsx:7 imports @phosphor-icons/react/dist/ssr/PencilSimple, 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":"packages/app/src/components/electronics/ElectronicsViewToggle.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"485800b3b9ddf0d7461443729b8133faf6149a49c608ae7ac77eb6ba9d31e2e9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/ElectronicsViewToggle.tsx:8 imports @phosphor-icons/react/dist/ssr/Cpu, 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":"packages/app/src/components/electronics/ElectronicsViewToggle.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b776a81f418b8acd9d361d30a4de697207c801ef8ded4c23a7d970ca7a89d7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/PcbGettingStarted.tsx:7 imports @phosphor-icons/react/dist/ssr/Upload, 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":"packages/app/src/components/electronics/PcbGettingStarted.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dba48e8c850146e8d993982d2867a360575ce58d88e3cd65ce8950603d3e817"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/electronics/PcbGettingStarted.tsx:8 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/electronics/PcbGettingStarted.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"974a815cec36758d35bceeccde5c9733a41af30a053791285f2aaeb760c855ed"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/embroidery/EmbroideryPanel.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f581da37df3f4c7df589a97511fa0978d0df346cad472e71a3b1a0eeb9de650"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/embroidery/EmbroideryPanel.tsx:3 imports @phosphor-icons/react/dist/ssr/Scissors, 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1d16b0b27655e2c42de2ad5c4625a460afff1d7db9673226777f69a99d1d2a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/embroidery/EmbroideryPanel.tsx:4 imports @phosphor-icons/react/dist/ssr/Palette, 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"053ef9d085f2af305c18297400a9959a4dbce70e58e2c9558bac6c1465fc15b1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/embroidery/EmbroideryPanel.tsx:5 imports @phosphor-icons/react/dist/ssr/Eye, 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bbaffd6d31dd11bf5ded73969e633e7b91b247d18ea94c02713f4c3e06e3a2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/embroidery/EmbroideryPanel.tsx:6 imports @phosphor-icons/react/dist/ssr/Export, 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"85efa1f747b94e1dd98daa2a64480a9834a1655ade8c9475aecf9a31b262f71d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/embroidery/EmbroideryPanel.tsx:7 imports @phosphor-icons/react/dist/ssr/TextT, 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d33d6ca518596a78be12ea832cc3020ca073c669ad2e9e062a5cc8b658bba6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/footer/DfmChip.tsx:1 imports @phosphor-icons/react/dist/ssr/Wrench, 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":"packages/app/src/components/footer/DfmChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cbaeccc114a4da97e98adf46f70c35fbc1fa71037871052cfc40c3df78749f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/footer/JobsChip.tsx:1 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/footer/JobsChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c01c6e83d30e478dccbeb70ad7570430dd5b772de8d4d32ca8d95edc139179b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/footer/RaytraceChip.tsx:1 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0669cc3818415e694929995392934027457280d118ce79793675d66784eca77e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/footer/RaytraceChip.tsx:2 imports @phosphor-icons/react/dist/ssr/Check, 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":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"783006fd1fefdc30a5c2017d079f47789443f6a62e85f9bd8a10354a36095703"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/CategorySection.tsx:6 imports @phosphor-icons/react/dist/ssr/CaretRight, 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":"packages/app/src/components/materials/CategorySection.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f053183d692cce815b191d3fac3f6a7b4b072c9f4ec82b1a4dff46188d05be45"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/CategorySection.tsx:7 imports @phosphor-icons/react/dist/ssr/CaretDown, 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":"packages/app/src/components/materials/CategorySection.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d6519e77f630193c7f9e2d9cdd01805ad11b333f2653dacf2141654669193e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/CategorySection.tsx:8 imports @phosphor-icons/react/dist/ssr/Star, 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":"packages/app/src/components/materials/CategorySection.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acd57ede4fa630d3cffbcb348f27e59f640b86fe103b378354a2a7eedd97719"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/InstanceMaterialSelector.tsx:7 imports @phosphor-icons/react/dist/ssr/MagnifyingGlass, 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":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf22766d7bbfad896b0ee9f7d88859dd8e440978d6bc83aca130681d31d1c75"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/InstanceMaterialSelector.tsx:8 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"021c558cec233ede2b05c0f409deb546653ed3327b04ed9274dcaf777d8acd93"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/InstanceMaterialSelector.tsx:9 imports @phosphor-icons/react/dist/ssr/Clock, 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":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac16906a34893d5d103f08dfad8cc22a99d0a613776285606294a50a0c0b367b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/InstanceMaterialSelector.tsx:10 imports @phosphor-icons/react/dist/ssr/Star, 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":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"235e708f82654ffa9087cc7417c1b89ca263fc309b489dfba1123bb81aa33025"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/MaterialSelector.tsx:7 imports @phosphor-icons/react/dist/ssr/MagnifyingGlass, 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":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6487cc7c147e007341b32c7ffbf04adfc9c1a7612e985897fba08f6bb640be"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/MaterialSelector.tsx:8 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6599c95226338c6ad7fe7a7ef943c331640434e6ec080dd06ffe1328660817"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/MaterialSelector.tsx:9 imports @phosphor-icons/react/dist/ssr/Clock, 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":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b356d422eb0922af4c9649f310580612c118da8cc22678e4a94fc284a2aa4e59"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/materials/MaterialSelector.tsx:10 imports @phosphor-icons/react/dist/ssr/Star, 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":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0c43c9339a8b4d53f9d9fbfd637a5abaedae88f07e8af4d081d5e0bef04a42"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/mobile/BottomSheet.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/mobile/BottomSheet.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4152f31052fac548e9cb457cab5e2888c22df51ea5a6fa7e8d0247e087ab9c24"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/mobile/MobileShell.tsx:2 imports @phosphor-icons/react/dist/ssr/List, 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":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde3f63e4219eaae46379e7930280c0efe2e4f23b60504ac18ecdc4289390036"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/mobile/MobileShell.tsx:3 imports @phosphor-icons/react/dist/ssr/TreeStructure, 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":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0844453528503fc9e66094d651e87c37557bec9a51ffbf0971a3342411fab1f8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/mobile/MobileShell.tsx:4 imports @phosphor-icons/react/dist/ssr/ArrowsOutCardinal, 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":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"60373e9e663b91738b8bfe1e58ee28d4ee214f933daa113e0dc0ce53ddf487dc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/mobile/MobileShell.tsx:5 imports @phosphor-icons/react/dist/ssr/ArrowCounterClockwise, 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":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ff27d73329564b27cbf56dcdcc8fa8a96c9e948a78b390bbf62f0c9f390f43"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/mobile/MobileShell.tsx:6 imports @phosphor-icons/react/dist/ssr/ArrowClockwise, 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":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7046d224c8bb4fb9e5b762ac71d780efa411112527e1cc3ab1e856114ea44ea5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/DfmOverlay.tsx:2 imports @phosphor-icons/react/dist/ssr/Warning, 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":"packages/app/src/components/print/DfmOverlay.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad4cc0c126543deb8d76b91dcd0b003bcfef89d359c2ec3c177c1aac4eda792"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/DfmOverlay.tsx:3 imports @phosphor-icons/react/dist/ssr/XCircle, 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":"packages/app/src/components/print/DfmOverlay.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"778d1e615c8fb76bcd6752971a7bedcc3ff1d8f6b2e07b7568905ff3c61c7ebc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/DfmOverlay.tsx:4 imports @phosphor-icons/react/dist/ssr/Info, 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":"packages/app/src/components/print/DfmOverlay.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8912ae3fc4f944af91b913a284f3b7f5e9693b6572a7a662be76f443f18a6682"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/DfmOverlay.tsx:5 imports @phosphor-icons/react/dist/ssr/CheckCircle, 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":"packages/app/src/components/print/DfmOverlay.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02dad6b4555239102a550f4cad03ff6993b2e5037c3ff69ca108e13a91398d9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrintPanel.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9059c659464c33ff94c54474a60f59fd584e3845b740ba242ad8df2ea0070d1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrintPanel.tsx:3 imports @phosphor-icons/react/dist/ssr/Printer, 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f6db3585b140417bf651a41182113dc4bec628f6e79bb50b4c333a1ac939ae"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrintPanel.tsx:4 imports @phosphor-icons/react/dist/ssr/Gear, 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a516c11999399233449455d9d29c12a64aef59cccc2ab5ab395b57e0f757fef4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrintPanel.tsx:5 imports @phosphor-icons/react/dist/ssr/Eye, 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"66566342ab504ed9e85f60315dadf0e27f47f41b9d5d3ad8577d40a28e555b5e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrintPanel.tsx:6 imports @phosphor-icons/react/dist/ssr/Export, 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf5ced891dede4dfd20afc33d1e0ea2ffb5f550783695290157d96ca132d0cc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrintPanel.tsx:7 imports @phosphor-icons/react/dist/ssr/Spinner, 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56a675fe41ccf93c8c9d3ca6e4649cd0793262e6cb6dd130f0fd685236369e5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrinterSelect.tsx:2 imports @phosphor-icons/react/dist/ssr/MagnifyingGlass, 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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea97b2e5e92a8f30b9fcd22aad8073612a0f6dc82841776cb6dc52f6f9bf57d7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrinterSelect.tsx:3 imports @phosphor-icons/react/dist/ssr/Spinner, 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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e8a23c95084ab44afc37e5f6d49db52dab42962519dd0e58033111c1091175"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrinterSelect.tsx:4 imports @phosphor-icons/react/dist/ssr/WifiHigh, 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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c94a9304f23d2856572e1524d8ad011392aa158d61c7917d97e31d2090defd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrinterSelect.tsx:5 imports @phosphor-icons/react/dist/ssr/WifiSlash, 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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"543bedc1de290dd2b8d47421e913956eeb35f9926788b2aaaba9f55d2f0b76ca"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrinterStatus.tsx:1 imports @phosphor-icons/react/dist/ssr/Thermometer, 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":"packages/app/src/components/print/PrinterStatus.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac8b6b12e5398439801dc52e498cafc7681799deb41ee95b1d0f397fdec3b96"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrinterStatus.tsx:2 imports @phosphor-icons/react/dist/ssr/Clock, 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":"packages/app/src/components/print/PrinterStatus.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7ceea5257674113a88ef063cb876d626a9af2df3bb8a80e52cfd3957d687ed"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/print/PrinterStatus.tsx:3 imports @phosphor-icons/react/dist/ssr/Stack, 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":"packages/app/src/components/print/PrinterStatus.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11ffdbc202a8c9ebd836264fbeadc106881773a91945bed3527035a38560d39"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/tree/InlineMaterial.tsx:3 imports @phosphor-icons/react/dist/ssr/MagnifyingGlass, 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":"packages/app/src/components/tree/InlineMaterial.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"89df3a9e14bae0423a49ec721dc4ede31f974fee31deb708b591c69fae52d892"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/tree/InlineTransform.tsx:2 imports @phosphor-icons/react/dist/ssr/CaretRight, 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":"packages/app/src/components/tree/InlineTransform.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd02834a741fc0aeabf719f276861fd1b13c06899838be391d4655fbf85f545"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/tree/InlineTransform.tsx:3 imports @phosphor-icons/react/dist/ssr/CaretDown, 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":"packages/app/src/components/tree/InlineTransform.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f20170f3259cf86b1d4f3f5d24625173c6e0a4be5b0c25ce3461137c48bfe59"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/dialog.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/ui/dialog.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"12da2cc3890b6bc4d68d690f3c8c50f891a2545a50136a98ddfe8288e8fa10cd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/expression-input.tsx:2 imports @phosphor-icons/react/dist/ssr/Link, 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":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1683fb3c79c065532a9c6fb2637f2ec0ba560f2016d341dd0d08e65530cce200"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/expression-input.tsx:3 imports @phosphor-icons/react/dist/ssr/LinkBreak, 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":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3f4c7e147d578f6b915a0f4488ba7a8762e58626e69c62c693fe7b892c26c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/AIProgressCard.tsx:2 imports @phosphor-icons/react/dist/ssr/SpinnerGap, 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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd46fd7d0eee608e5d9524672904dcdc7cd71d8fa657f815a719a502693e97f1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/AIProgressCard.tsx:3 imports @phosphor-icons/react/dist/ssr/CheckCircle, 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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f12297906e0bedd848b66f7a94a0181eb4d2f58cbcc92fd0e3eddc4203ac42"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/AIProgressCard.tsx:4 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af9ca990662e7342b20ca39c7196927fdbb1cff7b3a47605377b2d0ba771f4c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/AIProgressCard.tsx:5 imports @phosphor-icons/react/dist/ssr/XCircle, 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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74973fa54e5fcb1688e6538f39eda5cc395fc3e1b5e39308d9d8eb1887c6732"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/AIProgressCard.tsx:6 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3906bb4c12615ae2f05fe7387913c7ea1ab7c0e9d64f851e50df6b0baaba7f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/ActionResultCard.tsx:2 imports @phosphor-icons/react/dist/ssr/CheckCircle, 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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b7e1a53ead8abe37b6e8bd4f5cd7491e64ba9d8e74e553dd0dec0bbae97f3b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/ActionResultCard.tsx:3 imports @phosphor-icons/react/dist/ssr/XCircle, 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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aeae32e6f65ec74083cf4f68415980bfbc5fc655da949fb21a31647086a207"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/ActionResultCard.tsx:4 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1b2e45f4e5739794f332a1d2ec2726ce461fbb3b33815fedfe639068c91883"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/DecisionCard.tsx:2 imports @phosphor-icons/react/dist/ssr/Question, 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":"packages/app/src/components/ui/notifications/DecisionCard.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fad0d071124ef8abdc7074887525cfed30b4e75c2165c87ed004f2f43a39f5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/Toast.tsx:2 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/ui/notifications/Toast.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b25074926f57a202b5a6675f4b26efece9ba8720fdf9d4e3a32cbf61a43814"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/Toast.tsx:3 imports @phosphor-icons/react/dist/ssr/CheckCircle, 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":"packages/app/src/components/ui/notifications/Toast.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d0d11a5c802f177b72f020bbde7b80a6fcd74d3dcca6590c0b87d854f575f2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/Toast.tsx:4 imports @phosphor-icons/react/dist/ssr/XCircle, 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":"packages/app/src/components/ui/notifications/Toast.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a6cbb94666fe8003d8f0ac808c08832a5517f32c5a26b5715b5d3ad918cda0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/Toast.tsx:5 imports @phosphor-icons/react/dist/ssr/Info, 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":"packages/app/src/components/ui/notifications/Toast.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c67584e9c52680047826c3694ca0d4b601031ac365e5d267fddfd79ee264c30"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/Toast.tsx:6 imports @phosphor-icons/react/dist/ssr/Warning, 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":"packages/app/src/components/ui/notifications/Toast.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a943be18f1d37ae609044073b450262e1d8d91dde1ef19e5d8244d90f47444b9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/WarningCard.tsx:2 imports @phosphor-icons/react/dist/ssr/Warning, 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":"packages/app/src/components/ui/notifications/WarningCard.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f44224ede45f1e661edf96fc56db416f7c7436293b5ad045a8b7d1f79455c0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/WarningCard.tsx:3 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/components/ui/notifications/WarningCard.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"852fc32eb1b93554b6143651600d00cb5fb64218600cf9bfa6292e1699fc1d29"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/notifications/WarningCard.tsx:4 imports @phosphor-icons/react/dist/ssr/ArrowSquareOut, 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":"packages/app/src/components/ui/notifications/WarningCard.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f3864a0d073d498c99cc51448217db4899591e56cb1f55bae7ae6f6cdcab4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/scrub-input.tsx:2 imports @phosphor-icons/react/dist/ssr/Minus, 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":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1ec588826367a605287521bc0d85fec360cb661411c22d52e9ba0b862fd91e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/scrub-input.tsx:3 imports @phosphor-icons/react/dist/ssr/Plus, 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":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"726aaee1932216ca36fb71f9b9814439ecf86d92ba3fe0f88957be82e86e91f1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/components/ui/toolbar.tsx:2 imports @phosphor-icons/react/dist/ssr/DotsThree, 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":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb41860305dcbfdb3b5e2170429c071485d3033e2aeffc074461eb4c1a6012cc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:2 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"153f2aa17448ea32fc373685e1c0ebd3ad03283a5b52fe11acc6cf0fa95120ba"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:3 imports @phosphor-icons/react/dist/ssr/Cylinder, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09c693b3a1b39a2510d49a18e71ffd29a813565e866dada16ba6072a956676c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:4 imports @phosphor-icons/react/dist/ssr/Globe, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"653311dcb3faa3d00f8b518f3298ea0522ce05f9659c5c9dce4ea07eda666b7a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:5 imports @phosphor-icons/react/dist/ssr/Unite, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd507a62d0bb991707b8e5658c87ab5b87ff65d42720afeb3b703201f9ac935f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:6 imports @phosphor-icons/react/dist/ssr/Subtract, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fe4a0b0e0eef5729f704f7888f6f8098dda742bf53d9be3025a831bd55acf1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:7 imports @phosphor-icons/react/dist/ssr/Intersect, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af2c36540657c4bde5f9766f0e393efe25f8451a778a6e9f6cbfa5ebf5a1a2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:8 imports @phosphor-icons/react/dist/ssr/ArrowsOutCardinal, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7700d3abbbd326d2ef1c55ff45adbdedcc3d32e1e1b37f4934565d867cd3ae2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:9 imports @phosphor-icons/react/dist/ssr/ArrowsClockwise, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6316b4f5e1b756f542cb5d08e04734a3c763612129f2e5eb70becfcd4b5663"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:10 imports @phosphor-icons/react/dist/ssr/ArrowsOut, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1fbc256f0fe4e005f4280d3147944e4b2b5ad87c8f28c395362672ef1d784a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:11 imports @phosphor-icons/react/dist/ssr/PencilSimple, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2845f2686959e6863f9c2c7c0092b79c64b0519ab90c1c9669e65be0bd88d46"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:12 imports @phosphor-icons/react/dist/ssr/Package, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f9941fc07b517b8de6e6dacb7fb8e219a52f411133672ed42a916a8f210034"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:13 imports @phosphor-icons/react/dist/ssr/PlusSquare, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc995bfa3e860e9d7576ae66e8087c775d0942cc190191b1e5c1c14d6ea2bb4b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:14 imports @phosphor-icons/react/dist/ssr/LinkSimple, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"20830e52ed4493391e7b819cde626bd98aa9c4f8ef28e8ac454567b7202d3cfc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:15 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a100357a655dfb54630a21fdd3e3050201b2f15052fde63de1a13f8766a395a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:16 imports @phosphor-icons/react/dist/ssr/Blueprint, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a909fb1287c605d3d2b4b174f8c4d7cfc7e4e52c52dd23f6583522ae8bb951bd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:17 imports @phosphor-icons/react/dist/ssr/Download, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94e9a261d1fa8865395d1a78b21999772d45bdc10379c58f2664649f69c5695"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:18 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"676c8769b512b8f607323d48172500609717cee949606db3b173e08e638f5703"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:19 imports @phosphor-icons/react/dist/ssr/Octagon, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc20baf953eb458537fd4908a36149fca0bdaf09dd40779b580ad29108ba6d3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:20 imports @phosphor-icons/react/dist/ssr/CubeTransparent, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9225b63cc0ff300a1b6b96ac93ce38a23a4cb156fcf475e17284b1d9575fdc77"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:21 imports @phosphor-icons/react/dist/ssr/DotsThree, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5fb5f67d1a063846db36506b27714af4864aeb0a1d102c99afc61939902c41"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:22 imports @phosphor-icons/react/dist/ssr/ArrowsHorizontal, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3504ec538b98fcb58a0db16080cf5fc381a68ae22eb13795ff39757798c00c0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:23 imports @phosphor-icons/react/dist/ssr/Play, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b368dffd8335f1b9f6f2c0c4d55afcf4617c85f2861ce149a3ea88102471c12"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:24 imports @phosphor-icons/react/dist/ssr/Pause, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"843c5b9a94318aba3736e7967444f7ab47469f38743bb745dfa0752d2745279c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:25 imports @phosphor-icons/react/dist/ssr/Stop, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b54cacb5ce82bc1493a943956e77239592c04b8cbf82c5b8553e84cd35df168"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:26 imports @phosphor-icons/react/dist/ssr/FastForward, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a73373e4c9307e73821a12ce683b3901ad2e81961e52f273396e7e158f6ce69"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:27 imports @phosphor-icons/react/dist/ssr/Printer, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"374d3776d44026ef80a00a1a7ba6eebac465ef585abd4b8870001d5e7914484d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:28 imports @phosphor-icons/react/dist/ssr/Export, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66d097704f485add505b8c5256f94c9386acbc46b3b5b39eec527d473589be6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:29 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab7821bdfc42b497734e26411112c2ddc1a61b430a3bbf73262b296dc2e3c8e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:30 imports @phosphor-icons/react/dist/ssr/Path, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cc30f8b474ee7edf9ea80c2d82ae7015a25197e89b3f756b36b9cc60a15772"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:31 imports @phosphor-icons/react/dist/ssr/Circuitry, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2ecdb86da3966f2c9018f1d6b95fdb67016de3a8f525d8866d93ba62d41853"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:32 imports @phosphor-icons/react/dist/ssr/Gauge, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba51366517a73b146da2a62298c65799292b387a37acb203968c6af6d06893b2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:33 imports @phosphor-icons/react/dist/ssr/Scissors, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0359fb3918d7f2bc773da634f9b14b2c0773b783c843e92fed9c3c1d6d26c591"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:34 imports @phosphor-icons/react/dist/ssr/TextT, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea5821dd64ffcaed0b4039e706886952229b30075f072b54be89e0de0ace62a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:35 imports @phosphor-icons/react/dist/ssr/ArrowUp, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8859fb39f151d159d3aef524fe959db921a0e23ae8cbc5c389a8b159d31e08"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:36 imports @phosphor-icons/react/dist/ssr/Spiral, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2edb5fc7ece77ae1fcaf320657ca038325ce527689e0f9a612ea9fe6fe9879"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:37 imports @phosphor-icons/react/dist/ssr/Stack, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d4e7fe5c8e525c0a62bdb5202a345a6b90a22510c9dee3d80dbb7892c8b2c9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:38 imports @phosphor-icons/react/dist/ssr/LineSegment, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"314c5e000d2940adadf4b51076eb41bf562bf2753d0e709ba0c5227c4029b2fc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:39 imports @phosphor-icons/react/dist/ssr/Rectangle, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"99863a6172486124cf8a818f988d912a3b2ca5209476938d91aae95787836c15"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:40 imports @phosphor-icons/react/dist/ssr/ArrowsVertical, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc4fc968cc5f9583c98cc40480bffb8edb081b33a2d50ceaba46e1f82ffec0d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:41 imports @phosphor-icons/react/dist/ssr/Ruler, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d257bec7ca0944a4d4960f67e01e3fe0d097edfcea061c70f32e200a232be9bf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:42 imports @phosphor-icons/react/dist/ssr/GitBranch, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a11723c14dbbd9f1851c708903283b1fbba89c49f842b777c59a92851a43f6d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:43 imports @phosphor-icons/react/dist/ssr/Equals, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8b9231008f8174a934a4c159bd2221b6d0ac52b65a7eaf8a4965a362a9846d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:44 imports @phosphor-icons/react/dist/ssr/GridFour, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f858f191f2b50e2d1500c1b9a130fecbea2c0cb7cc02edbae6fd552a056b543"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/hooks/useToolDefinitions.tsx:45 imports @phosphor-icons/react/dist/ssr/Crosshair, 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ecd892f23de77f9ffea8337d1230fb7c4a50fa070172ddbd57637a0e6e6036"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/app/src/lib/bootstrap.ts:144 reaches into another package with a relative path (../../../kernel-wasm/vcad_kernel_wasm_bg.wasm) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/bootstrap.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b308938fe9a52c41109bb80e1e8f806e94c958a10c0d8d01842fad78ca22c4cc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:2 imports @phosphor-icons/react/dist/ssr/Cube, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6a9690ea33ba70928fb32b3ed224a1bc2aa1985134c346ee1c07307fac60fa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:3 imports @phosphor-icons/react/dist/ssr/Cylinder, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c35dd1b2bf07271d4fc903041b3190d11adca82303b80ba3cd6e77087be47f4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:4 imports @phosphor-icons/react/dist/ssr/Globe, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"132dc30d23a70bea3ce0a5cb3f8185c9bf6fa30d511365ed0328a9ffb48f0c89"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:5 imports @phosphor-icons/react/dist/ssr/Unite, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7854c6c355c318c2dbbcdc06818afccc5ce0b07d470cc44f3bd684a84669adea"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:6 imports @phosphor-icons/react/dist/ssr/Subtract, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"84989641a41e6411bf70c28002a31d65c9b5f61c4d22cdeda803044378f9decd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:7 imports @phosphor-icons/react/dist/ssr/Intersect, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0366af9a52e1b9abdb77534b5a97b1a1fb8d16bc5390d38a7c55a1b1e0a9ea5a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:8 imports @phosphor-icons/react/dist/ssr/ArrowsOutCardinal, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"31872a900bbc4f2140dc4ed26f1182fb26dc2be27e54c710837fd8672b150301"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:9 imports @phosphor-icons/react/dist/ssr/ArrowClockwise, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"05996f7d900f184daa44a7a6e217d4cfd0ceffcff1266a0392ceafecee07edf3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:10 imports @phosphor-icons/react/dist/ssr/ArrowCounterClockwise, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e768247860584577a7efd599bdc4fd6256c3fd7ba96f52677b95111c325dc8c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:11 imports @phosphor-icons/react/dist/ssr/ArrowsOut, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad70e6a14771695187d4f5f36ff596a97ca6597bbf03d9931e8fbe91a389946"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:12 imports @phosphor-icons/react/dist/ssr/ArrowsHorizontal, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ddd6c2e9c8ea9ba24dfddcd60ac9daa13d7ceb20d5f1cb756919d47c62f044"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:13 imports @phosphor-icons/react/dist/ssr/ArrowUp, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"304bcd7cc99088ca7f68c4a2bd4bf3c767d11053b955c5ccf4aa011e41534f48"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:14 imports @phosphor-icons/react/dist/ssr/ArrowRight, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd45ccd7e4f95ddf1ca2b1f77cf036dba9e426ee09e801823e7728fde7e6732d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:15 imports @phosphor-icons/react/dist/ssr/Trash, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"83562cbf7d40bc8dc371adb35b96bb388ad135f0637211170d62e9fc3672dbf4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:16 imports @phosphor-icons/react/dist/ssr/Copy, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae37d596b7fda1b9c6531fb592cbb8542d5268a13c5195914875d9d5fd83690"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:17 imports @phosphor-icons/react/dist/ssr/ClipboardText, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e421b0384471b9096af62090a4358597487cb35f292f3ad6b9a8375f90aea7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:18 imports @phosphor-icons/react/dist/ssr/Selection, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"166ee03c8792fbe3beedb4d7a61a444642bc36d1b16d467ee08a7f66e4ad3cfc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:19 imports @phosphor-icons/react/dist/ssr/X, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c14aa8274931368876d03c3c76edf742023f575cc553ee333825a069412237e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:20 imports @phosphor-icons/react/dist/ssr/CubeTransparent, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"541a06bf11e65e18ca2f9fbb6dc1a58a5f13e5b33862723c8d168646f06ffb61"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:21 imports @phosphor-icons/react/dist/ssr/GridFour, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f12ad30a70fafb75583caf98a7aaba99a2e366ad8f4f2a6ed1d3e64004c78f7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:22 imports @phosphor-icons/react/dist/ssr/SidebarSimple, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1530ffb27ae98a70ab34df6033974a525460d80d247a3b3a9c414c473d71198"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:23 imports @phosphor-icons/react/dist/ssr/ChatDots, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"847af1f99e6109d82f19c365464f29296810c8af84d881436588076b6d81b5d9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:24 imports @phosphor-icons/react/dist/ssr/Terminal, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70a945c79f908eedeb3bdbd9107538f52b9c6d10160081966b2b648cfafa8ad"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:25 imports @phosphor-icons/react/dist/ssr/Sun, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd3335f307d907418286982397ed58587589a1ba42793a25ee0f73f08108252"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:26 imports @phosphor-icons/react/dist/ssr/Command, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c22552d98601e59ad782032044470300648af692d0f1a7a3612e71885204dc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:27 imports @phosphor-icons/react/dist/ssr/Pencil, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c44b69c0180ab12cc9dfae6ac6657255f80a5c6a6a7b5860068cd5b2b6b7aa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:28 imports @phosphor-icons/react/dist/ssr/Printer, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafaa117a621c2cf477d7225e0943b738575ca1595c48ab5e213ca91bed45fa0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:29 imports @phosphor-icons/react/dist/ssr/Wrench, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"159deafe900489188f86c24e07bc9bdf35acf36562bfa1aa7a252ba81dab3028"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:30 imports @phosphor-icons/react/dist/ssr/FilePlus, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8361fd62fc7386ae8e9eb39045cbbbb33495ce3f9038a34b17e193b8a0408c55"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:31 imports @phosphor-icons/react/dist/ssr/FolderOpen, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81d713a7bca3368b3b8c60ba41faee2246748c036cfa4db4ba8f593004b3890"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:32 imports @phosphor-icons/react/dist/ssr/FloppyDisk, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eeb9ee00e48149ac9ab7ca968776d60d3cae9871cb0eba8e46accc397ac71b9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:33 imports @phosphor-icons/react/dist/ssr/Export, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0ce166f3b88735c927fcaeda7c4d35be6c41cd47ae88eaf0ac6dbb47d03e71"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:34 imports @phosphor-icons/react/dist/ssr/CloudArrowDown, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29cbfda3d1e8915964d94e841463826fa475602dfe24a6964a7a068b9c731c4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:35 imports @phosphor-icons/react/dist/ssr/Info, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a021ebe8a3f2d64316c554a0bf6ca5211d06b363a63730c994ba74a0a4f2204"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:36 imports @phosphor-icons/react/dist/ssr/Rocket, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8bf5c7e2e677bb28eb124188703349fdc4713a598450f60651520dc0d1aff4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:37 imports @phosphor-icons/react/dist/ssr/BookOpen, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fa9760d597077f14c67f9f2d45f1b64a10fff661c626df05fc510562092f1f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:38 imports @phosphor-icons/react/dist/ssr/GithubLogo, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a583d148d49423153f187bf5ae84f542f3d8342a67f8addf51ee778314e77787"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:39 imports @phosphor-icons/react/dist/ssr/DiscordLogo, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a73f23d5be7962e2c4285194588182d7f8758932275396a64120cfdffac9045"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:40 imports @phosphor-icons/react/dist/ssr/Package, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"36539345eadd7ca4e8a29b546924ce1a4d1af91072b754898b793c1166fc072e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:41 imports @phosphor-icons/react/dist/ssr/PlusSquare, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2024f2b9c1b9383576d00c8d0d1417f927096c5539dd2673bffc5df4cf569333"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:42 imports @phosphor-icons/react/dist/ssr/Anchor, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f01a9923a84fc64097efc6f4012a4dc3d3897338c18bff0b7c812f8c5965ce"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:43 imports @phosphor-icons/react/dist/ssr/Circle, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"edda5a3ac434365c0080d34a98c72929e446bf5cca3c0fc3351803b5fc3b7cac"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:44 imports @phosphor-icons/react/dist/ssr/Octagon, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d560da2f0339fdd835e475d1a8341eba10df06123b06888950751f02a2398a87"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:45 imports @phosphor-icons/react/dist/ssr/DotsThree, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f0b63f99fe179a931bed2fc87c3dee1495089ba61864736fe357f924201664"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:46 imports @phosphor-icons/react/dist/ssr/CircleNotch, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"505dbbd0afaaba4299c8d41cf04b5ca889e26c4d473e1c422bd1f5543a99eeaf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:47 imports @phosphor-icons/react/dist/ssr/Scissors, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7937c52ea54632ef767764c45117765ddadbcad99c3c367eb305108c64a4b3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:48 imports @phosphor-icons/react/dist/ssr/Circuitry, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aede4524a8cec3e455a0d0d8dadfa69f4148c4751de5af9998dd1efd8cc5f0f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/app/src/lib/command-icons.ts:49 imports @phosphor-icons/react/dist/ssr/Sparkle, 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":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9165141ed85df56425929aa421f5cbc49f686de543466b75e5d14e6deac0b3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 163, cognitive 197): handleKeyDown has cyclomatic complexity 163 and cognitive complexity 197; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/app/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b07b1e41bce1e3394baaaca3cdccd6cf5ace89bd226e7570abea2f23d12b80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeNets (cyclomatic 145, cognitive 233): routeNets has cyclomatic complexity 145 and cognitive complexity 233; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"550f8f74dc808f3de239865c83fc3816d54c7771f7c3f5b168fece6dab109bad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addMotorWinding (cyclomatic 129, cognitive 231): addMotorWinding has cyclomatic complexity 129 and cognitive complexity 231; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11593}}}],"partialFingerprints":{"codehealthFindingId/v1":"567c4948eee20fbf2b0a48aa02f2ebdd023f545c38db17ba3e35771a29a7a250"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderView (cyclomatic 107, cognitive 115): renderView has cyclomatic complexity 107 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacf593ec6e56bae9e59c7d937d8a921fa9bfa1c636578541baf3e53d2085aff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixDrc (cyclomatic 85, cognitive 166): fixDrc has cyclomatic complexity 85 and cognitive complexity 166; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":15028}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7527420c4bed2b24ff7aca8b24cd6c3d2f92de0f8ae29a3340f4e621ff90858"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateOp (cyclomatic 81, cognitive 56): evaluateOp has cyclomatic complexity 81 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"511a4e93795dceff66523eefc68c8e0da9abf98e37995ec26a2516692748d698"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateSyntheticDescription (cyclomatic 76, cognitive 47): generateSyntheticDescription has cyclomatic complexity 76 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 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":"packages/training/src/annotate.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce3d49641960d8640ed9f50fcf6faa3a764cbd22c54e834c7a87b29f02becfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 75, cognitive 65): (anonymous) has cyclomatic complexity 75 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3dcadefd1748f3c74e251015efe0e37386e94dadc36397ff203110e4f4d289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quoteManufacturing (cyclomatic 66, cognitive 87): quoteManufacturing has cyclomatic complexity 66 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/order.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb9e0b484b07fff28022078f202f5454d0dad73a9e7a310d0b4ff3ff852dcaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutLint (cyclomatic 65, cognitive 113): layoutLint has cyclomatic complexity 65 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a8fb268b25145f189c808bbcaa1cb3aed94e6fa3a3e9b35ae853b0acb90ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addCoil (cyclomatic 62, cognitive 91): addCoil has cyclomatic complexity 62 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7744}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c670233c97946f01d03712f3b3941a1b59af6aec81918905ba3e18e5a165e2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportVideo (cyclomatic 62, cognitive 86): exportVideo has cyclomatic complexity 62 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd5b64e6c9ee1d8387df4b1b5e2edf000dd2054a7302bd61e9398e1835fe4a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleModernRequest (cyclomatic 61, cognitive 72): handleModernRequest has cyclomatic complexity 61 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1e260513e1a606328251e1bfcf1f8e8bca2ff18834dc806e7130ddbd606b9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 61, cognitive 61): check has cyclomatic complexity 61 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9ea22c46c2e091c9dce60960aef9ac516d32392bfd9a42c2a2fd09db94c482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function placeComponents (cyclomatic 60, cognitive 78): placeComponents has cyclomatic complexity 60 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc8429975bdd5e6c9e34e77023098f11c6a8a5098904993e5c7868b7d5602c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkClearance (cyclomatic 54, cognitive 57): checkClearance has cyclomatic complexity 54 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3ba7726b9caaab54ff9db0db887a83f7af648cda62b005fcfcc96ee797226d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calcMotor (cyclomatic 53, cognitive 89): calcMotor has cyclomatic complexity 53 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12513}}}],"partialFingerprints":{"codehealthFindingId/v1":"710ff1acf50050c0179fc05932773579044301f97065cdb395812906281b7b4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 53, cognitive 70): (anonymous) has cyclomatic complexity 53 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/server.ts"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"374e798ad41041963c7c1858eae7437ba4f408560095c50a40a95ebf3d7dd90e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordSimulation (cyclomatic 53, cognitive 70): recordSimulation has cyclomatic complexity 53 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d4adb774ef46d584864f3f8f76a92651db257bb11cde669cbb69158a09ab89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGeometryOpcode (cyclomatic 53, cognitive 67): parseGeometryOpcode has cyclomatic complexity 53 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/ir/src/index.ts"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c887d81936849c331437d425028331da31e8a6de2b788951e02914edd819c4c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sizeImpedance (cyclomatic 51, cognitive 54): sizeImpedance has cyclomatic complexity 51 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9592c9403cdb2ac5cf533967ce374abc3fcc75f46682c7a6334dc399a7a3b544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ViewportContent (cyclomatic 47, cognitive 35): ViewportContent has cyclomatic complexity 47 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 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca86d1a19727139688801b9f9ee58c03befa389e63d67e2c5b337924383534c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyReceipt (cyclomatic 46, cognitive 51): verifyReceipt has cyclomatic complexity 46 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b97c9a1b93e831b40b915c97780525e76873d6346351132ba7da367e3ba791d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 45, cognitive 77): (anonymous) has cyclomatic complexity 45 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1745cf73561b50656b6773b23cc9d6e0d944e68d06048186da25ec23341e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SceneMesh (cyclomatic 44, cognitive 33): SceneMesh has cyclomatic complexity 44 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f9e2bdd8c0b72c1f5e0fafaefe330294d0e191e3d3e7480fd3c6f0376cb801"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildReceipt (cyclomatic 43, cognitive 60): buildReceipt has cyclomatic complexity 43 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14504}}}],"partialFingerprints":{"codehealthFindingId/v1":"833b499812a1db7390b91c291435a08303cadde84ad93b0d798f501ecd7bc9ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveNets (cyclomatic 42, cognitive 67): deriveNets has cyclomatic complexity 42 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c884cfce344123311e4b58a5bfe839f1d73715cca34e1af59646b3fad80cd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addViaArray (cyclomatic 42, cognitive 57): addViaArray has cyclomatic complexity 42 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2812cca33cab6995aacfad1f9e2a67244f927bfa1e579843dcc33a181f929bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLine (cyclomatic 41, cognitive 66): buildLine has cyclomatic complexity 41 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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5610f21859b929416abaa99c400bde079e91211d845d43a83967b6a5ede1ff4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 56): (anonymous) has cyclomatic complexity 41 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/app/src/components/xr/XRGestures.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28eafc43d35ef0042647dee4ddb4f1d118ac92c058ee927e10198177856819e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCommandRegistry (cyclomatic 41, cognitive 40): createCommandRegistry has cyclomatic complexity 41 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/core/src/commands.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"908aff863f424ddd00fbbd3448f6bada6d62f7e5bcc007990c883a08899441fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRustSourceContentWithInference (cyclomatic 40, cognitive 106): parseRustSourceContentWithInference has cyclomatic complexity 40 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f08353f50a2be29f5cfe7266ac948a42f2c30713c2489d7668a0f91abcdd605"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 40, cognitive 66): (anonymous) has cyclomatic complexity 40 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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"464afe685c5f8f75cea55942792aa374de4d89d7144a4c6cde4d6cb5d273f268"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatSceneSettings (cyclomatic 40, cognitive 64): formatSceneSettings has cyclomatic complexity 40 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/ir/src/index.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c2948167b70c08d1bbd6b5c9eaf2cb6eca455d803c1ea49006f88caf42671e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeIntegrity (cyclomatic 40, cognitive 50): computeIntegrity has cyclomatic complexity 40 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 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":"packages/mcp/src/tools/integrity.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b6a48ba44ff6265b51a8ca33b1990e80347f8ff2c924fe63ce44b18cbda426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function failureReason (cyclomatic 39, cognitive 53): failureReason has cyclomatic complexity 39 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":"mecheval/harness/src/pass_k.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe97f4d494647a8c8643b2f83fd0d54019f0d34e07cf74390915693e0b785fc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMutationViaEngine (cyclomatic 39, cognitive 46): runMutationViaEngine has cyclomatic complexity 39 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"8802b4343cc01e87eaba4061411c54d9d2a2945dda8eec725a38335d7276deef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PropertyPanel (cyclomatic 39, cognitive 37): PropertyPanel 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4aa7457b8c7d4451546c515e5091e3aaa0c7659cad0aad6cd46c3b11e0c1c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TreeNode (cyclomatic 38, cognitive 32): TreeNode has cyclomatic complexity 38 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"3281eb8f8936fa5b8d82cef9deb2570fce0ab3f188ce36b7d07ac987ae0c75a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeInterferenceAudit (cyclomatic 37, cognitive 74): computeInterferenceAudit has cyclomatic complexity 37 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"185dc9a9f8546097a02ff40e8df8e044d43e0b40f3bcda159f3f829b1ea1715a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function carryElectronics (cyclomatic 37, cognitive 49): carryElectronics has cyclomatic complexity 37 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 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":"packages/mcp/src/tools/carry-electronics.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4b434cb5873504a85edf6f71c334d16db83056d33854f5bf812bb6d79ad37a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setParameters (cyclomatic 36, cognitive 46): setParameters has cyclomatic complexity 36 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":"packages/mcp/src/tools/parameters.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e519512fc696287bce18a067f05572ba316b4dc40c09e327c90d6f3d7db64c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DrawingView (cyclomatic 36, cognitive 32): DrawingView has cyclomatic complexity 36 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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc38f031147ac1d66582d96fbb7c621cad3f2921e498cedbc273d3f545117037"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromVCode (cyclomatic 36, cognitive 22): fromVCode has cyclomatic complexity 36 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":"packages/ir/src/index.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6c05bf351401d23bb51acdb4028579586ab36192f5011520bac9f990c22eca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toVCode (cyclomatic 35, cognitive 65): toVCode has cyclomatic complexity 35 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/ir/src/index.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c0c1797851119e29775df76e5f83ecadf0a094214469b0ef4d45b758ca71b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elaborate (cyclomatic 35, cognitive 45): elaborate has cyclomatic complexity 35 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ff9f8453474ee26825428449c938ce59f8f232b8fec21475816ee03ac376e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setPlacement (cyclomatic 33, cognitive 47): setPlacement has cyclomatic complexity 33 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9761}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fee80c044d3d29dfcec6e1900f65a68c59194098e3f13aa0df3594f62e93003"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addStitch (cyclomatic 33, cognitive 43): addStitch has cyclomatic complexity 33 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee959b916add9aa37c55b3d2453510815fe92e72c4762d04163cdcd35678503"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addZone (cyclomatic 33, cognitive 40): addZone has cyclomatic complexity 33 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9951}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a908bbd6c12a94cccc33e7c5e1cc5aa568019774a7deea8593570a3a1ab3c40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleToolResult (cyclomatic 33, cognitive 39): handleToolResult has cyclomatic complexity 33 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f60623f1d8d617f658579a3a66094bca71755dcfe50422362f956c2af970780"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function suggestNextActions (cyclomatic 33, cognitive 38): suggestNextActions has cyclomatic complexity 33 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9871d404791c29f1c5092c9b7e197fc78b44a61146fb784ed5aa3f5f92234d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSequenceGlb (cyclomatic 32, cognitive 66): buildSequenceGlb has cyclomatic complexity 32 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6cebdbbb0e5b1eafd9239db3f3f465c6ca799e1daba49932421943c55df3a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ScrubInput (cyclomatic 32, cognitive 25): ScrubInput has cyclomatic complexity 32 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":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7007dabbae5be8bba6f8e4363c7f576d96771b44adc02be60acccd38eb7c19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchMechCatalog (cyclomatic 31, cognitive 56): searchMechCatalog has cyclomatic complexity 31 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/mech-parts.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"530af709cf85141834368aab1cabbbaf026c3fd72662d996fb2a9c8222516b67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stitchTJunctions (cyclomatic 31, cognitive 49): stitchTJunctions has cyclomatic complexity 31 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 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":"packages/app/public/launch/launch.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7514e52af7b93729df00f0c4526a5e8a8abe7374a662612936c0e4e23e501b39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stitchTJunctions (cyclomatic 31, cognitive 49): stitchTJunctions has cyclomatic complexity 31 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 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":"www/public/kit/gallery.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f9873f37726b0497af194f958c1ae1a01f4e301cca93e7dbfa0229fa847fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importMeasurement (cyclomatic 31, cognitive 47): importMeasurement has cyclomatic complexity 31 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f00a759991ee13d9df0f213f2b4a266144061f3d2ddf35af14c99a93cab04f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 31, cognitive 38): main has cyclomatic complexity 31 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"342f548529258b9b95db76e3ef3c98dcec7830a861d83d674d3657c681d3d70d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SchematicCanvas (cyclomatic 31, cognitive 22): SchematicCanvas has cyclomatic complexity 31 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc01b98bcca50dd711cfab463859c2885b6a8fe370b704b4106cfea7d9db2e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attachClaims (cyclomatic 30, cognitive 45): attachClaims has cyclomatic complexity 30 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab699158b37ff7e787b36be6facea10228d3d1fe4143b1a053321e258c3e31b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setBoardOutline (cyclomatic 30, cognitive 35): setBoardOutline has cyclomatic complexity 30 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6417eeed53a10f40ffd789c9ccfa0f682e3d1949b352effb42c241cbfb1726"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sizePdn (cyclomatic 30, cognitive 33): sizePdn 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7281}}}],"partialFingerprints":{"codehealthFindingId/v1":"619ce7210cfd31cb8257607b5b2d194f46fd852510d005a1e1812f4c03450193"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatOp (cyclomatic 30, cognitive 12): formatOp has cyclomatic complexity 30 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":"packages/ir/src/index.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2ff5a36f7785a49d01edb3b8c5c51428a00ab598879d17ca51455151839c1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 48): (anonymous) has cyclomatic complexity 29 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":"packages/app/src/App.tsx"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f136d2e83ce1b108dee8dbc68858dee488af5fe6191e61c848c238f39e011e88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addLoonToSession (cyclomatic 29, cognitive 34): addLoonToSession has cyclomatic complexity 29 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c20284d5ec32adbd2eac2abde3a76a975a1691c902f095b4d4a03789e263e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function solidFromBoard (cyclomatic 29, cognitive 32): solidFromBoard has cyclomatic complexity 29 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14099}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b485b486f3064a9b76a5b8807a74cd8b2e1bdf37d0c935dc74a0e845a3ecacb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sealedWallOpenings (cyclomatic 28, cognitive 72): sealedWallOpenings has cyclomatic complexity 28 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/enclosure.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fff634a16b0891fb0aed7798502e43e766181db6fe1f1d36446709e6f7cdc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRustSourceContent (cyclomatic 28, cognitive 55): parseRustSourceContent has cyclomatic complexity 28 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"521e335e6d2d82dddf091bd286650578b51dbad0c2a4e81752cc184d4e90ab58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ledgerReceiptClaim (cyclomatic 28, cognitive 31): ledgerReceiptClaim has cyclomatic complexity 28 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7b84f201b9eb0aaa0b43d71cad3fe2ecea2c23ecdd53797c6219d50011a932"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function windingLayout (cyclomatic 28, cognitive 29): windingLayout has cyclomatic complexity 28 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7f82db7e889b6e84c8cf63ce086c6ee3aca014102c5a8f93949f20cf70be09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function componentKeepouts (cyclomatic 27, cognitive 44): componentKeepouts 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":14008}}}],"partialFingerprints":{"codehealthFindingId/v1":"2133b15c6e679898c94487c61fcfc5cb31523f15c92ecbf8c810481c35b506a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulateStrike (cyclomatic 27, cognitive 36): simulateStrike has cyclomatic complexity 27 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":"packages/mcp/src/tools/acoustics.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1ba4ae9bc412f7198225caf306627e0d6fcc1f9920e9e781c808ca45e94195"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelIdentity (cyclomatic 27, cognitive 31): modelIdentity has cyclomatic complexity 27 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f1a6b0ae69caf744bd5c54300379ccc6aa6037bab680ac79db839190405c7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregateDrc (cyclomatic 27, cognitive 31): aggregateDrc has cyclomatic complexity 27 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33dcabbe61eda6364522a0ada67476ebb6c3739de43ffada545bcf9d13f9e7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeGlue (cyclomatic 26, cognitive 59): normalizeGlue has cyclomatic complexity 26 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/kernel-wasm/scripts/build.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"312847c9b58b5d159f06a3f682e9fdc1a4be2104761fec68daaf190adcf68758"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDesignRuleArgs (cyclomatic 26, cognitive 48): applyDesignRuleArgs has cyclomatic complexity 26 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a60062587ad05619bf15f348bfebcd84e49094ad188d107548412332e9ce03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 37): main has cyclomatic complexity 26 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cee2f076e3e8d7cd4ec53d93b66f854e7fca0a86dfb076a6ee88c444816272e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyJointState (cyclomatic 26, cognitive 37): applyJointState has cyclomatic complexity 26 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":"packages/mcp/src/tools/pose.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bc57f11168997bed7a11636d23ae8d7db8ef440e9809c90382b8980ccda819"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateGlbPreview (cyclomatic 26, cognitive 37): generateGlbPreview has cyclomatic complexity 26 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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf10708187a8d183f0b055e245c097857603bc84b0e1c29f3b0e956fbec8af4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordClaimMeasurements (cyclomatic 26, cognitive 36): recordClaimMeasurements has cyclomatic complexity 26 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db288a46d2f31d719aa10d2efb56052cb85195f63d3f0ac9f999eb2fe239fbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryExecuteViaEngine (cyclomatic 26, cognitive 28): tryExecuteViaEngine has cyclomatic complexity 26 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417918c598affdbcb04c121aa4fbbad81cc91a10da4d8257837c1fdb3c36e5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolSummary (cyclomatic 26, cognitive 19): toolSummary has cyclomatic complexity 26 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"25921d54ad7ac12713fe308b6419ccbbd60e8d264b82c019cf9d6be394f5e144"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateBomStock (cyclomatic 25, cognitive 43): annotateBomStock has cyclomatic complexity 25 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d76bc9ed08af4277d3eec6084ac10a2670374ca3de760260907ae4c282b6f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportKicad (cyclomatic 25, cognitive 40): exportKicad has cyclomatic complexity 25 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3f3f6538e9485c36102814f23c620deb27104981398895107bb56fb98b418b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 34): (anonymous) has cyclomatic complexity 25 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3245c6aecdf0f0cf3546d95440153bb69b870017e827390d37b50610df39738"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flatPatternFromSolid (cyclomatic 25, cognitive 34): flatPatternFromSolid has cyclomatic complexity 25 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":"packages/mcp/src/tools/flat-pattern.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84732a9d4323d796759a76329442f329b996968aeddc91dc593fe53045d67d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPartSummary (cyclomatic 25, cognitive 31): getPartSummary has cyclomatic complexity 25 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":"packages/app/src/components/tree/part-summary.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6c710313e7131b9fb6ed240544f971163f7adf82941fc8bef441c344dfaedd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importUrdf (cyclomatic 25, cognitive 30): importUrdf has cyclomatic complexity 25 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":"packages/mcp/src/tools/import-urdf.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd99cd551f12fe02cf9f07823358396aa1baebc66e485a9de18c619cd38d63a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkCommerceBoundary (cyclomatic 25, cognitive 29): checkCommerceBoundary 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":"packages/mcp/src/trust-boundary.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1573bab10bce115a147d384f0cc4abfcd0686fb6ec70e25dd229036b0f0a277d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordMeasurement (cyclomatic 25, cognitive 28): recordMeasurement has cyclomatic complexity 25 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":"packages/mcp/src/tools/print-check.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8cce0810df45284ea61bc32ab2d44fcda747197abfc790cd8b44688df25970"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boardFromSolid (cyclomatic 25, cognitive 26): boardFromSolid has cyclomatic complexity 25 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13677}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7b70b21dd97f1deebe905c5cd9c27a073af3c1b46bd88cdb2bda436a605916"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPcb (cyclomatic 25, cognitive 26): renderPcb has cyclomatic complexity 25 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"190b0d7fef8b9e2f64d18ff253bb6ac3133fa85a962932df8f73c1f55d18d0d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 53): (anonymous) has cyclomatic complexity 24 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a389ad4256f90348341d0e262635c05763315f8a0a0ee496e83123aead716c1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runErc (cyclomatic 24, cognitive 43): runErc has cyclomatic complexity 24 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3eb80c99e0d57f65030d93ab33fe17849b27aea7fdc33121a44a44f84f1588"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 40): (anonymous) has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/app/src/hooks/useCanvasRecorder.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d9da19e8d2a889c8bb206d82b0f30a047d65819c0432f4e52b1c942cfddc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 40): (anonymous) has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/training/src/cli.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"9283272f839876da27ac0fc55ea94a556d577de316d876e28ec7ec067444d255"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySimFrame (cyclomatic 24, cognitive 37): applySimFrame has cyclomatic complexity 24 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f093b415ca9943cfd26eac900167eaa249d5f71bdef199f6bb3b909b65be1ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 35): (anonymous) 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4818ec568a615190e53d6265562b057eb653a183b71f6b0faec7f20bc76346b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function solve (cyclomatic 24, cognitive 32): solve has cyclomatic complexity 24 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":"mecheval/harness/src/solvers/gateway-mcp.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d9228e3509ff7edc53a73d021b7e8a5bbd283594b588a9e3cfac874499717e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleEngineRequest (cyclomatic 24, cognitive 31): handleEngineRequest has cyclomatic complexity 24 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":"packages/engine/src/engine-host.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4804b010cd198afca17acbd860d4a20a6a8bc721cc034bd8b761f01513131a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeGroupClearance (cyclomatic 24, cognitive 28): computeGroupClearance has cyclomatic complexity 24 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb749a49ad7eae37107c60f26aab23b6cab428b0801778f038d2ed17d7d3fdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topologyOptimizeTool (cyclomatic 24, cognitive 24): topologyOptimizeTool has cyclomatic complexity 24 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":"packages/mcp/src/tools/topopt.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"658fc29669e35d73b4f1b6ba70b5ab7ae44bd57d63b751b447a8a10cf74e98d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJsonVcadFile (cyclomatic 24, cognitive 23): parseJsonVcadFile has cyclomatic complexity 24 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":"packages/core/src/utils/save-load.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5010da793c1b0e9d121bfc5e7bbe47b42c1e5aecfb6dc4607760fc7fde3d08d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describePcb (cyclomatic 24, cognitive 23): describePcb has cyclomatic complexity 24 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac0fd06e58a665084ad8b9c49ba0694ca09af904b0f2b9227b9432d7da2887"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExpressionInput (cyclomatic 24, cognitive 22): ExpressionInput 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":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb0c5df309dfd7ca5865e9890cd63d61d93f4548adac15d4bf8cf884d3d02a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function App (cyclomatic 24, cognitive 18): App 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":"packages/app/src/App.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc680fa850883636d1998d905a91d0365dc6c2cf12d760818a66269cdc4226e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 42): (anonymous) has cyclomatic complexity 23 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 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8998030d27c536178bfff96ccc9d8fbd2c3889fdfc0a77e5e0bcf977afb12ee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCavity (cyclomatic 23, cognitive 34): findCavity has cyclomatic complexity 23 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64d162fabb2359dfbca1443e770941d2bccaa914432cb08022f7889315168c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 23, cognitive 33): main has cyclomatic complexity 23 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":"scripts/publish-crates.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb324bad611b305ff82d8c9b54f008f61dff674e45bbbcf0b134c76c95f24f92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteNetTie (cyclomatic 23, cognitive 32): deleteNetTie has cyclomatic complexity 23 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10751}}}],"partialFingerprints":{"codehealthFindingId/v1":"910d6be3f28e08d06e31e6bf640de970e4f4898bd9cf3249cd65c1fcf1336dac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assembleInto (cyclomatic 23, cognitive 28): assembleInto has cyclomatic complexity 23 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":"packages/mcp/src/tools/assemble.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1063c0bc40f55b93ccefa7776268c03095bb716b2265f73f40f7f069d58c58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addNetTie (cyclomatic 23, cognitive 28): addNetTie has cyclomatic complexity 23 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10617}}}],"partialFingerprints":{"codehealthFindingId/v1":"82758ff056056caf816a9200cdfc0322b742453db8e733f0be1f5329b531a15f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function placePartTool (cyclomatic 23, cognitive 24): placePartTool has cyclomatic complexity 23 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":"packages/mcp/src/tools/parts.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1266bc9d295d7c95247acf86256342c5c6e95ea0f0e868668d9535294e05a794"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function taskPage (cyclomatic 23, cognitive 23): taskPage has cyclomatic complexity 23 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8d22b88f5a91adc60085370368b141eb7864015395555c8dff53e0d818b6b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StatusBar (cyclomatic 23, cognitive 22): StatusBar 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce23eda84c894bbe04378ae200aa84e6110962267cddc89f4889a9c756f2f6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EmbroideryPanel (cyclomatic 23, cognitive 15): EmbroideryPanel has cyclomatic complexity 23 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":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"de54bedf784f18ffbc02771d0cd48b684829038c5ef5796663187dd02e51c642"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 45): (anonymous) has cyclomatic complexity 22 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14a9d2a6d76d438f69df1f07a9e0cc3dbbef7a8458cf1d1c0c8df2199dfa3a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 38): main has cyclomatic complexity 22 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mecheval/scripts/render-task-assets.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a068fea3ecdcdf97dc53560695d84f659a742492e6cbc80a2253b334f05f81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setStackup (cyclomatic 22, cognitive 32): setStackup has cyclomatic complexity 22 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faa7ef4cf414b270213da49ee584cd1022832c7f8941cc0a574dac748b2b7f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateVCode (cyclomatic 22, cognitive 32): validateVCode has cyclomatic complexity 22 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":"packages/training/src/infer.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"42026fa0c66e596b30368ebc667acc36cd45449baedea6832814c8501021492a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkJointRange (cyclomatic 22, cognitive 31): checkJointRange has cyclomatic complexity 22 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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"07769db1c78bb2e89f188345683f7c63766a103e75381b1c3019d837089ec2ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unifiedFromSpec (cyclomatic 22, cognitive 30): unifiedFromSpec 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":"packages/mcp/src/receipt-unified.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a770b1a7ee3fe83e275358719e458178c0c7c8ec9d8d5ce892af92a0513d8d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flattenSchematic (cyclomatic 22, cognitive 24): flattenSchematic has cyclomatic complexity 22 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":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"15873399934982ce213efce265db5db5a79b356cb27b65c405d2462ba22dd824"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addCoilArray (cyclomatic 22, cognitive 23): addCoilArray has cyclomatic complexity 22 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8098}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b68b614b9061af59eeacd9479e76333a72e1e06ad4f9781a563bd151570b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DrawingToolbar (cyclomatic 22, cognitive 21): DrawingToolbar 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":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f55d334a5a9c0f11b9bda33bed620c0c8131d42d5d6d79e9ce50c42acd2057f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function InlineProperties (cyclomatic 22, cognitive 17): InlineProperties has cyclomatic complexity 22 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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20f2f4816818f14c9f0d248c17147def263054eb7b4617806d929bfd348bf80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CommandPalette (cyclomatic 22, cognitive 13): CommandPalette has cyclomatic complexity 22 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb3322c48e08b299c52c314a0c34acaa28c544925635c4ef05e1d4349632d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCommit (cyclomatic 21, cognitive 36): handleCommit 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"14844f0e63301d8b2ed8f1dd0a83f42932f1451327b3b321a5151f8fe109e8b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyClearanceClaims (cyclomatic 21, cognitive 36): verifyClearanceClaims 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5f2ab20e4ae20e83d267f0d13ef10ccf2094a1e7dfb87f2ac8006be24fa851"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateForFab (cyclomatic 21, cognitive 35): validateForFab has cyclomatic complexity 21 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef11a21857b6001e19910a60766b797a6053e209db4690f021023073be80f98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function component (cyclomatic 21, cognitive 31): component has cyclomatic complexity 21 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":"packages/app/public/launch/launch.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98b21ae467c6fa0b3321737e2ad174b906704b1bd28d6ed5cb0e6acecf8b4bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function component (cyclomatic 21, cognitive 31): component has cyclomatic complexity 21 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":"www/public/kit/gallery.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87083fe2234e26bf49e0bb0324ac919a767672ec31770b6da85637dc516862f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSchematic (cyclomatic 21, cognitive 30): updateSchematic has cyclomatic complexity 21 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4df3fc6fc518341f6f1b6f1efeba06d0f16dea014c39f2f3a5a2bf9c65e591e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureSweepResult (cyclomatic 21, cognitive 28): measureSweepResult has cyclomatic complexity 21 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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1683b3a5d495100963f6a1b336700ea6e132ac3e5510c1062671adf7f061ae6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 21, cognitive 26): onmessage 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":"packages/app/src/lib/slicer-worker.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"388da904f2539c5e6cb1f0ed25b8657a9942a2ee9230427a3ad40d5970be5dd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engineArgs (cyclomatic 21, cognitive 26): engineArgs 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac12f0a7fccaa369d6e539c88a15b794927a399c416b280fd4b724266a751e15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createServer (cyclomatic 21, cognitive 25): createServer has cyclomatic complexity 21 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":"packages/mcp/src/server.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab89f65be8ea8b488b13e4643e8709e32224455c54dbcf9980ad428ba22c1d53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calcRf (cyclomatic 21, cognitive 22): calcRf has cyclomatic complexity 21 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a89b77cfe8d667b8975d82c10035e54fcb50b1a972617bbf4cc021455396ced"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeSketchBounds (cyclomatic 20, cognitive 52): computeSketchBounds has cyclomatic complexity 20 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":"packages/core/src/sketch-math.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b70fbdcf9cd7fb2824cf7ec26c8514a5618c82ffc8880d81c1dc0e4d22ded8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countCodeLines (cyclomatic 20, cognitive 45): countCodeLines has cyclomatic complexity 20 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"scripts/doc-logic-loc.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8393d885d535ba64da30d9a796c039d34bbcd5a4c4f4b88c1b587d312c11d0f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateDocumentTS (cyclomatic 20, cognitive 40): evaluateDocumentTS has cyclomatic complexity 20 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"022cbe1c8558843e7c30aa823a78329254e60188da2994b2d711b9372cb5b005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schematicSummary (cyclomatic 20, cognitive 30): schematicSummary 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cbd4c4ed26bb6c66380dfa52d030dc6e3ccd4285e25070eb035fb3a566de35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSelfStart (cyclomatic 20, cognitive 29): checkSelfStart has cyclomatic complexity 20 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12872}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2b79ca767293dae460857daea6081063bac4f7b0b36edcf99d7a384cedccc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectStaleNets (cyclomatic 20, cognitive 27): detectStaleNets has cyclomatic complexity 20 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"6183beadd6d2eceb83475447049b6edc6c305e51f8c8678a143acd0b1d4b2e0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deletePcbElement (cyclomatic 20, cognitive 25): deletePcbElement has cyclomatic complexity 20 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da9279b0041583065c299bf4f9ef8170ba9421aa1763ed7e6b05e88f77add12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFootprint (cyclomatic 20, cognitive 22): getFootprint has cyclomatic complexity 20 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9016}}}],"partialFingerprints":{"codehealthFindingId/v1":"531f10430f5a1ef7e424102adb2409fa2ea6a98ae422e6addcb106e50bac7f3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SketchTreeSection (cyclomatic 20, cognitive 19): SketchTreeSection 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f821cb810c07c0aa4b0db65849d6959385141a8cbf7377367f3bf0bbc31b6cb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gymStep (cyclomatic 20, cognitive 18): gymStep 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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b9e239a2882d56febb45623411244681e963cc1458f938fd9e02a94955033"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 17): (anonymous) has cyclomatic complexity 20 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"409cc88d39a786ea6e2c5424987894a0ae372ea77bdcc3471a55cbffb7cd990e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeRustSource (cyclomatic 19, cognitive 49): analyzeRustSource has cyclomatic complexity 19 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 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"79946175383a441a79815d0b9802c8049499752da2b5b4d2e488cb02223fdbf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function primary (cyclomatic 19, cognitive 37): primary has cyclomatic complexity 19 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":"scripts/gen-swift-types.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95c4222199a50d70efba145d4532bcaa58fae175c25d0f1992fa282d1d9623e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasRootWithoutMaterial (cyclomatic 19, cognitive 35): hasRootWithoutMaterial has cyclomatic complexity 19 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"160ca01054ae17bf9d24db50206eaff36ef3980f38b96906d1eba94ea462cc17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSheetMetalChain (cyclomatic 19, cognitive 32): buildSheetMetalChain has cyclomatic complexity 19 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":"packages/engine/src/sheet-metal.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fff8687dc6383a9c3c12c8877b6893c40691545344e17657a7003f6e32d571"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPublishableOrder (cyclomatic 19, cognitive 31): buildPublishableOrder has cyclomatic complexity 19 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":"scripts/publish-crates.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b4e735945fe4531f155331ac1cf9c753dabd6c949845619ce28fa1496c64a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 19, cognitive 30): handler 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b56242bf9259dc9488541bd338866604ac29e1101514f66b50bad78c577138"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function slimPreviewForInlineUi (cyclomatic 19, cognitive 25): slimPreviewForInlineUi has cyclomatic complexity 19 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":"packages/mcp/src/server.ts"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d423f50ac013bc4ad665c02f3be922442ee7f23c528cae9c18c360b0b77e82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizePlacementDrc (cyclomatic 19, cognitive 23): summarizePlacementDrc has cyclomatic complexity 19 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f53880f97c26aa8f1aed2d1bdfa5835f80cc9998fc68b28e3b58b99ad30ba7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePcb (cyclomatic 19, cognitive 23): validatePcb has cyclomatic complexity 19 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":"packages/mcp/src/tools/pcb-validate.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0937490f839d6a54267619a9f6fadd705a345e2f322693320ebf34efc730cbc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executePlacePart (cyclomatic 19, cognitive 22): executePlacePart has cyclomatic complexity 19 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f27b77c55b014f267710321cdef4d11597972dbe0eb7d2a55261aea8a30ff3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDocument (cyclomatic 19, cognitive 22): loadDocument has cyclomatic complexity 19 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b202b42bd7142671206fe96b8c3c2d6eb80bfdc3da73f4c627ff622eacb499"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getCopper (cyclomatic 19, cognitive 22): getCopper has cyclomatic complexity 19 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8eb94c3e749c0728d1dd8eb94f851dd77073f12d6b30ba77e1174cf6cd371e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderReceipt (cyclomatic 19, cognitive 21): renderReceipt has cyclomatic complexity 19 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c09b86b4b59f8ca8175caa075ad0e5c4b849dff885f28fa1c1febd8f873c71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSolver (cyclomatic 19, cognitive 20): getSolver 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":"mecheval/harness/src/solver.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"137f1fc6056d33cc1b73a8c937957f40e41e657391ccdb7d6a81aeb2ab8279b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePreviewDocumentId (cyclomatic 19, cognitive 20): resolvePreviewDocumentId 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":"packages/mcp/src/server.ts"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"902c2ab9a40cb0ca67eba0481163ad16ab8eb0a654293ca52d0f22e43697ae36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) has cyclomatic complexity 19 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fc86f7fb324a6713b0027a28e50dcf460fe407ab1f158c2368540b278b6509"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createRobotEnv (cyclomatic 19, cognitive 19): createRobotEnv has cyclomatic complexity 19 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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"66035a567170c4363e05e3e7e147c19b86d85af5e530e6d3323ae62a0e39d1da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCircuitSpec (cyclomatic 19, cognitive 18): buildCircuitSpec 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":"packages/app/src/lib/circuit-build.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c4dc6dc8569b4a1a69e3ee32e49540bfc1be152c6b5c9615ce9474e2b71339"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CircuitAnalysisPanel (cyclomatic 19, cognitive 17): CircuitAnalysisPanel has cyclomatic complexity 19 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cae5a7174dccfba277ffba1d57bbe47c9655416790d913d76ab721e75999b9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ElectronicsPanelHeader (cyclomatic 19, cognitive 17): ElectronicsPanelHeader has cyclomatic complexity 19 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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbad76081ec1044d1bb4b29229581291d05cd24eaa8ed08c56c8f8327138dafc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drcPcb (cyclomatic 18, cognitive 34): drcPcb has cyclomatic complexity 18 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4941}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5826e01223f9330657aaf925b72feeb19b33395669cdc814c32c7aca034c3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function solve (cyclomatic 18, cognitive 33): solve has cyclomatic complexity 18 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e50d0d751fe11a09f371b4acaff6545c13de6f4683aa0dd2a73f35010f74077"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cast (cyclomatic 18, cognitive 30): cast has cyclomatic complexity 18 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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa2fde4675cf1f6752d22c8c53c45962169c50825e18204b48140462aa0ad6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 25): (anonymous) has cyclomatic complexity 18 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":"packages/app/src/hooks/useBackgroundLuminance.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dd478745da2927fdbeb56c54de00abde8a3c547db8ef94960d53bd62838a27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 21): (anonymous) has cyclomatic complexity 18 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"441f4b787e450cd87aabe0a79afbe3cc7b25c148a5346c2cf5ca4aa2e2f66a2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMolecule (cyclomatic 18, cognitive 20): renderMolecule has cyclomatic complexity 18 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":"packages/mcp/src/tools/atoms.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a88b5eb207c85636c5efdc480d6cc05bdeacc7171efdae1a680a95c8db161a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectSchematic (cyclomatic 18, cognitive 20): inspectSchematic has cyclomatic complexity 18 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c3105a1f8570bdbc37b86142f0bf58200adc522d3d222272e086346eb4d47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDrawingSheetSpec (cyclomatic 18, cognitive 19): buildDrawingSheetSpec has cyclomatic complexity 18 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":"packages/app/src/lib/drawing-sheet.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"395910be5fc907e025074fe8059cb92df03a1e184d4495f985a4c8520c113c3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function barFromDocument (cyclomatic 18, cognitive 19): barFromDocument has cyclomatic complexity 18 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":"packages/mcp/src/tools/acoustics.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ea4dce01a573d195a428eac56c8e5924450af0d56ef6aafc87b7e24315f284"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PbrMaterial (cyclomatic 18, cognitive 18): PbrMaterial 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f421834c9d53145cde86745380e26da7a87edaa65db7fa8e22778a250beec09d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CompressedFieldHud (cyclomatic 18, cognitive 17): CompressedFieldHud 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":"packages/app/src/components/CompressedFieldOverlay.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"01160e578cdb7a032f9eab4a240195ceb20871207d6c143903297492d609ad1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPartIcon (cyclomatic 18, cognitive 17): getPartIcon 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f8baf20e8d9ac81e6b515ff948cab86155d20f236063e31a7190e94cb19d43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RaytraceChip (cyclomatic 18, cognitive 17): RaytraceChip 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":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70606d8884e69c349b1e02bf46185752c87c0f75591a973f9e2b695d607fa2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) 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":"packages/mcp/src/tools/print-check.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"db75c12045986141a94d96b524d632ee359c08bf52ff4bf80d77804fd9460740"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PrintPanel (cyclomatic 18, cognitive 16): PrintPanel 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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac041a10eaf0577fe9ba0cd078e2ce0df7024448a137c6b5d175b0b9c20ed06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 16): (anonymous) 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":"packages/mcp/src/tools/assemble.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d88b3346ee8e7d6d3dfc0021d2119d10b9c3582ce05a4f3569a5b5b305e9ecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b11cb976860353ff5a2ea0e76546afa7af6065a1dd715e262c83e91dd62cc03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function traceGridBoundaries (cyclomatic 17, cognitive 40): traceGridBoundaries has cyclomatic complexity 17 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf760c6a57e14fdd6cdcbf5d697650048d0db21c85e185364c2670ae37020bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoSmooth (cyclomatic 17, cognitive 36): autoSmooth has cyclomatic complexity 17 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":"packages/app/public/launch/launch.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3529f5e5619c3b3e56cde0c9dca519feaecc404369e558c0292beb09d6d36c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoSmooth (cyclomatic 17, cognitive 36): autoSmooth has cyclomatic complexity 17 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":"www/public/kit/gallery.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ff392a3ab364b85ddb0124f7effcc2f1be07b9b5e8188fc9a072cfc9b07093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function polygonOverlapBbox (cyclomatic 17, cognitive 30): polygonOverlapBbox has cyclomatic complexity 17 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6cad38b37eb085161feb7293a92ec5a01ed019273ff2b972df8ee94380d473"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 26): (anonymous) has cyclomatic complexity 17 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":"packages/app/public/launch/launch.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e874705e946d8de10bace8dc4b2d7fee4bf899d19337c7a2f963b018b6f3d67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyConstraintClaims (cyclomatic 17, cognitive 26): verifyConstraintClaims has cyclomatic complexity 17 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":"packages/mcp/src/tools/constraint-claims.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaf4f2d8f89f7f059d215b9e9e4e54bd7654f6b000bcab6821ef14b95863ce3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 26): (anonymous) has cyclomatic complexity 17 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":"www/public/kit/gallery.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6e2ab43433ee4016e2a97ee01376d44c1fddf0e99ac1c316d47df13b9d1a1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSweepAxes (cyclomatic 17, cognitive 25): resolveSweepAxes 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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c9c67812450ea6f6cdf932836748025c9b2d4c73de2990f079db3fe7c578ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 24): (anonymous) has cyclomatic complexity 17 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":"packages/app/src/hooks/useOperationPreview.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b14633121ebf1b7d15572504122abc76ecfbd57610d9135d813fdde474de13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runStudy (cyclomatic 17, cognitive 24): runStudy has cyclomatic complexity 17 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":"packages/app/src/stores/analyze-store.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32abebb30fa6156ec888410d56d07884cb1eb1d3f8186885019abc91b8067a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComponentFootprintPanel (cyclomatic 17, cognitive 22): ComponentFootprintPanel 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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaeab296bf7359ce0a9ae4663301f18bc51c38360ae2a7850d9e75c3cfb0c42"}},{"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":"packages/app/src/hooks/usePcbAutoFit.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb64a9169a66c7d51e885d661b2efa6597c795be1f1e5e60d7346a5cd34763c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPadPositions (cyclomatic 17, cognitive 19): getPadPositions 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":8796}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fe81c2bcd1892bfddc156cd7b322d0a29037794df9db50866df2bafdab2e4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measure (cyclomatic 17, cognitive 18): measure has cyclomatic complexity 17 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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb686cd54cb92e21c3eced570605f5be8f581ca11bd3ca18730ca3cdbeded0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function predictPhysicsTool (cyclomatic 17, cognitive 18): predictPhysicsTool has cyclomatic complexity 17 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":"packages/mcp/src/tools/physics.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f1a518956a34662cc9b655e2665b8edfaaa7b343c2c91b407719e0d900769d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRatsnest (cyclomatic 17, cognitive 18): renderRatsnest has cyclomatic complexity 17 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9b15c209405a5ccd35276738e991d60e313ab8c77a1be9d02ee07866ab3289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addTrace (cyclomatic 17, cognitive 17): addTrace 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6f63b00bdadc6248af48e0463a4eba77d887f85a59f6e5d822f0dd4f7d08b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJob (cyclomatic 17, cognitive 16): parseJob 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":"packages/mcp/src/fabricate/kerf/client.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa12bc22450d0f7f1eb96f978c6c031c74f46c34e3df1eb0303441c9ca71c3e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SketchCursor3D (cyclomatic 17, cognitive 14): SketchCursor3D 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f6fe6bbf20ebd53d7ef8e6284ad4d00966252f81390a0e1122b7caf24fda27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DocTitle (cyclomatic 17, cognitive 13): DocTitle has cyclomatic complexity 17 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":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c2e5f4f512a8104b5d56ce1d7ec2da8dbec52d609c179326aa04d204a02f22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sketchConstraintToDesign (cyclomatic 17, cognitive 9): sketchConstraintToDesign has cyclomatic complexity 17 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":"packages/core/src/sketch-constraint-persist.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7d02c81b16ac8fa0bfeec9cfbb62ffcedb1632c777c145ad88c9b7af9a4299"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 28): (anonymous) has cyclomatic complexity 16 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93e0d9e733bb03e82512351d0b87bec194d0fd268f8e241271a003a850898b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function largestComponent (cyclomatic 16, cognitive 28): largestComponent has cyclomatic complexity 16 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f40a9a029ed6c045c45107b17e2007d721db239ff127843c6ada47981601f2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unifiedFromPcbReceipt (cyclomatic 16, cognitive 24): unifiedFromPcbReceipt has cyclomatic complexity 16 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":"packages/mcp/src/receipt-unified.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad9e5d7d11d7d1d35c965927f80733cae65a327684f2e2adf15707df0b776a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickSubFeature (cyclomatic 16, cognitive 23): pickSubFeature 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":"packages/app/src/lib/sub-feature-picking.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b7e76bb97fdd4bcbf72544de77c3ac47811dde94855b4445b047681532fd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileJointKeyframes (cyclomatic 16, cognitive 23): compileJointKeyframes 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4945edbad055682f1b8e5b65fc62e9605d3dd39ab87d4e3cb1f2b44ca543305c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareVersions (cyclomatic 16, cognitive 23): compareVersions 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":"packages/mcp/src/version-check.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d315ae22298846478eb153aa05805cab7168915bd8b19899b61990f544f90540"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sealedCavityFromMesh (cyclomatic 16, cognitive 22): sealedCavityFromMesh 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de346dcbc60ab934528ef8e1d16254ec5bb5db54f71b5c0cc01629931c084dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandBboxFromPositions (cyclomatic 16, cognitive 21): expandBboxFromPositions 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":"packages/core/src/camera-framing.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d229b7ff59ddb700be731cb955d22b7e6da9c4014a82a7a825ca4228100356f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rasterizeSection (cyclomatic 16, cognitive 21): rasterizeSection 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f395d404783e64d0367cf6a02832bf2d91757a22b166d871bdbd98e9755ee3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderStackup (cyclomatic 16, cognitive 21): renderStackup 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ea4801f5bfffafd33e231d7d7a770a2452d4459a08446497ad027324c1a185"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichSuccessResult (cyclomatic 16, cognitive 20): enrichSuccessResult 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cbd6569f95b219583dd612175849a4840df3cb2bf00006d71b636ee46e1093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) has cyclomatic complexity 16 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac8e46b523dc6d7cdd29188901d4b93be2735754b8bd56d09c59b697ccfffff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withComponentBodies (cyclomatic 16, cognitive 19): withComponentBodies has cyclomatic complexity 16 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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac53215999fde386ab3a3f2b05acc61a0cf6f9edfaff2d23f3d90f9834b8415"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 16, cognitive 19): handler has cyclomatic complexity 16 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":"packages/mcp/src/tools/thermal.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6bb1ac5d1fcd8a5c43dc4af1f50226042fa03f68e659301b1b9ddf980641fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJoint (cyclomatic 16, cognitive 18): parseJoint has cyclomatic complexity 16 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":"packages/ir/src/index.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"19adfd081f0e5065b596954b7924d3ca7ddf511a172ed308034ad2f7fffb31f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverPush (cyclomatic 16, cognitive 18): deliverPush has cyclomatic complexity 16 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":"packages/mcp/src/app-link.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7bdbed5003ae62eeb442340328b3178abbaece8c24839f0544aca91a7ee365"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 16, cognitive 18): handler has cyclomatic complexity 16 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":"packages/mcp/src/tools/structure.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"466bd3c0c21f35f4a5b9e13e25bfc4dd0f3862e9a5b2d97bec905ae0e25f4851"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swiftType (cyclomatic 16, cognitive 17): swiftType 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":"scripts/gen-swift-types.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e100c3dff1ab472612cf2e1fea7c7138cbb12e0a8928d3c1f1095b8a1f4fb46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EcadFeatureInspector (cyclomatic 16, cognitive 16): EcadFeatureInspector 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":"packages/app/src/components/electronics/EcadFeatureInspector.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7f0aa9ada7e0e7c65b507a7159d0774792d73b57f2cb709f67aa2e90168d5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRoute (cyclomatic 16, cognitive 16): applyRoute 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9373c2f68479424134a2753919bc9fe3e08e21d0f6cdd0e7fe87298706ec4e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichErrorResult (cyclomatic 16, cognitive 16): enrichErrorResult 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b691a9f4386ede15fb1e14bc510047579fca34e6b88c58651aeab8b5067c2fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defineLoonTool (cyclomatic 16, cognitive 15): defineLoonTool 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":"packages/mcp/src/tools/loon-macros.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"27747a552c8173c50e8b3de6916529dad85d2fc49b4da5d1be7e20a2be57d15f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2394efa4428ed0f3f4f87bb554f02cdb9d5af989a3953f9cf32b76393d646fa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StudyCard (cyclomatic 16, cognitive 13): StudyCard has cyclomatic complexity 16 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"802d152ea35b114831ca0b22d795c13091c910c18b556519cdb625f55bf9f514"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBuildArgs (cyclomatic 16, cognitive 11): parseBuildArgs has cyclomatic complexity 16 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a8460f71ee2e22eb9d88b2b2b6b5d960f17eb6dbce13646c5417b9ab35a52d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAnchors (cyclomatic 15, cognitive 26): validateAnchors 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":"packages/mcp/src/tools/design-constraints.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f26f5051bb479622c3ad645b4ad0ff821ce5ac88ef018c6c8e16d518a097bbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function creaseGeometry (cyclomatic 15, cognitive 25): creaseGeometry 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":"packages/app/public/launch/launch.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"835c660d061210b790d3d36aba7cff222c0ff99142aade2970315cf00734846f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportGerber (cyclomatic 15, cognitive 25): exportGerber 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":5965}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e1569c1c018ab2175cc6dec5931753324fc43f516d60f1866bb27b693b3049"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function creaseGeometry (cyclomatic 15, cognitive 25): creaseGeometry 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":"www/public/kit/gallery.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b27746807ee9f8729a9363887848146efd17badfcf732d64e3b906e882e42cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function KoanChip (cyclomatic 15, cognitive 23): KoanChip has cyclomatic complexity 15 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":"packages/app/src/components/footer/KoanChip.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"991a6f11f0cb3a8cac83aa58c2fb9607bafae83d5ff30cbb215e596a3f5fd80d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 15, cognitive 23): onmessage has cyclomatic complexity 15 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":"packages/engine/src/analyze-worker.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae172167b11cc61cfb4b58f459a2c8b77d79b38bbd85f0ddc17277be3fbc5920"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) has cyclomatic complexity 15 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":"packages/app/src/hooks/useTimelinePlayback.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c99983b1dcb27cdc8d4181fe47a95a134302fc141420b88d5954a3e31bf5acb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLoonAssets (cyclomatic 15, cognitive 20): resolveLoonAssets has cyclomatic complexity 15 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":"packages/mcp/src/tools/loon-assets.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dfd93ac1de6893011f5893523dab98084d2d6306b92ba070ecabcbe31bc38d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLight (cyclomatic 15, cognitive 18): parseLight 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":"packages/ir/src/index.ts"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e990e2cfd6ba02bfbbcd1a43c16d0bfd59d88b6ede7148f5ea86bdb3262b74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSheetBody (cyclomatic 15, cognitive 18): buildSheetBody 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6005e9b5f1f450947c5dbeba42e893a09d1a8c9ac77cbaeab38010f5d58ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importAltium (cyclomatic 15, cognitive 18): importAltium 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":"packages/mcp/src/tools/import-pcb.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7abef1202f38e54b7c6e11d8d583b352a308f5e60b152bdd4bc19b46634b8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeInspection (cyclomatic 15, cognitive 18): computeInspection 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":"packages/mcp/src/tools/inspect.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0181a0039637505ea72162b4e30ecf11805379f9157dee846234bda2d9922cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decimateMesh (cyclomatic 15, cognitive 17): decimateMesh 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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99b780a1060d8213bcfbb02861c714ae775b7f4ba9a539c0ef411f6aed86d1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 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":"examples/pcb-motor/scripts/mcp-bridge.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ed8c378dae5646b54b211c5078f1dfbac4d36418da7cd38d121640ccf11a5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 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":"packages/app/src/hooks/useEngine.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e69aea976b10f8deb5de5149e11b0de6091c54b0e4e693304b25f66a59628f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 15, cognitive 15): create has cyclomatic complexity 15 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":"packages/engine/src/physics.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeb2d6cec57aebb45597f561802aa3016046819bf062329b9aa6a4fbeb406a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportCad (cyclomatic 15, cognitive 15): exportCad has cyclomatic complexity 15 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":"packages/mcp/src/tools/export.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab12ab3e911572ab21419308dab9e40a0a15c0c42523bf6603fb4be606bf776"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DocumentRow (cyclomatic 15, cognitive 14): DocumentRow 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d3f16ff89a7d4117b2517cf5c441d2c2576d4b630797f4c14567af994eaf88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lengthMatchTraces (cyclomatic 15, cognitive 14): lengthMatchTraces 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e8dab4922bd446e006b3117ea1b04e0dba7fcafbd61200c609f77f2182c246"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fabPrep (cyclomatic 15, cognitive 14): fabPrep 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6467}}}],"partialFingerprints":{"codehealthFindingId/v1":"93042e954e4392231241cbf1345146bcd24dca4a88cd63a351de4c229376fe50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sizeCoil (cyclomatic 15, cognitive 14): sizeCoil 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00713ee1886f59ddfed8e74026f16425b044e5990876d5ce4df1db261497b79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DfmChip (cyclomatic 15, cognitive 13): DfmChip 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":"packages/app/src/components/footer/DfmChip.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd857d1082e0fda602405e3ba5d713351cc003c19f585531f6dfb00724765233"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePrimitiveOp (cyclomatic 15, cognitive 13): updatePrimitiveOp 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f85079ba73ddcaf32defd0a5f4b90317dedc16797ad0e47e2ffe3bd84cfdbb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CommandRow (cyclomatic 15, cognitive 12): CommandRow 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":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb2c4b7f91274b1f9e0364bf7f39cf86b336355e8c6118cc5140033f0250666"}},{"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":"packages/app/src/components/ToolPalette.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0115171acff921eeabc187b3a9df0a081cbd2b181c69e093ce333066b0fde5f7"}},{"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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa716bc3800cb0fff4cb4f1977459e66cbb8aadafa8a7560a1cffd554369c038"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lmSolve (cyclomatic 14, cognitive 31): lmSolve has cyclomatic complexity 14 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":6823}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf9eb99e66858fb7b3b3f8862efd4e0dc37da720e8147e7a57d3214f69ae633"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSimReplay (cyclomatic 14, cognitive 31): getSimReplay has cyclomatic complexity 14 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":"packages/mcp/src/tools/sim-replay.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3465d2e510d45c810422061353f0880e28d7f9dec6f664920f8e7f540cc36e5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveActions (cyclomatic 14, cognitive 25): resolveActions has cyclomatic complexity 14 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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"05851a2e4046f5e76021d814612b3d243cec1555de51d71be6c90cb04df1c2b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function worker (cyclomatic 14, cognitive 24): worker 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":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0f654ad3d81cb58747b9269ab67b41073c508bcd7f8d817b2f798aa4fbe4ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 24): (anonymous) 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":"packages/app/src/components/electronics/pcb3d/usePcbCamera.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84c0fe94c13b2d88da25b348da4167a4563bcf9ad5147f201051270a2e9e074"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decimateDocument (cyclomatic 14, cognitive 24): decimateDocument 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77b48ba8fd6fdb266bb43ae92ddc43e7b03a823ca3ed4c3500fd706c0a04d76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderHeroMetric (cyclomatic 14, cognitive 21): renderHeroMetric has cyclomatic complexity 14 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"075633e2a3f47065cd0574a05b02da36cf18fde6f3edf0c6792c71c1478fa2f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateExample (cyclomatic 14, cognitive 21): validateExample has cyclomatic complexity 14 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":"packages/training/src/validate.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc4cb4f8accfe7b7fecc7f38ab037aa8094aeed678811be7f0e3a062ed9615f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyConversationCacheBreakpoints (cyclomatic 14, cognitive 20): applyConversationCacheBreakpoints has cyclomatic complexity 14 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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"954e182f1f102f5e2849a0368bba90cbe9110fc317f94e72d40f865872d06bfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCsv (cyclomatic 14, cognitive 20): parseCsv has cyclomatic complexity 14 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ba48f271f12ede4a7fef18624c72eec40c4388d0aaaab9e06bc91e56d1555f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTaskMethod (cyclomatic 14, cognitive 19): handleTaskMethod has cyclomatic complexity 14 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b73487067598fc1b9bef12b62a652f2920eeb91adaaa8a07fd734e79603499"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 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":"packages/app/src/components/footer/Sparkline.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e967f2bb879f9a06775b8f5edc7069673f0ce6c2ae408dd1d3662e77fcc41ee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function passiveKeyword (cyclomatic 14, cognitive 18): passiveKeyword has cyclomatic complexity 14 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ce74a961e7c14da06a5185bba4b2ff03f3f199133e65fabe255914ac01e585"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNodeRefs (cyclomatic 14, cognitive 18): normalizeNodeRefs has cyclomatic complexity 14 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ac2e0d8ab0ea7fd0e175dd0dc1cbdd9ee6dd8ddfbb018c80011d95d7580f32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCsv (cyclomatic 14, cognitive 17): renderCsv 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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a7b26f384dfeb3b17c700972b074a89b3126d74278044ecdab402964eb55e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyLedgerClaims (cyclomatic 14, cognitive 17): verifyLedgerClaims 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34743970f6003826a3c6769d6dfe25bbdce23fff01d59bdad1115608162aa97"}},{"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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":12050}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b3b6592ab3384535c904a4769998ac862c83e0c22342bfaea2601eaed88499"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 14, cognitive 16): onmessage 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":"packages/app/public/launch/launch.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"10efe1dc7891c6da5f781f3b92a92665f0a1a5f8da8fc07170759e8cdc758f0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAsset (cyclomatic 14, cognitive 16): readAsset 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":"packages/mcp/src/tools/loon-assets.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0c642bad21690ca52bce12ed72190274d1458fe7990672e5f31bec209f67bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveDocument (cyclomatic 14, cognitive 16): saveDocument 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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"83671d8ba97839d3610d77db5146ac7be2ac046a0799fd6323841678f4cb6c9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFocusSelection (cyclomatic 14, cognitive 15): handleFocusSelection has cyclomatic complexity 14 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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c58dd8e5d5cc444e9551a35659e770c7bf7bb62bc619e0f4b743ec3624dda69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPart (cyclomatic 14, cognitive 15): verifyPart has cyclomatic complexity 14 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":"packages/mcp/src/tools/verify.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"65548fbc3ee872d91eae29d7285eb70700f482a9be10ceaa25ee29233a888366"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFlatPattern (cyclomatic 14, cognitive 15): renderFlatPattern has cyclomatic complexity 14 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e987b441bc0d6e840f732d5344563ea79fdc3454f0e340a7df893979b6c83216"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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":"packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7616991c2ee111b702563382137960d67ec21018182b6bc3a37a0c280d67af2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCircuitAnalysis (cyclomatic 14, cognitive 14): runCircuitAnalysis 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":"packages/app/src/lib/circuit-analysis.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db2790ea70a44eba3477bc7304726666b4929b9adb4837a9bbac44584324bf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectFaces (cyclomatic 14, cognitive 14): inspectFaces 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":"packages/mcp/src/tools/faces.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dc046a3711805921d873ee944ab3895656fbc5407d4b299d0e9cea43179645"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDocumentFromPath (cyclomatic 14, cognitive 14): loadDocumentFromPath 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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58af8a4cf7c8ded640c890fc5a52e52c66ffeee183bd976e6deabb90b92b02e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function poseableParts (cyclomatic 14, cognitive 14): poseableParts 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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19a5b08cad9389f0bbcb3080964fa07a68ecca2f21256756832d4b8a96f0e3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexPage (cyclomatic 14, cognitive 13): indexPage 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f280ddb874aabf44f415e5e5c7ac12a7b21baef258fe24e576a9ee92c69307"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measuredValue (cyclomatic 14, cognitive 13): measuredValue 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"880aafebd7e28a0a82fbdd8f82cd549cc51e2945f9164e3ae1ca23dfc46591b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function debit (cyclomatic 14, cognitive 13): debit 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":"packages/mcp/src/fabricate/store.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0d89c7345c0ca0f283fea08224b44397fa7207387a4207ab13fc3ff4bfb4f2"}},{"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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1065fd3ccb712b689011a79ff3605f78b138549e8a6f3bde3066418a9bfd1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addVia (cyclomatic 14, cognitive 13): addVia 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":9544}}}],"partialFingerprints":{"codehealthFindingId/v1":"803f0c813ebeb2774751151071e5f216ec990d3d927b87d5b91b05108b3cd5f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PrinterStatus (cyclomatic 14, cognitive 12): PrinterStatus 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":"packages/app/src/components/print/PrinterStatus.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd70ccaccedd4fa4e08b30cf9596296f74a56a469439d08bd65c382ebfc71583"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeDiffPair (cyclomatic 14, cognitive 12): routeDiffPair 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":4745}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f96d564a017fbecae080b0c38007506eb24a7eda10ac5c7ca1c44a75ccb228e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeMapOptions (cyclomatic 13, cognitive 26): computeMapOptions has cyclomatic complexity 13 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":"packages/app/src/lib/circuit-analysis.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d406a9f227433759fbffa535b789f6b48c0f64009831c2636210835b0538ee7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectionGrid (cyclomatic 13, cognitive 25): projectionGrid has cyclomatic complexity 13 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13627}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae2b4036dfafb109f0870a5b8f7417473bfa4619e928784ab43af50f14dd0e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeLoonModules (cyclomatic 13, cognitive 22): composeLoonModules has cyclomatic complexity 13 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"98609b8e86858ed677ef7ed6ae5df6a9741e4563ae4b47f2ef5a379151224732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderReceiptText (cyclomatic 13, cognitive 21): renderReceiptText has cyclomatic complexity 13 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":"packages/core/src/utils/receipt/render.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dddebca670ba4ba3f78bd705818a858b2eff868a8488ed89ec9abf569338be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) has cyclomatic complexity 13 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":"packages/engine/src/__tests__/kernel-wasm-glue.test.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b359f556a6f6a7fbcb533d2dd78e22460ad1d41e0134128e0c5f98ba8965197"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandPartInstances (cyclomatic 13, cognitive 19): expandPartInstances 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ae498c61651f97e3d071448697956c2ccb891bbde8eba9f6b19beff910fdf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitTaggedEnum (cyclomatic 13, cognitive 19): emitTaggedEnum 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":"scripts/gen-swift-types.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3237927708fbd709ea8b47ae6c16acd0b2e8ef5e6896e3f3ba76f4993c26c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onLoadExample (cyclomatic 13, cognitive 18): onLoadExample 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":"packages/app/src/App.tsx"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"15413863de11f47d84f4336748911c5cc6ab9162ab565333cdde5d0eefc18d37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitWasm (cyclomatic 13, cognitive 18): splitWasm 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":"packages/wasmosis/src/splitter.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18a812bd2a0559c3fae46534becb04967229c26aa86b38798109d87bcd3418b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) 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":"packages/mcp/src/server.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b85f3e1ed9df36a7341a19d1b0427102e4fdbbbc3e37b1ac53b07a1d7eb736"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copperAreaByLayer (cyclomatic 13, cognitive 17): copperAreaByLayer 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13895}}}],"partialFingerprints":{"codehealthFindingId/v1":"393f1e52c92432d0b32526450dba79cb4719e9d58102e96d70ce7420e473c3ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PcbScene (cyclomatic 13, cognitive 16): PcbScene has cyclomatic complexity 13 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":"packages/app/src/components/electronics/pcb3d/PcbScene.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e93b0e8e834c50d8835691f99a99344aa3e396e32269e429ac99d51d6158f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 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":"packages/app/src/hooks/useCanvasRecorder.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a668e6b4fbe84088a13c22c0659abd0a2b8b2efe758e5e0f8c23fade23e1e3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDfm (cyclomatic 13, cognitive 16): runDfm has cyclomatic complexity 13 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":"packages/engine/src/dfm.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b0be64d5f337a5250b2f95d4c3ece6518ee2c17c4ccad5cb83c28a934c859"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b6796f7be4eab2e56917809300df4ce8467359609a0c32e1aca4d4713abd11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importEagle (cyclomatic 13, cognitive 15): importEagle 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":"packages/mcp/src/tools/import-pcb.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ad55cfcc328bc0f1600df1ce1604e0c3aa48aa77c2ca7feaab6f537a6c104d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleRead (cyclomatic 13, cognitive 15): handleRead 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b82d2f677808f75d7db2af19147f82d73bdc68029cd6bef8261b1b4b1e575a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDocument (cyclomatic 13, cognitive 15): loadDocument 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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"860661654b132fc13edf59867597c385bfbf03209c3cb1f74ead6af0b9a35dae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitStruct (cyclomatic 13, cognitive 15): emitStruct 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":"scripts/gen-swift-types.mjs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88ccd62d6be5b6099566f437e5c68c284c98124482885a295623811c4c6206d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf9d2d658a0d3b79c8ef0eab8c857a145d606cb358ccb64e7bf1e6a02c80f85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSequence (cyclomatic 13, cognitive 14): renderSequence has cyclomatic complexity 13 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f49c283dd0c0daf6026ace404b793018d471528663069ed1c19e14547371b9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanGeneratedIR (cyclomatic 13, cognitive 13): cleanGeneratedIR 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":"packages/app/src/lib/browser-inference.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d18badceb9586ae990f5d2d9aa170b9b75e6b6c9b767106b45fe2c1d94fa648"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCircuitTune (cyclomatic 13, cognitive 13): runCircuitTune 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":"packages/app/src/lib/circuit-analysis.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ab9430e756a972f47975bc88417a2b4f99431bdfae56cce01e4bf946148797"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCause (cyclomatic 13, cognitive 13): classifyCause 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":"packages/core/src/utils/receipt/engine.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdfd0d404ff54539e273577b3a07a4f482ed21222f9189ee18187d220b0ef5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bomCsvToStockLines (cyclomatic 13, cognitive 13): bomCsvToStockLines 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82fc513108173e807f80ccb9d0fbeae2d598ec0dd1ff5ab59a94a82c8f0c275"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function predictPrint (cyclomatic 13, cognitive 13): predictPrint 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":"packages/mcp/src/tools/print-check.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d064d26eace906107c6aa066a54f3f2992b7a10d7958b48f6a719be9f092edee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sameUnderSerdeDefaults (cyclomatic 13, cognitive 13): sameUnderSerdeDefaults 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c78633f866024af6d34c232166c388316fd997deb300ae9b40d94f99389d9b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSweep (cyclomatic 13, cognitive 13): parseSweep 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":"packages/mcp/src/tools/sweep.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"302db03943671051f1c3085273c21a18399576f2f19f10ccea80b6c7944a1693"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 13, cognitive 13): walk 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":"scripts/check-engine-boundary.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d791f1d5ac6942d3d502db422b9df3378e279c6260f9c1fd6188494ab534881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPage (cyclomatic 13, cognitive 12): runPage 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bab1f20ba70b9676d8c50a298ec7ad91d19700b7df1d8f0a4631c450e24acb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TuneDialog (cyclomatic 13, cognitive 12): TuneDialog 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e09f0bb18581b8deb4b63ef2c81d74980af5211d1ca9e578092e7fcbd6dab8"}},{"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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"894f1c1c2a2d8c4acf2fe7f0c3f2817457c3dca483d918d9e49b92317ddd0b54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function KernelPulseChip (cyclomatic 13, cognitive 12): KernelPulseChip 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":"packages/app/src/components/footer/KernelPulseChip.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e6701005a7bcb63109fb49bdca1123707918f7ccf5290d5023d1fdc3e461ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modifiersMatch (cyclomatic 13, cognitive 12): modifiersMatch 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":"packages/app/src/lib/camera-controls.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77b0e028f73f31b9e5e9be2c685354533c467cf44712e3626b0d56a71c6d1e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWhenContext (cyclomatic 13, cognitive 12): buildWhenContext 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":"packages/core/src/keybindings/when-context.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feeacbe35bbd5f82e81c8169d81725dfd846df8c1751b7d0b51996f0721dac6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyEntry (cyclomatic 13, cognitive 12): classifyEntry 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9491a0c20dc940d5c5d7470f056529d95818cf8b730cc1eb44c0bbd51d713b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditClearance (cyclomatic 13, cognitive 12): auditClearance 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadc49ad200e514e3b98850b35518e27bb14f303460d84de3b6a3073db83d4da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calcImpedance (cyclomatic 13, cognitive 12): calcImpedance 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":7030}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c655edee49d849ed6c7391c9800adb0470d7b4014b762ee5a65f8a0f7b2ee6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollSimVersion (cyclomatic 13, cognitive 12): pollSimVersion 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33cd6db28a97d1e6dd5abb63836df6725406d77adca4326d96b1fc1900e8dd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ba884912e156af82a5aa2248400f56911a690f0b2c10526684595e462fcb3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DocumentPicker (cyclomatic 13, cognitive 10): DocumentPicker 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"281a6235e7f8a46410a9b989d9cb04d231e19455ded87a84ffd6a814bcd8e1fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 24): (anonymous) has cyclomatic complexity 12 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":"www/src/hero-engine.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a744a13edaa13eea9f421a9c28446feb14212ff92588ef31c171694fdbf140d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateTypeScriptLoader (cyclomatic 12, cognitive 23): generateTypeScriptLoader has cyclomatic complexity 12 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":"packages/wasmosis/src/crate-generator.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4abffafac58ec70e24b844be6b9413b0ad7322aa27059380362d37a777cac23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractEdges (cyclomatic 12, cognitive 22): extractEdges has cyclomatic complexity 12 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":"www/src/hero-engine.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdd135b5de105191ca0917e2f1dc94cd65d48b743b39dbe86f00ad763acc0bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractEdges (cyclomatic 12, cognitive 22): extractEdges has cyclomatic complexity 12 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":"www/src/wireframe.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c994cd539037e8add6c5b5161806b16530d43c6982b66d030adf3c71ccbba570"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) 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":"packages/engine/src/__tests__/kernel-wasm-glue.test.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4bf65c6e972b01b7b559987bf4cecec6aea6a0955138ff79ba936e5a1ee857"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 20): (anonymous) 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":"packages/app/src/hooks/usePhysicsSimulation.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee21a67800f79364b69038cf71116a09b1bcd067dd1bc58c913bdb3e8a471a33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"092fa2927a1fa1668b05d893a6232f6465d90a8e0c715def5fc3bac30e043afa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) 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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e5812f2fa2e4994178bb1745cd726aa98a7b323cd51962d3e62d2701dd4543"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureGroups (cyclomatic 12, cognitive 19): measureGroups 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d606efb3d1f1a1d8f0809e6d0041ea9796af5e9655d7b100235a104f7d9753"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runIdbBackfill (cyclomatic 12, cognitive 18): runIdbBackfill has cyclomatic complexity 12 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":"packages/app/src/lib/backfill.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5acfc141f6fc3bdda1d2130dc76bf13c05efcb321fe8972b746d41a53d1048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aabbOfPositions (cyclomatic 12, cognitive 18): aabbOfPositions has cyclomatic complexity 12 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":"packages/app/src/lib/pcb-interference.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8605a071f9334357e73ba993d9cd0649595965825499cbacabc2361478c5c91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elaborateAll (cyclomatic 12, cognitive 18): elaborateAll has cyclomatic complexity 12 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":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2639a1d2a337d0e4540ca3a6526f0b719cc4499f5b7e9d20a6f178a01e225c9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function anchorPos (cyclomatic 12, cognitive 17): anchorPos 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":"packages/app/src/components/electronics/pcb3d/PcbConstraints3D.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"901a515803dbdae6e4d8d61cd3f67c66acfad78b7148aa4f5faddcb4bbdc7075"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autorouteRatsnest (cyclomatic 12, cognitive 17): autorouteRatsnest 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":"packages/app/src/lib/pcb-autoroute.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"589348145be27822bea78b8933388e8ad0b1fdab5a3b1aacf345a16a779b2211"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotParts (cyclomatic 12, cognitive 17): snapshotParts 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6adf2c7aaa6bf6136a92920ec482935e613b858848624815699f42d650e746"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importStep (cyclomatic 12, cognitive 16): importStep 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":"packages/mcp/src/tools/import.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e9a00cd862e5775f5d0a7bd35bdf7aae6b0f4eb1f1c836d29131681a1240b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectInstance (cyclomatic 12, cognitive 15): selectInstance 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":"apple/VcadApp/scripts/vcad-app-discovery.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9524a1c4790f827dc77924da1ba3914b3372c6d2e4eb4c1355a08d730dc5a9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeDist (cyclomatic 12, cognitive 15): summarizeDist 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba95064251bc984bd0b9f19276370bd6b424ac04e2072ba75d4113d4bda8f3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CircuitTabTools (cyclomatic 12, cognitive 15): CircuitTabTools 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b1ab9ad0601cdf5038342efd4b8bf9c7c6fa5ccb84240c1ceb1da51b3b84c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWheel (cyclomatic 12, cognitive 15): handleWheel 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":"packages/app/src/components/electronics/pcb3d/usePcbCamera.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3d5c8558cf20fbfa3b6363694bf0e567fb0322575d22160ee6b25f0a3ed48f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCompressedField (cyclomatic 12, cognitive 15): loadCompressedField 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":"packages/app/src/lib/compressed-field.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7075a3f128a9b76c7804eb745ae4ed025ab1ee01d385cb244a2a7c5ffda01a1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vcadFileToCloudContent (cyclomatic 12, cognitive 15): vcadFileToCloudContent 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":"packages/app/src/lib/export-all.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b787f9e236ade0e5a076130f4ec153f02e64866b86ff816ff3decf39dac831a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function animate (cyclomatic 12, cognitive 15): animate 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdb31c054f5d234707fce01162ad5d55467a1bf1225968473f2296fb0a8a71f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureOuterDiameter (cyclomatic 12, cognitive 15): measureOuterDiameter 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":"packages/mcp/src/tools/faces.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a6c4e21e6748c2e2e91c1360d14d7466f1a520bbee9ef9da541b13f0b489ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBuild (cyclomatic 12, cognitive 15): runBuild 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1281184bcfefe367d3b4437d3ba88c1d96008661baf1807ca21627258b0f5ce1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adoptPersistedVcadFile (cyclomatic 12, cognitive 14): adoptPersistedVcadFile 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":"packages/app/src/lib/storage.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e7167d1e5a56760c86721acd6b69da423313df6b7d9a0fc2dfe43b7af2dc02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEntry (cyclomatic 12, cognitive 14): buildEntry 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":"packages/core/src/utils/receipt/engine.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc00cc32039f00b017e194deb6a7ac9e00088eec01bf498e885fa172fdf5cdcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 12, cognitive 14): handler 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":"packages/mcp/src/tools/circuit.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"823fff2b528ee312481187023453279f2f2a76217d589315bc57757f89f180ae"}},{"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":"packages/mcp/src/tools/faces.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd65a7e86f43f6af5a4095f9fad2d834d2e8cfd85100bdaee97ba33ffee6e15"}},{"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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b3fa692ea24b8e62f82e505330d9661b7bb86fc78f2ff344dbff6bc004563b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bomCreate (cyclomatic 12, cognitive 13): bomCreate 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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a87041e7b2bda1d370fc540d8f55799511886ef15ffbc1a29a3c46a55ff7be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBand (cyclomatic 12, cognitive 13): parseBand 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed16837c04c426620791177d913c1485fa960df4f10fd4d79acb9c57e2cc68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dfmCheck (cyclomatic 12, cognitive 13): dfmCheck 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":"packages/mcp/src/tools/dfm.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80ed41946eb4c10ea222d4d1025788bcdfa6462c62b13be47ed6e90be1a9a08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 12, cognitive 13): handler 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":"packages/mcp/src/tools/em.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c0fa6298cee3a74433c6045e609deea7e06f3e9bbe2ac7a4b3b665adf6ed40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 12, cognitive 12): handler 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6abc78c25bbfd4472b30bba3a3bab9bf32cbf3346bd7493dec669c7ae4abb4"}},{"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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c4abfa3dc3d3ed071a787e5b349c4387682119e17ab4173173d4df630330e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryAutoFit (cyclomatic 12, cognitive 12): tryAutoFit 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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5295da8436ad40af66a98f89791caab0f6c53da4e966be3db6f0f5d3e2fb114"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callLoonTool (cyclomatic 12, cognitive 12): callLoonTool 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":"packages/mcp/src/tools/loon-macros.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a260e17c79b12c530a01bd8cd4dd99a216099aacb4b9e515b3e67ab87c95f2a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ParameterRow (cyclomatic 12, cognitive 11): ParameterRow 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c286e3226af71dd9dd27e71d3e5dd5e0721205abbc8c5d60af3334342e0a7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SweepProperties (cyclomatic 12, cognitive 11): SweepProperties 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f3590261549d10f8f01c0dbb344be45904c4e28af081e7436be72df268392e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CamPanel (cyclomatic 12, cognitive 11): CamPanel 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":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0967f3a0aa447bda78f3107d6b3a25cfb5b78bc1b7aa4dfa7091c30cfd22ee38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fitToEnclosure (cyclomatic 12, cognitive 11): fitToEnclosure 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":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ae1ec69c4ef7666e9413ab08d592a84d1b1205c4ba9f811846144e3c25af41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ActionResultCard (cyclomatic 12, cognitive 11): ActionResultCard 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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9725471bf7c68b757cf9a756e5ee0c47f55091f515ded6e3a02a615d51f4aebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRetirementRoute (cyclomatic 12, cognitive 11): planRetirementRoute 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":"packages/app/src/lib/retirement.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdf3b37ab18fa510cd0a8c754abdf915c02af5f978e2752667c38f671cdaae3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 11): main 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":"packages/mcp/scripts/test-local-mcp-apps.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08d13926b268e0b63a2251f52174b8fdd37a93b6ed1abc89812b8f8efc36594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleArtifactRequest (cyclomatic 12, cognitive 11): handleArtifactRequest 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":"packages/mcp/src/artifact-route.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"00725abf12a33df8446b5d984120f40178d5cc6d1cb4a3127373418419d7319a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sizeTraceForCurrent (cyclomatic 12, cognitive 11): sizeTraceForCurrent 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9560f998235de8292afaaaa2cc9f9c41927cb122305e39b406b3fb446ab08a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verticalCrossings (cyclomatic 12, cognitive 11): verticalCrossings 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb439b3fdb70b21b58f9bbfc42aa859fcb5828c27fda2d91807fd25f1a17643"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkEnclosureFit (cyclomatic 12, cognitive 11): checkEnclosureFit 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":"packages/mcp/src/tools/enclosure.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89a672645e0668bcce17aeec3f3354e6ebc301c697abdbf2bf7b79b521a293a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parametricNote (cyclomatic 12, cognitive 11): parametricNote 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfe47bef4f603666b1e390d5ad66519f5b832e70ba53d09e79ace0ba2d73af8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function placementFixNext (cyclomatic 12, cognitive 11): placementFixNext 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66818c4945d27d8af2b35e2e2fd77c7abfb8a850d272925dedc2a83986cac1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateDimensionMod (cyclomatic 12, cognitive 11): generateDimensionMod 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":"packages/training/src/conversation.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f4b36c3e5563849b0d587e7b17e80e206cccc3d390a03fb4093acd3a5575f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 11): main 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"527b0e87ddf57abc7fe4bef5d2c4ec17d76d69e9aabff8c605e25337d2e946c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PcbGettingStarted (cyclomatic 12, cognitive 10): PcbGettingStarted 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":"packages/app/src/components/electronics/PcbGettingStarted.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec56ed1001acdfcea4a36aa0387238b4eb596379d3a0c59a52147926037fd8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PrinterSelect (cyclomatic 12, cognitive 10): PrinterSelect 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":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c471100509d2f8d1726d193094800eb6297182b85af3143f88ce1efc70f021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Viewport (cyclomatic 12, cognitive 9): Viewport has cyclomatic complexity 12 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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c36b0af5309bb45c71efa78a30044f585dcbc71d4628535be0cab58783ff52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectPcbSerdeError (cyclomatic 12, cognitive 9): detectPcbSerdeError has cyclomatic complexity 12 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9081ca69679208d7d8e30c3d7fd04b0679730c329ca1897c0975a1fd493ca35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forceDirectedRefine (cyclomatic 11, cognitive 27): forceDirectedRefine has cyclomatic complexity 11 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65aa101e28783bdca170f1a72bcdcc2c520054af517f6a76bf2aacab951e032"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFaceSelected (cyclomatic 11, cognitive 22): handleFaceSelected 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"800ad11f8e726eca1fdc2317da954b85e9a0be66a7dfd081bd567e6c1984574d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSceneBoundingBox (cyclomatic 11, cognitive 22): getSceneBoundingBox 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":"packages/app/src/hooks/useCameraControls.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7518f0e5523c749cf5af0b696c2ffe405d24a7e277feb369d878f7eb1af9ceb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function largestRectangle (cyclomatic 11, cognitive 22): largestRectangle 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13496}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f620923327f8d66009075f7f480832476ea16703deae11296c48757cae0506"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelDisplayName (cyclomatic 11, cognitive 21): modelDisplayName has cyclomatic complexity 11 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aface1374679f29e06aa02f6748cd414cbcce5bfbb725640d050815e5c22f4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitLineRespectingQuotes (cyclomatic 11, cognitive 20): splitLineRespectingQuotes 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":"packages/ir/src/index.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8ffcb3fefd527231001db1d7ccc35e07d2da4c7bff81a67270d4fe6f076153"}},{"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":"packages/training/src/cli.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a90009c4fa183541aab0bc03f6b3ceb27ae68d63d93743de71e792169878e10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) has cyclomatic complexity 11 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da352fc1dc4fd9de10e8fefc039a6e891b60e5d0d89c286ebd80b337db31a39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotSummary (cyclomatic 11, cognitive 16): snapshotSummary 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":"packages/mcp/src/tools/checkpoint.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bdfab09053e733e0bc9f10798417fab97d0bfc914915a71dced0944e76ddb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initEngineLifecycle (cyclomatic 11, cognitive 15): initEngineLifecycle 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":"packages/core/src/engine-lifecycle.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d474c3150bbff21aa83521924813f4b97a13e106db2dbe192950dd9447fcebfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addFromIR (cyclomatic 11, cognitive 15): addFromIR 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc19e7593c5ce77c546c3bada878b837a03b44ce9d4f37d5245dacfac78a04f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setDesignRules (cyclomatic 11, cognitive 15): setDesignRules 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":11097}}}],"partialFingerprints":{"codehealthFindingId/v1":"827eb4aa47036d91fba5eedd37885df1894ea74c467c0ba909a7f6dbe2c58cc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosedCells (cyclomatic 11, cognitive 15): enclosedCells 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a129ed8d3c646f98b02db7e9265b28fc9b42241eb829d86299f224da10db2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectInstance (cyclomatic 11, cognitive 14): selectInstance 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":"packages/mcp/src/app-discovery.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d84d248d8483374003d6347707507426115fadd42d83f7769977b4a79dd4cf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEdits (cyclomatic 11, cognitive 14): applyEdits 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":"packages/mcp/src/tools/batch-edit.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ded892813cfcfa8c6e891cb4d136f5ed035f3094ac75ad003267662cd4ee919"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 11, cognitive 14): handler 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":15676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1783e2ad0d3b79e1ecfe0f18cef24c9a579625fc58a3b52a999478cf92f183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceStatus (cyclomatic 11, cognitive 14): sourceStatus 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":"packages/mcp/src/tools/source-provenance.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0461c5d804bcc42b003074b9d8c805fb0fd46d59fa14b852f477cc7a7839e8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function play (cyclomatic 11, cognitive 14): play 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":"www/src/hero-app.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd91420d31b60c0f649e16646f7fdde8ed8d6f701357bbb340d9fccf4aee7b00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 11, cognitive 13): commit 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":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f372b61608142bddacc1ec86d2abebf7fe77adfe73e1339e13a9d7fda50716"}},{"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":"packages/mcp/src/http.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfb413983df20a1c50cc07f161f17ebdf9cf11d7b727f200502a99b2a10eaeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effectiveDocId (cyclomatic 11, cognitive 13): effectiveDocId 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":"packages/mcp/src/server.ts"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2e5660fd953072385ffc1b7680b68137ac73f326ae31edd59416dd142f7f4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importKicad (cyclomatic 11, cognitive 13): importKicad 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":"packages/mcp/src/tools/import-pcb.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"27895a34347895d987435055b2907e5067878f507e5c4f192dc5b091413684f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPayload (cyclomatic 11, cognitive 13): findPayload 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb570c5046c2568bcb065d7256fd64848738f861edae974055d3ad8427aa8f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchAndRenderGlb (cyclomatic 11, cognitive 13): fetchAndRenderGlb 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbeb08e30ac8789b031569781fd8abba4f24920a9a0ff45d3ae8b112ecc4bde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inlineMeshImports (cyclomatic 11, cognitive 12): inlineMeshImports 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":"packages/app/src/lib/urdf-meshes.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c76a51b2f3695ad7d6d2c98e32f847a2fcc509c4a5fd43e87b5dd1aa9849c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeDescribeScene (cyclomatic 11, cognitive 12): executeDescribeScene 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdead9c065893cc5af2d4964f3c6b5b3d354af212e726eb74f605eeff693ca7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffViolations (cyclomatic 11, cognitive 12): diffViolations 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":"packages/core/src/utils/receipt/engine.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea5cc5884e55fd27ab0b0b357002c1750ea3f52259ac11b92401ea2c288b879"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quote (cyclomatic 11, cognitive 12): quote 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":"packages/mcp/src/fabricate/broker.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"482436487406ace43f25d4cd18452f9646e3ca5412f53c8e943fc8d3345e971d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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":"packages/mcp/src/server.ts"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5a68784063944d2a8858d3916b98383e2e4f7304a9031ffc7172047802efb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findReceipt (cyclomatic 11, cognitive 12): findReceipt 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"da013c34125a6721792f6fd7aa5993c7707dc40b5f2f74402064a0cd8d6918f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit (cyclomatic 11, cognitive 12): emit 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":"scripts/gen-swift-types.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c1b6d8de6af92109d9e99bb329f4b14a88d2fe34b4e7dafd58da774aada61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeCheck (cyclomatic 11, cognitive 11): describeCheck 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3957717085e57e6384abfde3a46e0f174ed639c1b680f3a25dfc83e7c5381f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 11, cognitive 11): handleKeyDown 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"096d078146a83893bc186bfe48599229d6f245fbb8768f23df79501cecac406c"}},{"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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5854918895a0ed23637680d38e58050d993d61a5e9137af1080472d9a1afd05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paramFields (cyclomatic 11, cognitive 11): paramFields 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9934ae87a03f1648fade762220fcf6a01e7b6beacd7d423c9e3fef0b084c06"}},{"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":"packages/app/src/components/DimensionOverlay.tsx"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"570cc0551b37a79a7e08583ed1e9b942d9c3def5c0b194e27c01943a4253c02f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MoreDropdown (cyclomatic 11, cognitive 10): MoreDropdown 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":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"932885785fe1ced373a2091c95fc29f0366eb668a822e39feaa76bbbaee55d82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseUsageResponse (cyclomatic 11, cognitive 10): parseUsageResponse 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":"packages/core/src/stores/billing-store.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08c698c4817af80604760419fbf1c281eda995fb21314ec26d0920f12772031"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addTextEmbroidery (cyclomatic 11, cognitive 10): addTextEmbroidery 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99f8b35dec9c8f4e17086102a32fbed6792931044be34f3b687ecd3b022c43a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapLegacyWasmResult (cyclomatic 11, cognitive 10): wrapLegacyWasmResult 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":"packages/core/src/utils/save-load.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb863d82510769a1f0f8841c6e271d2cd64b74873eac5ef1c0d6f8861d84ebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 10): constructor 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":"packages/engine/src/physics.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d019138a34cfb998f56906a0bf70ac2e2e6657dcd39439e1158d109b7592f20f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushPose (cyclomatic 11, cognitive 10): pushPose 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":"packages/mcp/src/app-link.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2e411786829c22dab219a3e3e85bb6bb4f4993f3edcee3239b9ebf812fb664"}},{"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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"db38f6ef08a1063c749a1c890f59e5068960a27a386567ec63d1f9ad3eb1e992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffPcbElements (cyclomatic 11, cognitive 10): diffPcbElements 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":10911}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a59debc16f8139417b5f24adf4a5dbd5f326e3b6d045b86c921c043a6574b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packageHeightMm (cyclomatic 11, cognitive 10): packageHeightMm 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":13986}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bc99c5e0653294439e86a2fac8fc8e7c78cf425fbbbdf316dee7844a4bdedb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushSelectionContext (cyclomatic 11, cognitive 10): pushSelectionContext 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c483b2c3b94cb16e665d06c941839512e877776e68e38dbf020d1182cd9ef39f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSimReadout (cyclomatic 11, cognitive 10): updateSimReadout 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568c23d887f2d8e4f3c0bc8f28ccfcc99248717a0cf8862f6670b76fc1b6590"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushSimContext (cyclomatic 11, cognitive 10): pushSimContext 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed30749f601776018d05c9185300fa8c2f4b4b6328ed5eda161d1b38bd902b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderInlineDimensions (cyclomatic 11, cognitive 9): renderInlineDimensions 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf40c48ebbc56b362d5c5bdd5de41129e93aea46618cee98d3868089ac9cb11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Breadcrumb (cyclomatic 11, cognitive 9): Breadcrumb 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46f9ad10d901be517dea6d57c603fe49185552a61b34bcaeb06db771d18b254"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endpoint (cyclomatic 11, cognitive 9): endpoint 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":"packages/mcp/src/app-link.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebf344c1379af08e37c1277bef05dd4b5364c8261601bb21ac05be3bec00e9e"}},{"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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"3822486920b9b62de2156ecdf64419f32a85a7280edff9e1a27e8d5df3603e00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateFeatureMod (cyclomatic 11, cognitive 9): generateFeatureMod 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":"packages/training/src/conversation.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8d1945424acd108c391088639737c90b0491ce817037b7e18d1c1f7d9fd035"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/ecad.ts: 15389 lines of code: packages/mcp/src/tools/ecad.ts has 15389 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":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee7e585afd570ce63cd2ad2e0affb02165a4ea3b070a7369891b75f878c5459"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/engine/src/index.ts: 3010 lines of code: packages/engine/src/index.ts has 3010 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":"packages/engine/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db8eb1f09e9034efd024e37d9fafb3cd576fbf20575f7156a664e53437362a"}},{"ruleId":"R3","level":"warning","message":{"text":"mecheval/leaderboard/src/build.ts: 2470 lines of code: mecheval/leaderboard/src/build.ts has 2470 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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b03a36f8a847c0e8b2bf694dd335e39bf830a3efd9ec5981bde2a3c75da7253"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/viewer-app/main.ts: 2321 lines of code: packages/mcp/viewer-app/main.ts has 2321 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":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6188cac61c356b687cf7040b20162fdda6427463a79eb50530c542e086411f8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/stores/document-store.ts: 2150 lines of code: packages/core/src/stores/document-store.ts has 2150 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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7649f02c4835ce4c51322f31a3d33d5ce6cc7d7e55451005508aad4404a17d3b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/server.ts: 1953 lines of code: packages/mcp/src/server.ts has 1953 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":"packages/mcp/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8a6ce00912eec558f33d398aec825eddddb2a763a8288e9c52f964022a443d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/ViewportContent.tsx: 1948 lines of code: packages/app/src/components/ViewportContent.tsx has 1948 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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb137198ad80bc990f60aed5a97470675411e8b22b9104c7792993a4e1240f7d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/engine/src/ecad.ts: 1842 lines of code: packages/engine/src/ecad.ts has 1842 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":"packages/engine/src/ecad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2add453a9b506d700747ace673b783a44f19e3a442d1ab9bfb45d11253e3bd82"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/PropertyPanel.tsx: 1682 lines of code: packages/app/src/components/PropertyPanel.tsx has 1682 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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb8ea4297bc3805569440dddb78c638fce386317e790ad00466abffd5c82ebb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/render.ts: 1448 lines of code: packages/mcp/src/tools/render.ts has 1448 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":"packages/mcp/src/tools/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf7ecd2a7b4f8c6971bef233c6b82cfec7a04df6c2696684f381d7f8eca191"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ir/src/index.ts: 1426 lines of code: packages/ir/src/index.ts has 1426 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":"packages/ir/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63b7db5fd1fad9db8784da134843692010d6d7c543a347856364b37a1aa7a32"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/animate.ts: 1389 lines of code: packages/mcp/src/tools/animate.ts has 1389 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":"packages/mcp/src/tools/animate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"043f9026a9669541f64d31739f46446df05de4e593f83765c7d18e9a87bef243"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/FeatureTree.tsx: 1223 lines of code: packages/app/src/components/FeatureTree.tsx has 1223 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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"216437591020784b585baeecc39a04f615d93ef6d31209d43e4ad0ee4b99b3e0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/electronics/SchematicCanvas.tsx: 1218 lines of code: packages/app/src/components/electronics/SchematicCanvas.tsx has 1218 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":"packages/app/src/components/electronics/SchematicCanvas.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aec8dcbcae878642ecc1b2eb8ddbef22c573bc166433a4d2067a1baaa1553a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/hooks/useToolDefinitions.tsx: 1158 lines of code: packages/app/src/hooks/useToolDefinitions.tsx has 1158 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":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4e73476e97acdc2469b398d7f5ea001ac43c34fd6ade1a92f2d1495a2a255b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/engine/src/evaluate.ts: 1154 lines of code: packages/engine/src/evaluate.ts has 1154 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":"packages/engine/src/evaluate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a86b8f6f9f8e81cdce35cec93427180cd9601aa7993620cc5d53059b08f76cb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/clearance.ts: 1145 lines of code: packages/mcp/src/tools/clearance.ts has 1145 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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b366ed05ea35999cae602ce2dadc0a40f84bb479bdda362f7858bb457e7af84"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/gym.ts: 1141 lines of code: packages/mcp/src/tools/gym.ts has 1141 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":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee4b7bef97f640f65f8b049c79255d62d1f57fd50f7dd6e4a98f7e4f27becf3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/DrawingView.tsx: 1113 lines of code: packages/app/src/components/DrawingView.tsx has 1113 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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92db0def4eba393c63d380d47a37ba36b99b6ade54a1301ae905f34ea2e1d82"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/protocol-2026.ts: 1104 lines of code: packages/mcp/src/protocol-2026.ts has 1104 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":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb075f8f9bb714e9bc364d321ccce230b22e50ff9b2a3cd2e3b2c028ef31e149"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/claims-ledger.ts: 1092 lines of code: packages/mcp/src/tools/claims-ledger.ts has 1092 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":"packages/mcp/src/tools/claims-ledger.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a7369dc4e798347bf96fb6110a715aaf9d9ccb9b37aa8371e1699e16f8f61a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/training/src/cli.ts: 1040 lines of code: packages/training/src/cli.ts has 1040 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":"packages/training/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e52889101809962d607299e330fd20a278122543f4f0d6858b42c67af1965df"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/SceneMesh.tsx: 1024 lines of code: packages/app/src/components/SceneMesh.tsx has 1024 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":"packages/app/src/components/SceneMesh.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7052a1765b7ae74bf3c7d2eb026cf78ed7b43c4cb868f0a2217cd92fbeac5da8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/App.tsx: 997 lines of code: packages/app/src/App.tsx has 997 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":"packages/app/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"470306a17a03ef25a05ac2a240b099d4bd8c70551899f77174f3102bd3010a23"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/SketchPlane3D.tsx: 945 lines of code: packages/app/src/components/SketchPlane3D.tsx has 945 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":"packages/app/src/components/SketchPlane3D.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300d123ae2110b106bf7536198c1e9827265600556476845aa12c39f7708e14f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/registry-dispatch.ts: 901 lines of code: packages/mcp/src/tools/registry-dispatch.ts has 901 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":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ba809bc22413138d4e4c1f10322c8bd020fff19e39e31b34cf05bd3d9e8cc4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/engine/src/sheet-metal.ts: 895 lines of code: packages/engine/src/sheet-metal.ts has 895 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":"packages/engine/src/sheet-metal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aebc0de9f77187bedb1dfe6978225b2935a6eba47c1c54a8f887e994e8c32ec"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/session.ts: 818 lines of code: packages/mcp/src/tools/session.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":"packages/mcp/src/tools/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e1069af31e7887ae618b600a68c169afe1e4e6fc4801d638bc74ed0f9c1368"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/commands.ts: 809 lines of code: packages/core/src/commands.ts has 809 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":"packages/core/src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9685e1ca2461d35da8fce8f4b73f57d25f2d88927bb54afb07ff4b8bf5d8638d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/RayTracedViewport.tsx: 775 lines of code: packages/app/src/components/RayTracedViewport.tsx 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":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7948d4eb76a23d7256f2566fd99216e6850440adb629bc4314d3f8256ba097a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/sheet-metal.ts: 770 lines of code: packages/mcp/src/tools/sheet-metal.ts has 770 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":"packages/mcp/src/tools/sheet-metal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4736858a9b4eebaea2f8bb7f786da1edc28c3efd8e492c48491fa43cd0dac07"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/bom.ts: 755 lines of code: packages/mcp/src/tools/bom.ts has 755 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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76aedc07aa01aea2cc596b12873e42a880c33ba1e69fa3bf3086c4c40ffe4132"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/part-stock.ts: 752 lines of code: packages/mcp/src/tools/part-stock.ts has 752 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":"packages/mcp/src/tools/part-stock.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fa65647452f77a1aff41c034c9b337a962fa6e309d03472fedd31e33e16b6c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/utils/save-load.ts: 723 lines of code: packages/core/src/utils/save-load.ts has 723 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":"packages/core/src/utils/save-load.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4656fed975383ff9cef06d129207e0335f6a02523aadb8b2e02994823bdb694d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/stores/sketch-store.ts: 722 lines of code: packages/core/src/stores/sketch-store.ts has 722 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":"packages/core/src/stores/sketch-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00bdccf6dcc829a5e213914a19adc6430762c5a2d46b3755f39edd39a652971"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/Header.tsx: 703 lines of code: packages/app/src/components/Header.tsx has 703 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":"packages/app/src/components/Header.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda8d4401cb0b97a0e43c5b5a5fdaed3dff749e2e3f8e1f9d52888f2d4e131ff"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/preview.ts: 689 lines of code: packages/mcp/src/tools/preview.ts has 689 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":"packages/mcp/src/tools/preview.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a922d8df3fd94243274e16ec048e08d4abf2d0c01f8b51581b719f2fd1c7b28"}},{"ruleId":"R3","level":"warning","message":{"text":"www/public/kit/gallery.js: 687 lines of code: www/public/kit/gallery.js has 687 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":"www/public/kit/gallery.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edae69efde335fee16e95237322ca764ba8200ddb0f1ce4b1e26df05167f9d69"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/parameters.ts: 655 lines of code: packages/mcp/src/tools/parameters.ts has 655 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":"packages/mcp/src/tools/parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8765b856ff8085985c5a1ae2bf9ec531a2c0c5473ca9004d7c1cb9ea15729c4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/AnalyzePanel.tsx: 653 lines of code: packages/app/src/components/AnalyzePanel.tsx has 653 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":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"230f3ee2de01ef44e56861b339ee1adbfd2a191bbc1280b6ec5a6db03f54567c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/wasmosis/src/source-parser.ts: 651 lines of code: packages/wasmosis/src/source-parser.ts 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":"packages/wasmosis/src/source-parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e9c8151bf8e4010b2fc1fc18ced7dc4b0716b0ce3a53dab24df470cb21cc32"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/wasmosis/src/cli.ts: 649 lines of code: packages/wasmosis/src/cli.ts has 649 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":"packages/wasmosis/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4f694449d489716249eac8445f40a75dbd17dc09d1558a9d6702b1e7a481ce"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/SketchPropertyPanel.tsx: 612 lines of code: packages/app/src/components/SketchPropertyPanel.tsx has 612 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":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf81d3b2767974f0146bb726d055acae6d3eb438f4e6c141c82d659c4a6cea0a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/stores/electronics-store.ts: 608 lines of code: packages/app/src/stores/electronics-store.ts has 608 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":"packages/app/src/stores/electronics-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395bc0e9d3020afb85f81081ac7219a2b38e864ffce7441b2e806b8ddbe4045c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/public/launch/launch.js: 605 lines of code: packages/app/public/launch/launch.js has 605 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":"packages/app/public/launch/launch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f56da36cf4f5a3f1e9338612f457b8a0af29cdbb482c6e92e2399830ebabbb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/atoms.ts: 598 lines of code: packages/mcp/src/tools/atoms.ts has 598 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":"packages/mcp/src/tools/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"384ef6eb37a22ba8bb98ace65f2d385b60484f17b8c840128ada4eb0e2580b57"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/commands/registry.ts: 591 lines of code: packages/core/src/commands/registry.ts has 591 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":"packages/core/src/commands/registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74bc6aa3d6ac8f7401a5151fe4a1ea733c2738768e92906d71671270d906999"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/CommandPalette.tsx: 583 lines of code: packages/app/src/components/CommandPalette.tsx has 583 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":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7828856850e726d7f844800fefe4b79683da81eb3434cf92020d10f8f875696"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/commands/executors.ts: 572 lines of code: packages/core/src/commands/executors.ts has 572 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":"packages/core/src/commands/executors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f073d5766c383b96e5bc767eb6723a271c09c10a112c4a63c201dfbd8b8594"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/loon.ts: 558 lines of code: packages/mcp/src/tools/loon.ts has 558 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":"packages/mcp/src/tools/loon.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee883574b4b7fd8e34719893dc991124c2864df8b13eef1d2a3b75d267284bb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/cam/OperationList.tsx: 554 lines of code: packages/app/src/components/cam/OperationList.tsx 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":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c0523040050159ca4fa5f1cca0648c26e13662fd5f7f3d78dc2cacafe5860a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/order.ts: 540 lines of code: packages/mcp/src/tools/order.ts has 540 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":"packages/mcp/src/tools/order.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c17a74bab578b78b362443489fbfdc2eb978e3df7c67bbd24a4ae8856a5ee"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/import-pcb.ts: 537 lines of code: packages/mcp/src/tools/import-pcb.ts has 537 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":"packages/mcp/src/tools/import-pcb.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b07565116226cc1f4e9a30e19cfe8ca1af012faf2a47b6a49c76e056542704d"}},{"ruleId":"R3","level":"warning","message":{"text":"mecheval/harness/src/solvers/claude-mcp.ts: 516 lines of code: mecheval/harness/src/solvers/claude-mcp.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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b053ea1926a75669994d4013b27205b1a09254c32b6d1d4b5c619575593da5ff"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/hooks/useAppCommands.ts: 515 lines of code: packages/app/src/hooks/useAppCommands.ts has 515 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":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917b8d293512183d4776373d140108f00c285531563b4b13219bf0b17c806e3e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/wasmosis/src/crate-generator.ts: 512 lines of code: packages/wasmosis/src/crate-generator.ts has 512 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":"packages/wasmosis/src/crate-generator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37de82a862f5d5a8f9c0e2140b47313bcc166ee36a21b0244ac39466ba66b9a6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/em.ts: 510 lines of code: packages/mcp/src/tools/em.ts 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":"packages/mcp/src/tools/em.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8055518488f9cc4a677e6091134f9d041a4c3d8a9d0a513abfb9f15df13b5190"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/thermal.ts: 510 lines of code: packages/mcp/src/tools/thermal.ts 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":"packages/mcp/src/tools/thermal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7349818113f99d5cfbaa16cbf4c3f7090b03aff84e774978f01e901cbb7b0bca"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/structure.ts: 508 lines of code: packages/mcp/src/tools/structure.ts 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":"packages/mcp/src/tools/structure.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"719b443260140fb808c78ba2fcca7ccbe901cd58fb7fc4f0aa6badfa1ac6887e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/faces.ts: 507 lines of code: packages/mcp/src/tools/faces.ts has 507 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":"packages/mcp/src/tools/faces.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e41130013476034c615da1af761f32dbd3a45e1b84c42cd72ce49db7b58fc6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/receipt-unified.ts: 505 lines of code: packages/mcp/src/receipt-unified.ts has 505 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":"packages/mcp/src/receipt-unified.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec17fab9b554ebdf59d5e6921478bb045df6a1ec666e5512894d9ef647b44ac2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/stores/ui-store.ts: 503 lines of code: packages/core/src/stores/ui-store.ts has 503 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":"packages/core/src/stores/ui-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4706b270c01b47666852ae488c5ee673c593e215b83d8015f8a8124c8dff6ad7"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/ParametersPanel.tsx: 498 lines of code: packages/app/src/components/ParametersPanel.tsx has 498 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":"packages/app/src/components/ParametersPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9283082939663583e4405d450ef0de8e9f0b8366ff4317a37ef9d7726fa946a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/enclosure.ts: 497 lines of code: packages/mcp/src/tools/enclosure.ts has 497 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":"packages/mcp/src/tools/enclosure.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f2892380cbb368f36044d388b72abbe1a797139dd3e0a04461f5682a08ef7e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/next-actions.ts: 497 lines of code: packages/mcp/src/tools/next-actions.ts has 497 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":"packages/mcp/src/tools/next-actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"545f3c1847e8e43289e88a69049e69fc9d990673be44ddea27b667d6fce2b05f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/record.ts: 495 lines of code: packages/mcp/src/tools/record.ts has 495 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":"packages/mcp/src/tools/record.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"298ca63743dc313d618b4d0572c578a56bce790873512eba1c90a904aa13af22"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/integrity.ts: 491 lines of code: packages/mcp/src/tools/integrity.ts has 491 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":"packages/mcp/src/tools/integrity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd474992fd3419663fe504d21c9804517d6b76d3545972b31a2f3962e9f8f88"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/session-core.ts: 491 lines of code: packages/mcp/src/tools/session-core.ts has 491 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":"packages/mcp/src/tools/session-core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1caca09ad3f9411041d05b869b74f6a6af7c729714118afdc4695af4e39cecf"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/SheetMetalView.tsx: 486 lines of code: packages/app/src/components/SheetMetalView.tsx has 486 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":"packages/app/src/components/SheetMetalView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d46716516409fc892743b29bb1702e458ce0e8428baafd09606406430bca48e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/training/src/annotate.ts: 485 lines of code: packages/training/src/annotate.ts has 485 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":"packages/training/src/annotate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e257749c66d828ed29830978e80af04450dbf5e77fe39bd7db1f3bec5fe3cc1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/app-link.ts: 478 lines of code: packages/mcp/src/app-link.ts has 478 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":"packages/mcp/src/app-link.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d7e20573056274d039c6bc94f3327bfff9e4f9546926756da7741a069b6491"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/particle.ts: 478 lines of code: packages/mcp/src/tools/particle.ts has 478 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":"packages/mcp/src/tools/particle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e992c6e2367c43252873cdd1f423a355d302f916e2eddfa38752cf4a27b9bf4f"}},{"ruleId":"R3","level":"warning","message":{"text":"www/src/hero-engine.js: 478 lines of code: www/src/hero-engine.js has 478 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":"www/src/hero-engine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5194a27407c2be9a488a38bc804e63493991ffa275b1d517d7e3fa481ea4d2e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/loon-macros.ts: 475 lines of code: packages/mcp/src/tools/loon-macros.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":"packages/mcp/src/tools/loon-macros.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dc17376b8fa63dc6d313c25c96e5b943ac698b9585d4032516abd0949f3e1e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/sketch-math.ts: 473 lines of code: packages/core/src/sketch-math.ts has 473 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":"packages/core/src/sketch-math.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed10f5116acf9f95db9e9ff0c1ff43d363eb387a0f537296ec4d40844ea1573a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/DocumentPicker.tsx: 472 lines of code: packages/app/src/components/DocumentPicker.tsx 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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f916a9e491469cdcead2573abd1023901bb38d26dfb65ea04337530771adb8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/electronics/CircuitTabTools.tsx: 471 lines of code: packages/app/src/components/electronics/CircuitTabTools.tsx has 471 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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f771576a33a455d1131dd89151455b00f32a16e53bde4f72c998ec097a5b921"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/measure.ts: 464 lines of code: packages/mcp/src/tools/measure.ts 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":"packages/mcp/src/tools/measure.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f6a157f34c360dabe916fe1945ec4c2dc0dec44001686d0fb26c768cf18350"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/dfm.ts: 461 lines of code: packages/mcp/src/tools/dfm.ts has 461 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":"packages/mcp/src/tools/dfm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1a59777ce23992831c46330a0d42880db171c62e0dae36bf900d27670e7840"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/engine/src/physics.ts: 459 lines of code: packages/engine/src/physics.ts has 459 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":"packages/engine/src/physics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3032a23b064bae6d29430ca9555101db69f1df77c88169d5c2e7fe2aa9e9e2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/stores/notification-store.ts: 453 lines of code: packages/app/src/stores/notification-store.ts 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":"packages/app/src/stores/notification-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"440e1331eda2c27f7b8bb5d93d2d098831f4d1d81cdf19c52dac2eacec50876b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/lib/bootstrap.ts: 450 lines of code: packages/app/src/lib/bootstrap.ts has 450 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":"packages/app/src/lib/bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"705a04df3d8ea85901ac774a10f8547dd8577e0282559eb4159eb6fcabdd5281"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/hooks/useKeyboardShortcuts.ts: 445 lines of code: packages/app/src/hooks/useKeyboardShortcuts.ts has 445 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":"packages/app/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ab9328890d30ebcd496c40b6586ad6dc280e946cc4af33522118c4aaefd29d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/print/PrintPanel.tsx: 443 lines of code: packages/app/src/components/print/PrintPanel.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":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48956043dcb9f14d96cdc57b73d694a424a783d64ef2a683746778171bed27e6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/DfmDrawer.tsx: 440 lines of code: packages/app/src/components/DfmDrawer.tsx has 440 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":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab1a0852bcf5635dd09e06f0513df7e820680c6fb359ad8a75357d08599424f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/stores/chat-store.ts: 434 lines of code: packages/core/src/stores/chat-store.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":"packages/core/src/stores/chat-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c676e57a06db32a4482362c36e97a27942e9975a0d08a939583252b71529c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/Viewport.tsx: 428 lines of code: packages/app/src/components/Viewport.tsx has 428 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":"packages/app/src/components/Viewport.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61919126e64ecea0f976d6b8ac5efa7065b91e21179483cfbdbd7db6479a490"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/StatusBar.tsx: 426 lines of code: packages/app/src/components/StatusBar.tsx has 426 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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b547d1086a9d12e6b2d445953344b2be7a7a7df94bc6d1cb02e9860d43288c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/data/materials.ts: 424 lines of code: packages/app/src/data/materials.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":"packages/app/src/data/materials.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d23ce4b45259a8fcc28b267b432da0b3a0701ae6f77cbc0b75f8067830fa94"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/topopt.ts: 423 lines of code: packages/mcp/src/tools/topopt.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":"packages/mcp/src/tools/topopt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7103472b2053b4c6548dc3eb2abee2fe497aeb5c64aeadcaf648799fa12e008"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/wasmosis/src/splitter.ts: 421 lines of code: packages/wasmosis/src/splitter.ts has 421 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":"packages/wasmosis/src/splitter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"490ddbd9aa2f6ee69abf97312183a66174a4ae591ff6b57a4b8151497fedeff1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/core/src/types.ts: 420 lines of code: packages/core/src/types.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":"packages/core/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8341917e4df90966c6cf666a0b44db8458c6a9a5622a28a174af3a7717a475"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx: 417 lines of code: packages/app/src/components/electronics/CircuitAnalysisPanel.tsx 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":"packages/app/src/components/electronics/CircuitAnalysisPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7822bae348a88369a29b3933ba12a229312b38b64d0d2dcca7cf55f84568e46"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/mcp/src/tools/joint-range.ts: 413 lines of code: packages/mcp/src/tools/joint-range.ts has 413 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":"packages/mcp/src/tools/joint-range.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5573be7a429a260c2c060ad364204e1922d0c79372279dac100a16cb52056aa0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/app/src/stores/analyze-store.ts: 405 lines of code: packages/app/src/stores/analyze-store.ts has 405 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":"packages/app/src/stores/analyze-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57903a49f081f5e478cdcdb282e95a75eae9648c12fb609b004fe69dadaace72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"557b7af7dfcc41060206758051875831967229d9d44a4982c89c69ed114cf19a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73156d4359ec83adc8b7a72c68f0868c8f28d1d1b0050d5b382b916291a31a84"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48c5b00c25510842edadfc999a7caff286dd56cff11f9658889c6293e4efcf2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd1a3104ee7c0ae7d3040b4fd8921bbfad7e934b9a4ba6706eced6a25a86cb2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useToolDefinitions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f49693a378a9ea9b4119b687b1432500cfc9a05ef24aa27248f82fa3b8e9ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7321b31b73ca1435c709a83af8520f4ab40ae7ca3dabc43c068cb7263d59d7c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/wasmosis/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6203c04f60789143ddd8c936bcd54b54c9a7be63cfe353309b7137aa10a9975"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/Header.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a6fd494802c38f563eacb3c50e9552e175a2b526e001b1af2414712786b209"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/leaderboard/scripts/gen-task-refs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3840009ab79ebd7b587773a652e935fe8e38170f7a519985debf81768faaf64"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/public/kit/gallery.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b63613da0790731ecb93379369bbd8eb745f4a4d234b5fdec122dadc57cb654"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AnalyzePanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"859f0534ba52f21afeebf58a06e7aa3ef948d0ce85022d8f3859ca9dc82d880a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SketchPropertyPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe518d3bc03d0288d64e486283471d21ad595f7f26d5933d1a0bdc7d3d78591"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CommandPalette.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d084245d5f6ab35a437ebde0394219bc8bac9e8d3d6b4b43ff5c9b5dde04e18"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/launch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1613031656c642503ec08da0e58f31061a779ddade6b6c6e31c621cbdc3dff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/OperationList.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bf90d01fef22004b53149b97ca45158edeccb81abe46567c689ad1ea029015"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAppCommands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87934e85bda551d833f673882cddf868d2ecf5091d84fef14460c80d9c5073ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4a68d69097f46a8eea07362e70c6b136e91ddbb02e0cbc7f2aaec301bcc755"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/hero-engine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baef3f919671da800fbf718db7fdca869914fd9b3253ecdff1229fa921e4ab01"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SheetMetalView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d08d097705990f96a469e3d4db363a2a88a7ea1f1be61f7149a61e571498aaf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/wasmosis/src/splitter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1d16b7c30784560a91b0f65f51b97199a9dfb5fb8381ed73f12effd5bcea72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd112c475836ed11c3491381e6ca7290254c1e0031ef50d0adcb475cfd97ad1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8e00317093c74ac29e6eaf6c9846044d07ed711598a86dcbc99d8b90cdfe56"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1f764097b77eeee4dec294988fc59f81e6de3a7865eb6fd688d4babfec6bc8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9dbde4f9d9becc84fcabaf19041632480a5a00d31e827e18c051265cbee95d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DfmDrawer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fffabc4410f9eedaeba2d90a57866a5e7ef1eace3365f3f35ac6ebf6242018"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5bbbea9ed9ee5f847a282bcfe7a845a7cd2efffea8983427c62cd430377d15"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b103683d1737dcb4d8e5483f4e9bd89c884e0e56ec95a8cdd999994ebf52eda6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/InlineOnboarding.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fe65a9429a30eed5627aef8d049a1da61ea9f27f8788f71f2ebbe4c2dd9f28"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/tree/InlineDimensions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf95643f039e62b362d4fcad7d1c5cf75ed506be3db0e8a0d38fcfdb0f548fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/cam-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48433387421308390f4176307f7bcffb736baa8aa0ca5fb28c41152a7290025d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/browser-inference.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"638fabd947838a842dc08ac50db066202ffe62b3538769d2523d1498e326d9e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/matrix-cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be9661bf3809252ad091e678b659a513ceb78b5f531efaa7f71db3168878b60"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"605141b160c0641f78f0f38159b6b740bfd6c94fff382df4efc8e09896e10024"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ToolPalette.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"492905fdf394cdb39cee267b69091e07f0ae079f7653763a3e5ba68c9b081389"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glockenspiel/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c48fa263392bd7877f97e55dedd401bab6777e89f4eeeb7b46c78426c621c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b78db74c68da2b3e309f15391f36f15dde44ff38c342883c35513bb7b9e8e4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/usePcbCamera.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c6ee005c11755852adda5e038a9457856a64399a0123e91ce4215c7d8ecb95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3496786ba0a42342a8ec195d8a582fde8ee85342a60637bd9c3a51ebcd7469"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/QuotePanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"164c654ba80cb3f08b2113041ac5d5204ce52620e2550b634c29c6e385837ad5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d70f7f1d6f7c7ea60739bbbe383b81decc160c898ac79aa17dcdd148ca096d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/scrub-input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d730c9c8df06f7747ca4b4fc99b2d1abeadea669d698ce349da23a0c81e767b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63ab76f59dbf134262531432908c2cfd2025fc9aecad0741d82d5eb447d9301"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/ElectronicsPanelHeader.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62871e08cfbe0e6cfc4c0831500029ead649aff01337263a2e3a73a9280ee5e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/urdf-meshes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d91cfdb66b4dfc0017d46c9c7f1e52989510a1263c55b235a206894e10bf3b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/scripts/gen-pcb-task-refs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c67c48cc6f55cf098ccc8e41dc0b5d1a3e291dddb9e9863c01e423a5b5d1e64"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/hero-app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab75da35a35bce54028713dcc2272db1b7f54ccb37160e0f6e7542f596b4a636"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/RaytraceChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9aa01d56abdfdff27cf2a1e436271cf72ff97556b4424076df864c263cb013"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/KeyboardPrefsPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ee2595a529f307bf23c12b19a075ca464573d872b12b1cabcda06846df7468"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/slicer-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e11cf0985271353c719a15d790dbaeb03992d945311f052e48c2389c7ea24f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea72bdcdae93c619acdb612b14a5b2360cf93d6ff5cc716778112cfa92f9863"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/wineglass.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5830f735558a7e3df946605f7772034a7cf0bed6245a7158695259b381f8516"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DrawingToolbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57f52dbe2cba31ce0fc60f9dcd47e2f5188d5c58207cae81dcb30eef1d57dc8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialSelector.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c694a33e23f28ecb6f92f65f8e19c4e008e6f716792510d1fc93d59a3964be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baefb3b4c28cbc7ea40d672ca33c17a3ee4f5cb2ede36ed0ec4ecdaab0f0669"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/slicer-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f22f705bf088081fedd2b68b0623c17a44c5cbead8e77237f83add598a8dc2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glockenspiel/geometry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e042eab111530776151a18f78f605c5239bcd2cb775bfdce218b38999435db8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/LogViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ab828fc618a2eecbd47a7c1930bdb7bb364821808c2cd0f31ff22c645d7e74"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/pass_k.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2ef8e47f2bbe9decbc5fea9002103342563b089ba95dcc2b190f91c1ce9e7c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/dropdown-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe692c3966f5db3b01e5a39e8d5d1a211aba24d9e0dd6f7264a330d5bd55e8e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/LegalPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58a1873219e6c683c4cf0bd2f5da9d6ac8cd238d16f7660702b4eedc3668545"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/NewPcbDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c076d93483ba9f32f3c8b10020b24daa7d5ab907a98d2a5ecef13cb9b7befeb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/embroidery/EmbroideryProperties.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e858da58345c45d9f09ae8fdd9ec0199035ebc12dcf99ef970d888842a6d53ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/DocTitle.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98284ec41dd5274598065b083649fbc15d68475a8cbeb10f9d864c60ca675a63"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/mobile/MobileShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"156dbb4400304e424a1e541642302049f6322b96a29fa8b1477467778b56135e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddb931dc6353ae72559d1e2a0912ff6a45d702086c110f970c5982a15f3aefb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ContextMenu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ab2eee33bca71397ecca0f024523f8959c387e80338d9ecae3b6ee3b71d022"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-wasm/scripts/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d572156fcc4c0f5dd5535fab455f7dcf61250448f661b8944a291a7c9d9fe079"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"202d9d7e0787695dd326fe6ffd49308cc605281b52fbbd2b9efe2b286e027a71"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/CursorCoordChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2067f6f0fdc6a2da4e455e9df2679a192b42e0649c0bd354761e7e038e7001d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrinterSelect.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77670a48c8bf4ba0cffb2512043b15d9082d3f0b83b09090dac56b15fe0b50e0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useKeybindingDispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9830a4213b3382b562c6e85d20d5a1327bb76c4156fff36b68974aa65e64a72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/tree/InlineMaterial.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b6184f022c92f70bfeedf68f574675e7396eadaea9ec4c89b08114f9150dc6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/mascot.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe04d590fdd8da49339e191fa054b12a52ecccea3d24805e8ed0f75b4f7d969"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AboutModal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1573b8f811f0004b01a3c0af4fd9f167f4e7f9bc8d01dafd66a5cd4b741ce076"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/f405-enclosure/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda63810718002a5d20e35e4ab30ca1eca60f079c14f6d766dea5c4be5ad7a6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/KernelPulseChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6d3be88c5ed20c6ee0c11b122a44e835186faa51f7df3a952884378b1f4e09"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/url-document.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"449eed0d427f9c235859e290af91b8c2583db1d2fff3feb1346bd1c773ee3db6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45f7e6e80a8aed15597c64490cd5bb60ed705f583dd5b05f89d5d533c69060f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ExportAllPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a5dc42c076d64dfd01b2e2aa632444dbd65f18a625b69991cde6729e635cd0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/notifications/AIProgressCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8bec274732d102341801b74e578c8953cf7725f2d433d2aa831d2ef5b98e06"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/robot-arm.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"858421817a8ef3dd8e9d9f865d0fd6917b3380d57bafb434a76a9a5aad244831"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/KoanChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4eabcc2e2ead51341d140a70fd429d86c13f4e7fdb201592f340d8a7d66ff6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/receipt-art.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18045811a22f108f89073834d6ea2372aeef4d180addf29d04ecca50dfad6f4b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ceb23ceea138a3bfcd4517bf9117e2dbdf69d4e05a780f9fe4c2c9eca3449c6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useEngine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"197fc41394c19e61be8f876f45ce5b1dad232ac33990643773e505ef73849648"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/ToolLibrary.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36a6803c9ab0ad9d30e980486d4275e9997901c1a6093e5b63fb181ce5efdc4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CameraSettingsPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee2eef06199735eea70973d6a6ee02ba71424b23f4de055139bd00e7aeb3c10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAutoSave.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"028a6beccdddfc4c61050274f17e3f3d5984d6567f3b635b4879b2ca05927535"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/leaderboard/src/tokens.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade802e2419dd54f219144ff43762dac1e6b752aa6aa84db3ad26729c18258a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SceneInspector.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fc383ed1c46263e0fbfd3a0e251d778e47159d910dbadde428f1d0a064c9d2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/command.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c64cd0e175388aee287df148d4c7c0628f1e405c917a8c404d8a18e7e2a6f8f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AppShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f2f9df53b06eaf365c7048462c9992e24902971225d18d0a0e862cb0266ec1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/Splash.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8180d304d3bbf00f38e583381ad92dee664a1b340c873318e640095bb16aee82"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/plate.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f18fdd9f84e9a123413a7342ed096a9879fc9b4dff05013f5b9ba65e74b7a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/calibration-coupon/geometry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfb6acae59949bf7df71c949e627cd4a1b72b5e02dc30975b144b09301ca64e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/notifications/WarningCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c52dabd079d981e39f64077cac198e9694a90910b6e15cf55f490d3fa32db82"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useOperationPreview.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0970ed3403a20906d52d46d9a9df78e7ea7a65839d905c1a933af90fe6091"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/engine-card.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9340cdc0bbaed11eedf665909aa2003cc9d6cd92ebc4a6454225bbe5742748"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/StitchDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b1d7a01f03fbef4b33c56ee53e8d25b8744327d04f7ac47593743c605cef05"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"660f44a7fd47574677c6ea81769df2922eba83960245fb29795d210b1c71b891"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/input-group.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9218b4692510e3487c761b137cb1f2931e9904b3fde27f43793a7f2d80088470"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/viewer-app/openai-shim.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebc3191b7706397e93ab72d475d53e800c37a2eb6ab775b80b80a0a786790e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/AddJointDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d16661e149176da9650e151ed18ce19bcf77235a7dbf56661cae8a7b3e70872"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/PatternDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f535f23f9ed2342b85cf4f3ae59bce051a2cb85ba0fede06bde9e2fc7f62d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/backfill.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb9f036ed5321176da80f31d10dd064826b7efce6388686c90c50dbffedb321"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/viewer-state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92843de366920cdc0972b7443d9a020a2ed52cb5a1c1466ea62a4255cb4aead"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/vase.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d8860760ef53e58ea541cceb663041a51b85d26f3a6e5a830d8f019f5c0aee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/MoleculeTree.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd1e9d45d76852e4c177d256ee8c8250702c142fc09a3a713ec8ba8498d8ce"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"999a0556c9c98948bb8de2974420e45c41c2bb6d408e9e306437267506e81d04"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/scripts/render-task-assets.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b565f0ed711e8cf169ceb77471f5d95a341f9190923c79b5283cea29b32e5243"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ProductModal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"901969e59d9ee395af9eab9ae1ca4de76681d8a977acfa0f4750c9c192734ffa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/TermsGate.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fa8c10135f3e9c744b3043e87be4fa7f38ecb72153f20e209f795784142edf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/scripts/test-local-mcp-apps.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"448c71e81f9b2f12ac98661892e7659b3496612b02d4b7152c6e4f282512d2e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/SplashMolecule.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e70ae72919657e360c96da29e943e73b0aab5fdd0172eb929f42f0219ecad0a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/usePerfMonitor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4b736a4018bfe5c1c742ddbdd0498d605897012246ad63a5b4fca090813973"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/notifications/DecisionCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d0a807372e603047ff70484845f9edfe5e98759a289bb7d3fa2ec5b60e3e1a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"272b704ba71e4b0e1070b010162293a90063d9a81094e6a38f69e1739d27a9c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrintPreview.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0b2129d986f63a9f8fc161519be55f8937a97e94c9618a12e1fce96257d9b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/bracket.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f05249ded022d02101dedcd123f327283f28a601aef6d46b57c987c8bc85b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/slicer-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a897c2b970c716131829a6edb882591d57ca8098245a93252311ea5efe1d3f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/notifications/NotificationContainer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d91b6e98cdcecb17eb3d2a5d13e46c9802ae6c67cfa235185edf8c6537ff614"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AsyncBoundary.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2729e596ccaadbaec475f1ffd880f357e7588fc3f8bf91e45fd91ccf36f6a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/browser-tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6557f5570ce8c424d8be9e789f4dd6819d2a9ab1ef63185faa73ac41c8291a5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/DfmOverlay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53b276e29807ead4e91742f7e9f30ebfedd672c72d94c9bedb8cff7cede6502"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialPreview3D.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f93bd85ba24382d71e1122f8967b10463f400a16a24af4ad21c4db6385bca74"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/TextDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142b1874f13c8f438ac6693a37cf6a096eb0c617f93ccf238f8b950494f9f8b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/notifications/Toast.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"100b693337164ed772a1d0a328f815279615e72cfa6993ade327a7e8b5c8d6bd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ToolDialogs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"646321422367057fa5d04a8991a7eadd29b701788742159b09ab2a388a9973e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/spring.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce0dcc81584af2d94686e4216c11b9cb4c1d8a6c7aeea79f9d6d4a4ae93fd10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/analytics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"766ece69623f8d7a6d427f671a81f41db071a62b2c612a447174cbef225de66f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/scripts/build-npm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8accbdacd97d5635d9c521e20086cab10f6f11527dfdaa482d1f112cfc16cde"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/wireframe.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4c4a00343ca7e29812b7d3fca94cb5324eb7391dd8507623ab4e6102f140d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useUrlSync.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9091236129aa62c4263d27a312ec4ffdaf669897476fc71952780c2bb4ccdb1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/GuidedFlowOverlay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3539cbc185b96c309491df5ec8f5e2fb1098dfdcd4c9bce07fcafe08e309b5b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useBackgroundLuminance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95da2eef399b77bfb5ff6575617aae4dcecdab0dc1e821b28a189870182ea12c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/PcbPadShape.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22095aaaa046c2bd0c4f35f1b59cf63218b285cc476a0b5f14679ba73d243a84"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/FooterChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9059b7a156636f7fcdcc6815a7c296eeee3c0d1cd6d925757eb74802e39113"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/container.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00d376eec33a62f33b36b55ea55e1174667842f838b3bbfcb04d622c38e06bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/AnimationTimeline.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a667200a2ae116de9b71e719da3a918050841fed7025813bcf0e3b9f34a4efd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e981ef6bf9ec130924cacfed24c0b14e47c82e293856a8e126be6616a94287f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/printer-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8061096a80c3cf9b7d83f6c98356e599ea565d9ea0a5b1aa41100f5ac188c1cf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/animation/gear-train.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2132aa9032e902ada8c6e48df19227d0d85a2d4a1fb037c2a92a5d9f35e4031a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/changelog-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72de70f71a8bcf0209b9bce900a2462d564f6d7d9f2efeb04f776a0fd256ede1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/InputPreferencesDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eb342437a7ece62206961baf02b444161ac10a661e64ba622a03ade4496347"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/tree/InlineTransform.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a0ec1aa53206b939ae311318e9261931f13437e1dc19bfe09c6adac5ae306f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/ribbon.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"303011e1accb4579b752a917f6cf25d37a1d86b67691c0754db033a47607a8f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/CelebrationOverlay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bc8f4e85fa642c9707cf6d6eae67644f0cfc296ac24febb9b73267a683f251"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/SlicerSettings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b63b119eb8c01b5e0ed7efb8f792a8b67f756120057994d85dff4e4d9c01c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/tree/part-summary.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d15cad580b9094ddfb4d8e9b397fb1864944c99d8e64d257ea892e0d1d8bda"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/onboarding-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f175d8f8d583cdf02bd71c02f0af8e7a3677952b210a8ac6b6a7cc0a200da1e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/mobile/MobileToolPalette.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6aca3074fc1b04bec3b9846a02ef397c6fcd8c14f8862919d6913158256bad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/scripts/vcad-app-mcp.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27103520bc76f3c8b63a75b67ec37b30f3d7eb745e9517ebba47c272022bd2b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/leaderboard-cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca517d788b2c1dc1eae7eff3ab9d06b356845851cfd509a89e673a7108e47fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/CategorySection.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f88fbca7f792f4dbdfba547d3f33e351a2e0312a24b452c73709a8c57ca66e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/flange.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ad2b3d39b1f58fda06948581a507511f715d0135ac08ec59e04a1abb45fc12"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/scripts/serve.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26191a6f85c4980a15af8d2d80cf9a73f95b21b8ced696a09e7c05b6eec88cb6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/calibration-coupon/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d597f8ad4f0971ce7fe7281f4189366161fa88c085726d05ab208dad3cb0c1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/WhatsNewPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a323285fd6f60c5b5ed530f9aff96d1e6f559a25ff67bdbdff1a0d9a6100c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/command-icons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7b872afffac8bcb941f077a10b08c442ad2e61fac01e4d3c2125c1678dee72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/log-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2d8e3bfa9407c040ee1879739b381e2b12b80f2f3a8798a0429805c4a60adc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/kernel-loader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"737e5df8550c06231f27d61041f1ebae1fe7fb56c2f76241ff4f0cb9d5ba214c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/src/prove-demo.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fa3ec793a7e2f32ff70ee706d380a3501f638a0f7ead85cd24c72e69c92c3e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FeedbackModal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0b3fa106ffdc635bf8238a7b641bc5d5f19344934fbb7188fb18689ff1ca44"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/cam/CamSettings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc8b378130fab81522d8c62db8b3affbe38830cddec2fbf8c344d38789e86e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/sheet-metal-bracket.vcad.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceddfc43a4a19ce1ade578df8634791f0aedfb582e4bbe767ca3ff396b3803a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAppUpdate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28760ca68c7d2ffec3e53e47209602e42a50cfcec887eca07e7d0ad00336edde"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/usePcbAutoFit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40fe624133444f2fadc4119195d3521722caae20a85817db7519ebf1677b55c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/symbol-icons.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"460f2e08aa74112044845621cdbbfd8469ff22d49eddc56754067c1096bc804d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useKeybindingPrefs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab65813805116c82b199f29078151a464e220c7c5c31964ce9a9d3c848038fa9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/InsertInstanceDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adde956949faf18d77b54dc34c7c523c4ec4876fb811690e6a87e9a1157a75a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/print/PrinterStatus.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb95102d6c786d1a8b5a69ad2c5b076cb8fb6833f88d34f5f5730eb902b9d21c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db575b2c780159da5b157f5557701a0718f5af24d9d08aba339f49660321309a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"338f907c78999d5616be469c56ea7f00b492ea7b73173fe30329044c55386d1d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c64f97a643673f09f7ff7c320d1cba45f8a7997b2861914a0ea4a9212c63bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/calibration-coupon/record.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d2b495517a188496e1c4256ef869e01557add8c92ed2c953027e3301b17b82"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/MirrorDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c8cbdcef359d2220e3cbdc21ed4b1081cf5d32c4bd957d0431fec0c37a8f07"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/JobsChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe45dd86c1235980a777aecc9f0d758e438e05cd0f71c61c21b80e81fe486e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/export-auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32152e8c9c58082cacdbdfd8ad533e192b59fe8e21c7c15aa7310fe65c1d9130"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/pcb-motor/scripts/mcp-bridge.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"966fb347bb1c24ecc47c274c1271af5861e88fcf0fc2fe8f34741b1e92841438"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useSketchAutoFit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3273ba772d880798cf871cfe83b2633900324c8a5818334797a4061c9c59fc52"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/button-group.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c69a627d666c8c5da5dad1548c4f622bf67c42e73a378a2b3bf395faab9881"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/DfmChip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e48ef5cb7c18e1ed0648d59c7636e7e510ae10b4ba3a0363c1f559ea2d4a1c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glockenspiel/hero/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a317b70cc9ccd1e84a9cbc0ab1ad0953b62cc237ed84ae5edd2b228e7bec2a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialSwatch.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70165f3ede8cef4e08bc87d205ddf618e67c417463ddf2e0df8154625c8da90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/tuning-fork/generate.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2602eb1fe0c4f10bc489760a99841ec762f3eae7cfc4027d8b940d9092adcc0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/ice-viz/layout/relayout.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13444b189e52eed804c8debd12e7625f348698d7cf9318f0121f9ab83ff4f7ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/LayerPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a564cf05c0fe62f28daaa55c15e4b8e4fa2d3fc92b95159d5105f5641b7031"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/FilletChamferDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8948031644344bd033bd27fd3fe08e7a90f2ea93f34136b5aa6a634e4cecd857"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01635357f7ea53adae685d40634c924c67aec505c0f9b49263966cfd4e2a225"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/RetirementPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db80c8dca0dbdfd04df025dc892b98ca5053830d6fa76b41b6f3c8b8ed61ac7e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/materials/MaterialInfoPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d981e27998ccef07e7062795f195e3177aa225515559c899ac9c1183f0dc70a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/output-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c825f9ae53cf9620997244b29f26af8351efc345dffef0b61dc9ee8d262064"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/glockenspiel/frequencies.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91df0106fdc9f0064f1a37a629c3374c1fb0a164b94fe694ee677864854a72d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/TitleBlockEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdb15b6b3a3e52fa6e1a91459ea8cd98e3fc1b027b673239937d8321267ab58"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/dialogs/ShellDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae87d3b8a785256827c8eea88a30c0bf31f8320da6c4c1c0d56f91df286b3247"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/Sparkline.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c05738df8654f14ccadf5c147f80782ce0dca02cf62e3ea5ae0a9bb09e69bed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAppMode.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b10720cc91a9bd969ad70162b1c10ab4a7258089526be1402e77fb53e306294"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/hero-worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9206f41b5bca8b57bbcd66379a1cd0ecbb2639c5164a18cd2929d5a112670322"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ErrorBoundary.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c88aa943652c62cc17bd71ed1ec2061eab781821ca82ffeab633422549239f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/lazy-with-retry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f47480ee5426c9883ee3538cf0c742562da7e57f61e42076ad1d511630e38e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/LoginNotifications.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"942319cc341e24eabf73af533cee07de0d70d4c6dfccc6cdeef56afc2588f412"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45a65a6392eaf7c819aef41362b59fbd3380efa835c58f11da3ae2d7977a9f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/mobile/BottomSheet.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfa16715d9a9d2297ac2d438ae8c47eb55830cf13135b17e71acbdd27ac10ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/pcb-autoroute.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1261a7c4ed0f940f412adaf592f081532ce48a640c975fd433f5f7cd215449c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/ice-viz/layout/layout.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900b6f745f1ff2f2e482289ead1c782498d7db03c81112ec826e58697b953af9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/scroll-area.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc61c48975c6854775554e6d6b4205242710de04c7a5007cebbc037b4c7b3fad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/FaceSelectionOverlay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e5716638e470e2458d5518780ff0854a1416f83194a067577008448a5f68e4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/tooltip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecf32bea8ec099f46b3d6cae39242d55d43c9611f37a4a0ab4b7a7e9da08d38"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/save-load.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a8a7498256ca0662f2737a23979b388d5f14f9562f77d4fc5c373b90c41539"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ReadOnlyBanner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcc92846fd5fc802642336c3eb7ede3c9ffdab9de641be1cbaa3fae12c2c49a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/shop-profile-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"935aef83494b66cd7132ffe85fe7978676103c68caba970f84ecb7acd71e7539"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/kernel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a61d9be1e6d5b3cee478c5ac1704c98d9874e0a91976f29bb7e59ad982378b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/leaderboard/src/serve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d021094bd357d38a0e75bb19d93d55acb5bbc0ff0a4da1ffc2171ba21805ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/UpdateNotification.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d0096c1014aa1f16882f1b8d36edf1ce227d550ff7f952f6e5f97f33a9f891"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f83b700377f0b416d855332e256fe29d98090db1ec36c92b5f3f6233ca98cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0b6853fcc203b9c9c71b06a1188fee8d8a08f6c395975bd9e4de3d8db72c90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/GhostPrompt.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"457f36c93579884b782ffbb874782817b80535a1baa63644ccc7dd03c60724dc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/locale-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e09c2e626dd28c78190fcf5158cd258a14820ff650320c5eb4b7887810ed383"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/hover-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e043b63bdee2afee60eea01e021e08a58e07dcc1814064ceab0a7193f306a99"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/boot-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c694481a81d928dd28644735b1d5375204ed56a94a96a25957cd3b96a636e939"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/unitree-g1.urdf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63962af1ee84368509431a20e6e05c5bb4daa36838416bcd91544c800d3daa84"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2881a90576970df191a9669814d11aefaab65f6bb02521228cec1fa8047e89"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/data/examples/unitree-go2.urdf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e612e97593320ea5953c73c6c1957d0c4a7a799408fb47738fa4bfad45e6c76e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/auth/popup.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba83ecbf9f8739fdca4b84ad43224db1a3663218840e9ab597f3384e2c2cd3c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/GhostPromptController.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39669dd5825bfc989dbe01b82b28f9fc1902fdb1d476f4953d72177f1f85aea7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/ComponentPicker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"544d171488fa9c1986680013afac045a3d7e83ee6d57f81ef95455b01f952b6d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/terms-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"017fda120010e8ceede7d42332ea219449040ab00efc1e61467d689c7ce7d5b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/collapsible.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee86e5ccfacb72824e7ad1228796e0115b5e362702a6237bade31482721a724"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/open-document.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd0e0a2521777cf2994e716372fb91a2f528f2874accd2e952e99367fb0b16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/RetirementBanner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7343751f748307239c8f623ff6b2a5e6a146f3acbf051c500d29d668da73b983"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useVolumeCalculation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2d0cdf1763d5fba9a2fe128e20d57128675b0cff31cb82ce48986594e1f7ee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/crypto-polyfill.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d89f0cac24cb5bd359a52bb48ff9c3d616ace6ffb6dcca9693c736e79cce9b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useIsMobile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d4b21b7bfc559f11ec5848a3844307af8b106fff0194607a418f8d25414d15"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/separator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1e34a76bcec42e8722d58ac47350aa2da93e69f521e19ae2dd5d8d42c1bc99"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/recording-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c137da16f4e32907c564ac917fe329bc5053d8b0b125073e59033a5004aed310"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/npx-entry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeb9b1a9af278343f96cbab0edc7260f0a7080f4efe3ec81afc4df68fcd38c7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useOfflineStatus.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbefcdaff88bee44ef5f189d3bf704436dfdc23280a4c4a5945ee60129a1b97"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc952f1d40fd0af033dfc4ba8841d151472028b852a177b78c737d0abb1a34fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/separator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9495042030e1d95762fe6e95f7ad664c24ce26091622d465abd5b3a5c5618016"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/scripts/agent-edits-gate.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e6543d852197b003a18313fcba483874f681c446bb499fa3bde8f6e8f8d1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/scripts/copy-launch-kernel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0631f5210993ed644b5d36026e3bbc2f102956529c6705151b96bc2181b534"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/OfflineIndicator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e308bbff8c403eb38ce837cb0315c7c0c12cadeb730ccf26304105db7b777a73"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/textarea.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7ded58ab6958cc7cbffe0da1f5d542b69b0a0b6794f53812ff32cde3dfdaf8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/shadcn/spinner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33c662337d506232bded96ac0bf41494258b16b45f75504b731dfe143ca65e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/theme.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acecdc055d17288ac045f3524e7cbf2f3b4a3a871b5564ad8fc9a0341fcdc93a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/export-main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7001291baff835815870a7b6feb03ee5e91fcb6be6e989363a921329c8e1c0cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/public/theme.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c4608f46b21d3eb317fd2042ac6d743bd23f5378dd14d2dd56ad78eed04ef2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/doc-id.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"342e2dbcbc1c237b8d4bb46b37c9b53b7b38d26ed879ee77d1fda1828362eb8e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ErrorScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaacc35daf087610965c49572759b4bb53c8b8eafa6c317712ffcd0f54ab743"}},{"ruleId":"R5","level":"warning","message":{"text":"Dependency Freshness: 62 outdated package(s); JS/npm CVEs scored in D30"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7de98450603a813bc7a991bc6e60f440c1deac6f9c9bfd4d0da057afed869bcf"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060packages/docs\u0060 declares the lint script \u0060lint\u0060 (\u0060next lint\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060packages/docs\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/docs/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5c07e887c0d64d752cd87abf3e867462c4267277a1f07693f5019a10f81ca4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~364 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/electronics/pcb3d/usePcbCamera.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cac0d7085384388d4d61dddb1fc57e7f45f59cfd7cdd38a2da5ebf848825aa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~327 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/InlineProperties.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5132949961289e624c63071e6734fdd4e96af06f6357691a69cbb6dbf95e77"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~257 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/dropdown-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffdbf5469187ef752644532006048c60ffb240d809e9f6a52d48e53526111ae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~235 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/ui/expression-input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f791dd25618aadee8c49f2807166d964db9ab84858ff0363243c4ce40cb2c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~219 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6b782e701d56022db8a206bb10cfdc0f68f030f30068838bb377639fbbd0de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~190 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de96ecf291b6b34f9541c90cfc1eb4d1b00c4df4712528315c49b0dc79b76c4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~182 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/command.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78fc6d691b11a530647e2e3705984f031e0f83578bcb72021df5b016ec6ca74"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~170 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/input-group.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f28aed14a88f5cde8664fc427fd51faa835a9146e4a0d8fa10eadff4364968"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~156 LoC): no import path from any entry point (91 application, 42 tooling, 184 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/app/src/components/shadcn/command.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":"packages/app/src/components/shadcn/dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bce1c82384d60ffe3180392b47d24f27d864dc656421eb987c19474b8d35fff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~125 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/hooks/useBackgroundLuminance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59b65c542e5f03624212ba02742e4d437cf19e6baedd43f2b14460607d71362"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~122 LoC): no import path from any entry point (91 application, 42 tooling, 184 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/app/src/components/electronics/PcbFootprintGroup.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":"packages/app/src/components/electronics/PcbPadShape.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b385f490aaf0c45d2eafc0d1b80b934f0fe104a4456b8b96ad83ae04552d77"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~83 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/button-group.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8a31d1793f427cdbc8689573beb747e2413483fa42e94fc2a98b8114755557"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/electronics/LayerPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"182f4522a53cd183560bca688144def499b2510d6699947d8fa5ab2a48375771"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (91 application, 42 tooling, 184 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (packages/app/src/components/shadcn/dialog.tsx, packages/app/src/components/shadcn/input-group.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":"packages/app/src/components/shadcn/button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dde7aaeea49645f3204878ab5e6b98229aed2998197883bbadc6232c35d25d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/scroll-area.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d674995e0ba66bb2c9bb9c0adfc32c48c007f2f8217ed4920eaa5db1cf41436b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~57 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/tooltip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9bd4fead5cb2958b9d6abc62f72a25abf1e4735c6788d39b89e64826e96270"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~48 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf6b4f4dadedcabe238d3b0c2a171f6b97cded360dd94645aabfc66181e10b0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/ui/panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3b90ed1d99e19b2d4ef6cc3ac01475434c29285dcaaa0358aa695bbfdd71b6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/electronics/ComponentPicker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49e71fb505d2ee89fb7fd239d010fa83e059364f6058c0543985ddf092c6b2d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/collapsible.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc85cc834ddec0bcd002ac8c8beee3ff56d1511a7c2057b7cf0b029d45e4c9b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/lib/open-document.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4806ea01177843bda02f86bca54bf0c9a466dbc4486ea3c5253dfdbc34258b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (91 application, 42 tooling, 184 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/app/src/components/shadcn/button-group.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":"packages/app/src/components/shadcn/separator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ab16706ae5ec13896010f78c2ccf0e5ea43866c9957253cd234377e23ddec3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (91 application, 42 tooling, 184 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/app/src/components/shadcn/input-group.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":"packages/app/src/components/shadcn/input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"354188c00e2e8dc4201a787244e0319ef632aa12f030a213fdfee6ac3750b134"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (91 application, 42 tooling, 184 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/app/src/components/shadcn/input-group.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":"packages/app/src/components/shadcn/textarea.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c9db01bb665c3d7b0978a58f7987e2a4051800eb59df24c464a465bd94e91b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/components/shadcn/spinner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae01282648c53fd5d0fbe780853a6cfe8e3608db52a876acd7ea9585f0dc7da1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (91 application, 42 tooling, 184 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":"packages/app/src/stores/toast-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47489688a5f20fab7e0d86c2fbd69b747d95252dad96637f4d04360fb5d0dde3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_Anthropic\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04d9f2dc21acea245976f031a4d77f4f5925098bda44857d4b922a189b1e995"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027colors\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/leaderboard/src/tokens.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a41f5d57e5c04aee9d352069ac9bff17be38792e268a8c6385e8f6c73d278f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RayTracedViewport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/RayTracedViewport.tsx"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae12bb2bfcd9cac84af1fe813b6c0fcf0d454b754cd86262e0f5e9a7863b7534"}},{"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":"packages/app/src/components/electronics/CircuitTabTools.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f346464cec52a6390d281aeff206ddad75618c606f32fc86737ce51eea42e3"}},{"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":"packages/app/src/components/electronics/pcb3d/PcbComponentBodies3D.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"596fdd8673d67c3ac3b3910885f529f69cb0d053d7ebaf92c36e0b9cf5071e04"}},{"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":"packages/app/src/components/electronics/pcb3d/PcbKernelBoard.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf890898770aa409964ee0867a3eacb67d55e601f53b573ffc7619488b7d4c08"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildTraceMatrix\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/pcb-geometry.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3db227e1fc16bac75aabf0d9db2559795fd11c6435034fd87ce5f3b5a1dac70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027padShapeType\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/pcb-geometry.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e72512d0995ac0a81852603411c056cf4c0efdf6e88ceaf0a78c8d6d579f9ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027padRadius\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/pcb-geometry.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"03571aa4fdcb78a03b6f6b4c2073fca63ce575a7d5c73267c199ce5fa58007d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027padDimensions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/pcb-geometry.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5128674d7791b74cad93d374aaa7d2e4afc957cb7389295759f0cd33c36f9627"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027viaOuterRadius\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/pcb-geometry.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b100af2ef7a3fcf5b0a5bb967bc6d3be2a7f37dac4035023c02b7ce2f95a6d76"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027viaDrillRadius\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/pcb-geometry.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e4bfeb589d73a68b96eaf2c63704203c35602fa6ae34505b154ba4a924d860"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027copperLayerIndex\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/electronics/pcb3d/pcb-geometry.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"921f444e903fe7651ba66dbf1d362ba1d686822baf2287031faf7075d3c5197e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ChipLabel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/FooterChip.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cfbe7a5786681dee72023c59aed97fb5f934d1f5622bcca47aa49300def176"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ChipValue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/footer/FooterChip.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12577e15e8f79b829fc496c67cd71dc8dbbb2d8a0d79dea8f51a9ad095f8f08"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TabDropdown\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/ui/toolbar.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3716d604174685eb5c7beada4e92c065049946be279b9307616c7c3a64e05e22"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027validateVCode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/browser-inference.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"814cbb5f29bd55fe11126dc1e1712a0dc4e25f38f94f9ef4f29453d322e837f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clearModelCache\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/browser-inference.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb40cb824cb4291c5b2aef4df2fa5797e1e30a133ed1e6b28875a3843f4acf9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getInferenceStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/browser-inference.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"66411190be41226f2d0c5f603c69556c1de255a302a25a2569e2cdf7c06f552a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027matchMouseBinding\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/camera-controls.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14108dedc2bfe568d6a92599137891ba17095a4ff351cd7e10a1ac0b79f0b47"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_SWEEP\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/circuit-analysis.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"381ea1486527b0e8e4f23e2aca047fbe86f0f29026cc95de77c8cc6764d29ac8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setRelayUrl\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa984a62880570ade4dbe6d3763e6b88f5b140abf68132ca1b49a23f3e749aa5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027controlPrinter\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd64f20b73a6c0379c82594eeff8a04fc8fc746f1ed7256b233b1f25807a85d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027exportVCode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/save-load.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"be56e8a41b41d01af5594fc4620f50d4228fa6d9250c2e20f7782602996e9c9c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027copyAsVCode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/save-load.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95cb9e8b4693087e2fd7abd3dc39160e6fbb22b1ee394db1d3864c833778feb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateDocument\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/storage.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ae94fc84d7f061e765987b1da454e000a5d36962df885d66a59d47580255c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasUrlDocument\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/url-document.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4449416424438f8fc45fcee27519539db97e3d2c2d3460e87e3959ccfbe88bc4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getProceduralShader\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/shaders/index.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7177d720e475600525b6067d4a3406755a6df624e4f4226b03e436460ad387b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getShaderTypeForMaterial\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/shaders/index.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4de729e43be4c8fd9c8eb65088d25b38acf720ced6dc49268651a2085e77145"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027settingsToWasm\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/cam-store.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d042753187c794bc62494bbc2de7bc152c6f4974ef8c94a8e485ad7038678093"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useToastStore\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/stores/notification-store.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6e535e740b979de14784fd2ec79da4b4ee2bde84f280a890195815d4a5a17a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_ADAPTERS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/fabricate/broker.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6b29f3acbbacfcb6f107ed2365e615bada4c9bab3c54a982895cf59306b44e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ERR_MISSING_REQUIRED_CLIENT_CAPABILITY\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/protocol-2026.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9730a5e9795b91717a217bb49a676b0346152496ff9980c97dce47526f6b1fe5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateSchematicSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdef437132a25aa9fef6de9e477f5699b6d51e2408bbdfc0cef31fc106abb4f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027inspectSchematicSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc50638ca2d9c2d2f735c4af18cec104977426f250a9c34e076f8c99d4779c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027placeComponentsSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91e72a8dacd9f4e58c1545fc267cbeb8049f9db722be59a28af24b902dcae48"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027routeNetsSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7563e903bac7845cb8352d6d6cb6b56bac5c02ee90ab930aff402bb182fb023f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runDrcSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f07d6ff55a27162cfa6b84b769a273e47e14a8b1bcfe2f39bdde35eec70e39f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runErcSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"464230676ba079af52ba00a1fe1b7cb03452847b5b084cc55520381300ed25c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027critiqueRouteSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffd7aa1172414871cce012e0eb08b9f9bb9018cc8d0fe85a4b1e386d6c9a512"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027routeDiffPairSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b9739050b7f3cf9a7f1bdceda5c048944bf5ec05911d378ccf6c8b4c89c540"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027lengthMatchTracesSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20b1b09abcca5aeab1dc3d45a08f3ef89c2d9cf9a9e776663bcc33ec466f070"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027exportGerberSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b99803fee6cc6c2d11820525a18ee6bbc7b31359e95f3627fd749fbc630f4e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027validateForFabSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"479f155ff204f984366e62668772a053f7592608fe226a9785ce312b364dd451"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fabPrepSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f269c6b7de8e43be54c98ceeb84dd307f0c66e4bb9efedab4189764988db7a58"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027exportKicadSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dc231ad9a90e4ac68f74b0b54684e9a5cb86bc32df77fbb2eb3086437c7f46"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027addCoilSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2798a9b1affdf28727b114a7823b274d68b228b8b645b3ef3184087e1670657e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027boardFromSolidSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff8188f8d208a2cf4975d0e5675a651b400ab082c6e4a641a9cdc46202b638f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027addCoilArraySchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa15df50e31b9695f8d1b969c38bc08711fd6bfcbc5bf6afeb917b966d5aa221"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027windingLayoutSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48750a89c3ae7bfde7ba4b212eaf7124bc38beee456b1a10d144678616f35ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027calcImpedanceSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f90a6b83b7a2608f316ba1fd480227e8de5d4c33d39fcdfe0ae3a9511e13e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sizeImpedanceSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab19ebab36d707f0680a06394b1e162f790480d9c7c4c5fffe799cc93652584b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sizePdnSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa176052c963544e099295c0f39009b1152e867cb101e370f96809fe44cb06e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027calcCoilSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c282365206ac2ca033039f0de5ed6d8660ba895fbbf2dc5e89c31fde6b6bff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sizeCoilSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a6d92957f6dca0ebd1835f1f2c23b6046c3116958c4e21d4c3dfde2b9d0c4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027calcRfSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb58eb9602e05c13a16a52539e8eace313ec42413346756642821f83816d9092"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Observation\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf059ec5fe163790f5a8f7d43600b35d4ba6c35a9b220f501e6e4fba58470baf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027StepResult\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/gym.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9d385b6ae295d9485bebeb8642b1043775f2f25184c09af0d28de14b11ead7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OverlayType\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/live.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ae862a64e3d631d934bfc2ad21246f061495a62a34b449b47f3621db96751a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OVERLAY_PAYLOAD_MAX_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/live.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11ebc3c01214efaae2ba4b8b9ada391abb6263fdcabca3986cf2582adde2283"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isHierarchical\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/schematic-hierarchy.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"65820e173ac5721212208ec69d9d4fe4f03fc5ffab87b8a31a43dda486f00878"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027documentWriteVersion\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/mcp/src/tools/session.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 packages/mcp/src/tools/session.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/session-core.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2a1753b72c1e3c6b1b0d68165c57971219ab3792acfcc765ae2f8dbe2dee47"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027currentUser\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/session.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ed657025ee7cbda5c3b12c6be18d467a9b0f1f2dccebfb80bfc69342cdbbff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027codesignMotorExact\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/wasm/ecad-diff.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa94b140e544d9f6389ccf4d4e3bf9387cbfba9e38ac30c4a86dfec53835ee8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027generateWasmSplitCommand\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/wasmosis/src/splitter.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0c8f29a794a0f56a91ce417939f67739fd570362bb80df4b6f9939a8331855"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TINE_W\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":"examples/tuning-fork/generate.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb6fe9cbd3381d242919998dfa1098e958d5625a29a887ad5e79510dc94d081"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027outcomeBadge\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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d00195e8921fb6f0bb15ca6c40d144c1dfd0ea64acd0815b4980a8905d4a1bb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027titleBlockHtml\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":"mecheval/leaderboard/src/build.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2fc9b324d29d0654b89c4e703c81f5b1fc18c1f3634853aa7511834d1c70c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027noop\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":"packages/core/src/commands.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc9b1e70b991874a811d4990ef8cb10bd691934cbb62fede3b274310b48cabf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027crdtVec3\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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a78a3f03b97b1115b5dd1796fd76831251174c1d566794838a7c310f32143ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getPcbBoardFeatureId\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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba71d9a8ed485a2e3af645a1c2c081d13c4792710686533a145d2a05969680e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DEBUG_EVAL\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":"packages/engine/src/evaluate.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f593943e86cc5f8fcd81311c245d8330383b544b9722280697943ff3784934"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027partCandidates\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":"packages/mcp/src/tools/clearance.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d07768d6588a7f8a0750f719a8ed395355c6564fe683a22bd43356e93cd2c3"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@modelcontextprotocol/sdk\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/scripts/gen-pcb-task-refs.mjs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f51fe71b42ef973b549492f6827ee9920e8269e69327283cbe30509abad0fb9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unlisted import \u0027three-stdlib\u0027: Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it \u2014 but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/components/TransformGizmo.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"935c852df1e007dc530e0f1a5e2d1754840d740e7b71c9484bd6144018819c8f"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@vcad/kernel-wasm\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e1f74d84916b276bbb8a4b91166924f5c04b510024a0de4dfa1bf4be8993e0"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@vcad/kernel-wasm\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/__tests__/length-match.test.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbdd21af6844f01c98d9d50e9e34ef7271aaf9882c5020ae47194fcb7f1330c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-use-controllable-state\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d4ea9e961fa20bbf3cc1548d773de7f2c5fea5806ced352df1b4dcf9400e4d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@streamdown/cjk\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"287255138ed052f7076f996a0f4bedb5938ea652f8a8c165e6c94b9127eda0dc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@streamdown/code\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda72b068644a8b64583c77b957528f1a3101e49f7d78676e57473fb09159a14"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@streamdown/math\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec711e29ec9c9176526859edc4c5c0db2c761bd3527bdc8d1c06bfb2600601c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@streamdown/mermaid\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfa223f553731e873d89f1f2106efaab6d54d24e7d8e9f43253f54261760057"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@vcad/mcp\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39ee374addf10b452abac1af7ec158c14d0dd986debfca163b4fb9e2545d607"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027ai\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a0e026d92f7b108a475acc4d70f3d8c610b6f7435387c8afdfce66c5da820f"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027motion\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8e5022cf521e72841f5f25025fa84a2ffcd15f32b769a9067af256da45923d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027shiki\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f2f385ac24467a347dc8aa3222743bf05d2a87c70152734139ad39665713fc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027stripe\u0027: Declared in packages/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/package.json"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d6421b1c64f9955bd470e98868302f07a91e154d211ef50e68d4285b393c8f"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/mcp/src/tools/ecad.ts \u2192 packages/mcp/src/tools/enclosure.ts \u2192 packages/mcp/src/tools/ecad.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/ecad.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ac5aeb9bbbef9827d989e04571d121210461a7d9c99feebc569343364548e5"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): packages/mcp/src/tools/loon-macros.ts \u2192 packages/mcp/src/tools/session.ts \u2192 packages/mcp/src/tools/loon.ts \u2192 packages/mcp/src/tools/loon-macros.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/loon-macros.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"382cc694383e672a260904ebfee6187f7f5fa4dee5c681972770c6068ec4dea5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!o.isMesh || !col || !(col.g \u003E col.r * 2.5 \u0026\u0026 col.g \u003E col.b * 1.4)\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9abd1ebb1f5a8276d18c0ab1d86028c4d2f231fa158bddf9f72e503a2b4b93a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!scene.parts || scene.parts.length === 0\u0060 appears character-identically in 3 files \u2014 packages/training/src/cli.ts, packages/training/src/multimodal.ts, packages/training/src/validate.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":"packages/training/src/cli.ts"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95a6140c3a893da9fabf59675d86ffce32cd2a6157566936bc44e7f1192d4c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!sketchNode || sketchNode.op.type !== \u0022Sketch2D\u0022\u0060 appears character-identically in 2 files \u2014 packages/core/src/stores/document-store.ts, packages/engine/src/evaluate.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":"packages/core/src/stores/document-store.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f48be66b56d9ba882c6ea70b130c8a52148b67301ccd6283c2b22155632a675"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!textNode || textNode.op.type !== \u0022Text2D\u0022\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/PropertyPanel.tsx, packages/core/src/stores/document-store.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":"packages/app/src/components/PropertyPanel.tsx"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a38f2d7ca41512780272f206bad1a661b8faac7ae911631ff58c5dd5a51f13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!action.variant || action.variant === \u0022secondary\u0022) \u0026\u0026 \u0022bg-border/50 text-text-muted hover:text-text hover:bg-border\u0022\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/ui/notifications/ActionResultCard.tsx, packages/app/src/components/ui/notifications/WarningCard.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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25fc1ef64eedc1c27b2ce56e2d39692c14fc147398af23ae7de8c2e3bab4b84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Math.max(maxX - minX, maxY - minY, maxZ - minZ) || 1\u0060 appears character-identically in 2 files \u2014 www/src/hero-engine.js, www/src/wireframe.js. 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":"www/src/hero-engine.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"11146ae53426b7654d4c4f3d62f7b7290c7d6c25c53e5faa476525e61fda20d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060category === currentCategory || category === \u0022metals\u0022\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/materials/InstanceMaterialSelector.tsx, packages/app/src/components/materials/MaterialSelector.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":"packages/app/src/components/materials/InstanceMaterialSelector.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f799d31492ebcd6297d5abc32f114106667e4e40b5f6fb5f4c0d9a626d42d506"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060disabled \u0026\u0026 \u0022opacity-50 cursor-not-allowed\u0022\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/ui/notifications/ActionResultCard.tsx, packages/app/src/components/ui/notifications/WarningCard.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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb8d0811ba6eac69da46e695f2828f00c8b2c99c3bc487c2aefbf688a91931f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.instances \u0026\u0026 document.instances.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/FeatureTree.tsx, packages/app/src/hooks/useToolDefinitions.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":"packages/app/src/components/FeatureTree.tsx"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b2f36b785a8a8c73e251d54948ff449e62b2980f8d031b09bcd5a8f122f6a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.button === 1 || (e.button === 0 \u0026\u0026 e.altKey)\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/DrawingView.tsx, packages/app/src/components/electronics/SchematicCanvas.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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0847d7b5f712e87940cacdfa1a30cf3b66b3438cd521189b05c6054e7e3cf2c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060emissive[0] \u003E 0 || emissive[1] \u003E 0 || emissive[2] \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/electronics/pcb3d/PcbComponentBodies3D.tsx, packages/mcp/src/tools/preview.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":"packages/app/src/components/electronics/pcb3d/PcbComponentBodies3D.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"521c93efa8c853863658e1be739e5b34a951669ee22459917753376fbe191626"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.canvas.width !== pw || f.canvas.height !== ph\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7f8c206769d7399360f5fb52be34de5f5bb45d0da5f41b1ca65e989e51124f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fn.lengthSq() \u003C 1e-12 * Math.max(a.distanceToSquared(b), b.distanceToSquared(c), 1e-30) ** 2 || !isFinite(fn.x)\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc3fbc544359d240b6c4eb2a25e76acecb8b80f1794699bd6d618afaeb4b701"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060geometry.boundingBox.getSize(new THREE.Vector3()).length() || 1\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9893a83a706d82e0ddfc9812983dff034e5c39c8d0fe9171ff7a5dfe2f3e96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C scene.parts.length \u0026\u0026 i \u003C visibleRoots.length\u0060 appears character-identically in 3 files \u2014 packages/mcp/src/tools/document-solids.ts, packages/mcp/src/tools/sweep.ts, packages/mcp/src/tools/topopt.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":"packages/mcp/src/tools/document-solids.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c79aa649be22ece911cfe55d4eb3a3b7e0aff9c1444b13e41952ea9c6d8a30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.kind === \u0022face\u0022 || it.kind === \u0022edge\u0022 || it.kind === \u0022vertex\u0022\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/StatusBar.tsx, packages/app/src/components/ViewportContent.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":"packages/app/src/components/StatusBar.tsx"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9daf71452d6a8a7118ff3cbe16b1e5dd65bb25a80d6ff3401f83cb0527db43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key[a] === key[b] || count.get(ek(a, b)) !== 1\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee51031a92cdc67a906781b9bd5592fb2ab71568e38bc05b6aaf8b9eff3d31"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060m.metalness \u003C 0.05 \u0026\u0026 m.color.r \u003E 0.55 \u0026\u0026 Math.abs(m.color.r - m.color.b) \u003C 0.08 \u0026\u0026 /^(part|default)$/.test(m.name)\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9e844464812de8f59024e3cf0bda6fe68f3713693e453bd4a5b9e95d0181a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060m.normals \u0026\u0026 m.normals.length === m.positions.length\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, packages/mcp/src/export/glb.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":"packages/app/public/launch/launch.js"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bff1ace3a991a9eb4e55a4f8e2e17b5f0381ee8667772e552dbeff221783dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.mesh.positions.length === 0 \u0026\u0026 i \u003C visibleRoots.length\u0060 appears character-identically in 2 files \u2014 packages/engine/src/evaluate.ts, packages/engine/src/scene-convert.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":"packages/engine/src/evaluate.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbe6fa132ca10974a313c053ab73c83a7884d04de3398ad099fa3bcb2fe3df0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.document_path \u0026\u0026 resolve(r.document_path) === abs\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/scripts/vcad-app-discovery.mjs, packages/mcp/src/app-discovery.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":"apple/VcadApp/scripts/vcad-app-discovery.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"381a5e914c2f077b92e0b4de0938e5a7959f74d424cf00e054d42f8825eb34c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scene.instances \u0026\u0026 scene.instances.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/app/src/components/ViewportContent.tsx, packages/app/src/hooks/useCameraControls.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":"packages/app/src/components/ViewportContent.tsx"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e5935d3b536b88a34fdb18a3035ea3c6e05185eff39b3d55b2766dc2853139"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selection.type === \u0022trace\u0022 || selection.type === \u0022via\u0022 || selection.type === \u0022pad\u0022\u0060 appears character-identically in 3 files \u2014 packages/app/src/components/electronics/PcbFootprintGroup.tsx, packages/app/src/components/electronics/SchematicCanvas.tsx, packages/app/src/components/electronics/pcb3d/PcbScene.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":"packages/app/src/components/electronics/PcbFootprintGroup.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaccdd8980a56e1173f3e1c4bce7fe1806f3ac1d70c55254c5f97846b2d2a733"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src.boundingBox.getSize(new THREE.Vector3()).length() || 1\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb25a359afee9f77863fe8248c56f66d6b4b1d57fcef73e65ad20e6fbd6fb91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stitchTJunctions(o.geometry) || o.geometry\u0060 appears character-identically in 2 files \u2014 packages/app/public/launch/launch.js, www/public/kit/gallery.js. 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":"packages/app/public/launch/launch.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea3c66edb5bfb931b485637071390488fd2cf95ee37f281ffe2d8aed025bee7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.suite === \u0022E\u0022 || task.suite === \u0022P\u0022\u0060 appears character-identically in 2 files \u2014 mecheval/harness/src/solvers/claude-mcp.ts, mecheval/harness/src/solvers/gateway-mcp.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":"mecheval/harness/src/solvers/claude-mcp.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"324460986904189757ce47482489424880ab2cb53a9cdaa778755067f2cc7d3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof window !== \u0022undefined\u0022 \u0026\u0026 typeof window.matchMedia === \u0022function\u0022 \u0026\u0026 window.matchMedia(\u0022(pointer: coarse)\u0022).matches\u0060 appears character-identically in 4 files \u2014 packages/app/src/components/TransformGizmo.tsx, packages/app/src/components/ViewportContent.tsx, packages/app/src/components/ui/scrub-input.tsx, packages/app/src/lib/viewport-drag.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":"packages/app/src/components/TransformGizmo.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbb03735dd5c8f0d2391cd65fb2f9a0983dff3d0d77b06511391caca6ce2ab1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof window !== \u0022undefined\u0022 \u0026\u0026 window.matchMedia(\u0022(prefers-reduced-motion: reduce)\u0022).matches\u0060 appears character-identically in 3 files \u2014 packages/app/src/components/ui/notifications/ActionResultCard.tsx, packages/app/src/components/ui/notifications/Toast.tsx, packages/app/src/components/ui/notifications/WarningCard.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":"packages/app/src/components/ui/notifications/ActionResultCard.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ce328db9bd32d276dd6d0ec85450ea95ca4c60b2ec64399fb9c80170218936"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.modal_feed || (*feed - state.feed).abs() \u003E 1e-6\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-cam/src/post/grbl.rs, crates/vcad-kernel-cam/src/post/linuxcnc.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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"714a6b6ed97d223315db5656387f624b72e18e19748aa933cf7df6e1d5c62da9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.youngs_modulus_mpa.is_finite() || self.youngs_modulus_mpa \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-fea/src/section.rs, crates/vcad-kernel-fea/src/spec.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":"crates/vcad-kernel-fea/src/section.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45a02b431c82503a3260170a1979af26825678ef3b11439645c14a2cc07528c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!thickness.is_finite() || thickness \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-shell/src/lib.rs, crates/vcad-kernel/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":"crates/vcad-kernel-shell/src/lib.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"02348444bbdff84071db5f85d9fb4b9e9b4d55fdc720aa946472f9412484f62e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060((d1 \u003E 0.0 \u0026\u0026 d2 \u003C 0.0) || (d1 \u003C 0.0 \u0026\u0026 d2 \u003E 0.0)) \u0026\u0026 ((d3 \u003E 0.0 \u0026\u0026 d4 \u003C 0.0) || (d3 \u003C 0.0 \u0026\u0026 d4 \u003E 0.0))\u0060 appears character-identically in 3 files \u2014 crates/vcad-ecad-pcb/src/spatial.rs, crates/vcad-kernel-cam/src/turning/geom.rs, crates/vcad-kernel-sheet/src/manufacturability.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":"crates/vcad-ecad-pcb/src/spatial.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d2b407ba4592e7840b0a59420e8e30027d16a5afc9ece9854328c823d780be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060((vi.y \u003E p.y) != (vj.y \u003E p.y)) \u0026\u0026 (p.x \u003C (vj.x - vi.x) * (p.y - vi.y) / (vj.y - vi.y) \u002B vi.x)\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-drafting/src/section.rs, crates/vcad-kernel-sketch/src/profile.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":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b224cd92a46f1f437b9d19a040f7cbd995bce4380ed02f3d6bfa7ffaa2d6e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(a.y \u003E p.y) != (b.y \u003E p.y) \u0026\u0026 p.x \u003C (b.x - a.x) * (p.y - a.y) / (b.y - a.y) \u002B a.x\u0060 appears character-identically in 2 files \u2014 crates/vcad-cli/src/main.rs, crates/vcad-ir/src/ecad.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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":5090}}}],"partialFingerprints":{"codehealthFindingId/v1":"5418f0c62784d717ac17551792b4c5ea70f0355cbd1181cd521086d03a171d49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(a0 - b0).abs() \u003E range_tol || (a1 - b1).abs() \u003E range_tol\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-booleans/src/cyl_band.rs, crates/vcad-kernel-tessellate/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":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f09b50f68ca8192595fdf8bd4d02f0325bc8be74afac92a7948bf5367de1d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(horizontal_layer \u0026\u0026 moving_v) || (!horizontal_layer \u0026\u0026 moving_h)\u0060 appears character-identically in 2 files \u2014 crates/vcad-ecad-pcb/src/router/maze.rs, crates/vcad-kernel-gpu/src/cost_model.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":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfc981059d73523b01526c9384f43ea38ad6a893976a76e46d6ea68d178bab4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.0.x \u003C b.1.x \u0026\u0026 b.0.x \u003C a.1.x \u0026\u0026 a.0.y \u003C b.1.y \u0026\u0026 b.0.y \u003C a.1.y\u0060 appears character-identically in 2 files \u2014 crates/vcad-ffi/src/drafting.rs, crates/vcad-kernel-drafting/src/dimension/placement.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":"crates/vcad-ffi/src/drafting.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c286a62f6b252b6b816689a83e2302856b04043bb118d9ef4c465b426635e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060angles.x != 0.0 || angles.y != 0.0 || angles.z != 0.0\u0060 appears character-identically in 2 files \u2014 crates/vcad-eval/src/evaluate.rs, crates/vcad-loon/src/convert.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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"db415800ac82df4b7606d7345c89059fbdc648f2218f6eca9f1fb990dafdf8c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060children.is_empty() \u0026\u0026 points.len() \u003C 12\u0060 appears character-identically in 2 files \u2014 crates/vcad-app/src/materializer.rs, crates/vcad-loon/src/convert.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":"crates/vcad-app/src/materializer.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59487b2b0eb51eead0d7da68ff0f8221bfd0719bdaf4668f0914acecf5c2111"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.parameters.is_empty() \u0026\u0026 doc.bindings.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/vcad-eval/src/evaluate.rs, crates/vcad-ir/src/resolve.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":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3933bb4be3157fd30fb5db6424c7fa9c4dbc7abb788dd3249b690a1e59be1bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fi \u003C 0 || fj \u003C 0 || fk \u003C 0 || fi \u003E= nx || fj \u003E= ny || fk \u003E= nz\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-flow/src/model.rs, crates/vcad-kernel-flow/src/solve.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":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca0a78945e3e0cca3040aecc3609f2b8b0b6e8f795d092c04f3914c5dcc5082"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gcode.contains(\u0022N0 \u0022) || gcode.contains(\u0022N10 \u0022)\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-cam/src/post/grbl.rs, crates/vcad-kernel-cam/src/post/linuxcnc.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":"crates/vcad-kernel-cam/src/post/grbl.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc32219370b0fe7f2839199453b561691e32b85e8c6f679240dd4ee64444106"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gnorm \u003C= 1e-12 * value.abs() || gnorm == 0.0\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-acoustics/src/optimize.rs, crates/vcad-kernel-particle/src/optimize.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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e12898dd20b6c776e38e6ef2a7f3e5c794b0dca522649b4992b97185e969ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i == 0 || j == 0 || i == n - 1 || j == n - 1\u0060 appears character-identically in 2 files \u2014 crates/vcad-ecad-pcb/src/router/auto.rs, crates/vcad-ecad-pcb/src/router/escape.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":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":5362}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a235d5dcd86f85bdeb8d7d8cfd5460b4a231f16a9b1e3b2f61884eb3a0646"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i0 \u002B 2 \u003E= mesh.vertices.len() || i1 \u002B 2 \u003E= mesh.vertices.len() || i2 \u002B 2 \u003E= mesh.vertices.len()\u0060 appears character-identically in 2 files \u2014 crates/vcad-cli/src/app.rs, crates/vcad-cli/src/main.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":"crates/vcad-cli/src/app.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be7473cba509eaf5269e64ce1b0f686c582dfd8b7c4663866f8007b92324fb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060idx \u003C total \u0026\u0026 self.sparse_entries[idx].row == row\u0060 appears character-identically in 2 files \u2014 crates/vcad-ecad-diff/src/design.rs, crates/vcad-kernel-constraints/src/symbolic.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":"crates/vcad-ecad-diff/src/design.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5b140f16a5d0a482583e6cd4fd1164aaf448dea366b9c271525d505c3a70db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mesh.vertices.is_empty() || mesh.indices.is_empty()\u0060 appears character-identically in 3 files \u2014 crates/vcad-kernel-physics/src/colliders.rs, crates/vcad-kernel-shell/src/lib.rs, crates/vcad-slicer/src/slice.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":"crates/vcad-kernel-physics/src/colliders.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29dd48b615e9cb974efcd7ce85fc5e1e6cfbcac3640fe252f7282d788e7716d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nets.contains(\u0022A\u0022) \u0026\u0026 nets.contains(\u0022B\u0022)\u0060 appears character-identically in 2 files \u2014 crates/vcad-ecad-fabprep/src/lib.rs, crates/vcad-ecad-fabprep/src/verdict.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":"crates/vcad-ecad-fabprep/src/lib.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f815bc42e30a3685903d0a3c44ff5e56783905411e8965494822a1c73da87d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.fill_frac \u003E 0.0 \u0026\u0026 opts.fill_frac \u003C= 1.0\u0060 appears character-identically in 3 files \u2014 crates/vcad-render/src/animate.rs, crates/vcad-render/src/lib.rs, crates/vcad-render/src/photoreal.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":"crates/vcad-render/src/animate.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e45c03c948e5f094efda446cf91f9f2a90d4d418ce526ce0b01726f7965e24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out.len() \u003E 2 \u0026\u0026 (*out.first().unwrap() - *out.last().unwrap()).length() \u003C 1e-3\u0060 appears character-identically in 2 files \u2014 crates/vcad-ecad-symbols/src/altium/mod.rs, crates/vcad-ecad-symbols/src/eagle_brd.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":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"326e332cc72f2224d3a7c5cf2a6ab172547783cd2b7804b4b22445a8c5bd572b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.x \u003E= lo.x - 1e-6 \u0026\u0026 p.x \u003C= hi.x \u002B 1e-6 \u0026\u0026 p.y \u003E= lo.y - 1e-6 \u0026\u0026 p.y \u003C= hi.y \u002B 1e-6\u0060 appears character-identically in 2 files \u2014 crates/vcad-cli/src/main.rs, crates/vcad-ecad-pcb/src/router/auto.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":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb93f824db2678e7fddb1e916817468af47a27e0042fee2573db0870f22de3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.x \u003E= self.min.x \u0026\u0026 p.x \u003C= self.max.x \u0026\u0026 p.y \u003E= self.min.y \u0026\u0026 p.y \u003C= self.max.y\u0060 appears character-identically in 2 files \u2014 crates/vcad-ecad-pcb/src/router/push_shove.rs, crates/vcad-ecad-symbols/src/altium/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":"crates/vcad-ecad-pcb/src/router/push_shove.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13b8dfdefdec0c181895c8bd4bc705bd3d2040f7dc28eeb2a1be38561ca0986"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pts.len() \u003E 1 \u0026\u0026 pts[0] == pts[pts.len() - 1]\u0060 appears character-identically in 2 files \u2014 crates/vcad-loon/src/convert.rs, crates/vcad-printcheck/src/checks.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":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea59af2cfcf3766ce3addab8c3a91ee6955850d28110af5d48ff3aaa479819ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.x[0] \u003C= 1.0 \u002B 1e-12 \u0026\u0026 r.x[1] \u003C= 2.0 \u002B 1e-12\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-acoustics/src/optimize.rs, crates/vcad-kernel-particle/src/optimize.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":"crates/vcad-kernel-acoustics/src/optimize.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af528445a5d9c3bf800ee6ede3408ae015fef7dc15aebaf33c7fc08c9f7f23f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.contains(\u0027,\u0027) || s.contains(\u0027\u0022\u0027) || s.contains(\u0027\\n\u0027)\u0060 appears character-identically in 2 files \u2014 crates/vcad-ecad-export/src/bom.rs, crates/vcad-ecad-export/src/pick_place.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":"crates/vcad-ecad-export/src/bom.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bd1c251cb68bdfccc571ae4caf3ee36533864fe3a773286fc4099cae3c957b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sample.draft_deg.abs() \u003C min_draft \u0026\u0026 sample.draft_deg \u003E -90.0\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-dfm/src/rules/casting.rs, crates/vcad-kernel-dfm/src/rules/mold.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":"crates/vcad-kernel-dfm/src/rules/casting.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31d5c9cbdddcf25c27cf877868c7b9c868320d7971f8838b5bb5195a623f67c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.re.is_finite() \u0026\u0026 self.im.is_finite()\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-acoustics/src/complex.rs, crates/vcad-kernel-antenna/src/complex.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":"crates/vcad-kernel-acoustics/src/complex.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a12a0e054f74f0e597d5111e64a666d804304fd8ed95ed494bffe5abfa22ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060settings.stepover \u003C= 0.0 || settings.stepover \u003E tool.diameter()\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-cam/src/operation/face.rs, crates/vcad-kernel-cam/src/operation/pocket.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":"crates/vcad-kernel-cam/src/operation/face.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fba45b2b6e2f535d61c528329eb9cfbe967ac2ea10c53cfa2b4af7e1b9ffdb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060size[0] \u003C= profile.bed_x \u0026\u0026 size[1] \u003C= profile.bed_y \u0026\u0026 size[2] \u003C= profile.bed_z\u0060 appears character-identically in 2 files \u2014 crates/vcad-atoms/src/fab.rs, crates/vcad-ffi/src/print.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":"crates/vcad-atoms/src/fab.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d6c09dd6481a41cf687fa196e3e652b754255447112a837dba76e597d6d215"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060steps.is_multiple_of(opts.check_every) \u0026\u0026 steps \u003E= opts.ramp_steps\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-flow/src/adjoint.rs, crates/vcad-kernel-flow/src/solve.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":"crates/vcad-kernel-flow/src/adjoint.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3453e4313fdcc95e98d986375a51861ffdaf8ea204ba1eb148f371913cad199"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060topo.half_edges[*he_id].twin.is_none() \u0026\u0026 topo.half_edges[twin_id].twin.is_none()\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-fillet/src/topology.rs, crates/vcad-kernel-shell/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":"crates/vcad-kernel-fillet/src/topology.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96f8ed31283f9df93b75e0f6e5c070c88838b29b3471fade2e18d85a5b94594"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060topo.half_edges[he_id].twin.is_none() \u0026\u0026 topo.half_edges[twin_id].twin.is_none()\u0060 appears character-identically in 3 files \u2014 crates/vcad-kernel-sketch/src/extrude.rs, crates/vcad-kernel-sketch/src/revolve.rs, crates/vcad-kernel-sweep/src/loft.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":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d1439086e4cd19f64b6f74d9660ea7f4c4595f4ea3f8788cfd14f9cb9a1fec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060va \u003C= 0.0 \u0026\u0026 (d4 - d3) \u003E= 0.0 \u0026\u0026 (d5 - d6) \u003E= 0.0\u0060 appears character-identically in 5 files \u2014 crates/vcad-kernel-booleans/src/classify.rs, crates/vcad-kernel-stocksim/src/verify.rs, crates/vcad-kernel-tessellate/src/clearance.rs, crates/vcad-kernel/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":"crates/vcad-kernel-booleans/src/classify.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e39d9addaaa74409ef0191163870ec32196fa7b86d1f24f6f5c1d98c1b076ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x_dir.norm() \u003C 1e-12 || y_dir.norm() \u003C 1e-12\u0060 appears character-identically in 2 files \u2014 crates/vcad-kernel-booleans/src/mesh/mod.rs, crates/vcad-kernel-shell/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":"crates/vcad-kernel-booleans/src/mesh/mod.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5b05f91c088624116e8f362c7e7aa90e9bee7f6df6eb452e6955dca56411a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x_dir.norm() \u003E 1e-12 \u0026\u0026 y_dir.norm() \u003E 1e-12\u0060 appears character-identically in 3 files \u2014 crates/vcad-kernel-fillet/src/chamfer.rs, crates/vcad-kernel-fillet/src/fillet_planar.rs, crates/vcad-kernel-sweep/src/sweep.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":"crates/vcad-kernel-fillet/src/chamfer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d53b33fb3cb26286b17b50ad631a0f439896576ca34a4c0817a995e2ffb6c50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!model.usesDocumentTree \u0026\u0026 model.assemblyInstanceCount == 0\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Shell.swift, apple/VcadVision/Sources/VcadVision/Shared/Shell.swift. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c797b9407093b794551de8fed32d5ed9026f7c9428c193731c2c60e3ffa00f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!model.usesDocumentTree || !model.documentDirty\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Shell.swift, apple/VcadVision/Sources/VcadVision/Shared/Shell.swift. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a634dce88d9645d3e7f4a1a1d1a5cf47c854a8fa883b16846c2246063b288ccf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!model.usesDocumentTree || model.selectedPartIndex == nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Shell.swift, apple/VcadVision/Sources/VcadVision/Shared/Shell.swift. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"66380786b8ee2f674dfd259228bae1b5a068a5a308f404c26fb0904c650ab422"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!undoStack.isEmpty || generationUndo != nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"986bedb28b886111eca8c44a60edacc4607d5b21da9b3e276903dbf9843ff542"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$0 == 0x20 || $0 == 0x0A || $0 == 0x0D || $0 == 0x09\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/PoseStudio.swift, apple/VcadApp/Sources/VcadApp/WelcomeWindow.swift. 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":"apple/VcadApp/Sources/VcadApp/PoseStudio.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81abe1d4b2962d0baccd6239b4ad1075a7b3ef7f840caf3cf21d78272993b6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$0.opType == \u0022Sketch2D\u0022 || $0.opType == \u0022SketchOnFace\u0022\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Document.swift, apple/VcadVision/Sources/VcadVision/Shared/Document.swift. 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f830d7cb55929a394cf800103bf4dda0aecdaaa3b2c5d1cb21b53976f0794b12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agentEnsureEngine() != nil \u0026\u0026 usesDocumentTree\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4907}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0b4a125d98e0cb12bdb63139601c5177a41850d815bf114bf40fa9aa181f76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allowEmpty || (!nodes.isEmpty \u0026\u0026 (!roots.isEmpty || hasInstances))\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Document.swift, apple/VcadVision/Sources/VcadVision/Shared/Document.swift. 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d687c38a8eda5c5c811fc85d5585e07d73be50a43376b97f8897f66acdadde"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060assemblyInstanceCount \u003E 0 \u0026\u0026 documentJSON != nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4549262d11cbf1bcb12113fc1cef602181221b9a0acc71c8784ac4f66ca2f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060assemblyInstanceCount \u003E 0 \u0026\u0026 timeline != nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a2f380f6cb7e2b0b499f19c3397f0f612cc1cec7fbd8e6d37dcf6e051d7b61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060baseShape == .sphere \u0026\u0026 modifier != .none\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3948}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fa0e0af3b036c7d227d6e9695fc4aca40d9f7dc53d5e95502361726141451c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060derivedRoots || count(state.document, \u0022roots\u0022) == count(dict, \u0022roots\u0022)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1599188c6ee80429c0e506d2c83c8a6fb7c0f5b65644f941d8120c2a576791"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060documentGraph != nil \u0026\u0026 (!featureNodes.isEmpty || engine != nil)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"e338373d4c64c0609bbe6ffecf57b536f3b6b2fcb4143c66d7c5c8ca26acb9e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060engine != nil || (source.isSandbox \u0026\u0026 documentJSON == nil)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70e612cce941f3ef73c728a70376f21e255ac83a45ad0bc5ad7d55fff4d48f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first.isEmpty || (!first.contains(\u0022[\u0022) \u0026\u0026 first.count \u003C 12)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/IntentBar.swift, apple/VcadVision/Sources/VcadVision/Shared/IntentBar.swift. 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":"apple/VcadApp/Sources/VcadApp/IntentBar.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df30e8094f077d5cf2ac0bbb38b8cc0440860d710b07ab11af3f2b2c10c893a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first?.isNumber == true || cleaned.isEmpty\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6784ab018422af18027307fde371dc78ccf98759604e95584f3a796d3c012f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hovering || model.hoveredFeatureID == node.id || (node.partIndex != nil \u0026\u0026 node.partIndex == model.hoveredPartIndex)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Shell.swift, apple/VcadVision/Sources/VcadVision/Shared/Shell.swift. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfbd30547d416103b5dc022df620b6e543c292a898345f048fb00207b223c21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isolatedPart != nil || !hiddenParts.isEmpty\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c8a76297caf2a28523e48f7c282a1be1fd0078dffe1990a0cb491de2702c58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022Revolute\u0022 || kind == \u0022Slider\u0022 || kind == \u0022Prismatic\u0022\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Document.swift, apple/VcadVision/Sources/VcadVision/Shared/Document.swift. 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0e964a13884f516abe60da00ccae1d429fe8cd025a0e4e8b21d00a5230de2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060l.contains(\u0022foot\u0022) || l.contains(\u0022ankle_roll\u0022) || l.contains(\u0022toe\u0022)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Sim.swift, apple/VcadVision/Sources/VcadVision/Shared/Sim.swift. 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32c740d56f55d8d2b0029a63cc7617865f30864672d06aafe63fdc4ccb0a4ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loading == nil || loading?.isFailed == true || loading?.url != url\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd3ac1668750d4391d5e2851d7199c5b592d3dbce9caf72f0e22f0c51c6596b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loading?.isEvaluating == true || evalJob != nil || preparedScene != nil || openHold != nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a154b82c24ee1bc881a253322b6400e1ef38d23717b1b518d084320618ec125"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loadingPrevious == nil || loadingPrevious == source\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3691}}}],"partialFingerprints":{"codehealthFindingId/v1":"353889bd8383a3bf86b175cdeec04661111184c4e5b5093382cdb78a96e4e178"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower == node.opType.lowercased() || lower == Self.label(node.opType).lowercased()\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Document.swift, apple/VcadVision/Sources/VcadVision/Shared/Document.swift. 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"de578b365f0a7c8299b0389243ce8e6593466d53aa4ffaf713f5c3cef484e4f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022hip\u0022) || lower.contains(\u0022knee\u0022)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Sim.swift, apple/VcadVision/Sources/VcadVision/Shared/Sim.swift. 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":"apple/VcadApp/Sources/VcadApp/Sim.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edc5485a7409b546f7f77e61b7c212818673e807348c38b48318fde29724950"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mesh == nil || vcount \u003E vertexCapacity || icount \u003E indexCapacity\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Kernel.swift, apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift. 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6d0eb8eed80edd54c6a01564e524cd715f9a27e0f3456ce4485b29af14123f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.allHeld \u0026\u0026 model.connectorOK \u0026\u0026 !model.receiptStale\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift, apple/VcadVision/Sources/VcadVision/Shared/ReceiptLedger.swift. 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":"apple/VcadApp/Sources/VcadApp/ReceiptLedger.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bddb7c54bd5cef9d4c9473f109d1b755e78fd4f4686d9f2dbc4581d8733210"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.documentURL == nil || !model.usesDocumentTree\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Shell.swift, apple/VcadVision/Sources/VcadVision/Shared/Shell.swift. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"96abdf3eb4d66c9be6df3ab951e0d76ad5b421fc87544ef051286effb25f4dc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.recents.isEmpty \u0026\u0026 unsaved.isEmpty\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Shell.swift, apple/VcadVision/Sources/VcadVision/Shared/Shell.swift. 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":"apple/VcadApp/Sources/VcadApp/Shell.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c99da3db635cb6b2a0009a0af027e28f670c1bccf933ef03012df707c7ee6a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normals.isEmpty || !Self.normalsTrustworthy(normals, positions: positions, indices: indices)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Kernel.swift, apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift. 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb9a1b16a31bedf718990072256dc89d5fded24e7d57b1a641bb1c3df0b143"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060openHold != nil || evalJob != nil || preparedScene != nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3726}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4c28e45eca905762cd0a60cc3a344708f713a46b02a179f71f7061cc79669e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seen == 0 || Double(bad) / Double(seen) \u003C= 0.005\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Kernel.swift, apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift. 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"776bccea59c385a1e9f4bb9034e5bc37113146d986d291ba7306407f486d1609"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectedFeatureID != \u0022base\u0022 \u0026\u0026 modifier != .none \u0026\u0026 modifierValue \u003E 0.05\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":4069}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f18f17aba624a6c907614c169b3110401324fefd2793f54838b1c5678fd7fbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectedFeatureID != nil || !multiSelectedParts.isEmpty || selectedInstanceIndex != nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a1be61bcb5964b1fc578e292629cddd53f24e943614b68027bbea4a1d77eed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectedPartIndex != nil || picking.selectionPart != nil\u0060 appears character-identically in 3 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadApp/Sources/VcadApp/FeatureOpsPalette.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"de98761e467f9fde65a27b7a839f28d4fddfba6452849699a5f7fe6766196e9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sketch != nil \u0026\u0026 sketchFinishBlocker == nil\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"116550a64bcd36766d74e0f386e9b99f04c9c71aa6cafd3f5632c032e7ed67dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.isSandbox \u0026\u0026 !canUndo \u0026\u0026 !documentDirty\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c085adeb034a52b54062759c2ff98e6a996d15c65c91d882ad8b507b73d4d7e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.isSandbox \u0026\u0026 baseShape == .cube \u0026\u0026 modifier == .fillet \u0026\u0026 selectedFeatureID == \u0022modifier\u0022\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbd9125b7581c5193a0f3ccf926aad344b9bbf0f987e0890a18bfb72fb3ac57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type == \u0022LinearPattern\u0022 || type == \u0022CircularPattern\u0022\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Document.swift, apple/VcadVision/Sources/VcadVision/Shared/Document.swift. 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":"apple/VcadApp/Sources/VcadApp/Document.swift"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edbcf862e9e79138b6546b7e50712823806c1293bcb0c542cf15d01f4ce0f16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usesDocumentTree \u0026\u0026 !highlightedParts.isEmpty\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1f6cbbdbec681b4de4bf841a0e6f98988bf32f39dc91eed92f40cd541173ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usesDocumentTree \u0026\u0026 !sketching \u0026\u0026 multiSelectedParts.isEmpty \u0026\u0026 (selectedPartIndex != nil || pullFace != nil)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bd9a542a5c12870bda77d839ad09466f33bebe3df4cadf957e190017ec0bb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usesDocumentTree || (source.isSandbox \u0026\u0026 documentJSON == nil)\u0060 appears character-identically in 2 files \u2014 apple/VcadApp/Sources/VcadApp/Editor.swift, apple/VcadVision/Sources/VcadVision/Shared/Editor.swift. 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":"apple/VcadApp/Sources/VcadApp/Editor.swift"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46c687dcf3fef023eaef545548418e7ca23dcde22e5633d160127684e54c3a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v.normals_len == v.vertices_len \u0026\u0026 v.normals != nil\u0060 appears character-identically in 3 files \u2014 apple/VcadApp/Sources/VcadApp/Kernel.swift, apple/VcadApp/Sources/VcadApp/PathTracer.swift, apple/VcadVision/Sources/VcadVision/Shared/Kernel.swift. 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":"apple/VcadApp/Sources/VcadApp/Kernel.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"755e6fe589e7acbf4ebcdaecac0c005ddef96baf4d29b002cad64ec6f5647acf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stableKey\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 156 (\u0060stableKey\u0060) with a piece of \u0060value\u0060 (and at line 160) \u2014 and nowhere in \u0060stableKey\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060stableKey\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/document-solids.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a0e4b713b66212250fe6266566457dcf75991064c8374fc5c1bb9d54426fe7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalJson\u0060 is exported and takes \u0060v: unknown\u0060 from its caller, and it calls itself at line 299 (\u0060canonicalJson\u0060) with a piece of \u0060v\u0060 (and at line 304) \u2014 and nowhere in \u0060canonicalJson\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060canonicalJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23e4b27862a20bbfc05dd91246489497da970305a66ba2b7ea57366cdc54b94"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sameUnderSerdeDefaults\u0060 is exported and takes \u0060a: unknown\u0060 from its caller, and it calls itself at line 805 (\u0060sameUnderSerdeDefaults\u0060) with a piece of \u0060a\u0060 (and at line 810) \u2014 and nowhere in \u0060sameUnderSerdeDefaults\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060sameUnderSerdeDefaults\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/tools/registry-dispatch.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf37ae0df99f4e1c930654bea1f175f917f24815e41c4334f62ea0910338838"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalJson\u0060 is exported, takes a document from its caller (line 27) and hands it to \u0060sortKeys\u0060, which calls itself at line 16 (\u0060sortKeys\u0060) with a piece of \u0060v\u0060 (and at line 20) \u2014 and nowhere in \u0060sortKeys\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060sortKeys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mcp/src/fabricate/kerf/intent-hash.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a62a0ac5aad6f419ceaee186f2fd588b8d7862ceb4b2f28b39f7e3db1a66b2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060freeVars\u0060 is exported, takes a document from its caller (line 138) and hands it to \u0060walk\u0060, which calls itself at line 149 (\u0060walk\u0060) with a piece of \u0060a\u0060 (and at line 150, line 153, line 156) \u2014 and nowhere in \u0060walk\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/expressions.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc4be793032ce489710aa09cf26d951ca8ba42c27ca71a6e78c3be8ea3c18e2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060mapsToObjects\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 226 (\u0060mapsToObjects\u0060) with a piece of \u0060value\u0060 (and at line 229, line 232) \u2014 and nowhere in \u0060mapsToObjects\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060mapsToObjects\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core/src/utils/save-load.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"736d42eef1a29c59e509ca4b852e9100780ceb50dbcea0674687986c3d177f55"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060translate\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 98 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060translate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b3a06ab4e8283b680fdc7e6df47f8476c5c3b9702d6b577d30fac0d4d25aa3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060rotate\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 103 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060rotate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"189fda31bc0d79a73b24151ed5cec7d8d89391edf55ce7361bac4d439e2f2484"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060scale\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 108 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060scale\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d23d244cf1d93b63b7dbff58447294e4803043db06b7fd79d49b5284eb2f3f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060chamfer\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 114 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060chamfer\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"95db68fbec811752ce16c26bb1905b63469a2ee06be3220dc0d9e9cfeec35f06"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fillet\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 122 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060fillet\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ed39ad626c51c2e962c78af7fb2846eba4f55cec2cafe154119dae9ba2cc7c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shell\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 130 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060shell\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"438ea0fbab0ed7021951120ecbe08c656d60cb86697335a5f118dcd7cf342d80"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060linear_pattern\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 141 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060linear_pattern\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"336696cf8cae3d25bfbfed2275e763260513d3a347ee6459ae9d7227c1e93740"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060circular_pattern\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 160 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060circular_pattern\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f74dde9b266810caa64f37426e2b5efa93d42243c9fff76ba77fe81e4ddf4e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060volume\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 205 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060volume\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-site-wasm/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1d17e7a29c93e08f85226597c708c71e40d77f35239fe03e8562a07c5218ee"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_from\u0060 is public and takes \u0060w: \u0026WireAst\u0060 from its caller, and it calls itself at line 120 with a piece of the document (and at line 121, line 129) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060try_from\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/expressions.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc112ee288f5770ce9afd270bef494531f4c617d82db4906570328dc855e13fe"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060mirror\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1221 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060mirror\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"92719072bf849116cb288a8e28ceec98a41919b553c0237e28a5d30225ebcf73"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060num_triangles\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 2062 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060num_triangles\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ffbe51a728108acd99862bf7a8d0a24ab77e04cc8dd8ae711e3e79b6913b36"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060bounding_box\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1979 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060bounding_box\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c47ff5ebb5cb60bdc49b06a3773a42854e2827b039d43013de6e2490f4c0e60"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060translate\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1656 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060translate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b165181da73f005e7ff01c0da72fea753b8576123b75e5b30afd614049f7f5d5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060rotate\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1664 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060rotate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"082e152681e671ec4efe3d69d059fa2f949b2a1af23ae8156d218f6161564db3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060scale\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1672 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060scale\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdea45209b0865eb1159d01186193d5f2209138ac9cf442935c9bfbc23d861e9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060chamfer\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1689 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060chamfer\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33da8b835302de69f52834bcb22e90333b74545bb30271ed93850e15f3f7d65"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060edge_blend\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1727 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060edge_blend\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"46037788d0eac0ac0aab3f17c7301a559320fd886ef02d7b59f1db6b32909b7b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fillet\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1743 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060fillet\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"81675c2dc9e453a232e4a6fdb0c57f6fee2ded47d42bcd2b68aefcd69cb5fd92"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shell\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1754 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060shell\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee99d58fb3a511a92c29c3c495cf37bc9bba29a42f86fc1b6ea3981120da85"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060linear_pattern\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1800 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060linear_pattern\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1d35df1e831fba9639853bf0b55c0e52b7d2e97731912558daf4995baf078"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060circular_pattern\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1827 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060circular_pattern\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"94465befef0ee8686e5b4cdc4327a27a288f7c7a363d6c8b9ebe878db1342c7a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sweep_rotate\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1857 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060sweep_rotate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"446ecc5b47c5d304bb8bce5cef2ece802800f8222ab1cc12a69bad5298163069"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_empty\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1875 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_empty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d411d64b680c57653924a1afe9956503dba3d7d119d7b8acd699617967d06504"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060volume\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1954 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060volume\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74cbee41cfc46a82f204b1a7de21487a9bf5006ade10210538efedf8076e1d4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060signed_volume\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1961 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060signed_volume\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec92f4b790b09d8981414ec8acfb1db5c0f80df61ba9966dc05b31a99368321"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_inside_out\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1967 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_inside_out\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c456d9a071a98aa74859f606fb0ee26ce1d70549612d3a307e374ec30260ec56"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060surface_area\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1973 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060surface_area\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"628d45776303cb01c13b020e5fcb6b74579030acedaf41ac02ad2e20b79083de"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clearance\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 1989 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clearance\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff8797bb46f189d242f69703749a33e0eaf8654c0f9bcb8279e60a0069b2e9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060center_of_mass\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 2055 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060center_of_mass\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"6619fcda8cc8c8ffa9ac577a8a2c5672a2d48ad1ec155e08181602b7f10259d8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_step_buffer\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 2184 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060to_step_buffer\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021783cd581a8dc7b208270c5eb31fa945e7299b1290bc8e0e8d0accf0d6aa4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060can_export_step\u0060 is public and takes a \u0060Solid\u0060 as its receiver from its caller, and it calls itself at line 2194 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060can_export_step\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"578effbbacc745058eda0e3cdc56d261eba04d1e78fd6e98ffbfb5473b81e68a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_inside\u0060 is public and takes a \u0060OctreeNode\u0060 as its receiver from its caller, and it calls itself at line 44 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_inside\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-stocksim/src/octree.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1149a5ce3a507ca04a9c4064712530351591b1bea4f27f9ca47777fac5ae6a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sdf\u0060 is public and takes a \u0060OctreeNode\u0060 as its receiver from its caller, and it calls itself at line 64 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060sdf\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-stocksim/src/octree.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8b4a7fc01fe40bc833e783224ebd6b9561df00d217b4c658412d7742039166"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve\u0060 is public and takes a \u0060StepCurve\u0060 as its receiver from its caller, and it calls itself at line 47 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060resolve\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f6e3f095fb0e551fa4939eba9df95956504d0a342c6c163d7df9aa5ebfeeaa"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060evaluate\u0060 is public and takes a \u0060StepCurve\u0060 as its receiver from its caller, and it calls itself at line 68 with a piece of the document (and at line 71) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060evaluate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/entities/curves.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3febad71984e3958429c8d23a0771aa26a1d238236cf81e23e69424f76b3ad06"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fingerprint_document\u0060 is public, takes a document from its caller (line 451) and hands it to \u0060canonical_stringify\u0060, which calls itself at line 407 with a piece of the document (and at line 421) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060canonical_stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e2d93c179bfa65da1f4ae7f6c77902bbb9f5a7282a441b6bdf7e5441484ba9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060eval\u0060 is public and takes \u0060ast: \u0026Ast\u0060 from its caller, and it recurses at line 509 through \u0060call_builtin\u0060 and back with a piece of the document (and at line 510, line 531, line 537, line 554) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060eval\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/expr_parser.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4e34a98efc7de49764726826dee65a30db07eed093cb1af985ec0691ca41b4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060free_vars\u0060 is public, takes a document from its caller (line 659) and hands it to \u0060walk\u0060, which calls itself at line 669 with a piece of the document (and at line 670, line 672, line 675) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/expr_parser.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dde304d4c1bd02459463ce1bafbec795bc9f86738af1422fe514f37dad56c9e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_str\u0060 is public and takes a \u0060SExpr\u0060 as its receiver from its caller, and it calls itself at line 33 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060as_str\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/sexpr.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db4572465d5a39923f413685363001c9e4fe85912a8438726a4af58be6e5fa7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060find\u0060 is public and takes a \u0060SExpr\u0060 as its receiver from its caller, and it calls itself at line 55 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060find\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/sexpr.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05b6cdd615a2b5ed4c824b1b8698572c912757c03459d28caddb99af2434143"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply\u0060 is public and takes \u0060cmd: DocCommand\u0060 from its caller, and it recurses at line 250 through \u0060apply_checked\u0060, \u0060apply_batch\u0060 and back with a piece of the document (and at line 253, line 360, line 369) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060apply\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/command.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"141a97555149616a341f1bd334ddd1485dae810581f363aacb3d05d0ed1890b3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060eval\u0060 is public and takes a \u0060WhenExpr\u0060 as its receiver from its caller, and it calls itself at line 167 with a piece of the document (and at line 168, line 169) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060eval\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/context.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a828cc1db86cdb63ec3f018b6273639f0018320f7125ab96495143535fb981a8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060referenced_flags\u0060 is public, takes a document from its caller (line 175) and hands it to \u0060walk\u0060, which calls itself at line 187 with a piece of the document (and at line 189, line 190) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/context.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81be27572b11b4a9ec658852a19f4e79b5c90de46e3bde0800631ea5a02eef0"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposes a dependency it does not own: \u0060transport\u0060 is never created by \u0060DocumentEngineClient\u0060 \u2014 it is the constructor parameter \u0060transport\u0060 (line 279), and its declared type \u0060EngineTransport\u0060 is an interface \u2014 yet this class disposes it here (line 353). The instance came from whoever resolved it, and that owner decides when it ends. Disposing it from here reaches outside this object\u0027s lifetime: a dependency shared with the rest of the program is torn down when THIS instance goes away, and the real owner\u0027s later \u0060dispose()\u0060 runs a second time on an object already disposed. Drop the call \u2014 a class disposes what it constructed, and only that. If this dependency genuinely is exclusive to this instance, construct it here (or take an owned factory) so the ownership is stated in the code rather than assumed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/engine/src/engine-host.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcb5e51863a047c26eebae14557c5b884a76b5be44ec0eb642753c9617675fe"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 2/16 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: buildBoard: \u0060buildBoard\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"www/public/kit/gallery.js"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b6ed3978e53cf310aa8e6e467a6e2f8d57267856190f49cfe006f17f0d4aab"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":11830}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ced301579569a17a5daa4b4c2374ff3ed934097625d1045b44c459d89c1adc3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchAndPrimeKernelWasm: \u0060fetchAndPrimeKernelWasm\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/bootstrap.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53a108696278bde538ba6015428e1865d4e47acad307e5b2d177193fd75369d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadCompressedField: \u0060loadCompressedField\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/compressed-field.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6e3510417026dfd23da3faf2c886ed18beff8558afed28fe9bd368c81a9fd0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadFieldStack: \u0060loadFieldStack\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/compressed-field.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"accb5aeddee61a888e3500dadb2f5933854c62d2c99fd93744da61579d6f70a5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: discoverPrinters: \u0060discoverPrinters\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd12f45321c671dff1678f69d182d0960ec2532ca58fa7c183f42aa00d08044"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: connectPrinter: \u0060connectPrinter\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7320b973759dfe2de2b00665911fc09824690b5b089bbb2dc3023a2c000d5b42"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getPrinterStatus: \u0060getPrinterStatus\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fdec6cb8941b6d5098ed7ab038044a186520abe0f6aef200476f4845aa887c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: sendPrint: \u0060sendPrint\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaaf31eb91317e6fad472783c340eb8b591f15ab2e73f1eac32b11c11670a6c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: controlPrinter: \u0060controlPrinter\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/print-relay.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a444de5d89dd476413e6e49c92a942ac9dd05b395214ca5484838683700adb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchBuffer: \u0060fetchBuffer\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/lib/urdf-meshes.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1a36fc0edce617ce8bb920e6f7d6b32cc2eff58e38732374e2741f8b295b45"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: check: \u0060check\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/src/hooks/useAppUpdate.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb60f351b7ceccdcd30953114083438ad8d5c4d2633452c9eabf35496087ff9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: wake: \u0060wake\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app/public/launch/launch.js"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f36874397f038f4dbeac59cc5fcc7cb9b9839d19f152bdbca9a4335a7272bf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: listen: \u0060listen\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/scripts/vcad-app-mcp.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c164579541af7f06469f6122c80d393dfae4d05711aadfef3a2c11cf53ba1d0e"}},{"ruleId":"X25","level":"warning","message":{"text":"Option is kept and never read: \u0060Registry\u0060 accepts \u0060config\u0060 from the caller and keeps it in \u0060this.config\u0060 on line 40, where only it can read the value \u2014 but nothing ever reads \u0060this.config\u0060. Setting \u0060config\u0060 therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read \u0060this.config\u0060 where the behaviour it configures is decided \u2014 or, if the behaviour genuinely is fixed, remove \u0060config\u0060 from the accepted options so callers stop setting a knob that does nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/wasmosis/src/registry.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f578549d4e5977f7d9411f17d7b8a419cd97fec8343434bb8a84910d8d1ec334"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Expect.hash\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/parity.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"204334b4b6989a761bab3c40a35c929aa8c9ffc781038b422a7dce691b644d36"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Export.strict_brep\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"be02867192ad9d5d6a1f1cccbf37e7556f4c8d32eaf07283e33dd87249ae6d7a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Route.blind_vias\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"254d49d9563a062c6fc7953ca822050d4946ace2c29d8b40aad503f6f4b2700c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Route.only\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30dd286b65fd1c7f1f0cef6bd0f5ca3decd1358b3e5d46e3c67bfcbe59c286e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Route.escape\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e287279032cf64ff45a665977b74319bd3de01c61dbce028e323c314cc654dc9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Route.explain_pours\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"334331b7c4061d14840d7d24435977f4989978610d473dc184b95902747f9966"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::ImportUrdf.relative_meshes\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2ba2400aa7040082faa09268426228e3f6ef56a3d959647974bfedb3925421"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Features.min_count\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d811d76cbb12ec84f9b7aa7ef089734c1379243f43f050b58c0219b165f0cca"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Boolean.part_a\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"847a81d59c2560f2ff16d9c1346c0e9c9d23465c470e09e12b2bf2ac3d21b4ff"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Boolean.part_b\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3396f5cb14a154808dea85e46fc607459a7df4a1915b3ad3a2c13858fe30f39"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Boolean.result_name\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b90ca37b4b00066c33c1ea76b4b0aa8cec2eb52fe9621f216f8cf98da6791c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Simulate.log_every\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2a46efe2f7de7dab899a7c4efdfca6fe5aa80b137e01b7b2d23af4e14382af"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Slice.smart\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff6e72d44e544d53f68f823c917d846302dcdc3dfb3ff821fc3fd2be530ee22"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Slice.explain\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c7421960624e61ef4e0fa4185b68db8239fe001942d04a8fcf123b9d83a456"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Dfm.pack\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0abef2f9e212061bb662b57cf1e3c8c203828d90bf50a65988a6db2068d2ff"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Check.allow_bridge\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5956a1d7b64cafd220c176d078a4978301667b9db3c5cf48a27d712bbfaec894"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Probe.quiet\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"482db746891fb561fe290dd0af58928f0d2fa23a96812a936bbce4956faf445f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060EvalCost.base_eval_ms\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0e4af1a2a3fc16f303d553f1408ad9a7a58b2b4d4d30fa1fc8341ed1b9c75e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LegacyVcadFile.consumed_parts\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"397d54a3e0cbb6e912300cbb4359bd720fb7e55c11a9e0cab6f085df9a8bee54"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LegacyVcadFile.next_part_num\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4403ba01cf28dcc59954ff30c921664b6fd87814e2049193bd91b32622aa5f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LegacyVcadFile.loon_source\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/file_io.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c8e9b4b0fc9d24d8cae46ecf7be660036118f2de683140496ab3d19aaa9718"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060FillParams.fill_type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b0fb4fe78d124673bd869391760942e0c7af06311f0e381d18b70c61d27255"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060FillParams.density_mm\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9712fe3645da7497df6ba5ba36ccf52f1da57d0371576ef7cc4413b5a76f5e1a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060FillParams.underlay\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4581344f51301cc31681bbdb6f3f6a04fb6228972d3bf8f64db3c041032e1cdf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060FillParams.max_stitch_length_mm\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac94def3656827a8067477a960223c9366e9158c2973aca206182d0e265fa39"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MaterialDef.emissive_map_origin\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef8ed92523ffa7547341a96dfcb362b208eb46c78ab2e3fa5b511fc0748d56"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MaterialDef.emissive_map_u\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55863dc9717cdc8fe9a287af3ca6a1ec3d071c808481d5ab512e7755ae2c306"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MaterialDef.emissive_map_v\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"910a20e1c8ff2b4919ee86c2d54193a02d155548e0aea0b5b98cfcccfd65646c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PostProcessing.silhouette\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"04231c12d2c67f43437a7242659e78979ad3a045e231661299050d68c6c7ba3b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Document.claims_ledger\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/lib.rs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"881409c1c6d22aa1a5a8f2c12d373ce590f2fa2bd53625e11f939815072a5fdd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MdConfig.bond_r0\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-atoms/src/wasm.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"47637d5a636b5f27f7c6c97ea63a5ca421cffadc0218a1e2e9c4f9f1d089c938"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MdConfig.thermostat_tau\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Its value is copied into \u0060tau_fs\u0060, and nothing reads that either. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-atoms/src/wasm.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0463bdf9b5364f5bfd21d2b0acdf2c6c624e9b875cc561f9dc64af231278772b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MeasurementContext.measured_at\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da1589c5e26a14c62095686ece3de083221c9ce35e8035f446a02dbf0b3b29e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DfmIssue.explanation\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/issue.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94747232329a53c6c858e6a56d3400c253968f78f6e28e47b018b640470c7c8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DfmIssue.edge_indices\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/issue.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fb2043db2697cd14c86f78422830d03f967f563c5290704b89b1b065d53923"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RenderedDimension.is_basic\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dimension/render.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb91274158a3750cb8d62729f596ebd97d1264e064a14d1bc828027ceb477f0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DimensionStyle.dimension_line_offset\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dimension/style.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a6136ce6b86fb6b8c74aab18e400a9132af502fa9b6dc08a5cc30e4f1e5dc1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ProjectedView.view_direction\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/types.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4afc0cdf2f1e9c2952bcc94a0ef37ecc08e74e2c3075d614d383af1767babdd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ClaimsLedger.schema\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-receipt/src/ledger.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dce276e8feb6a367befed413ed3d0aa500375bf0c60c357ec1e5eed88a1d8a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ClaimsLedger.claim_sets\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-receipt/src/ledger.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5a33c15327a0839cdd99e5a374b54be526cfca4db14e82c17787f685842f1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DesignReceipt.schema\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-receipt/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dfee94bbf0554ed4b7d7ad5c86d5f6b94e83cff17023eb9950ddccd1461dd3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DesignReceipt.generated_at\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-receipt/src/lib.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07c2f502c05837a74df7d46083dec9e7621e20329f899c590a1ee078ed69ca3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AmsStatus.active_unit\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-bambu/src/status.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a202c23961f3afbb0c04d029a4b864a4b28123ffc7e9b863e4ff15548adc4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AmsStatus.active_slot\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-bambu/src/status.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9762d964a085f03dd4e227b77d9e2b4fedc5d90f22f032da766b50daa78b7cc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterStatus.time_elapsed_min\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-bambu/src/status.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3797f4ed77130f2b4465cdb8e5fad7d52a84d911e8c9653a0c9439654ab630"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterStatus.chamber_temp\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-bambu/src/status.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1a08f58ee1ec24fd82ebe534eea25fa282c2f2aa3af82853ea2938223471fe"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterStatus.wifi_signal\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-bambu/src/status.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c08f571a56e553902f65a7e43b209a20cbb1bb4299365aa0e80c28d6c9da14b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterProfile.heated_bed\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/printer.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5a870e6f23fab984a82cdde6eeeca6f2aa61db51c20a8f5d2a5cba66962113"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterProfile.extruder_count\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/printer.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d494664c77751d4c303d8b7223d9fb7e044e3b83cf507ea47b11b0af5c6ced5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterProfile.max_feedrate_x\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/printer.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ae8cf7ec92ad2b4e3e31c114e8366bdd86ed1225ccbf1b40e3783236a894aa"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterProfile.max_feedrate_y\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/printer.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa15399a0c8728b8b0fc5d437d5c27bdfa40abd135f776ec9e6667fc49d4a354"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterProfile.max_feedrate_e\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/printer.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"313bdfee13d2e94318660509a93d4b23644b342dc31250aa08ad20d4d93d0af5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PrinterProfile.max_acceleration\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-gcode/src/printer.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8781dca171f694c0c82f70a5f674a08fa56845f27154c70f50d38bd746a0cb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Limits.max_tokens\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/task.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9469c7a774a0a7730e6648f2455852b1c7c156d94a5eaf4dac75ecfefd2d965"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Limits.max_wallclock_sec\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/task.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7b3c2be084db7b168c0893ff14782d00f7dc84de45843c882020e0b0856441"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Limits.max_tool_calls\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/task.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"58daf41dbfeb29a591f3f0a0825309f902097731917a05ff185c8587a17db450"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060doc.instances.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_body_valid\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/suite_c.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"70032decd5c7a7d30b2aa2f393b49e53c1adc08991019fe8eec1cd064563d56e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026blob)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/bin/grade.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f295bbf4af4849e59ba364d47a08ad9f3a78abdc5c94a847f80c18b14bc22e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::args().nth(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/bin/inspect-topo.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"85410a6fa92e85212786e8559d51791f9c7f63ba7cef19b70a3d42bf25a9b9fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(\u0026path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mecheval/graders/src/bin/inspect-topo.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"27802917ce30106e6c8564f62afbf2d9dac46e3dbb9bb0145947ff731071dde9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rows.iter().find(|c|c.arrangement==arrangement)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_markdown\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/fidelity.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe4fea80c77b7267cea0b264972e67a2587b69c748e264698036e4f4e46c68c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_case\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea59baf40246a0e0eb7c1f075c4fdb9f0f47debd5072b18b7778dbd8618ccbf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"729948bc5f23f1631d792958c0a8cbfaaf8273204edb8360842789d9316e1429"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060results.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9fbc8d2e82372758dcb8ee605f0f7898792147038fa6ed59500eb015f9464a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026card)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aab411eab918926aebd151343a34879b4b2a697881bc3e08f9c0ab038c0ea56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(path,serde_json::to_string_pretty(\u0026card).unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"287c3e4746048770224f2d38ef55830d07c2f2702238ffa4e8b935e97d10f766"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026card)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2e2c0fc8edb047062afd3fd05b4050d03223ddaa4131b6c50ed4a4bf9af3a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(path,serde_json::to_string_pretty(\u0026card).unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"578fa959be8929675bb988a19bd03cc7ad3571ba0cd912a5cd3338c2007933a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::OpenOptions::new().create(true).append(true).open(path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6744e46f7769be1a8930271edaa77512f3cccc3cf24efc0a8feb763dfaf941e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(f,\u0022## Kernel torture track ({subset} subset)\\n\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdec08a3f483cbbf2bfc0217ae7406b617afbc5f393387aebb802ec3f9857462"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(f,\u0022{}\u0022,card.to_markdown())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f309c2912754b277465befb66f13e6b2d7555f90d9539c44fd09024b5fb2b80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"77966e69a0f126f89c44dac6b98fb6380cb79fdf68cd5bad955f76cae0499a99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026std::fs::read_to_string(path).expect(\u0022read --baseline\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-torture/src/main.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eb87bba837672be61a29658503a917a0b8abc3f60da1e966ce4e868a8c27a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ch.to_lowercase().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_snake_case\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-tool-derive/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2578131226fcfe38fb173686d859d89a60f7523de2363efbee49eace51bb426f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.ident.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_fields_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-tool-derive/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f5397dd52d0163d288108950e163a60d4b750597da39f18d7ea27af4634284"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prop.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_fields_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-tool-derive/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce0c9f81e9ad981eb01631efba099eb006deb168c2916a3c258b3ae8e9ff71c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema[\u0022properties\u0022].as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_fields_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-tool-derive/src/lib.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b073bfb7eff44ab37494eec05498e253e41c4853bdfeb55797b9c32705a7b62"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_fields_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-tool-derive/src/lib.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb7172f8110a4ed31ee84a3d398a52bb37553f638efd76325f41a72d2c7bc1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vcad_ir::materials::resolve_def(\u0022aluminum_6061\u0022,None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fallback_aluminium\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-sound/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d14c6fe2d99d02588b5b8ca9e8b6c3c4fe1c606e6a20afdf1ac209b65220f45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SoundMaterial::from_resolved(\u0026m)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fallback_aluminium\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-sound/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a6ad07dc38210a941387aaebbc586d0da45aba6dbac672f724ece611558328"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rustls::ClientConfig::builder_with_provider(Arc::new(rustls::crypto::ring::default_provider(),)).with_safe_default_protocol_versions()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060printer_client_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-bambu/src/tls.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a11ac32633f2062d89ca51a025c3ce38cb87e8d8108961d178e7a65c294d53c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rustls022::ClientConfig::builder_with_provider(Arc::new(rustls022::crypto::ring::default_provider(),)).with_safe_default_protocol_versions()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mqtt_client_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer-bambu/src/tls.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13dedca78a6441d3922ee287f722709c2ffff13f07eb6693b65f9663ae12400"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060remaining.iter().enumerate().min_by(|(_,\u0026a),(_,\u0026b)|{let dist_a=if let Some(p)=polygons[a].points.first(){(current_pos-*p).norm()}else{f64::MAX};let dist_b=if let Some(p)=polygons[b].points.first(){(current_pos-*p).norm()}else{f64::MAX};dist_a.partial_cmp(\u0026dist_b).unwrap_or(std::cmp::Ordering::Equal)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060optimize_polygon_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/path.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"808c7407ffbab005f369c8abad17a4c347dc59976da2c0a8e4b344e0857db68b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060remaining.iter().enumerate().min_by(|(_,\u0026a),(_,\u0026b)|{let dist_a=if let Some(p)=polylines[a].start(){(current_pos-*p).norm()}else{f64::MAX};let dist_b=if let Some(p)=polylines[b].start(){(current_pos-*p).norm()}else{f64::MAX};dist_a.partial_cmp(\u0026dist_b).unwrap_or(std::cmp::Ordering::Equal)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060optimize_polyline_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/path.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3594f06b194f2faec7138c1d08539e7d2ac6316690cf398ef39e9b7747f5a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"de342e1b2e6c38d4b820f0d9618063c3b81e8a1b88ad2837443262aedcdda1b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"58963e4f6ccc16d66a31c45f542d1cd5edc18a026cc2343978b7eaa4736de813"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2689d70cf8a795560a93d55403d6fda5d3f1efb27035ad2997a5af112120b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"855f4b70fbfbfe21980a4a187e40639124c512b37d04440d9110217923b5dffc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.signed_area().abs().partial_cmp(\u0026a.signed_area().abs())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-slicer/src/slice.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5b4f58aa2f441f231b361e0fdb03722ea0adcf3b8cb3a02937f3e067d22298"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022vcad-doc-eval\u0022.into()).stack_size(cfg.stack_size).spawn(move||evaluator(erx,esink,chord))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-runtime/src/lib.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aefdebc93a1155c05efacedf66aa63b959e105cfe7648a5c9551de90de4c365"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022vcad-doc-runtime\u0022.into()).stack_size(cfg.stack_size).spawn(move||run(Core::new(\u0026cfg,etx),rx,thread_sink))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-runtime/src/lib.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"823b8d92d511a001d82df72b7da8771637a80a334aff0b81ab48936bd376f1d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060merged.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060merge_intervals\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/exact.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb47f4f4fca65824f146e74f43f76ab54d749466b88ac50a598ae2829ef076b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(key(p.0),key(p.1)).partial_cmp(\u0026(key(q.0),key(q.1)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/lib.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dd8dd6cf747c82af209f883546351c1c7272c8a73f48f50f4d244b6613fd79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.iter().max_by(|a,b|score(a).total_cmp(\u0026score(b)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060draw_annotations\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/lib.rs"},"region":{"startLine":4942}}}],"partialFingerprints":{"codehealthFindingId/v1":"9471b05809e5122ce4b492f9b24edff92a1c267d945243b03711b54fc0770a18"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cli.animate.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_animation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/main.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e77a8fdffb55d9f9f104d5d05eb6d40b3727046225b5d34f1793d86235c6fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dest\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_sheet_one\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/main.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"a233b30c914fe0754862ccc5aa96773d84ea4578743dd301666b998ac4be7313"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dest\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_one_uncached\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/main.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6204e43dc2f32298f6ef6456539eaceb94ab43e23efe501ffedb443153ab9e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.inner_index()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060layer_color\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-render/src/pcb.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ddcc9ea21ef349f3565b0025d6e68c8b5e8c8628b6a9ee2c84c6717c69c83a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fit_scene.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060verify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-receipt-verify/src/lib.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bce69b2ca4c0f68de0c4b1105d83b0b0dfc8b55ab999d135f920e7ab736cf9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clearance_claims(\u0026[cc],\u0026oracle()).pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060verify_fit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-receipt-verify/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2856076d13f5558ed6aef67106a3c4a4a7462bd29b28661093b9df010b5bbe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.measurement.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060receipt_claim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-receipt/src/ledger.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"264fb48e65e86ba126879a7eb90a1f2747f269e243dfb4379a8fda294881596e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060level.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060union_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-process/src/masks.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"04668a1c50336470a1fc65d27514961f3d0b0ec33c6b384f824ed1ebd96b36b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060film.resist.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060simulate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-process/src/sim.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"be647c505cec62ede93fa1e29b0dff9644a46d718d92ffc7dfc00529c694d064"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060film.resist.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060simulate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-process/src/sim.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19a5afd1a0baed383575c6f625447d185ddcc6b22f9389c2785e3a65ce3c0bf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060films.iter().enumerate().filter(|(_,f)|!matches!(f.kind,FilmKind::Resist|FilmKind::Implant)).max_by(|a,b|a.1.z_top_um.total_cmp(\u0026b.1.z_top_um)).map(|(i,_)|i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060simulate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-process/src/sim.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28e63490f72d98d175ca4b3cf13b6e9c292e834e627e9d21b741cb1f8672897"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060films.iter().enumerate().filter(|(_,f)|f.kind!=FilmKind::Implant).max_by(|a,b|a.1.z_top_um.total_cmp(\u0026b.1.z_top_um)).map(|(i,f)|(i,f.z_top_um))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060simulate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-process/src/sim.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4274ab22f7e1d7b12ff54fac0194d9483ae203a643fe5e3c118b85b88e296986"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"23faa440fe9f57c33a88dc278bc43c442b157031b094db531a14b89e0262663e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.partial_cmp(\u0026z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d30258f282f3be633826517d196172679be1a1d1d825e37c3ce0077b6296fb4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.span_mm.partial_cmp(\u0026a.span_mm)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_columns\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-printcheck/src/checks.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97a1930e4e8f959351ce958afbc11128834696e97e5eb62b2114ddcc4ab53d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060AXES.iter().find(|(n,_,_)|*n==name).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-parts/src/vacuum/chambers.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee0b9e7280ccfda876685c9a1a34b1c672a051576f4a8c94d17997efd3e5897"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060union_all(b,\u0026cuts)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cf_flange_local\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-parts/src/vacuum/mod.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba5acea2ee01bc07df91ab47d185de6303e6aac8e578c660c528bec3c5d1feb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdin.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-mcp/src/proxy.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44247128c78b072c93ab36fa01ab63d42abd640b92332a04f25339a4f1f8790"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-mcp/src/proxy.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a733483d77ee6243558197597b0683c7901372090558beaed9060341178f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-mcp/src/proxy.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8096280c5e3fb9261a357ec4d751dbd67c42d672cc748d2554c44b8c084ab20a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060map.get_mut(\u0026task_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-mcp/src/tasks.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cba65496dcd3eaa77e66f88e7f6eb9b3f9b4a0c20928950898b0b0d3908eaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.get_mut(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060local_engine_tool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-mcp/src/tools/engine.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ab4a25eed2cd80b6b96bf29e017b9e1cac59747fd8e1a5002c606d611fb118"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(HOST_TOOLS_JSON)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060definitions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-mcp/src/tools/host.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6738e34aacf12ed5939c2683faec987b54fc403fdf6de241a42297a90a3403"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.doc.schematic.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convert_ecad_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"04be1ef08fa5959e92899eab9812c410ce9f0ab5d3b8f9c4798469db490c18f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.doc.schematic.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convert_ecad_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"24208ea04264bdfaf0af40dd1ded0510930e99bd9672fddc8292830be4ce9630"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.doc.schematic.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convert_ecad_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c9317136e9204e4d428fe95f773c75a97cfe3a5b90462bf6f7c973d3370f2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.doc.schematic.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convert_ecad_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b459cc54d487985fd006ada174d20037e1ad9e18ff1f612f15889b90080394e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.doc.schematic.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convert_ecad_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9fd7648d966e885dcf347873ce7ff2894587f709feeba84815d455775d41fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060convert_bolt_circle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/convert.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8005d307d924caf6e986a905fd7d516397ce10069e35b0501d1ba543541716b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entries.get_mut(pname)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-loon/src/variants.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"a464f92f5b916a015186450c71253b8571cfd7007ff0ebd6ffb603bcf4ca2285"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026vcad_ir::CsgOp::tool_schemas())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_tool_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d521fe12b1ad7aa499b85ee98f7e59e48acba33b7b855a6fdf93fc91f51d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026vcad_chat::anthropic_tools())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_anthropic_tools_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8895b74aba4f10342b8a8ffb6561ba7721961db096e178ffc4dfd2d0334d5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_profile_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8265}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ddcceb548578a4409ed72944cf96c6d1adea61f404e967ca805c4c2a82477b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_profile_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5bdba92b333754e4e35491c41c33025256a2079fbf82b744d93f00034808d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_profile_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96212ade0d31d99fea2c07708b25ebad58da0ebb300a405bf2f5579402bba39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_profile_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8281}}}],"partialFingerprints":{"codehealthFindingId/v1":"df485445c4434687f43e3fc122e52cfc318d08d8054b0bf6c7030ec6e961bee5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_segments_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29cbe1c6ce62e58446cebed5f1bc075fd6d0fbedebb1df638b931256958d873"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_segments_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b78432275745c0543d46565c411f368d161227d07aeb6d014d2b5d0cdb78505"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_segments_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5355cee0b128acede4b80ba52db330dd50c1b4c7dbf3332ae142ae6ce244216"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sketch_segments_to_path2d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/lib.rs"},"region":{"startLine":8472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80334d53da232e3762f11090daffc2e4836df9e2eec2815286dc834d78c635b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060session.cursor()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sketch_snap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-wasm/src/sketch_session.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9ca7d698a7cb44b83347eaa06381b8456401c0a284c55d2aca6229f51465b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(1..).map(|i|format!(\u0022{base}_{i}\u0022)).find(|n|!taken(n))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060unique_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d1566ca67c03acc8f0f33d168cdc04f55f4c602875f013c84f8b1185f09dc8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.link_to_part.get(\u0026link.name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060into_document\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-urdf/src/reader.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f2e2bc4e8d8da6c2711ed9f7b8ccc1439b03ccafe34bea80b5f475030320db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_mesh\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-topopt/src/domain.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4bf113a32deed851b282a6c92a14de4618f314c2bf406fe2c58391962324f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.half_edge_dest_opt(he)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060half_edge_dest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-topo/src/lib.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1d0f0ef4479ac3c959c6ec2244ce57b68b6e287a689931ef38e4538c470b9d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sens.iter().find(|r|r.name==p.name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060economics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tolerance/src/economics.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff25a92dd5a4a079bcb4a9e1a3798685653d09b8731024d676045e96c2afd178"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.variance_share.partial_cmp(\u0026a.variance_share)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tolerance/src/sensitivity.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbebcab6e3949159d5a5007877edbd0ccdda9487f38931ca0e434e42f4ab1bef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sys.rad_slots[l.slot]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060smooth_max_gradient\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/adjoint.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a033bc1f758d352e0db54e50999ee881335454c13896fa331aefd16e96c24373"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IndexedGather::apply(\u0026mut self.g,src,ix)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gather\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6686935756d50fbbd51d4c2ad37a7e706c86d8a87f911a8117a4b91f117b2c71"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spmv(\u0026mut self.g,w,ix,src)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gather\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b1a2c722ff7a3e050f4c7cbd4e11fb377f2061a4939bc7d6447bffc2c5feeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SparseMatVec::new(c.to_csr()).apply(\u0026mut self.g,x)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060incidence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7c1ce4c5212bef5271651a4c13ddc5d8fadb5a717d9dd4d6a2af356185a78a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spmv(\u0026mut self.g,w,ix,x)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060incidence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"65256e861466f828ab89e927bf07e413c474a5ef5b1f63f4124cd959ffdec247"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ins.g.map(\u0026[ka,kb,hh,half,has_b,has_h,area],|v|{let zero=ExprId::from_f64(0.0);let one=ExprId::from_f64(1.0);let ra=v[3]/v[0];let rb=\u003CExprId as Scalar\u003E::select(v[4],v[3]/v[1],zero);let rh=\u003CExprId as Scalar\u003E::select(v[5],one/v[2],zero);v[6]/(ra\u002Brb\u002Brh)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060assemble\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a960865c7b64eebf66c9a84fdf86975084d9d47650dcf1db9a435d75cc249052"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ins.g.map(\u0026[g_link,ta,tconst,to_ref],|v|{v[0]*(v[1]\u002Bv[2])*v[3]})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060assemble\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c509d9eb31eda230b3d8f0f45a8f89c9d00a0de6d4e53d587dcd60362be630"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ins.g.map(\u0026[b_src,b_ref],|v|v[0]\u002Bv[1])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060assemble\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d973560742a42cf0c940b57501a269c22cb7bb205b2ae5ab62e7646b3d180b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060solve.apply(\u0026mut ins.g,vals,b,rows_in,cols_in)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_graph_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e5bb3250b2f2ae079ff19d60ede47afcb881500a511869d58457f49ca60ff5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ins.g.map(\u0026[t],|v|{let x=v[0]-ExprId::from_f64(reference_c);let safe=\u003CExprId as Scalar\u003E::select(x,x,ExprId::from_f64(1.0));let xp=(ExprId::from_f64(p)*safe.ln()).exp();\u003CExprId as Scalar\u003E::select(x,xp,ExprId::from_f64(0.0))})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_graph_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d4e3865e7c86afa891c9a4eb78643a582089634d10b66e41c323adfb2f3e35"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ins.g.reduce(pw,0,Monoid::sum())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_graph_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b890ee1ceb47e5779f6a150676a509897c7cbe28dfdd2401368eae4b28e3495c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ins.g.map(\u0026[s],|v|{ExprId::from_f64(reference_c)\u002B(v[0].ln()*ExprId::from_f64(1.0/p)).exp()})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_graph_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"80599f786ed21a29e7bd9e3979615369fea15c6233b152c60f8e9bd07d767c84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ins.g.backward(j,\u0026[p_in,k_in,h_in,ta_in])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_graph_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"604b185dfd6c06926a9458efc8ba4ab3c886242acd3bfd91dc09c0f9e2040dd3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"66257e5172a28603a11ee61bce268e617b9502f662a3ab233fbf0aafb74de34e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"19539ae1790ef159b766563b5a0a23f77ff3136991e0004dafd7063f8c7523af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca39f6906ff3356d197f5c9c723ae2e3f9e86b48688ec6b6b92d1f02f709ed7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a8cd4676c8d33f12b100fb5286dcbcd49f0a132f26ada87bc8294e08ec98c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"3085e9cdf323bff83b3f58dc13635f19d271a2bf59777c70d6651ba3e0188d1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"100281cad749b29c05dd7a998bddd8f30d73993d567b379c76f9b2992c9ee9a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r.iter().rev().find(|r|!r.transpose)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060last_forward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8debc9cf8f5a618db0cd49a1034fc41460e650d49512aac1d6de1a5a2d1e3a0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval_cpu\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"995ceeec8c2167794c467b96584facb4b45b43249b3655b87483b009b8e2f83f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060o.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060eval_cpu\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f02b4186c501ad041fcf8c7c92283ecc2cc9cb6b4c10ba347c3230568f17a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.grads\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060smooth_max_gradient_graph\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e346c5cc0c310b6237a1db4ced3ebbbccc684021b83e0f5848432953c0767a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.j\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060smooth_max_gradient_graph\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-thermal/src/graph.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"165d22f44996b19c69eef144dfab5543cc6868024141d1938249e37c54bbcc0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Face::parse(\u0026self.data,0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060face\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-text/src/font.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6edd6de1c27bd313560bfa558ba0f2e31931790b8c5b59aa902cc4c9ea9be03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_builtin_sans()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060builtin_sans\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-text/src/font.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78ee78a5572a30a32e8a7f96ceba8c94520ed5654a1671bb49f51f6426c6e5e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060groups.get(\u0026key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_creased_normals\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/creased_normals.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57fc7c535bab395facb81dd08f1744e73c8355975f18b3eecfe83b36152b28d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ci.vertex_position(vid)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060capture_plan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/frozen.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"023af04d0268a12e9f4cf63cc6b0f6d483d9b37dd19631b90f1cfa48462f4da5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060boundary_loops\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54d9387f525a819aa0d06d8389e2b9c5470af38ea7a6f211276caebd75082b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060trail.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fill_closed_boundary_loops\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"672907ad739e90c2b0c9a95759d05e02ab9e43e830a0f317a8ef52039b2078eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060deduped_2d.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060merge_overlapping_holes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6e2c4c404b83f586262057ce446beb572f5f6b4f1e847a0ce21128a3da9094"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060poly.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tessellate_small_arc_fan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4671}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8283363376ff78a019af125f4c3c632d98be1efa6fbf7aad7384953a97097a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060unwrapped.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tessellate_ruled_two_chain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":4780}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad18473db0dd13b6b8c44125bdbb16e78521dbff2193235910f0cc1a609f98a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tessellate_cone_sector_two_chain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1ebc0822375948b72905a31dae2f758f506e30aeb06616640089c40d20f9af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060unwrapped.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060torus_two_chain_rotated\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-tessellate/src/lib.rs"},"region":{"startLine":6866}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb51259a26bcfdb94225178f48ca218c4a1f5d9d59ec04f983970f20fcb3e440"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060he.next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060loft_ruled\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sweep/src/loft.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f54a412f3675ac746fa8c42fd094f342a9586903c8f472e3474df5f546c251"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060curve\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_solid\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/reader.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f5c183c72afd732b6427a28b53f3f40f92c598aeb501bf1a7f088b4f5984f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain_verts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060plan_edge_merges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bc60cf77f823f963345a877373a7916c195d4a54a86fb9fcc2b35d6cd20061"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain_edges.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060plan_edge_merges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ecdceebad6ac207a79b12e4bbb94cb4fd725f4c7c90f98aa54cdd71a156bdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain_verts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060plan_edge_merges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dbeb3b68f7888e06366a1a3ada71a3da3b913a7a65effef47d06fc0718e07c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain_verts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060plan_edge_merges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5d846ae96f5244d587c9c19416314ab6b19210e91f202356fc2ef736910aa3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vertices.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060plan_edge_merges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/reconstruct.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f160af95fea9e51131606b59a9b962c17b930846c22450c27406dfd33ebb4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.write_axis_placement(\u0026placement)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_arc_edge_curve\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"851e119c91a48051015ea4174e406bef0dc39fc67565e35cc069725178e797cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060he.edge\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_loops\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6648ba0401ae2effade267088c0d2e62847e71b4d5a490cb0f886093f10c52bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.vertices.iter().position(|v|*v==first_origin)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060chain_run_is_forward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ebb4662c2f1982576f2def44c8130eb0f4f00a577f4d338cb45eb82bfb3b19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060run.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_orphan_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"71206973a2d3908bb150805718466ea198c7f4dee24bd517cfd0345c4719ef7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vids.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_orphan_piece\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"458115a13c0088fbf14b08b8fa40b7fed2833af8f126f007a0bf3e9c4d80f81e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vids.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_orphan_piece\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e84d9a29d673225bdba7665ddc74c3f379b61d68adffc37397d63b9f395b49d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vids.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_orphan_piece\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0e28b526de97a71027ffa98b55a606e6f68f44b7a1ff365644fc5ad4cda7d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vids.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_orphan_piece\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-step/src/writer.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebf0101eacf717affe2708f91c199308f062c2e11e99b0b0637c1099194261f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SketchProfile::new(profile.origin,*profile.y_dir.as_ref(),*profile.x_dir.as_ref(),segments,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060flip_profile_frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f547bc53a3974559a24b8881a7d000cbcd546ac3156b11a4f5cf8085d7a3ffad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060he.next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extrude\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ebe3cfeafc7565b24b3438281e0db5fa2912133631c1fdce12e6329d1c4ddc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060seg_last.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extrude_with_arcs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b765b1b000ed3765638072d576de5254e5247930301bc822b9a3167edc7d17cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060he.next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extrude_with_arcs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c33f1b38d1afb81b0ea114789bda9d9a3f21ed9afc3b90abbf35aafc79081a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060he.next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extrude_with_holes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47c648926c274243f50504b8c229cc64886a37f0b35146967c73b65a8e080d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060he.next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extrude_with_options\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/extrude.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0f59dfec86f74c751c43744ec31a04ee117b5377099d6b037e8ed095aca847"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new(origin,x_dir,y_dir,segments)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rectangle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/profile.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"992933849b0b26f8c48e56653a65c2564f1f9fca79fd24ad552504253d152d69"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new(origin,x_dir,y_dir,segments)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060circle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sketch/src/profile.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f609a525ea603d6496c7dfdfaffeb62d9800e8c628d9699f7c371b895dcdb1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060best\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060boolean\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df15e3318e6f1ce514543d4042423d895dca4b95530da197ba1c964af9f52dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cycle.iter().max_by_key(|\u0026\u0026e|{let(u,v)=directed[e];let dx=(v.0-u.0)as i128;let dy=(v.1-u.1)as i128;dx*dx\u002Bdy*dy}).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060boolean\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/poly2d.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a8efc2a17167973c04ba655cdb60183fd9ddc289a2f313d9906aed37fde74a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(include_str!(\u0022../data/sendcutsend.json\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sendcutsend\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/shop_profiles.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6f370cb5f25386ef0b6a487fe4109e022ad63c611e469443e178743de0c76d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060via_bend\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060walk_and_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-sheet/src/unfold.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"65627f8586a0ec0e4c5f96b7cde5ff957b506480ce45c8104773720a3f3bf2ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060g.backward(j,\u0026[th])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060adjoint_gradient_core\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cec8d0efce1796b26179aeb5573461ebafaf4c912567ad8766a370ff551782"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060adjoint_gradient_core\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"e572cd9ae63e6dbc956e659834cfd2f1683d17e9e089863622a983fcbc956dd3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060forward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/diff.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"593ad2346e791cac304daa2092545b1efbbfd8107905b4e0b6df2d60ee161ea3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PhysicsWorld::from_document(\u0026self.initial_doc)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/gym.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d452b0828c7fefec151ad003405b8a8aa2d5e4b8b025a0a5ab2d9d6e50e9b3d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.joint_kinds.get(joint_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_joint_states\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a9a7a2571682cf98e71dc1b5b2bcf5de8e6f6f695ce292e585c1f61d1fa413"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.joint_kinds.get(joint_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060gravity_torques_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-physics/src/world.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a3ee699ff977a1c5c4e6107df45feebf150a7b154eecd3527adaa50f6fbe0e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060objectives_and_gradients(build,region,std::slice::from_ref(obj),steps).pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060objective_and_gradient\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photonics/src/adjoint.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf136588e445b97dada261d884d4679629377d247213200e58e26337e8e5689d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060recent.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060maximize_split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photonics/src/optimize.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6cfb1fdbeb03c4f24a25df7d67e3ea43e7ec3a298273141bb5845405fe7e48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060recent.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060maximize_split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photonics/src/optimize.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"683d113f1b301448b3984aa7a5d3bd60014998ba6edcd7f144295c15fee70da8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bounds_cm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/capture.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9476711cc67244becdab333a68944c161565236aa4eea7cec0b095750e2b54d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060xsdata::element(s)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060elements\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/materials.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6993535c31a3b9d0002709ef5fe1e1e4f24903542995c2e2ae5192e5da73fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TABLE.iter().find(|t|t.0==*ox).copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_oxides\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/materials.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b284cb56e043c91b42839f0575d2abd4116dc7fb18915b64186b67e0bdfc466"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060xsdata::element(cat)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_oxides\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/materials.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c17fa3ce2e01b3d33410c738598b6e53adfcec6a751f1bffa30910237e4aa1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.slabs[k].material.linear(e)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mu\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3931cab65945db3fc824e6a3025447d076b866e4f2075c6a61d26eee34bbcca9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.air.linear(e)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060tau_to\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac990919cd4324eaeaf578f62ad96f4523d73068dd5d4bdadcd6b9bcb5cb9e64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spectrum.bins.iter().filter(|b|b.rate_per_s\u003E0.0).min_by(|a,b|a.lo_kev.total_cmp(\u0026b.lo_kev))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9003d0f890ee4cfdcda3995993963c416afdd9a80caaa0a5bc51dd07121206"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bounds_cm.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d857230ea6a2532eb595144bef62ecedb69e82c05faea5bb7e4fd5d6409d53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bounds_cm.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb90394de0903799e9affd92bcaffb64d7e5eac49c573c50bdd0f5e903fe97c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060geo.air.linear(e)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-photon-dose/src/transport.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28461f58ae74626d2de62513a6e298dfd581a15d521a4af4e88aaf50e290247"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h.join()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/chain.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"104490d24081885294f802eca04f3de05a84487a322ca82d87c9f50792b47747"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060vertices_m\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-particle/src/wire3d.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec55bb04daa37318634ea74b81a88f084d33e4c42e296e2bed8fcecf0516425d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060presc.surfaces.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060first_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-optics/src/paraxial.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f712a82fa0c6bb55d41e25f1bc6591f5296fe961aaa0d0845698398f2adffe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060faces.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/diffusion.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4df74855c1e03f9c4826822579b334c1cee7f315299b447270ab7af981c5093"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.faces.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060cell_at_mm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/diffusion.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e62f5e2e8fd748dc5d159b96248f38ec18769035abaa224062286a7cf98c8f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060boundaries_cm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/geometry.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"896ea3a1e453dd695d58e411e11923ea248c20f3f86bce8a230483434c03fbfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..N_GROUPS).find(|\u0026g|e_ev\u003E=GROUP_BOUNDS_EV[g\u002B1])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060group_of_energy_ev\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/groups.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d55e660ca99c05464b81b623db52cf46749d691ab66f3118200d50d10088f58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060params.get(n)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060claims_from_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/receipt.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44704a45f91635015370534e261e25319b050cd3f1209ed3d997d6ccf53ee4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060claims_from_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/receipt.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"387b7df1c85f6ccd2fe3ab1c7eccfa53b635badec00df5ec60aa1de4215962a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::groups::group_of_energy_ev(e_ev)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-neutronics/src/transport.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbe02a85881f978e2b3cd5164e47fd4c68d45476947ad9b57d61e48612035cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060edge_endpoints(brep,*edge)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_edge\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c29cab66de8ef006fdb1674583f67fd1e80205e488107142e2de593bf17b15"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060edge_endpoints(brep,*edge)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_edge\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-naming/src/lib.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f60de1a794e791d936c1ecfdb4424ec63f525b53dd7cefb1100334e45e0fdc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r.inverse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reflection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-math/src/lib.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0610d9066789ab42677f10080d019aedea5839527fb1546549c3d6eb2f4b4638"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.send(result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_buffer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cc174898118ade717039c815cf1ed97ec92deda9721f15d99b42ebebb594b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rx.recv()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_buffer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2ad5e79854bb3375bf3aea59bc518fc44234865dcad188b48c5b107620e46e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_buffer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/decimate.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"502bb0e0f6268d911f78e32d65f9a0bc5a9e2e0ac45f55f07d9f49bb9fb50c4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clears_batch_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/narrowphase.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"62550d543ecdfa7973f5a81e55675a05bc27923aba08f2b7249476df0e70eff3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.send(result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compute_creased_normals\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/normals.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a769082864b3428b4dc98ca5d1c435c9391c5de8d6b045ca53c06ecddd237"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rx.recv()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compute_creased_normals\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/normals.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2075f1802fca41703b8fb9c189fe42be8418a3575b6886dff8c8095f34822da1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer_slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compute_creased_normals\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/normals.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca434ce2c8f017b21bbb16e99175660ebff38956c3a9cc4c3781c4b29d7da3e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.send(result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060distance_field_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3a0d8ed1ca5acf602bedf3611f651d5c79c6dda27418b36b197997ecac4ef3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer_slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060distance_field_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9f915e998bcd41f622b1a1c9f38851532306315d92d11f1dc31c93ea6831d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.send(result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060distance_field_compacted_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a12235772164aa2431e5cc6e7f9460cb6e2451c2ad54c251f13732f4af4c38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer_slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060distance_field_compacted_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73e925cd7a86ae48bc209bef1d25ee66da388982fbc7736894a5ccf2905870d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.send(result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_u32\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c200615b5f1e19e68677a857c0ea3d21045611d816e8549a32cb67cd08ded3b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_u32\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f75347ea7145e39db6b5d3d963f3424bc90b9193d5e58a1fe36d32ba3aa148"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_back_u32\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-gpu/src/wavefront_batch.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacf02605be93203cfd2a5c457bfc91c78417430a4c7e89e59fbcdd826b91145"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CouplingLedger::new([\u0022flow\u0022,\u0022thermal\u0022],BlockMethod::FiniteDifference)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ec1c444d935bfb7391268bc1ef6043ac86e1c414b77939b7fe6001711d8269"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.set(1,1,BlockStatus::implemented(BlockMethod::Analytic))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9a71dee23201bc7e8dcc88d99671791c6e5aeb0136aa496da0ddb40fae6f5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.set(0,1,BlockStatus::implemented(BlockMethod::FiniteDifference),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6a172446b03316a12a213e881c0c74fc2b2ef1296dbafcd2d6806180492292"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.set(1,0,BlockStatus::implemented(BlockMethod::FiniteDifference),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9bb24ed529e7ff0028009057fc051c503356acd43a0f8a0c37a5a2b355e268"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.set(0,1,BlockStatus::frozen(\u0022the film coefficient does not respond to the wall temperature it induces\u0022,),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37108dfe83789cad3ce173a546124f4a36de40dc9267711adcbb046c9862642"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.set(1,0,BlockStatus::frozen(\u0022the wall temperature does not respond to the film it induces\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5244812e699964cf51594f63e7869742fcc2fc6f099b13e03b3efb7955bec66a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.set(0,1,BlockStatus::missing(\u0022no flow response to solid temperature\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cf4a21d1a9018e325e164c08789e78b4393687e0fe3b279db5c18117a25082"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.set(1,0,BlockStatus::missing(\u0022no solid response to the film state\u0022),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_ledger\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/conjugate_adjoint.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"481675f01b6d82a7da6e1f149862297d26eddadc3dcf386bcae39a94743bd62c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preview_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/gpu.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"39caeaf7078f9743a0802d3bb78d4aa14f0dac7b524bd8625d62bbc99976b3a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.thermal.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3519c6fe54b4df6c9a774b29e037a4091f8d34e870decbacd54fd10a418d27f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060t.buoyancy\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-flow/src/model.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"282643575549abdeb89626ee8f13fe6f2a5d0bb6cb9806d91ab81a8da4221787"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060all_faces.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060loft_blend_edge_keyed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/blend_loft.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d54b480f2bd62f040b79d12fef3e9cb2cd96df6fd66348970201010eb02857"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060corner.ring.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fillet_plane_chain_edges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fillet/src/fillet_subset.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0995eb0d77aecac0ad6a830809f62a3b5a1581a7b93897818fc528e2d5b9bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gauss_data(x)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060element_stresses\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e9b2bac9deae3edb22079bde55e21f2f8578db7dd75f7174b72ac029a8f350"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060buckling_study\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/buckling.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7911cacc83e0ffd0475049f99e4ce946897ac9693c4794120a78bc1cfdb17a04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.levels.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/convergence.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f120d62579095bf07eb229df6a29c543318a2abc2202295ea49a55d498ffad78"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060finest_fields\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060analyze_converged_fields_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/convergence.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89dae9e3e2f564b30b1716b4de9e8d96a4566c89adb5cd07cc10cc2c8c36a65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.graph.eval(\u0026self.inputs,\u0026[self.output]).pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060eval_cpu\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3593692b8cf815e30934a99ede3b1b38209e58768e46610f5776274d4df72ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060g.comp(\u0026[ne,12],\u0026[],vec![Arg{src:cidx,view:View::identity(2,2),},Arg{src:nodes,view:View::pick(2,\u0026[None]).gather(0,0,1),},],None,|v|vec![v[1]],)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060device_assembly\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d8eef5b38b5b2e21864a3422123922e735edc9242ccd1354487cc2888ad1d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060g.comp(\u0026[ne,12],\u0026[],args,None,|v|{let m=edges(\u0026v[..12]);let inv_det=ExprId::from_f64(1.0)/det3(\u0026m);let acc=(0..9).fold(ExprId::from_f64(0.0),|acc,k|{acc\u002Bv[12\u002Bk]*inv_entry(\u0026m,inv_det,k/3,k%3)});vec![acc]})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060device_assembly\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3740c1474daf1dd5c998272f54e7e5528a24f60516a61a24d865cd57c8dae4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060g.comp(\u0026[ne],\u0026[],{(0..12).map(|k|Arg{src:x,view:view(vec![form(1,\u0026[(0,1)],0),form(1,\u0026[],k)]),}).collect()},None,|v|vec![det3(\u0026edges(v))/ExprId::from_f64(6.0)],)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060device_assembly\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2adac93b284a629d39a9f5af9220529c9c918494ba65c65848656ca15cb5bcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060g.comp(\u0026[ne,4,3,4,3],\u0026[3],vec![gv(1,2),gv(3,4),gv(1,4),gv(3,2),gv(1,5),gv(3,5),Arg{src:delta,view:view(vec![form(6,\u0026[(2,1)],0),form(6,\u0026[(4,1)],0)]),},Arg{src:first,view:view(vec![form(6,\u0026[(5,1)],0)]),},Arg{src:vol,view:view(vec![form(6,\u0026[(0,1)],0)]),},],Some(Monoid::sum()),move|v|{let lam=ExprId::from_f64(lam);let mu=ExprId::from_f64(mu);vec![v[8]*(v[7]*(lam*v[0]*v[1]\u002Bmu*v[2]*v[3])\u002Bmu*v[6]*v[4]*v[5]),]},)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060device_assembly\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a040e6aee01b4df195942ae7fd86816f4ef2d3241740257fc5e4577f557b7ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060g.reshape(ke,\u0026[ne*144])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060device_assembly\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a627f46b34f4e9281d20811e159bd175ea4bb231c4c3746c4beb3a51718337d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spmv(\u0026mut g,w,ix,ke_flat)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060device_assembly\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f483848336dd10cfc146083d85dba0c12ac5e27b8ddcda82af878e86f44b1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060g.map(\u0026[summed,unit],|v|v[0]\u002Bv[1])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060device_assembly\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/graph.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6b95ac64881a02d87b76a292802ebb52588f8a0ff36e8007a258cf4e7df90c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060voxelize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f7368ce5134cefea7606016848027c964ed650e45c2854e883826f3b7d79b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.partial_cmp(y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060hex_fill_conforming\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6bbffa6e5d972522bbea0d36b1a14da3a9ca8b3bb4c8c926b1fd2db6a19d45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060hex_fill_conforming\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8c2f8ec2a690ec1b8720f19b9d7509ec223c52fffe0f3688784da1214bb041"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wall_thickness\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fabbdb313649e03cb7701dc2c4826fbd19c781f755b75220edde3e7fa680fd8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wall_thickness\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"725c8a5635b48238bba6a0c799ac7635f9ff0e9e8f06b4a1f82665705d012d1d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wall_thickness\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/mesh.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dd0924f760652355bdd05aba3c42122ed364e239bc558f6639eacdaf3a9279"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dense_cholesky(\u0026kii,ni)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060brick_matrices\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2be0ce414b8e78c0a5a016fbbced387b910538654877aa4d5e353404510f75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a[i*n\u002Bi].partial_cmp(\u0026a[j*n\u002Bj])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sym_eig\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-fea/src/modal.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b1f2a2b09aa576a7e7fe0a78976cae048d40989a28f85b95631f2c1294c242"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.1.partial_cmp(\u0026b.1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060nearest_edge\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-enclosure/src/fit.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7756460475d80ddb491e2b2b37b1996d6a282b61cc5433dd474ba341835ada"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_enclosure_features\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-enclosure/src/mesh.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8637a2266ca4d52e7cc7ffd2a29eaafbfebf43b281588bcceaf18c4e93d94c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e41e0ac077e59da85240e562f0f6f1592ce136352edbc6b83ff09463e982fcf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022SECTION\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c21ab3ba6e334812abf40f7ceae09eaad256537971bf9a295e298e7a72c382"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca16135e13cccfe100a87752cabfbf29eeef98a6dfec6c9ea8d0485401740353"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022HEADER\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1aae8cfb2ec92af9df77ed174822fc643554e8e547043044db3f521eb48513"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00229\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5605cd92ae62314d426962b918ff87efef2426b63d74b57c6f534d380282f78b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022$ACADVER\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3771272f578e2b1cc86c4f0ddca0e36e38d9163eed52af64f0f346d8b00389d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00221\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe6f3f9644ba70e5ec93e9f4f8ee4c49b367ce7a93751c2fea9de93638d8ed1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022AC1009\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86dba431e346e0184ff2317ca971ec85fe9befc146dbcf11ecd5aa9098bb8c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00229\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a51155dd3bcf744854f0422372a9cb23aa990ca2dfbae3dec60e14f5b72cf39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022$INSUNITS\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d292a81eb7740c2d8a2e6567e11899ed03b07e100053660b7cfb00fc5b4bf367"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002270\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4af9ca86d8ff7740d69a7b16067dec842886ad0748ede4cb929772bc24de9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00224\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2376250068d4839974a50e0109cc74b82c27c16f454bde161073c6f549b9b02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71a54588e9b3ec05750200f84fd2d1dde11bab6fd52c856b90c02190b3039f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022ENDSEC\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea0d872ac18f9b468aa5c42bd04dfb0c5e4ba1a4936f90db73a98b463d95b9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"87faa4e10f052efde2f81f37bdcce772b8d9d7effc1a4741d2161de65b923265"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022SECTION\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c93da668563a692c65b0bf7179ac13ec8c35b487e2dc830b1927b1981b5f95"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbae4f729ad0de00b388a21d744cf521a870d0131a181934782c9a89e4400f1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022TABLES\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ce25a7ad4240e3fda27a6dbb35e2bc88739535fc639d3a0cf6e88b40a592a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a881678715db3f4590eea14db7c269f11c9054cdff5900a80f3abfa4d7c14387"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022TABLE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"976208ea82a2764900fbd61120897368b137c98ac37b872539f0b7033d91e262"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8e6826b1c267a68f8ce8ec4aa7211db719860cd59ee6e102aa21653990fe0c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022LTYPE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d5270a79cb044e39c0c04cbf75d2f1f890e3559a5ac0a9733cd005fa002fe3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002270\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"490e6e7f35787d21413e84212d115aed9af98a02c216d6fc138a60fc73e85cc7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c84ca8f6dc53abd1d142eda7d9f8a0cf86c28709a4100dcc8273dab9816e5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8626bd9ed00ced3ff898d0b496a08eda42831f68b05287ba38bd253a04e47675"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022LTYPE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fb13cff8018ce9cba4309c529cfdaa1cde8d98d6fade5eb668a531ab13d159"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"719fe8b25be4f291a5a1824ef7b860edb2ffe01571f22e9b5cd5f62200dcb33a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022CONTINUOUS\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87d7cdf35a1a3e59b56d134896a640f67bc483a9bd44fba4c68664282ea574"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002270\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c26df6cfa44996f93ac71f4d9f65d470ffe2891e35324a4753bba16ab6b6d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0536ff2d2484126a9c22bc82bb7e76d937264505cc56b229bbde92b85a370eb2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00223\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"893583ddb6dcc284e1f8be74cdfc9ff331edcbc6c111c92042c6049ef5364a99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022Solid line\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31858305d33b726b1d300e7949b940e0143f946a348a6b03b496770ec029e7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002272\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b261b9316da116e7211ec75c676e322446b7b07638ab3eceebd088b8fd15d07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002265\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c63d5a50ede26e02f6986be5d1b57bbcd886337548b42b507731af88c30e42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002273\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf0dbf525dda3a1ce24e4d223ce8126c5fb4df6e4c65418c29f0bea1b786a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b35895191d5fe4a979859294f5c801a8eefa0a5175eae9baf8fea52111abd4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002240\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"37416741a03658ddc4a0f12043757a187978b22cc64cb148f975f3e4f1fcd7a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220.0\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e43ad8130179fc376b421138d0151f2c106372f39401ada4064965d0f0b3506"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"495a226964b49cb8b6e4dbbd46a1b7cca47ea6ccfa31b9e24b7212a5c2edc92d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022LTYPE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b518349dd827fd281fde08243a1c286221c838949afd620553a19fc3cd8d1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b815ec4e4343e4a584f9ea701237c19ccdd4571bd947d2ef7df0399639ffd4ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022HIDDEN\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd09fdcf91cdf88acaf5660c85480b35515c36f14507927165b73a810add92d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002270\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9445a2c3edcf41f8700069640bff9523971c11e13630a49c0a8e59e23c1c64e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac63b16e05fa5112e31fd18a2274a58920868752dcc4a268e83849851a25627"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00223\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fa7709f3b33a1dae6f243295729db50616003a5ca14ae93c488a0dccfeca86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022Hidden line\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"529531f8eaa12f951e70a93f6dc2d68f2295856d55d79d49adba18e6c1ac2746"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002272\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"120ffee32ccdec06c9f13bb73c81a00d8272ab2c446aef31c5534792aa9fdc56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002265\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"664c69e37efd794f717ecea97bd2285bd1b041165750a64cb5b76168fb1e686e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002273\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b67dcc86bda835c667ee5c03333f93e363b6642f76e9cef7b0f03eeed6f317"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d43739bad05ac50dbf92526b8112290cc2623dc68837db735140776a7865a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002240\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a69e2a1890109c71cfa2dfca1eaaed4269298fcb9a17c927c4518cdccd1739"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00229.525\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67bd94c611086993f2bf26171d9dbbe0461a8480869bd3ec5b9b1457bc1705c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002249\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"999a9df17504553a888bc55367d254aadc1d9d363572a846b2e493187fda59a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00226.35\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2717492a930a695824c2bf8e51d0493cf3dce2e893d39b89f5006512a391641d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002249\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc7d34fa2ebfacdeb86e9598aff8105104292bfe44b62332a02aa578bb5ce8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022-3.175\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7f3dd01dc60c42f22a0f7adcb02da2b3cd6421a86ebf32ca1903087a537c78"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6d3712ea569296411d6a094d50c536e77f5df61779dd9d9061863a85dd6378"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022ENDTAB\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a0bfb24a4e0142fd5da68005b184e26215be7e14ad33b78275f7129aa0be45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85ed95acf96d6f490a9cada20c35565fde5957709746dc635096c1a4b2a2166"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022TABLE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bbaaefaef3581e64cedacaf79c0c84381fffd6da7b7291ce954dc1dc45f26b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9669bf16fc795de90c8215d65768b58b8476c755587a09bbb1c8b79e8b9b762"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022LAYER\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f262a360296c3650b7583f7e5987fbdf1c92ad3cf343e2a57a6cea548563b5d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002270\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ae07c582b1439a39fedacdc95fa9b33122e9a6762a9dd0b6bbe275dcf8daa4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b5ace994bde2add6bc697456567b338609e6fc5f45921e0cea340bfe79b441"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"38edbe7aaffaa14e35b450a96b2b27d8058d1bc92916f9b2e4b19a3c49fdc1c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022LAYER\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c87a11cbea6a4f2ec5c15967b4c5e6d89587ee893bf32e271fdb285107b956"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18cfde7b385069cf34da3aae12e47d46d31040085688acf02e846fa30d9a8b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022VISIBLE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e493f805499915c1c064923f2c3fc3dc3e21a209dd456aeb34223a76b0dcd00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002270\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ebd7b24c69326cf237db0a867f5919e85a36beda872531dea38e5670919b42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"31865a8c68ba66267ec02f628e2b4571a2403afc5d41aa945123b2d33a9e21fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002262\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0d448437810fadfd3225394d71d6442723c2204eb8e1d67b61051648f58b7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00227\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"26deba4dc43e71bfc057dd230b36db8581617d077060000033d1458d6cf13d5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00226\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa54f1996b0559683dafc8f26cb64d7c51c5e7009ff47e97a36f9c8354f76bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022CONTINUOUS\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d107d2834f195b4fcd26d8dc53503ce82ebc1445595cc1f636e2ae9638977d2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d27effee25a09a878756ad20b7f3b1c006e8f43539acc9b0313a091c72ac56a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022LAYER\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad783a202bd007f1836a42379feef523ecc89d77e6fee2d472104520702d4f30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"767b4ec2b483b84a0336ffdc760274756f3029bcacda4e46de2ae106ed6ec343"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022HIDDEN\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8e87f1d51a9e2a9f3c29f2ce6d9e101b59e9363f5f95af827b62019fd7dddc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002270\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45c7b9433ef36ed7588ff47e1e0138ddf34337227c29fd89095f8a1b5e93453"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ed5391b51815edc030e9051cdf67dc9e4d5e095e4463c3c8b9fb24511fa22b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002262\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ae84bb5ddc9cecc1ff8dec5363ef8eaad7d037f4e7a61832944813ce9da5da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00228\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39563aa2e052a513f2745780d7f98a7f23d6d5d9251930e78af1ee35b104a7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00226\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f3dcbf81243755a734320a495588b79d49cd626220030cecbb4e983e41db9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022HIDDEN\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ea58690aa7222b01f2e36584d35dabba8d565ffd579a804d505b6f5ea5dd33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ea0cc238d8b1006184fd7196993aaf7b7e4535f43454f1e64de98505a425b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022ENDTAB\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa237d493a0a2556a7778df0749cb6fe430ed424d099015dce4f21047b9d8923"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"164b3846ab6f98104ea590a52432a0bbf3e3cfcf764e653e40a62f2d79a68162"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022ENDSEC\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2417954e44d1af67e2a77654839382dfc6139d5b1b21f99a19d91111caccb6c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"644484c9d468f1dabf9f3f72fce123c2f2b2624825ae75511c8f20fb6723b8a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022SECTION\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb21ee8afef3f0b06c0e36221aae6f6ac601098907f938c963eb11f6162d9c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00222\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7933d2a8a95e73c0d0d0224096aa4033590ed03a6336e4ce4452d4a47c85f227"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022ENTITIES\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b4550c2aad59396c4d548cfe2aad26874721524891be7fc6ff3431ebcc9e06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed3737cda337b919957ed9d050ff90ef55eb3a0464d5c7d50f6464ae4c32842"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022LINE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d44c9461e9fa098fb3b0c56be0c25e7154a626dc4c0c3a61fc258b8760cb84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00228\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d34b8608d7c1e62cbf3467066d9cabad10c7f5dafaaf4768af35a68aa354405"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022{}\u0022,layer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b122c377bcc0df5063b39dbbf7954518949caccda20763ff0168327cad548040"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00226\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ab231784207f55adb514382e6a34c699075d7818d3ef90946cae6b794dd7a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022{}\u0022,linetype)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0f1f115407f3b0f66f50f7b84c0cb4bb75070aa7546364491e9cc581dcaee2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002210\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3c0ba2c7421b98199dd7ab7ae5854c460d2f616c51280f8e922ae3a366503b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022{:.6}\u0022,edge.start.x)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bd0169baccf6ee610850eb8deb550e41b84c3b6889a1d0a1136a643e06c05a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbdb3e0d67d08cbdc7ab1819c08d4103e9adcd36a8c5bf5d170784c407c9575"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022{:.6}\u0022,edge.start.y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a798b65d29622d147e41a5ad09c11bc2d8b6acd53731da0014bc28628d1baec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002211\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ca2e00cf61b58f299212c2de054d60bd752b8946cfcc5553fa2099ecd54ab3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022{:.6}\u0022,edge.end.x)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8727ccc02f219f0994e79bb2e87fa3e688fe40515ce61d89fc0a9bff1ff6c4ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u002221\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97182c83873c2ad1e28ba5089f01e78fc25997becebccb97a7b359eff72f1ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022{:.6}\u0022,edge.end.y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2297d7f256aed571ad24470db8c263d2c09e6bc18a251360740a226d1ff582f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac38c44634e81afea349c8f9188994c9eeeda4346955b16e13fb08edf32772db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022ENDSEC\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0715f67aa6e398fbc9ba6095fc7973819fe5238e737733e6e0f423c1de885871"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u00220\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cadc19522cb12bed9b43d6d603818a2bc16369d9438f3a3d41c5f87d9999e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(buffer,\u0022EOF\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060projected_view_to_dxf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/dxf.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3049e095ff40221422afec5c99a8015e16d7ccc7975a1998dc6e6b8709cdf20a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lines.remove(\u0026key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060merge_collinear\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/hidden_line.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ededcd23a8584d8abf4f217fef39aeff9e8064f0f48a725aba637cb3f69bfe72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060forward.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e60eaa2dc9875a03bab825a93cf3e333efebf6622fe771c0b0de856ec1dfe4b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c533812c8b7b68868163efbc9ad220b3b91c5c8d13b3540dc8567fb47bf08f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060clip_polyline_to_strip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fab178fce00fec5543d47bc6e5cf3a32fcb62e12efb964f304768f0af4c348"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/section.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec57bb382310bc90a9403e44f4b7af8374ed033227be176d775f674c022c72c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060length\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-drafting/src/types.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a991b4dc2a9b486004886d2938976baef26e3bc311eb83576942887c93b379"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060objective_gradient\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-diff/src/optimize.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"51548eb53862fd0ce518bcb55e285ac3836058a35c060be636eb92b9536fba51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.thickness_mm.partial_cmp(\u0026b.thickness_mm)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/casting.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"61945fd5143e6b867a8c6bf5ec5bb79f1eef072eb1edc275742fe53cde405fe3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060levels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40ba0cacb94eb12b94e8c97c31e8fe2e25e8ffeaed303d8aaec5b92acfd206d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060levels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b609c5304cfee90e8ef541443cc4035572dd286b09fb29918339f645fc4cd5ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060levels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b8cb1175c5c29dbfa704cef3fbdde60dbbd31d075c8c7a265a63ecae6f2e4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.partial_cmp(y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060union_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9769c6cf4bf2392cc68c3cbab4d600ed9e7902af8b976415f1ed3046cae27f4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.1.0.partial_cmp(\u0026b.1.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r1_corner_radius\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"7406052f27831ede86cd809c1119f41c72fab98ae2d29bd60abf55a585a8cafd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.0.partial_cmp(\u0026a.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r2_reachability\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"562bff9c1386eb9faf43f3d4b8f2b4594c1ff8f13bafd59e314f64a34cc0d49e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.0.partial_cmp(\u0026b.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r3_hole_diameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ddb6d73923f0fcddb8ace2f89ade7ffd6f70453fee3aa7a664ecd03a987033"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(a.1-d).abs().partial_cmp(\u0026(b.1-d).abs())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r3_hole_diameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d2173e45eb9120a8dabe15cf611a12e09ba23954320a398d21ebb05df2fcd1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.0.partial_cmp(\u0026b.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r5_min_wall\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"547251f890cba14f1c1f2d8e510a853d0284fa1abf65f3988e654272b0119860"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.partial_cmp(a)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r6_envelope\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"42902872140508e50324a5fa67e09e53e1343f269dfa5f4a70caec3c9f56ed4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.partial_cmp(a)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r6_envelope\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee6caae1afd8cf21a0edacbe1626d1a3485b7099f85541b75a8183d95f5e2e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tracks.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r7_threads_and_gears\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa04da5f58925acb607a283e27e5de8eea8b83f80795776d1d873c074cb825e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.0.partial_cmp(\u0026b.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r7_threads_and_gears\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"340a59d23b049fc675e103693e606a4a4bd82eacc9eb5ab38a3fc2e48021d12a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gearish.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r7_threads_and_gears\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"df071a4134e78faba3e133ecbe387dccc98c809738aaca9653eaedf0c5a31454"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gearish.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r7_threads_and_gears\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4730e3d3a8d863d2d86df746fe3710b0a37cad8e0f0a469f556263e0d73136"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060[2].partial_cmp(\u0026b.1[2])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060r7_threads_and_gears\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/hobby_mill.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dec84c0d67cdade9762d42fac1cbb5f557bf9371bf3740ae54fa8938eb81a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::from_toml(src)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060default_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a9f7c9b5a98594f8f62378740101e57b2850ad5d7adb8573a24b45352d3e7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.thickness_mm.partial_cmp(\u0026b.thickness_mm)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-dfm/src/rules/sheet.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"104558292c339b364ddbc2939007a328d393360b19189f0d0d60dd5aeaa0208f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060order_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/export.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa5bc9691c45ff4270c8a7d531e8021e6cd27f3130eb9300d1a8bef28472b56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060order_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/export.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1707a377e17b5bd709cac15163bd36d6fa38af13810115bdc42adfe699ea9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060order_segments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/export.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"49834901b98be41431b4f45adc5bc1a09adc741a6bc0224468bf491a8fea1341"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.send(result)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/gpu.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb77c924ccb68041d7d94a2abc72a1dd639d2edf481311a5b12fdfad27bbf17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rx.recv()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/gpu.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bc9abf2c3eca3b092bb39414634f59d22e042ee7aaf5b2f446e1814023fded"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer_slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-constraints/src/gpu.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"742a8060571f09637d76d4f43f7f420179f9a7d3ceba6c9c768ec7bf4b5e3e88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060coords.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_geo_polygon\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/operation.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0393057dd975c39cb63983e910b5eb2cf7ec6259d1164bbe0fa9458d682d3e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060contour_to_points\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/operation/contour.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89d4371a6189183c027714757b6b5cdbba9c98e7e6f30b918fb4b4b11b4cd13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060simplify_pass\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/operation/roughing3d.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc83366dd5cb037d9efea48dd568e79ed06a3cdd57d7f661b72bad51b899a979"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060simplify_pass\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-cam/src/operation/roughing3d.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9893f215ab6c46a8685bcd0ba67c304873635093cf3581f36f87f50c18863fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.parse::\u003Ci32\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060js_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed91fe8e60e0fc3ba0d6486ccc715ed6cc885f7dc55ca015709275af472bec3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(s)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060canonical_stringify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3178d8b9eacd9bf5dc0396817102e8ee4348537ce377da52dce0b6814dda0089"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(k)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060canonical_stringify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-calibration/src/lib.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b43eccd79529f0bb389c12960d0e99e4d90cf58fb13f11757684756925ccef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cyl_good.first().or(cyl_bad.first())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060project_point\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/api.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0706ea700ab7cad83309c185d7692ff3702bfa6fecf11806eb0ddab5bdaa8a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060us.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060profile_from_samples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f30b4b78bd02905c15ccffa6d06a816c0fa9f72a3f7b1901714772a50e0e9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060unwrapped.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_parse_two_chain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4cf9ab07404526256ebf30af9b818845f64f37bd9a88228c6ab8dcc02657e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..n).min_by(|\u0026i,\u0026j|pts[i].0.total_cmp(\u0026pts[j].0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_cylindrical_face_by_patch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":2390}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fc2378809a1ad342db9968e6322f307fea2ab79608380fc2cf12b3f539dea8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..n).max_by(|\u0026i,\u0026j|pts[i].0.total_cmp(\u0026pts[j].0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_cylindrical_face_by_patch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/cyl_band.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de31cb2728606e60e053baa53e1444ad15b005219b6ce3e3704b485b11b3099"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060topo.half_edges[start_he].next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060freeze_circle_loops\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc662c57081ab77201b097f373847e7546e8358f3997ec08b047626ae548f3b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060run.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rechain_rim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b0f25fdc9ab217c9b784f4bf404cbb15761bd84925423d635e05c66d7882be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060twins.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rechain_rim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d8afcac0c031630543be9cb33bb4c797a3ea9f582497c5d95f1386180c6c11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rechain_rim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f686e283006d7d0f0f4d55a97485446a94c6318c86ec1793e19a5781978b14a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060topo.half_edges[start_he].next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rechain_rim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/freeze.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3534e490bdb678e6bcb3e397f8f5cbb97db25ca9f519acd474648e1da92bc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060splits.remove(\u0026fid)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060take_section_outlines\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/pipeline.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfcd780422994a02ce864b181fc9e541fee45738d18541725c5fe08660e988a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.0.partial_cmp(\u0026y.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_edges_at_interior_vertices_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/repair.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d0c9f9412d45f3e35ab53f851782bed93d346d4995b938549b3636dab5692"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060remove_consecutive_duplicates\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dea010cfebae32f2e07f3a053c60c91dce2dc14cb61ccdbb8912584b1238be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060remove_consecutive_duplicates\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad63af769c91db98e867df19595f85c8af16d256bde54a3c3b32058ea1ab479"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crossings.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060select_crossing_span\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de1d4447b8b19a05d5f8423481166576d2655891d219fff41928dbf9c33af90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bot_chain.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4984}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab99b62f52ed2a4a1753be21ae6fa69f7d98be7c4679cf699d2997fe05f1ff6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bot_chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4985}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd5c948d82513f7e25df0b98839227b53451661a27b244c84f30bb6921e8a9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060top_chain.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"175e00b5c65f14e9980ab7d95d5cbcfe0a0d36158b07b841daa278ab3465ce63"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060top_chain.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":4987}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f3143250a1af24c8c174662b3a55f33900f5fa8c6cec1b470fdcaf56f8d633"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bot.first_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef877bc86f38ffa6643bb8afe0752c660dd7154ece65df14b8f997e98fb7bf8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bot.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5073}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f5afc26ebdcc9326b99cb2570db18b531e5998bd64839ae4695631f0438b37"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060top.first_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5074}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f98af816e67d7834fe4cd811ae384646fcc11d3e03375546bf9e1d266276874"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060top.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_conical_face_by_ruling\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5075}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ea11adbd39cc4375d8f03f3dd8d9487fcfedbeca93e6fe75660763566c736a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.dot(n_hat).abs().partial_cmp(\u0026b.dot(n_hat).abs())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060canonical_circle_points\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5894}}}],"partialFingerprints":{"codehealthFindingId/v1":"815f04c2ddda44af9a3aa87b0717e935c19a08d4aa3ca050eb48c1963b5ae851"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cand.into_iter().min_by(|a,b|a.dot(n_hat).abs().partial_cmp(\u0026b.dot(n_hat).abs()).unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060canonical_circle_points\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5895}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bf1259c3cc3a7291c096e8caa0d12c624b31e689c29677cbf46156d080bb86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.dot(n_hat).abs().partial_cmp(\u0026b.dot(n_hat).abs())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060canonical_arc_points\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5933}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7cdaf56f7ed268530f7bf3e09957c3b806e52cfc50f5096a7d58f24e09591f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cand.into_iter().min_by(|a,b|a.dot(n_hat).abs().partial_cmp(\u0026b.dot(n_hat).abs()).unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060canonical_arc_points\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":5934}}}],"partialFingerprints":{"codehealthFindingId/v1":"c160cec5f1f40dab5df324b2b850ce5bb74874c04af275adf956781fc7f5869b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bot.first_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_cylindrical_face_by_line\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5709edf2fddc1d8769534a96eb7afdc0e988439b9ee161cc4f92edf7826e89f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bot.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_cylindrical_face_by_line\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6691096411b42f05bcd83fb600dcf785af5a06c25abf93a1e961ef827dc712c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060top.first_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_cylindrical_face_by_line\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83273e91d9eca8a00ca2277f331e28fd8c23f7b6b4b59591f27de1a4043d9a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060top.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060split_cylindrical_face_by_line\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/split.rs"},"region":{"startLine":6288}}}],"partialFingerprints":{"codehealthFindingId/v1":"449f1053835140b05c88780378135a98e5ed677bc4914c3e15bdbab602291221"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060point_in_face_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd80db6f20fed3b9501edc920750cfb59e91aa48f043700f00e393974a537b71"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060point_in_face_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-booleans/src/trim.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"4472005d4a09637386ef055cc61315f3ed7a9bf623913b90d39d2092ee041d92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chars.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060normalize_symbol\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-atoms/src/element.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0bb74bef67c4fb00a1f7eb25e4896f8cffbe575e1d5d29a3acd72b76c9fc0e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sys.cell.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060homogenize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-atoms/src/homogenize.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bade3b483b680ba9737f162187a084ae709867674b057cbf2e2acc2fc9d6f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h.join()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060check_joint_range\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-assembly/src/joint_range.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e53a4251907b1bf1e4ae1eee5ee12a7e22099e81060d1512ed8af585f3fd47d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060da.partial_cmp(\u0026db)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060nearest_basis\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-antenna/src/geometry.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0a71e4a86a9457d0b83541dbd62f5e29f962304da2ffbe19c1a11dc1f0c31c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.2.partial_cmp(\u0026b.2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060measurements_from_s1p\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-antenna/src/nanovna.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9647cf4c4210c2984b9158eb41bdbf74438d4a40c9bed3ef2d7dd7e7614c41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rows.iter().cloned().min_by(|a,b|a.2.partial_cmp(\u0026b.2).unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060measurements_from_s1p\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-antenna/src/nanovna.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6202903322885c2ad7b080ca2037b68fe13edaaec27ec72cba1000aa1a375b73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rows.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060band_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-antenna/src/nanovna.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0a805bc652336ebff72296e60fa41c8b133cf6327f469dca129980ecdfaed1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.1.s11_db.partial_cmp(\u0026b.1.s11_db)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060predicted_claims\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-antenna/src/receipt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3003c2a98786624279da5dbbcc1a562150fbaa481215728885cd22ddc28f2c6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.iter().enumerate().min_by(|a,b|a.1.s11_db.partial_cmp(\u0026b.1.s11_db).unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060predicted_claims\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-antenna/src/receipt.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f68e838bb294dfab2c0fc76a865a59de8068e6af1d77daa89e7ef9249a337d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.segments.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060port_segment\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/cavity.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4e158f3639ca5ad17eb3939ab0cbb470a7bb786be8cab6eeda8617265236ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(c)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060breakpoints\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"014f2187fa97b0e1995ad60477a3399271606deece12523363423236b609289c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ev[i].partial_cmp(\u0026ev[j])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lowest_modes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cecceb644de04cc106b2442ef0a07f4160a7b6bfa6bed662327e6774a1de539"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.1.abs().partial_cmp(\u0026b.1.abs())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060match_bar\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/instrument.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf0ef0b688a65c78a8c779284d9f3b360735ff5b7cbbbb46ac11905eb8f07a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(pa\u002B1..pb).min_by(|\u0026a,\u0026b|rows[a].1.total_cmp(\u0026rows[b].1))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060tuning_from_impedance_export\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/rew.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a31102a00672d2aff97f9d7b13d9d5e6cefc4da04bf8c743c3fe1b6dea1f6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fem_hz_with_mesh\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e323856ab2bef78d6ab9c56cdf261e8c081b7d95a8bcdc050b9a7513875b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.db.partial_cmp(\u0026a.db)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060spectrum_peaks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"925266f703b10285a4832a78160a169c0f62b59f24f626773ba8561d8831ccd4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.hz.partial_cmp(\u0026b.hz)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060spectrum_peaks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/strike.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a36dd14e8046ad51cfcd4155ffc312ddb2a4ed3e5c56435ad5ea0866d68ac82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060y.value.partial_cmp(\u0026x.value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_peaks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/sweep.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f388b6bcee4edfeb0edaefd56904b8d09ad7d8fac719f7dab346f7ad0e0968e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.f_hz.partial_cmp(\u0026y.f_hz)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_peaks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel-acoustics/src/sweep.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4690de6576c06f99c8fd256aed523f500adf77747b6b059b46f089e5a6c23d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..3).max_by(|\u0026a,\u0026b|(hi[a]-lo[a]).total_cmp(\u0026(hi[b]-lo[b])))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dc78d82a40bd0e4b7e426974e53f9af2167d440830ed7db3ddaa128f0e4ebc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..pts.len()).min_by(|\u0026a,\u0026b|pts[a][axis].total_cmp(\u0026pts[b][axis]))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3e0e48d9494f6f530911a4a89c07faac29f535ae25f08830747483d6b63f73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..pts.len()).max_by(|\u0026a,\u0026b|pts[a][axis].total_cmp(\u0026pts[b][axis]))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b7ed309013a0af3987bca55db69be6c3b72b6df1c06be4ec6292e95be976f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..pts.len()).max_by(|\u0026a,\u0026b|line_dist(a).total_cmp(\u0026line_dist(b)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f04d0b8276dad4c1d16cc6c4442c934ee0b467cb144504cff733e7822fe48f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..pts.len()).max_by(|\u0026a,\u0026b|base.dist(pts[a]).abs().total_cmp(\u0026base.dist(pts[b]).abs()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc386e21855cd60c94c0d48c7d7348b74a70bc867e0d105f69598fcfbd322dc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060faces[fi].outside.iter().max_by(|\u0026\u0026a,\u0026\u0026b|faces[fi].dist(pts[a]).total_cmp(\u0026faces[fi].dist(pts[b])))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-kernel/src/hull.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01827fe96249b828dece69701a5bb2e40a3ec4fa4095b1bbb4c8cd46c966ac2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026self.src[start..self.pos])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lex_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/expr_parser.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e58b9da07890c37d3d490b3b83179667591be91b302118c295c81394fb55382"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026self.src[start..self.pos])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lex_ident\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/expr_parser.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"699916d11863032b82f7a497361baac0267a1e0a27eaa0ce28982a8f1df3a712"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060asts[name].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/parameters.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"800d46e4f4a8876903b7855564b520f4e646d433491a55b82a35e959ee97eb75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# vcad {}\u0022,VCODE_VERSION)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7141820b2989aab8bf06bd0ed900bceff4c100610efd0733601a9fbb9f01148d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ccb9bab5fc7c46bc8bb0f08142beb9d52e285a1c5fd6408201ad3e4811216"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# Materials\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2291a7b9fed9057f9cc0e315c08651d866fa4c078744196ab2893639f3595b3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022M {} {} {} {} {} {}\u0022,escape_id(\u0026mat.name),mat.color[0],mat.color[1],mat.color[2],mat.metallic,mat.roughness)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c3afa93e723975514bba1d5678a3bba051269d689b97ce7c5926dfffc9a0bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,density)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34561c2f95a31517e7700313a4c858c940bbba007e47a73ead65adca0a029a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,friction)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76255982f83f6bf892ba9d3e8fbceff4a98a58e24fcfb987038d912c93ca9a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5193d20ae90fda37342a606374bff6e0ff59746e2069356d0c17a92ffa324c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"438ee5126800f2f2f93b3377c9ebb59868a7f21c433b8f497f109dd2a5902f57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# Geometry\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b024eb3daae04fb60cc06a53c2e53b13057b5a257c9cffdb1fcf5f4e3a09c72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022{}\u0022,line)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d436577b2c66b7496f8103586f1e71d27df6c427b1af14a91860399c03328b77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ec353e53c1ff043857bcad503831c41a482c908a29627decf860a16bebf88f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# Scene\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5cd6d782d7ea9d7c1fa8ec3fb239463aaca7af01cbb8625ee3bdb330d0fbb6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022ROOT {} {}\u0022,mapped_id,escape_id(\u0026entry.material))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7725a79feae7128d225e5ae35b677234bb2495f445339743ddbe9b2d05aaa7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 hidden\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"534f5a6b7a54f31ffd5a94ed42df9d4f03b3ea62b0be57dd1b73595715621871"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8c38efe095b9bf5001af88157cf2073ff694a291d1f1ca90e6b32fb32b4d2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"37220c1860b3d1c73a957010141f3a568cf124baa919d873d34072b8b5fc0a18"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# Parts\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3acd29cfa1fe7e0cd35c77fd6a14c14e9a2b6843a3d995e797504847a3aaf39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022PDEF {} {} {}\u0022,escape_id(\u0026pdef.id),format_quoted_string(pdef.name.as_deref().unwrap_or(\u0026pdef.id)),mapped_root)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade6efc0078a0531b2065199d597dbb06fe26799b2b881d3c46b4e8efb415a75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,escape_id(mat))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab3c26a9688bce4de0dcebe0d5a695858a27a1c3ee1948c23d528b43c95b5d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b61112b939252386a6d8c549df07617c2f1612abc8be5fdc27a0573195bf82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a52378e72c5864becf76350f56400a0ea9148ecad018a2a150edc8bdc7ae988"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# Instances\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c9306fa227eb35cfc17dd4aa5b6ad066fb7652be00218e62e52c5724ea968d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022INST {} {} {} {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026inst.id),escape_id(\u0026inst.part_def_id),format_quoted_string(inst.name.as_deref().unwrap_or(\u0026inst.id)),tf.translation.x,tf.translation.y,tf.translation.z,tf.rotation.x,tf.rotation.y,tf.rotation.z,tf.scale.x,tf.scale.y,tf.scale.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"706271b0b1ec03985c7740941d00f15b6220a0a3ef2d8f66cbf6163665b2c2aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,escape_id(mat))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"887a22a280e44fba168553845a4ace34c2738000777918482370db0e0064a050"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bbddd2438e52dfa68230567b0b982d2de02814cd007c1cfb5b4d675a3ffd6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3fd7a33166816aadb8e334880b628d7041891de7df9791c1b96ffb378fde68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# Joints\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c0c77afd257c8bf15509c6fa7b144451fe98e5021a79da4a47e717b8a944fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11e07592f3a27758cc4a0046cd08fed3fd8d6263f50874e9889ab1bf743fc9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022GROUND {}\u0022,escape_id(ground_id))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"94374587e2cfb14ad8e1a253131df3b98b756104df42f88998f06d7bea1c3aa2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_vcode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"196bad860e7ed909e7b3baa1bb0f53d929c962b746d84abdae7eca4ab20b5bf5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022JFIX {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026joint.id),parent,child,pa.x,pa.y,pa.z,ca.x,ca.y,ca.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae88e4db8b4e68854b6988d031659e7bb30a2a81803bc09aa3068b9b531823a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022JREV {} {} {} {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026joint.id),parent,child,pa.x,pa.y,pa.z,ca.x,ca.y,ca.z,axis.x,axis.y,axis.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5558a3ec2262074c202110d81150b8b7e7ac8c6e0bea1cdcafa303f75dc3fc8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {} {}\u0022,min,max)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7c6da2a1d5b33caf362ff6165cfb7be70df57fe7b729eafe971826e4de61a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"918c956ffd178cdb0b02ec9cfc5757697a1ceaee4b85e54a3ef23318c85933bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022JSLD {} {} {} {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026joint.id),parent,child,pa.x,pa.y,pa.z,ca.x,ca.y,ca.z,axis.x,axis.y,axis.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5c53401d776dec454f3edd5aec2a3a16c7a926c8f60d55645f9c9855a99751"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {} {}\u0022,min,max)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8ba88be562dd3a9f676fef8146498e3171e26e5ec5365493ae0dc95d18be06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9226cea1d856228ef397830531bdbdb70f920ab3b9dcc5073db943cae14712a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022JCYL {} {} {} {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026joint.id),parent,child,pa.x,pa.y,pa.z,ca.x,ca.y,ca.z,axis.x,axis.y,axis.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"305c0172fcb3efaca6f7247eec792f4c8ffcb6d1a1b8ce6d07d29a2315035046"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022JFRE {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026joint.id),parent,child,pa.x,pa.y,pa.z,ca.x,ca.y,ca.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b288b5ebeb838ec7628573c713baebea432869c2d5cf7e9ec83f58e66afb10d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022JBAL {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026joint.id),parent,child,pa.x,pa.y,pa.z,ca.x,ca.y,ca.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_joint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"062555adea1262a4f184cce56b13d5a4fbb2b4aa5ad01953b40e8acd9e693cf5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022# Scene Settings\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8902a2b1a6a07fccd68271fc0d0d8fe2908c0452af4489063a58defe4c3de23"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022ENV {} {}\u0022,name,intensity.unwrap_or(1.0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"903f8a4b255d7f8fde037f85e2a87a9fd63ff3b5261beb8762941f07bb125c9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022ENV {} {}\u0022,format_quoted_string(url),intensity.unwrap_or(1.0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"00784646757f0f18dd44688a83c91efd7b74bb6bd35be443c1024030a88ec0c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022ENV none\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f435531752defc8ca15180b7828fb7905d4877ec13735f34a9b9c1c5cfe6fd9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022BG solid {} {} {}\u0022,color[0],color[1],color[2])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"9610d7bf36fa35acc7f896cb3e48323616bbe330395c26478653b29789554821"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022BG gradient {} {} {} {} {} {}\u0022,top[0],top[1],top[2],bottom[0],bottom[1],bottom[2])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"066257b675b3d84a4c07ba1f5e031213132b51af357f432a8eeb7e3d24c3576a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022BG env\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8d30f5d1421cd14bb49a62081d5edca418e697fb017c05ffa0ee31eb50630b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022BG transparent\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"193e3b95eb11418d558da8d6cd2ddc190066e363b30e76fb2b716dc440f7db48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022LDIR {} {} {} {} {} {} {} {}{}\u0022,escape_id(\u0026light.id),c[0],c[1],c[2],i,direction.x,direction.y,direction.z,shadow)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b6606eafcb0caa3bd5a12a00fae78615527f630b790ae87493ad706c5184f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022LPNT {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026light.id),c[0],c[1],c[2],i,position.x,position.y,position.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91e84601c0feed04f92546c8c445c51999cbe3a49465cfda545e73889cb9209"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,d)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ce2c18d7fdc41f47bd58774cc911302e2177b44b154b25dff2af7d790f76e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1023414d5a18dde96dc4793e60fd2a1ffe6c364205608241f8d39f30e5512c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022LSPT {} {} {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026light.id),c[0],c[1],c[2],i,position.x,position.y,position.z,direction.x,direction.y,direction.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac44dcb7e2256496e3d89f06ac1464fcfaaa50f0f31c329cd67228379f88ecb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,a)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f28e77737a899deccc24d201ae22b3ba639a4ffea4149b852be8677f6d4ee86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,p)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b1870aaef35dc09ea25b0a66136065b37ce8654e9e924f166ea948fe4fe864"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c4d6998cb20969d6f8afdf74d344f745694d107d12f2f4cdd44e5480bcceb6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022LAREA {} {} {} {} {} {} {} {} {} {} {} {} {}\u0022,escape_id(\u0026light.id),c[0],c[1],c[2],i,position.x,position.y,position.z,direction.x,direction.y,direction.z,width,height)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e0a90ff339f425e0794e3492925f57a1a5f8cd62d3dc417ba93403bd724aff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022AO {} {} {}\u0022,if ao.enabled{1}else{0},ao.intensity.unwrap_or(1.0),ao.radius.unwrap_or(1.0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2cf418f4074d8debfc4a55eff4dafdbcc76fbc790faec9e029d6c6d454009c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022BLOOM {} {} {}\u0022,if bloom.enabled{1}else{0},bloom.intensity.unwrap_or(0.5),bloom.threshold.unwrap_or(0.8))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd662203d16171cb496022d63b3a513c5ba5b40f88558b982b19c2bf2a34596"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022VIG {} {} {}\u0022,if vig.enabled{1}else{0},vig.offset.unwrap_or(0.3),vig.darkness.unwrap_or(0.5))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"147a5d6f1c98bcc2d25d24d32103f5261fb788335b870ab0ec6bdfb089bb12a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022TONE {}\u0022,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc32d2578debd736976ebc24578f8b6dc30aa1492a304bcc6ec542e9187a6b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output,\u0022EXP {}\u0022,exp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"da489f44873116425b2538deb772737ab8e20e1a7bf0914273834ae2f5f898f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022CAM {} {} {} {} {} {} {}\u0022,escape_id(\u0026cam.id),cam.position.x,cam.position.y,cam.position.z,cam.target.x,cam.target.y,cam.target.z)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b14933deeffd733028cdfee2774143a92399e58cc37a33af4c34b5e67dde77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,fov)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"074219c37a18ac4e5f0f92dc641ec2ae78f1f44b3eb24c301542501db5e053f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(output,\u0022 {}\u0022,format_quoted_string(name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5670920e0cc442711b1bca27dbdab057c92604b31b5aaac2388ba7e9ab7676"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_scene_settings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ir/src/vcode.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e36419c6db77dbbbf75ee36ac9b4efa61b52952906d6969ffb43a68489749bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(EN_JSON)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-i18n/src/bundle.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"add4a2c92553725f6b37ea2b9ef1cf07ea5e77da4701ef6352a527e870e5cc62"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GLOBAL_BUNDLE.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060t\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-i18n/src/lib.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b44aac6d89c740a7b460d967e6daebd787b90795037ddb1df1ca7846cb5967"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GLOBAL_BUNDLE.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060t_fmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-i18n/src/lib.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9775fbe740de93e3fd3f74b9ea77120f2a6ae9b543a87162c462e48ac74a453"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060level.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060balanced_union\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-gdsii/src/bridge.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"77300094f55a16abb40b267c1552f4c85cd29a1b049bee87f149405e58b6cc66"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(json)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vcad_cam_generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/cam.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebc1c272dda7657b785b282d9b0a946a1163f1b19365153aac7f95b8cc7b7a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060blocks.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bc96fb3073e5b08f8408350514bf3661bf786b10e9ac3581017348750b6ed8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060req.tools.iter().find(|t|t.number==*num)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060job\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/cam_job.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdae6d3291a60b3f6090efb200f5dd143e9289fd5e22abd6bb2cd9dce6caf419"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060doc[\u0022roots\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060solid_from_board\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/pcb.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1a1d2583692e12a6aee48f4bd59fd6c8ebeeb243b9b95173f2f17900312607"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060doc[\u0022roots\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060enclosure_for_board\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/pcb.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8972a5d4a71070b450098a824d6084338e4db6f52b08c73c71d8d0a9623749a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.entity(start)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vcad_sketch_add_line\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/sketch.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee8b3a5dad71818c8f3f309858d3a5fb1b770a367f8c357d8cbd3e9851b0e38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.entity(end)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vcad_sketch_add_line\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/sketch.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a92151886f2321b36d9315eea27ea7e5f5ec51e91de0e5f9097a5472ad76e0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.entity(h)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vcad_sketch_add_arc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/sketch.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"624f94ece6d5224b5ca31187236ba93d9a81d29428a4b5ef7df96c23b0ba59fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.entity(center)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vcad_sketch_add_circle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ffi/src/sketch.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e99109d06428583a553548fd075808675a3ba7b8b479432aab5e075c41678c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022CARGO_MANIFEST_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/build.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd7617b852c616bb1af4bc1511530aa7b5e3319b6b83d282a205c6cb7f62b5e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/build.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec927d0d2343af249211c3d71e6297103b93e3c2851811b523800c4b0e855a46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crates.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/build.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb74e8dc6eca3ec72be485ac5abb641697a76c322feb219f7763c1e5253aaff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060best\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060extract_antenna_spec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/antenna_extract.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"391bd5df1b90833e6772127f6e0895f9b52e3c6d9c768608c7733efe306e9a60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pieces.iter().zip(\u0026edges).find(|(_,\u0026(u,v))|u==feed_node||v==feed_node).map(|(p,_)|p.width)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060extract_antenna_spec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/antenna_extract.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"2097c222a1565915a6a57098affc2f98fd4ea8c00d5dbfd5719de39c650b5221"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut at,4)?.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_bundle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/cache.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"8339bc045ddf3bfeda3f79caa39b62b73a001beeb599ecc0f1e99b911e316c25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut at,4)?.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_bundle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/cache.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef003ea79f0d0c2fa330023f9d19b9ef4226d68e74d2f7a4799a56f40877a55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take(\u0026mut at,8)?.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_bundle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/cache.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72ecc7878c76d707a5abd7203384a428de2d67efec2ef8a4bb9fe99ee719ac9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060probes.at(theta[0])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gradient_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/diff.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e728e043d7417c7bc6d3e0a656f892573d6d1225aba199d0756ac09c5bc41133"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060probes.at(theta[0]).expect(\u0022probe evaluation validated above\u0022).solids.get(i).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gradient_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/diff.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"046247a8a6f1ba17b70957965d9a445eba39080120de0297297d68ae29da85ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060boxes[a].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060evaluate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bd41446a0b0887c2a3ff8a9c92518ddb8c25701bc53bfad8da555b03f0d91c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060boxes[b].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060evaluate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e35ba3c38a89c229bfa750a037a1c38b71bf75c131bf76d55f0ad0aae4b8c58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060boxes[i].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060evaluate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e49e5124819eeecfef04e79af9d7629fb9d31e9e556e824394ab6f75de9502e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060boxes[j].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060evaluate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"34db69a4cc48e3b0ad523775a5cf58bcf90d7a421b0cb430e1d80a62fc2a2b31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clock\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060evaluate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d5162d62754ca24cbb51f8e35c1f25e9972e7c9bbf1cf7ebd38c5f8474081d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clock\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060evaluate_node_timed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77d8b00f8dce69bed2d7f07b8a8285aa2f9943334e6d79c0cc4020c3b9d954b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::convert::to_face_refs(std::slice::from_ref(face)).pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attached_sketch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c95a1262ab923b312e64b6865bd378a1427f2974c827624dd3b03763d6ade1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060it.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060union_fold\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/evaluate.rs"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"95644f2b887e24436554feed12eb84201f17ec311225f2f9ee69fae6d54e7b40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h.join()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060par_map\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bdc3e7f268455bc079244b86c126cb815a8bd9bfbe95b53b43c01a66a09828"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.exprs[i].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060expr_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4424cdc72ec2e987111aaf1c8d1937844955d7bf54153447146d5cf9d44a57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.registry.get(\u0026q.qoi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecc8de95892ca693d03280f3f671e31b43084feab3527e87ddc0cdc91318901"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.registry.get(\u0026q.qoi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sample\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c93f5aa5e5e9e45b4bb9c4f22443a38ca8a220d599c9a0f39991a8730d6abdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060jobs.iter().position(|j|j.plugin==pi\u0026\u0026j.k==k)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sample\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcec60d60acc96c08fc7bd53b7fd3a1b9b92ac1bed8bf5ac6a0a40e33dc36beb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Builtin::parse(\u0026q.qoi)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060seam_fd\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/optimize.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5b45f4ef101816a33ca9a59e6deb972f653470553060dcfa76695678062d74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bbox.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060document_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/sensitivity.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483b6744dfe9068b8c8654f8727b386476746ace2bbf0e04efe4000a28f3f21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_value(defs)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060default_materials\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/step_doc.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aae41c94f62d011a27c4d1ecf3a33c2f46fda73571b83b885d2cc942328ddaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060axis\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060extract_axisym_mag_spec_from_scene\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/sim_extract/em.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"05961a424423f3feece80a98bb6677bd98312344853a64249d30391b59e953a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060d.parameters.get_mut(param)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gap_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-eval/src/sim_extract/tolerance.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d14c6b2230e09a6c853f607bd7cd0adc1bedd7bb660db9436a3319b84391198"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060map_layer(used[i\u002B1])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_eagle_brd\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"44eb6c1148f21c6025897479c2de6d03d6531fd9d032cbad5b978686c14afb99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_outline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1265812b69986da04da89176bef2201858278620b7bcdf70912755db2cb97f53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_outline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"edccacfe830e7e3daf32f6f3a6e8f1467a78069b90342b5039118160788249b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_outline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/eagle_brd.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d9a659ffe4cec249d2472eae2be1be92f8925d0436893b3dcfd567e9bf01d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.inner_index()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060layer_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e93f573996f319aecdbee6e8c56cf773e56d097bf4ec504da280eaa014df49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060f(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060flip_sx\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ece77dc0577a30e038edf801fbadf42780a13df8971ed44af381ac318daf6f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060f(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060flip_sx\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2708add2d97ba175e2142fcfca355de9d7caf4e229430886d2916e20a840e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060synth_edges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"605a6dd95bfe5a26a07a7ba9b270cd862d55e042ca6684b1bd238805e97e9271"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026pro)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_kicad_pro_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":2950}}}],"partialFingerprints":{"codehealthFindingId/v1":"061fe0a30b2458170e90735d5a3516c47fcf5b128bbb9f79d114871e50734273"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060remaining.chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quoted_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/sexpr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f069562fae44ed9eb11e6591e12045fb09cc23f9e3a0d7adf58ffc6a272ab1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.copper_index()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_with_stack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87c5d748bdeffe8b82fb6dfc5877d8242aadb9ef5cf59e52c17ed33485aa363"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.copper_index()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52834e1e473ca0966981f165e9d744e224e6cbd6ae52f2c934677d42b866785"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PcbLayer::inner(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060slot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db12df2cbc801450507f804a153ac4789f150ba4150802c5f7b9d07dd23a937"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060board_outline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2c3142fd219de3dc999ee725397b02d3d267f2c81713d50db0d7e224e65ded"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_outline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde5522394a37f808db35bb7fb78eaa4abe0a8792c6d0ab5e74ef78302bd542"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_outline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf33a92a9bf4923b8e181d43ac67557120f98d528f9d1b53805642b9e756eb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060chain_outline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-symbols/src/altium/mod.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c5b1f9a569033f6807e629b5ed87939fa0d80f8c5492077b744fa75b081b04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060branch_of[id]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dc_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1d3cebc02793c3be15c2ab421c36b389fe81ca5dfa774b68d04edd190ae606"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sys.branch_of[id]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ac_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"82db6a7ed2ab34f157e5adfd68e908be1e513a1a721c9b16bbd68d08fa9f5f7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sys.branch_of[id]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ac_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7010a0965a96790098066e638b31a16d109be2d4cd14f1831bb6696da5c9001"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sys.op.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ac_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3dd6e2b20c8f3fb2c0b045001b6d42b88146061b689933dd153817bf8f7bcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node_grad[p].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ac_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea8b9b47388378b7aff023e48ed550c9f2117521e34bd10b556653ab9015db2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node_grad[n].as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ac_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/adjoint.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c270194ed2883235c9625770733827914bf7338dd4546112f44a74d6507dce0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.adaptive\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060step_adaptive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1844980c3c5726773385e2eaf2c7574f176e65e0d52e90dac9fb8eba7bd6d02f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tail_chars.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_si_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/netlist.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e2ced4e426bd6ea4ebb1f92d81289984eada6d9b4434eb2e588532d1dc56e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tolerances.iter().position(|t|t.device_id==v.device_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060allocate_tolerances\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/tolerance.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c487c35c6e095aab17fc49660c19f594ad570a2cab761d0a5e225c09e4525f67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r.stackup.contributors.iter().find(|c|\u0026c.name==name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060allocate_tolerances\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/tolerance.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b43dc35036fdf786e1100fcccefc3acbc16d7b4a1a6a8627f9d610769f422eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060branch_of[id]\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060transient_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-sim/src/circuit/transient_adjoint.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5097051f8cb54100e0680c18ec1701c170966fe87990f4f23cb420bc4f07ad0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::from_toml(profile.pack_toml())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_profile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/dfm.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f573d00b8e87de60672cfbfdb52a30e02f66e2c0930f10aa0999a78288c7a85e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060islands.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060detect_net_islands\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/drc.rs"},"region":{"startLine":2250}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d905bcc768c8ec622c090a289aaa798d7495618d038067e265771c744020ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dist(a.center,end).partial_cmp(\u0026dist(b.center,end))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_teardrops\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/teardrop.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7dac8d4e152cadb3483f193855ab9e75067fa444483e82fdbae5aab6bc1669"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.x.partial_cmp(\u0026b.x)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/teardrop.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"52496384914bbe3d710d4826e91c65383596683878e029a00b8277deac0dcec6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.y.partial_cmp(\u0026b.y)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060convex_hull\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/teardrop.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b082fb660b743aa113e5498cad268569f4f1aa05a0ecabd68b1e4dc368952ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060best.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060route_all_once\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b01d5d8ee2582877ccdd21a2d03469cebce4a591a3c987bd44ed0e361e8afd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060best\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060route_all_once\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/auto.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"921751daca12422f553f461b09df78a307f4a3ef73ac5dceb26b6a041076b957"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pen\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060seg_seg_dist\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/claims_ir.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bd978e106f51711db68f86055f9dbcd3acfceb6a41e8910fe1530736ea224c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060simplify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a17f1ccade64f01d23b09f54e631096563b52cd901bc14414b8f5386c3668b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060simplify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/complete.rs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"972d99416b13e0c4034b094d7f3ec0c7599baa0e48ad1d80d624ca3d1fac10a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060plan_field_escapes_toward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/escape.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19d717fb0ea33913c836fb4319a2504d174655f4533acfb488c5468058a08af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060costs.table.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060gpu_search_batch_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/gpu_bridge.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a486aaef6d858b74f1e3b410eb3659652a6c31f1360f24f7bb780bd60e132f3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pcb.traces.iter().find(|t|t.net==*net)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060match_lengths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03974707c6ff7d9f2ec30d2e54fc2b0f85c111889ec3b9cbafb66d86c756dbd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pcb.traces.iter().find(|t|t.net==*net\u0026\u0026t.layer==layer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060match_lengths_runs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/length_match.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f16a5055da01b6b37c3855053721fd647ca1dc9bf9b95f0ec422591a75c0d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060run.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060route_net_maze3d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4f90dfdb3f4f942144f832ba3bd079aef4a2c1846ad634fb3c74b9565fea3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060simplify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af31a4d94024b72749813b51965a8125b93470657c25fc3dd32af6b32bc40ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060simplify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/maze.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9d818bab7550e713d70d5df86c8de1758a8f6ce27a6dff1538bf660f996dfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bump_away\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2a4c7112b1936d777dc1b745ff24e9ccb66c5fa3018fb6df6c015f59f8c38b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.1.partial_cmp(\u0026b.1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compensate_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66794ca0857f7c3caa9bbf096489fae441e71043e49edf1d7261216e5a04b20"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.1.partial_cmp(\u0026b.1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compensate_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"03876bb640a003e18e10407f239efc606a490dee4ac8bf9951bc1eaa0775e5f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060points.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compensate_run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b866210220326ceaa1a1fdd54d68cdc957f3c563289e75ab233ae50c5aacfe4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dist(*a,p).partial_cmp(\u0026dist(*b,p))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060nearest_pad\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35811e9afddf0973a96bf00c800b2ae0eae39398f2f92ecae3b5ac6b9b574a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_legs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3429a5dce687a7576b11526b5a419750e500e1ae2d9f023c929e97a77647cfcd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_legs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4b76003a0d34d9cbda148969bda883ef7f19414f21ce4f295feba75da931df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_legs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b2dd7ced38cd2732f07d61505691de49c3bd568f005e2b83001ec239071519"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_legs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c8db48b65123c1ebbae31e074c477bed0265276e21fd97e1a16d4c004f2a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060off.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_legs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"008801c4444065d4ee3027e77ba3a50b155a7e21a6068fae274676abea7c8e32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060off.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_legs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ee05c5f610994e775e87263a6f3ba654991b4a3c7001361e7c2d716481bf90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060seg_layers.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_legs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/pair.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb83bbe559ca69806ac15eb4d6f6ed1c4371fcba3ed52ac4440a150a5798a3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DelaunayTriangulation::bulk_load_stable(pts)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/cdt.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba347ec2e1cc6382676cd9e7ed86200b7ca906aa294ec7692eb70f85c2b6bc2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.cut_s(e)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060end_point\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49efced40a912b662ed75c3733a07e82fa14f681fbce114b6fabd85a3d7fd9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ends.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060route\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/embed.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"b493f60ff8deb5afd6cad06d730dd5943a4841d93e01e2755ba542137be44cf9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stack.iter().flat_map(|\u0026(a,b)|[idx(a),idx(b)]).reduce(pick).map(|i|copper[i])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060choose_sites\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/flow.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"268a53cd3f96a602313c3cb88c1c49232a61bde8b7122ff375e2b7391eed2687"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060funnel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/funnel.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d4a3efb733fc2f25181c03edc823f14f3e8963b1842669f255d262890544a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060funnel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/funnel.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad007de07ddc77a486d895cc5a9e3e5f752b4a6470ca87b6bc300c82c1b6664f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060funnel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/funnel.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"929e39b9a90c47b35e91ce026dacef556909c821c61392e97c0f7daedf71507d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060round_bends\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a828676f0e7d7b03055a2fb7f2d9b17f9322a90dc3d9e4a9070d6e4f24082945"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060members.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_wires\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e92b2b4e907a9dceac0893b0b3644d6fb2debdd25ececdab97253c34cf0a5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sess.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_wires\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e83cc7476d3eb73ab2b9838e643e6b353d13e83399c6e433246e12fb46495e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sess.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_wires\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8294ba3b0534b132ace964923f18893a8126c9a0c2202afbc4ab4764a66da20"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sess.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060realize_wires\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/realize.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"9629932cb14c33fdd7346277e365a81e80501179440e90c8e63a29a48d0d8444"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..n).filter(|\u0026j|!inn[j]).map(|j|(j,best[j].0)).min_by(|a,b|a.1.total_cmp(\u0026b.1).then(a.0.cmp(\u0026b.0)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060commodities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a14c0aeaf3f3065ab0cd332595a369ced0a1391aff3197fb119e502275fcd1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runs.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060runs_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c0276306db096aa89f915f0e0f35f6e943f67053aa1fa073ca167c7fe8d76"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runs.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060runs_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-pcb/src/router/flow/route.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee747b2f1f00d1ac5caa95bc2aaed5168c4d23d5f80957fb44f49ab16ce9a9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(raw)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pack\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-parts/src/jellybean.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27333580854083351873a980cb9f51be6a8ff26fed0d2c24b051f865e3bfa39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.macro_name(code)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060definition\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b50066529f5b3e5731c37efebae25ab56e6e169254b88fe10a2102c50b61ac8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l.inner_index()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060layer_filename\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7e41502a0fd6dbd8add4a54e7e2f02e97a9aa178da8299cfe396cf5ecc7502"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stack.iter().position(|\u0026l|l==layer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060layer_file_function\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-export/src/gerber.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5ddc0a18e421b7cac348c9b493f15409d6cb58f4d1afead844f2483b0792aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.build_g(widths).lu().solve(\u0026DVec::from_vec(self.injection()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060forward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-diff/src/pdn.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81fe707710dc60a264fb542c54e1420b3cd4381b35daa968b6b9264ab191c63"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lu.solve(\u0026DVec::from_vec(self.injection()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060jacobian\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-diff/src/pdn.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a70b65fb3be33b6034b7a0a2d34b384162c0f43890d05008088b324abb779fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lu.solve(\u0026DVec::from_vec(rhs))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060jacobian\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-ecad-diff/src/pdn.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"637197b0e0600326f565a56a6d5f3ba5a3ef17b5a674cc75df2ae412aaccc384"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026saved)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060save\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-crdt/src/lib.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad2ebaa870b9d34cb4533a2ffce4444428d40e91db548f7d356a9564b1ac1a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.menu_state.open\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/input.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e8cca376b1578b806165abd2e41171d512b553c6cdc2afa7356d40f7fb79ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.menu_state.open\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/input.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35d859bec795580a8ffa5359ff63eaa038785730e40f889431e4cf4214e4487"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.menu_state.open\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/input.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"9831828715b379bb399610272df5e17c3750853a96fbbe38795078732b8e164b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.menu_state.open\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/input.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f2e73ec6acaf17fb717f7488e5701fe02c24155aa2304693d045fbac851bc7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.menu_state.open\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/input.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff8296cadfaa278ecc64a4290dfbd8c7dafc5dee36882f430069870e3eaa8f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rustls::crypto::ring::default_provider().install_default()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecad0e045554cefe8468ec8b0161a5c25565a35f95658b0d54dace0ce353b638"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060save\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-cli/src/main.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82467684f57f8b62d364eb478780f1a6550e5816302ec847ae389ba5e290bba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060part.solid.as_ref().and_then(|s|s.as_brep())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060objective_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5aab5bf01866b744aab25b7084d99e6ef439f9ed1fe828c6660d1b6b587d5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060solids(doc,parameter,t[0])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060face_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"94baa9e6696ab7a5d90f15a7ebc82fcb4f31555ef9cde99c52cc3f456b981b45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060solids(doc,parameter,t[0]).expect(\u0022probe validated\u0022).into_iter().nth(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060face_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"322eaa270a60e406776d74f6c3894861860e092d3e660518e6be14776cc97753"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060face_sensitivities\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/optimize.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b2157908f2b906bc18df514a2f010a4cba99012e92105aa8344c56ba3f396b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ctx.shared.done.wait(g)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060wait\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-atoms/src/task.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7e98878707a2f17602141e295e57eec3c18062ba3e27cb84183c294225276e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(AgentManifest{version:MANIFEST_VERSION,cache_key:format!(\u0022vcad-agent-v{MANIFEST_VERSION}\u0022),system:SYSTEM_PROMPT.to_string(),tools:tools(),vision_tools:vision_tools(),})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060manifest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/agent.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0fa0b6a19ec12e4b95728e3afceb9b23dd6b95a3ed9a65ab553713f1e47de6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026manifest())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060manifest_pretty\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/agent.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf60c37a614eb29e1e64de8604cc0f145e7a360ab56b2c2d0b49fdb4d5597c22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060doc.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/delta.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3678c9b36734e7646a7cf840766abd3e8ce69dfd000d7cd0a05de0fe0be472"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/delta.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"498f4a2e2b8321b0be3222f15c5d775bd9b142057ebf0f9a007bd7e87d1dad4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060array_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/doc_edits.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d839ccac601f2357220907235033d0ee2c9b974a937d7342cf5631c9124c6a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pcb[\u0022footprints\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sync_schematic_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/ecad_tools.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"54459cf7b47d9f816673b27ae21a2a0797794b1471145a537ae018fc9b07c103"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pcb[\u0022footprints\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sync_schematic_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/ecad_tools.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2a9102e68c6380b28d92399797fd3fd6026dac603b1332cb7a624676dee58e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pcb[\u0022nets\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sync_schematic_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/ecad_tools.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6c06e05150d28c868ec23e02963ebb5045726b9fc90b2aea568f332e5b5d21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcad-app/src/keybinding.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6a3c7f6ce67ebd9fce904892d0804b60801bee73a8279733f1c346e320aee2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.peek_char()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060next_token\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stepperoni/src/lexer.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad16728d053fa5250b7c36c89a9990e569393d4a53523940ff829d74123c7585"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(digits)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_entity_ref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stepperoni/src/lexer.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd625a6d824f629437512cf65e25193e811e8e8d5984b4d2e6c132f2b1d84d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stepperoni/src/lexer.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a903ef4bcbe559f9d48c53dd165550c11a5760423aea4706aa8ba136d3d2ce6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(num_str)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stepperoni/src/lexer.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fa93d13fc8c0eedc90ed235d5b563d0e99f303f05bdd7f0921255a00ca8158"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_keyword\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stepperoni/src/lexer.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d1fcbfc2bda7e8bbfa35d699a90e161e561404bd9533615629cfd4c622ac62"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Downloading...\u0060 under \u0060isDownloading\u0060, but \u0060isDownloading\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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ea17b64eb1f721538a5b4d2b4f1de5d8c325f7db9466a6a26bb21eb011fc2c"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CSpinnerGap size=  class=\u0022text-brand animate-spin\u0022/\u003E\u0060 under \u0060isDownloading\u0060, but \u0060isDownloading\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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cdd1f20caafc32b99da8a6f8bd2a27121ee430b6f414cb4e3848a31fbcd524"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Loading...\u0060 under \u0060loading\u0060, but \u0060loading\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":"packages/app/src/components/DocumentPicker.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef1e0c1745b1e580c558c96fd14f9d902a0ac3d28593669a51bed766a609963"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060send\u0060 turns every thrown error into \u00600\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\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 at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apple/VcadApp/Sources/VcadApp/DocumentEngine.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c7d0a8852bf0c97af1aab61713ef75da840be3b03772b35b14b5593e95c507"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060manifest_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-ecad-parts/src/catalog.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4541061b45088ff79c2d1aa5f68009c68f5030f572dfd23175d42359b943fd2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060jellybean_manifest_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-ecad-parts/src/jellybean.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd41bf7eabe8ddf52c28973e5a5f9e25bff0907c1e65644813bd03d925b6c0c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060footprint_keepouts\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":"crates/vcad-ecad-symbols/src/kicad_board.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"183b3b07185f474742329812858a1413b55f163e34ed2f30b69de5097df7834e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060vcad_scene_write_mesh_bundle\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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":3662}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fe09a7087498447bea1286531d9a33db5a7e155e02619445ae280d74834886"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060vcad_mesh_bundle_import\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":"crates/vcad-ffi/src/lib.rs"},"region":{"startLine":3698}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7d8cb10baca934152e75c675339266c90324f7732cbb8d215dd79534ae9940"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060vcad_recon_poll\u0060 turns every \u0060Err\u0060 into \u0060-1\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":"crates/vcad-ffi/src/recon.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"61204712239073ad894ef8c8a8db96eb8260ac316e34deef65bdd00afb2385c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060evaluate_sheet_metal_chain\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"361cf437f3b121297a107252f18ce8c32a985d4636093f9b33f71d3e7a8d976e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060check_sheet_metal\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a346cd7e890c9b8a0b6ab2437463a01b5305ce0bd7f0adfefa4ab5aa9453102"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cost_sheet_metal\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"52809638a35aa438ce86f9fb0cf03ca62aa90257311b8def205091397ed8fcd7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060nest_sheet_metal_parts\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"457235b0d9b3178a7c7e5da645e8c05c8f1f8d4a29a77a0d54bc19bbf957e703"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060nested_sheet_metal_dxf\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff081d3d4a058166bc23bf862c00096c29272ce8a1168c5fcaf983f17ebc0d7e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sheet_metal_sequence\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d50a44e0705d45ac58219a27027abc32a895ef51812b2ee425c3d1e556f258"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_sheet_metal_materials\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb3b7851624f78f1f605aa27a322b233508fc3c100ce39323c91cde98570411"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_sheet_metal_shop_catalog\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02cf2534f1f8d89d7112d96261397a0f049ea7e8852d7d333c46262ccfaac76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_sheet_metal_bend_table\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"be186287b641d5a52d265e2920b3db3399022475c8de4a4b532d345c3d875a86"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sheet_metal_folded_step\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022step\u0022:\u0022\u0022,\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"436a219c7becb98728da1fe9a79a4bf5bea07c1bc0b4a3ad2ab96311d71ef0de"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060flatten_solid_to_sheet_metal\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022error\u0022:\u0022serialize failed\u0022}\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":"crates/vcad-kernel/src/sheet_json.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1e0183343ea71990edaa9533d69dad7ad42c05d3d26aa77ec16fb0b0747a76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_document_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ea91c04c8d0c3fc6e8d89571276c87c79dd62a31f4b8cf36e5c473ebf242cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_parts_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4748687c2c52df2e33ba77d41167b9d2fbaa7f3f5f905450d92f53e257ecfbdd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_ordered_features_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf18fc40da679bcd70a5baed10a62113d70ed442e9c2466dc2054b7818acd28a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compute_position_between\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"885420230e6a1ddc73d66621e0f0ad37fbd9c1cb7a9200ee0bc260abfe9fae74"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_sync_clock\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bfaa9e3e09fbec49d314000881033f12713271bf932358ae1c87f1c4ff9867"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_ops_since\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-kernel-wasm/src/document_engine.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdd1ae24e373d9f3ebdc687ed9d20df44e0859ec316774bdc7de0ed334293ae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060commands_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-kernel-wasm/src/keybindings.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"511815957d25d35d96a32a740e78ba089d68d35c907029b70acad9e7e1462fed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060conflicts_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-kernel-wasm/src/keybindings.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6b5af929f12080afe5f653909cf7bf0962f406f31e633a5337490e3f596ebc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060f64\u0060 turns every \u0060Err\u0060 into \u00600.0\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":"crates/vcad-parts/src/types.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f138b8ad5f24cc541bc5f64ee7eb73f302f9ab3d7bcea8623e750da6309604"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060i64\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":"crates/vcad-parts/src/types.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd0b802cb84e40ccb744d6a44c8cfd46c38dcafbd0f66e7e2dd38351c7546ba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060manifest_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\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":"crates/vcad-parts/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"db97663affa1aceccfd9efb694a2569bec20b08e5fd4254d249f0212bc4f9d0a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060DrawingView\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":"packages/app/src/components/DrawingView.tsx"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0e1779f0d7b503e0e0ecbe8293d1a6148f2a8bedf8f1d7ea5fa04d26299c69"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060useFieldBinding.validateExpression\u0060 swallows every exception into \u0060return \u0022parameters do not resolve (cycle?)\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":"packages/app/src/hooks/useFieldBinding.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5d41773301cf30239c9ebfa18ddcaee9c866ed88b2abd1ac1d84456ce95ab4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createDefaultCommandActions.canUndo\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":"packages/core/src/command-actions.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab545aaddd7761f3a57d10f66e4cff3379593b54f0faa3471b125308612ce8a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createDefaultCommandActions.canRedo\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":"packages/core/src/command-actions.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de099a71afae670f0ba686c105ba8b71997a209c7bd6b21d356264b5873c7c8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getSheetMetalMaterials\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":"packages/engine/src/sheet-metal.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"1237babad469df3cbea3a6ef2fd7baa67907c0e09fb97cc2f36d5d115655b6fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060debugString\u0060 swallows every exception into \u0060return \u0027Object\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":"packages/kernel-wasm/vcad_kernel_wasm.js"},"region":{"startLine":11453}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a00781483431ad3f6d098d2f81d00400b49c0fef0fbd016c80428ffe75f3f6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060sourceFingerprint\u0060 swallows every exception into \u0060return \u0022none\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":"packages/mcp/scripts/serve.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"79033f362e6a3ad5faf63f36a73fe3c0b4d708a500b0b0e4d86f94a4b9c2c2e5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060publicBaseUrl\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 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":"packages/mcp/src/tools/artifact-store.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"01640b9d4d9fa76c4672680186a354c644a618791880fb23b4c7b25aee16c6dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060documentHardware\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":"packages/mcp/src/tools/bom.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b6a671039fe11604e3973c496528532f6d9b419cf9427bc989d64e07defbdf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeVersion\u0060 swallows every exception into \u0060return \u00220.9.4\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":"www/src/hero-engine.js"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3779857ff50abc72abf1b28dee4374c978fc23ca51196b09ed14e7b5ffcef77"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060base.contains(\u0022TSOT-23\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060base.contains(\u0022TSOT-23\u0022)\u0060 also satisfies \u0060base.contains(\u0022SOT-23\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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf11f1039777c6df98b66b325f68c0d0b53b39214141a181824996ae7d46a3b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060base.contains(\u0022DHVQFN\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060base.contains(\u0022DHVQFN\u0022)\u0060 also satisfies \u0060base.contains(\u0022QFN\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":"crates/vcad-ecad-symbols/src/footprint.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"33332ee37a4d6e6527376b8af24e3d6fc40c290591a1f8560b48d11d524bd515"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060t.contains(\u0022uvia_\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060t.contains(\u0022uvia_\u0022)\u0060 also satisfies \u0060t.contains(\u0022via_\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":"crates/vcad-ecad-symbols/src/kicad_write.rs"},"region":{"startLine":3436}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0f24bb330c02fd1f0189800cc01f28d83ec46e6460acb0b0e194bb05b18b1a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022cylinder\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022cylinder\u0022)\u0060 also satisfies \u0060lower.contains(\u0022cyl\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":"crates/vcad-cli/src/ui/tree.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba0f637221c0911c773f2eb9533d3bdd2ff04f8c2759e100950e1c63d6b6033"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ref.hasPrefix(\u0022DB\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060ref.hasPrefix(\u0022DB\u0022)\u0060 also satisfies \u0060ref.hasPrefix(\u0022D\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":"apple/VcadApp/Sources/VcadApp/ElectronicsSchematicLayer.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfcb193616407d6883430f667ba826432c814502658d547dec49c00460e925b"}}],"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-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-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-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-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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.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-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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.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-346","guid":"07c355cb-45b6-d05e-8a2c-9f686bc45618","name":"Origin Validation Error","shortDescription":{"text":"Origin Validation Error"},"helpUri":"https://cwe.mitre.org/data/definitions/346.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-570","guid":"1c94c05a-8663-e95c-b750-8a0329b22647","name":"CWE-570","shortDescription":{"text":"CWE-570"},"helpUri":"https://cwe.mitre.org/data/definitions/570.html"},{"id":"CWE-571","guid":"c0fe8265-1b68-da53-9217-4ebb9a96d5f7","name":"CWE-571","shortDescription":{"text":"CWE-571"},"helpUri":"https://cwe.mitre.org/data/definitions/571.html"},{"id":"CWE-668","guid":"e2cb99db-6d24-b056-b0d0-885a733ec403","name":"Exposure of Resource to Wrong Sphere","shortDescription":{"text":"Exposure of Resource to Wrong Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/668.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"}]},{"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":"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-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-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":240,"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."]}]}