{"$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":"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"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":"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":"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":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"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":"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":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"NodeGraphMessageHandler::process_message (cyclomatic 442): NodeGraphMessageHandler::process_message has cyclomatic complexity 442 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ddc4901f8da6ef638069abbc96156e9c87fdf2dca13cf3c12fad6b264d11c"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentMessageHandler::process_message (cyclomatic 312): DocumentMessageHandler::process_message has cyclomatic complexity 312 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db1ca1c7c37e32072a59349b3c0d7de01dd2b4d844aa31a41930e51bd00b90e"}},{"ruleId":"D1","level":"warning","message":{"text":"PathToolFsmState::transition (cyclomatic 273): PathToolFsmState::transition has cyclomatic complexity 273 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3cc48962f08ffe2337d44c185bef8b17600c921d20147a12bbfb4708d48479"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::migrate_node (cyclomatic 258): graphite_editor::messages::portfolio::document_migration::migrate_node has cyclomatic complexity 258 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"47af47d9d18b44ef3b0c3c756a8f80d6853c255894375984bb8b34c1be579e21"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectToolFsmState::transition (cyclomatic 189): SelectToolFsmState::transition has cyclomatic complexity 189 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f2ec170892caf7817d5d4505c7704d62380710a4c2d1f9885aea038c7c2363"}},{"ruleId":"D1","level":"warning","message":{"text":"PortfolioMessageHandler::process_message (cyclomatic 171): PortfolioMessageHandler::process_message has cyclomatic complexity 171 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"649b59aecf35f07892e984f066d4136ac5a4e0f0c1358a2a79b67164d6070249"}},{"ruleId":"D1","level":"warning","message":{"text":"math_parser::constants::builtin_function (cyclomatic 151): math_parser::constants::builtin_function has cyclomatic complexity 151 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/constants.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f303d9d75727f1a6a59badaa891f018d5fddae5bda845e51b70292c3151240"}},{"ruleId":"D1","level":"warning","message":{"text":"GradientToolFsmState::transition (cyclomatic 136): GradientToolFsmState::transition has cyclomatic complexity 136 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9f6c95d36ea869d6b17a6007a149fbfe214fa3d0504cc79681980ba898987d"}},{"ruleId":"D1","level":"warning","message":{"text":"PenToolFsmState::transition (cyclomatic 134): PenToolFsmState::transition has cyclomatic complexity 134 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3066d88e9120d60228946e0c321ddfe2bb14cdd3a6307fdf6c1a57e51d1cd2"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::document_migration_upgrades (cyclomatic 106): graphite_editor::messages::portfolio::document_migration::document_migration_upgrades has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f975a3b802a1dcfaa8f3967498620042d0c3fbba6f501bb549596f36e0c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeToolFsmState::transition (cyclomatic 103): ShapeToolFsmState::transition has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ac23d2faac4bdf71066e7bec646548caac60d6fd1ff9fa5d524de9cc5cf756"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformLayerMessageHandler::process_message (cyclomatic 100): TransformLayerMessageHandler::process_message 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":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c0bb6e943e5481fb96aabba1e720e38bb81175170cbbf015e2f78f009356ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ClipboardMessageHandler::process_message (cyclomatic 93): ClipboardMessageHandler::process_message 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":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e343bc85aa5022683ab5b3cb67f3e80b3c6d166db3f5d16fa96b9d73385f82a3"}},{"ruleId":"D1","level":"warning","message":{"text":"node_macro::codegen::generate_node_code (cyclomatic 88): node_macro::codegen::generate_node_code has cyclomatic complexity 88 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e2fe73d1f441c096aa2073bf9db108c1d67eaa0db9a3b29a3aa6fec6375a12"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphOperationMessageHandler::process_message (cyclomatic 81): GraphOperationMessageHandler::process_message 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":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acc61ba71145cffa5450dfab219cbc2c065caec1821b2c8f99f994a52e0e94b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutMessageHandler::handle_widget_callback (cyclomatic 80): LayoutMessageHandler::handle_widget_callback has cyclomatic complexity 80 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a63478c35f941f07f6967b1c3d4dcfb630f972104905472e400968bbf64779"}},{"ruleId":"D1","level":"warning","message":{"text":"NavigationMessageHandler::process_message (cyclomatic 80): NavigationMessageHandler::process_message has cyclomatic complexity 80 (threshold 15). Of this number, 77 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":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d3940495fb191535ef2ed4c696a0e5b01d3ad63c2d4b5cbcf078a2c5170a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::vector_nodes::morph (cyclomatic 79): vector_nodes::vector_nodes::morph has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent 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 (vector_nodes::vector_nodes::morph::lerp_appearance) 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeb60bae4469efd89b818ff36cafca32dfe7406ce218a925a9c8a2ffaf7d89b"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceMessageHandler::process_message (cyclomatic 78): WorkspaceMessageHandler::process_message has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/workspace/workspace_message_handler.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6c88b4c6ef9b0ab8bed1ffc564d870d2ccb6b289fcdce294b9cc03eeac0e2c"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type (cyclomatic 72): graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type has cyclomatic complexity 72 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3832d46dea31002c905243eeea942f3648739d8d9b5dde32b7652a2f6f832d"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path (cyclomatic 72): graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/wires.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"add40a03c908e2f016c50d9d61e57fde7af962ffe83679456147eb341df3566f"}},{"ruleId":"D1","level":"warning","message":{"text":"TextToolFsmState::transition (cyclomatic 65): TextToolFsmState::transition 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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"582ae86dd2ec83b5fd61f0ddd847bc959d5af7be2541847cf22921fc93257cd7"}},{"ruleId":"D1","level":"warning","message":{"text":"rendering::renderer::render_vector_item_to_vello (cyclomatic 60): rendering::renderer::render_vector_item_to_vello has cyclomatic complexity 60 (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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad079b708413ab208f7b5ccb72da321771495eea175841632663c747d1c03d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"App::handle_desktop_frontend_message (cyclomatic 58): App::handle_desktop_frontend_message 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":"desktop/src/app.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad299788efe9adce88a08a456e3c204295862a1e26a419e7136b05ca924d8100"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolMessageHandler::handle_message (cyclomatic 52): ToolMessageHandler::handle_message 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":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"165649789939fec486b43abda4f65ba54f41ba26af88ca8664cb7bceb3320011"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next_token (cyclomatic 52): Lexer::next_token has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/lexer.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb61982a03a2137bcba42ef2040d48df0344f775981f86dfb03a043a161f91d"}},{"ruleId":"D1","level":"warning","message":{"text":"Replica::handle_packet (cyclomatic 49): Replica::handle_packet 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":"document/peer-transport/src/replica.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd991817a0dd11e03bc0950335d48761e087ccc3c6f7df6bda95bf644d6cd98b"}},{"ruleId":"D1","level":"warning","message":{"text":"Key::fmt (cyclomatic 49): Key::fmt 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":"editor/src/messages/input_mapper/utility_types/keyboard.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ea9b7ddecd5334ff3b56191d59cb516d9b88706841e9cb9c102ab6e9c07ea"}},{"ruleId":"D1","level":"warning","message":{"text":"InputState::process (cyclomatic 46): InputState::process has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/input.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad149fd590a74971969e6db8846806abd86abe91d5a8bc09f00cd113f28079"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtboardToolFsmState::transition (cyclomatic 45): ArtboardToolFsmState::transition 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":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"140503c6c09812052496712f479aee95faf3a647d2415ececb025d6e2636a45f"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeGraphExecutor::poll_node_graph_evaluation (cyclomatic 43): NodeGraphExecutor::poll_node_graph_evaluation 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":"editor/src/node_graph_executor.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a8382ba5ce31bac127b46f3ade15bbc6be4d93b70c34d9daaef6edd5e8e435"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher::handle_message (cyclomatic 42): Dispatcher::handle_message 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":"editor/src/dispatcher.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"243484a95ae524da84dca3b3d2eae2768d851eeed128bf2be1998e6b8c201f10"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_run::requirements::check (cyclomatic 42): cargo_run::requirements::check 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":"tools/cargo-run/src/requirements.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c6c51bafb213112ab7fd9b05177d29b04aa18b24e783e3678e0871d81e37e"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::flatten::chain_order (cyclomatic 41): vector_types::vector::flatten::chain_order 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":"node-graph/libraries/vector-types/src/vector/flatten.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7655e7525362720e819eb4d98906893c660a0ec12eb8cf225144a6851810e989"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::apply_op_with (cyclomatic 40): Document::apply_op_with 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":"document/graph-storage/src/document.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"de304666795821d837eb7c2c9e4aefdf058df58c5b0ba7eae75554fe6b99af7b"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorPickerMessageHandler::process_message (cyclomatic 39): ColorPickerMessageHandler::process_message 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":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed54b809f28d297318c317ab8572addafa8cc758275ece4ac1b1400845983b0"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncMessageHandler::process_message (cyclomatic 39): SyncMessageHandler::process_message 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":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80b86585db514402e49aaaababff4ad97a72fb45b2781048332de0a8b979316"}},{"ruleId":"D1","level":"warning","message":{"text":"math_parser::highlight::highlight (cyclomatic 39): math_parser::highlight::highlight 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":"libraries/math-parser/src/highlight.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ff698a222cbe23db62866141c019ae59b189be42fe2577d2b33f4bec6b6d06"}},{"ruleId":"D1","level":"warning","message":{"text":"SegmentModification::apply (cyclomatic 39): SegmentModification::apply 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0cbff79edadd9a7339daa77b2687de0bfa3fa7f4525ac711981287abe54f7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Graphic::collect_metadata (cyclomatic 38): Graphic::collect_metadata has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a147fe3d366db82421769723b1740c4b87e697832afaf5ef44e2353d84a319fc"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints (cyclomatic 37): graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9fffad15201c0c0d1762548a591a3d3059309863a01618d5637992b90b1a41"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::refine_cycle (cyclomatic 37): vector_types::vector::algorithms::concave_hull::refine_cycle 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0c414abb65d6b4a302f5486e40a2dab78480ae950758a2fe9e33e3514c14fb"}},{"ruleId":"D1","level":"warning","message":{"text":"text_nodes::json::parse_json_path (cyclomatic 37): text_nodes::json::parse_json_path 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":"node-graph/nodes/text/src/json.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34c0f850748983128b5890db141e1bdf9f698edeb773fe06cc863454c9e7f81"}},{"ruleId":"D1","level":"warning","message":{"text":"SplineToolFsmState::transition (cyclomatic 36): SplineToolFsmState::transition 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":"editor/src/messages/tool/tool_messages/spline_tool.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5fe73fd9e999bad4d43ddc8943c5b8d6eacf448c850b2885c735de6d50d996"}},{"ruleId":"D1","level":"warning","message":{"text":"PathToolData::mouse_down (cyclomatic 35): PathToolData::mouse_down 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"200bbc2dba853515c38a22b6a639e7ad910233f295141e5f8b9b3fea5017dd9d"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkingVector::reweave (cyclomatic 35): WorkingVector::reweave 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":"node-graph/libraries/vector-types/src/vector/flatten.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"607538f7a31b39409e46411ce31f421306e047a702ec7fd197b9b407bbd0c972"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::mirror (cyclomatic 34): NodeNetworkInterface::mirror 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":"editor/src/messages/portfolio/document/utility_types/network_interface/apply.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2878836ed527a19e48084ef2d5c73621e91c9a8b938a92d6ceb887de320ead"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::merge_qr_squares::merge_qr_squares (cyclomatic 34): vector_nodes::merge_qr_squares::merge_qr_squares 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":"node-graph/nodes/vector/src/merge_qr_squares.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c92c431a9d7242be4fd3ae5883a5450cb1433be3ecfa72be7ad3e88dddcd11"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorPickerMessageHandler::apply_gradient_update (cyclomatic 33): ColorPickerMessageHandler::apply_gradient_update 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":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"986562cbee8dd7376724b9202443a6e34c5e9a001a1a3735b82fbb017377fb24"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector (cyclomatic 33): graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector 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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37b189b2770e4ffd9c42b5b3e20ff1320969ba1bc83cff437f37b2658370bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"Vector::weld_flow_ends (cyclomatic 33): Vector::weld_flow_ends 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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c27cf4198a1c0714003ae8b762c1ab5bd1088e7fc773e14450cb7c6978a05c9"}},{"ruleId":"D1","level":"warning","message":{"text":"raster_nodes::std_nodes::noise_pattern (cyclomatic 33): raster_nodes::std_nodes::noise_pattern 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":"node-graph/nodes/raster/src/std_nodes.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf47d11f843ce8e29ffe7ae37f9a2a38e960eda6b64718eb9f6e0a2aa037883"}},{"ruleId":"D1","level":"warning","message":{"text":"input.shouldRedirectKeyboardEventToBackend (cyclomatic 33): input.shouldRedirectKeyboardEventToBackend has cyclomatic complexity 33 (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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf21b2b212c951a319bf68f247fa8d1ab0c58612fccd653eff8a5f7c3ec6d08b"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_desktop_ui::input::process (cyclomatic 32): graphite_desktop_ui::input::process has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/input.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"374d051c20793a8e88dc4b5f878c19b6da2ee91bc208e868e770020899ba8c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"Gdd::stream_entries (cyclomatic 32): Gdd::stream_entries 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":"document/format/src/export.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4d7767c32739a80820229adfc86f7145515984cba64d64142a87d687bcb29e"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::set_input (cyclomatic 32): NodeNetworkInterface::set_input 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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca42d16026b806bb46dd9c1a05afd53e8056defae8765d872c0bfbeaff26f37a"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeTool::process_message (cyclomatic 32): ShapeTool::process_message 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":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc382a5a3242dd7a9e933fad386295ae63145d8c5387c33df213c1093f35b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector (cyclomatic 32): graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70289628a9474b11365179de66c6b1b5a76a31e1e5bd602ad08bafaaf6fd7fd"}},{"ruleId":"D1","level":"warning","message":{"text":"graphene_cli::dump::print (cyclomatic 32): graphene_cli::dump::print 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":"node-graph/graphene-cli/src/dump.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a78438aac71a55bf4940b54e9bfab5569b6010c6895dd8446ab335e80da4a76"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::grid_topology::fewest_trails (cyclomatic 32): vector_nodes::grid_topology::fewest_trails has cyclomatic complexity 32 (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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c75ed5150b1331c9befcaac822e47e0e5f7804debbaa1687502e38a046c3c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::turtle::turtle_path (cyclomatic 32): vector_nodes::turtle::turtle_path has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/turtle.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"060af8e4e257459d6b599eae706ba76c50f293829dcad01f9ea03e07d4d3509a"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays (cyclomatic 31): graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays 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":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"63473085b99c1cb8c8d118ea9cdbee442d00bb798af4387bcda4dc7f0a95cae8"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueNode::eval_in (cyclomatic 31): ValueNode::eval_in 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":"libraries/math-parser/src/executer.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bd67041839adfc68d35a70ebae8eb385113844245a5b481fb012b83a16761b"}},{"ruleId":"D1","level":"warning","message":{"text":"membership.window.addEventListener(\u0022DOMContentLoaded\u0022)::update (cyclomatic 31): membership.window.addEventListener(\u0022DOMContentLoaded\u0022)::update 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. This shape REPEATS in the file: one other method here (membership.window.addEventListener(\u0022DOMContentLoaded\u0022)) 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":"website/static/js/page/membership.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"783cd3e950522dd6dc14713aa3394440c26736c0c30a90fe9597dd3398ad5eca"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeGraphMessageHandler::collate_inspector_sections (cyclomatic 30): NodeGraphMessageHandler::collate_inspector_sections 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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d67b2764fafd19cd61ff84256336db45e7955966e794a80afbd218fed09841"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::migrate_copy_to_points (cyclomatic 30): graphite_editor::messages::portfolio::document_migration::migrate_copy_to_points 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":4013}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf2bd6c33828b86cc1a97c0cf0f6bf7c18e1f46992471e08dd8f4b8fe00fe0f"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::load_stack_dependents_for_nodes (cyclomatic 29): NodeNetworkInterface::load_stack_dependents_for_nodes 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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd6231006c061a843a94419b4209fd658b500a7db6b5466ac3e7dc0b8761d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"GradientTool::process_message (cyclomatic 29): GradientTool::process_message 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58672cca0cce2c02163c9d292941ff4ca48e416dac8c381371298085538818a"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section (cyclomatic 29): graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"8639db659c02d8cb00db3ae9fe85ee9a9606c61737530d93955a34e140db0565"}},{"ruleId":"D1","level":"warning","message":{"text":"math_parser::completion::completions (cyclomatic 29): math_parser::completion::completions 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":"libraries/math-parser/src/completion.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f80bfebacc9ba67564ad593b34c90512273a335c7f425caabf1ddba06977855"}},{"ruleId":"D1","level":"warning","message":{"text":"rendering::renderer::render_vector_shape_svg (cyclomatic 29): rendering::renderer::render_vector_shape_svg 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded8f08ef8a7b9eac54f549ccb6ee711a0648c6a95fcbb8f72d8701840d5b2f8"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::trace_hull (cyclomatic 29): vector_types::vector::algorithms::concave_hull::trace_hull 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8da889cf9bc5c367a2e2983dc3e99298f4a3c5d3f3e51d4993b058a129d57c8"}},{"ruleId":"D1","level":"warning","message":{"text":"path_bool_nodes::flatten_vector (cyclomatic 29): path_bool_nodes::flatten_vector 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":"node-graph/nodes/path-bool/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f52569ea96b6f65b35ec685162dd472a72d0eae8412973049ed21df82fa06e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceMessageHandler::process_message (cyclomatic 28): ResourceMessageHandler::process_message has cyclomatic complexity 28 (threshold 15). Of this number, 27 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":"editor/src/messages/portfolio/document/resource/resource_message_handler.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bd1fadfef740a95adbee50c2d27e26dd888d1b9e17afc556e7a20961080820"}},{"ruleId":"D1","level":"warning","message":{"text":"IngestMessageHandler::process_message (cyclomatic 28): IngestMessageHandler::process_message has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/ingest/ingest_message_handler.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"883e355f471b72bb0afeb08236cb4a30be38e0d244e0bf0c4e869366b5c55805"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::convert_selected_manipulators_to_colinear_handles (cyclomatic 28): ShapeState::convert_selected_manipulators_to_colinear_handles 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a040730bd4d1e5af7906f1d09d30491e3a743e1ede28e022575bedcd1bd7d7a"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectedGradient::update_gradient (cyclomatic 28): SelectedGradient::update_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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"91da8509f2792d3d53f772ab68fc92b30ab247900e4594408a46eb4b05d00afd"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeFnAttributes::parse (cyclomatic 28): NodeFnAttributes::parse 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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0454d37d248168be1674f6ff3535434951bbd7a7e09dd56b4a2de75a5228f81b"}},{"ruleId":"D1","level":"warning","message":{"text":"App::window_event (cyclomatic 27): App::window_event 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":"desktop/src/app.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8a593d5648eb6ac7964b98370cf102c3501549d571324af6b401a4bc164144"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_desktop_ui::resources::load (cyclomatic 27): graphite_desktop_ui::resources::load 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":"desktop/ui/src/resources.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc76509c682f584d4d4dcf9ca7560afc1f7dde4f304c5bd2444ac9f11a028b7"}},{"ruleId":"D1","level":"warning","message":{"text":"DiffUpdate::apply_keyboard_shortcut (cyclomatic 27): DiffUpdate::apply_keyboard_shortcut has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 6 belong to 3 function items 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":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5a71d8e0c29b6dc9e7dbcc8b6c7e3b339a24209fcad04c77bb76e7d9c5fef8"}},{"ruleId":"D1","level":"warning","message":{"text":"PointRadiusHandle::overlays (cyclomatic 27): PointRadiusHandle::overlays 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"38854c5a265657b5479b2912a0fd1ddddbb95c6773cfd12c321e8f820b8e0ea0"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::emit_cycle (cyclomatic 27): vector_types::vector::algorithms::concave_hull::emit_cycle 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d36013c1471a8b99663ec92b72054cb8b96416f1482300446794f157fbe1af"}},{"ruleId":"D1","level":"warning","message":{"text":"document_graph_storage::prior::restore (cyclomatic 26): document_graph_storage::prior::restore 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":"document/graph-storage/src/prior.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf76940d76757e8b8549ffd0255c7ab66ac313b6499f31f88c58300d1bbaea7c"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryMessageHandler::process_message (cyclomatic 26): HistoryMessageHandler::process_message 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":"editor/src/messages/portfolio/history/history_message_handler.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60783b5b0dc2d684cbf6d349fa67df355190c1492ccf2edc1d9c60ac149d528"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions (cyclomatic 26): graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3739}}}],"partialFingerprints":{"codehealthFindingId/v1":"486c399fe76de690df7ec4ab0d87bb194a7e5f203faccda19e13046661376eba"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection (cyclomatic 26): graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection 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":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dd3a13c06290ce81a08221ac99659a67cb94ac8cc9cef52b2a65758465ba8c"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::shape_tool::update_dynamic_hints (cyclomatic 26): graphite_editor::messages::tool::tool_messages::shape_tool::update_dynamic_hints 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":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6c3adbc07a8e9d2fde322116779f8f96872868aded2c9586f19311ccaac32f"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetwork::flatten_with_fns (cyclomatic 26): NodeNetwork::flatten_with_fns 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":"node-graph/graph-craft/src/compiler/flatten.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf907d657175f0da902dfc086bf443784bcb2dbba56dcd12c5a5c4716c5e99a"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::solve_span (cyclomatic 26): vector_types::vector::algorithms::concave_hull::solve_span 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"be64febfdc0bbdcbb5e68c1de8316213cc764eb564d0635930bd63944b124484"}},{"ruleId":"D1","level":"warning","message":{"text":"node_macro::parsing::parse_field (cyclomatic 26): node_macro::parsing::parse_field 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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727b910c0c4b538b516737ac9ec39354b5bc2735f6103978dbfb9e59685ba16"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorSession::dispatch (cyclomatic 26): EditorSession::dispatch 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":"tools/web-editor-driver/src/session.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfab563c73692d607b09cd9700b9939f1bace056b6d8d731ba2e3dd7d9194daa"}},{"ruleId":"D1","level":"warning","message":{"text":"App::user_event (cyclomatic 25): App::user_event 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":"desktop/src/app.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f51fc263b2f74e0fd4bb15371972bdcd2b920ae554da9f37bc5d800f9001b6"}},{"ruleId":"D1","level":"warning","message":{"text":"DialogMessageHandler::process_message (cyclomatic 25): DialogMessageHandler::process_message 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":"editor/src/messages/dialog/dialog_message_handler.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"caecd37870cc533c9e1ff39f695fc88557fa21a308b0ebf57ad1b092d3f7e166"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::move_layer_to_stack (cyclomatic 25): NodeNetworkInterface::move_layer_to_stack 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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0a3d375fd442c004c0cfca9ff41fb5d01b6089998499411f9d84c0d3638a4"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::delete_selected_points (cyclomatic 25): ShapeState::delete_selected_points 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd18469b488624a603498c4e9dd77531ab43e474a19e4e399ebd7dfded2e4ea"}},{"ruleId":"D1","level":"warning","message":{"text":"snapping::solve::resolve_freely (cyclomatic 25): snapping::solve::resolve_freely 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":"libraries/snapping/src/solve.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e01c01932bc9a322b1328df1b49e9d185b24beb00045e896d92f1ba541be2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"graphic_types::graphic::flatten_graphic_list::flatten_recursive (cyclomatic 25): graphic_types::graphic::flatten_graphic_list::flatten_recursive 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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"92563877ad1c56d6c9c87aaa10a947dd7c3b2d0d9c0d4bb9b17850101b348402"}},{"ruleId":"D1","level":"warning","message":{"text":"Vector::unweld (cyclomatic 25): Vector::unweld 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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7715f7501b917694edd111313fbc398ee525fcfebf8c34da04ca155ba726c4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"InputPreprocessorMessageHandler::process_message (cyclomatic 24): InputPreprocessorMessageHandler::process_message 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":"editor/src/messages/input_preprocessor/input_preprocessor_message_handler.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"543a44095f70c81e8f15dd200575a341bc95e18ce8b1f870a91922580027c7f9"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncMessageHandler::poll_document (cyclomatic 24): SyncMessageHandler::poll_document 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":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cc4ddb837baff422fb04b84f57866f91a181c1a0d8785f73277b777aabb6e6"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundingBoxManager::check_selected_edges (cyclomatic 24): BoundingBoxManager::check_selected_edges 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":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d304bb74cdae95f7df5067d7c582fb4a256d047f07b3381f2dd46c78d71a889"}},{"ruleId":"D1","level":"warning","message":{"text":"TextTool::process_message (cyclomatic 24): TextTool::process_message 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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e954a75af62e4e5a5014044e7e4dfa620185af7660461ab0bf5c2107af33e74d"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments (cyclomatic 24): graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"84912dc257d5adc5ee6ccbcd37a1f4ffece4fe3eaee41af26d72a26e6168788d"}},{"ruleId":"D1","level":"warning","message":{"text":"Graphic::is_guaranteed_fully_transparent (cyclomatic 24): Graphic::is_guaranteed_fully_transparent 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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7d7550af84c33ab7271815b987f1d69420c404d16c2db165b51c6a7d38ba29"}},{"ruleId":"D1","level":"warning","message":{"text":"graphene_std::render_cache::render_output_cache (cyclomatic 24): graphene_std::render_cache::render_output_cache 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":"node-graph/nodes/gstd/src/render_cache.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14a99497c38131917b8878b920b654cd56e7d93a2f9ff0f6487ab38994004f1"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_proc_macros::editor_commands::editor_commands_impl (cyclomatic 24): graphite_proc_macros::editor_commands::editor_commands_impl 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":"proc-macros/src/editor_commands.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b58030fdfbc31c507a652d8b2cbdbe71f17889a17f45773f0e774e49adf3c25"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutMessageHandler::process_message (cyclomatic 23): LayoutMessageHandler::process_message 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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdce0b6f099c097e3065155f14d5d2830f5341aace5a33e1067528db48ef9ea"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorDelta::construct (cyclomatic 23): EditorDelta::construct 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":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77dbc757cc5dec1f29ab498fd54691eee89cd48cb30711250b8b796f39c4f4"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::delete_nodes_leaving_dots (cyclomatic 23): NodeNetworkInterface::delete_nodes_leaving_dots 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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e30d3c5c058ca2125d8da613e5039e6c19a54343d1ecbbc506f7844e8b7a1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"PathToolData::drag (cyclomatic 23): PathToolData::drag 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"98394d886a2e6bb9dccfed0afc3d9fd97db89622bdc2691ac5fa2f75d2a3ce99"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays (cyclomatic 23): graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays 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":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"162494240afa4f1cf1736992ea8b895502e9a6cf80f528b326245f0913b56763"}},{"ruleId":"D1","level":"warning","message":{"text":"MatrixNode::eval_in (cyclomatic 23): MatrixNode::eval_in 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":"libraries/math-parser/src/executer.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fa8a832b7f1eb199243df1c020d3f2389ab2c9ee1935310d60bcf5ebcc3a86"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::offset_bezpath::offset_bezpath (cyclomatic 23): vector_types::vector::algorithms::offset_bezpath::offset_bezpath 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":"node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd05d28ed9a2a717c258f1448b7a189e7e917c17fc566a7c7805f4461b8bece7"}},{"ruleId":"D1","level":"warning","message":{"text":"membership.window.addEventListener(\u0022DOMContentLoaded\u0022) (cyclomatic 23): membership.window.addEventListener(\u0022DOMContentLoaded\u0022) has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 87, commit, a function literal at line 136, \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":"website/static/js/page/membership.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa62f4106712ff4d367ba08908b6264dfe6072d07376f573c6f8bd1b0c06c01"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::move_selected_points_and_segments (cyclomatic 22): ShapeState::move_selected_points_and_segments 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac36e76aad509f050ce1c2afe12f16eb1349ed7199d872114a74c27284cd151"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::get_inside_points_and_segments (cyclomatic 22): ShapeState::get_inside_points_and_segments 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08c97e6958fbb97ffa7d42261fd017a88072f8e248299abb5174165fd1e5f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector (cyclomatic 22): graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"37909cb6fef010286a70b88943f9427a59bbfef9da9eeeb2ace28a28f49d2b43"}},{"ruleId":"D1","level":"warning","message":{"text":"Curve::subdivision_intersections (cyclomatic 22): Curve::subdivision_intersections 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":"libraries/snapping/src/curve.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85958e92eaf56c2a7f3c693d869e2c3b11ad75d2a4ec625df2d9e0cd976d9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"node_macro::codegen::generate_register_node_impl (cyclomatic 22): node_macro::codegen::generate_register_node_impl 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":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3423df0173b08bcdeb8016c19141317745fe114f839b78cc61f148182b9f8b4"}},{"ruleId":"D1","level":"warning","message":{"text":"raster_nodes::adjustments::selective_color (cyclomatic 22): raster_nodes::adjustments::selective_color 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":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f2c7d8a5258c5cd6f0d01a9849d26288c846a7574fb2fcb775c164f4c2cfc5"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::vector_nodes::smooth_anchors (cyclomatic 22): vector_nodes::vector_nodes::smooth_anchors 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aba38f73a92436f84fc759be89a7cd31bccc0bbf96f356ddc67a4b35c1d5f16"}},{"ruleId":"D1","level":"warning","message":{"text":"document_graph_storage::delta::compute_deltas (cyclomatic 21): document_graph_storage::delta::compute_deltas has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/delta.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8927555a61165b6b4dce553a49671ecc763efb4230ad6ab5821474fa9410b41"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectTool::process_message (cyclomatic 21): SelectTool::process_message 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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab673bc0f011a71cf0d1927d1c6ccef0d887ba58e60c01f88b25bd62a472119"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector (cyclomatic 21): graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec60f846067e662a2cdb6da28c7903137ab756d82a8d62ab0aaa24be10b7403"}},{"ruleId":"D1","level":"warning","message":{"text":"TypingContext::infer (cyclomatic 21): TypingContext::infer 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":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78635f8c9c22549533755f51912684bbb9660395ebea95a364e9909b6b3cf9d"}},{"ruleId":"D1","level":"warning","message":{"text":"graph_craft::document::value::deserialize_tagged_value_with_legacy_migration (cyclomatic 21): graph_craft::document::value::deserialize_tagged_value_with_legacy_migration 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":"node-graph/graph-craft/src/document/value.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"b311078877ace7e90177babf1a2ff13d379c3e8b2e55d20fa0a8a48141066e3a"}},{"ruleId":"D1","level":"warning","message":{"text":"Graphic::is_guaranteed_fully_opaque (cyclomatic 21): Graphic::is_guaranteed_fully_opaque 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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa7435bd3158d5798022dad7152893a54eaf5ae0670b748c26414272d6fb990"}},{"ruleId":"D1","level":"warning","message":{"text":"Lut::apply (cyclomatic 21): Lut::apply has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/color_lookup_table.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7869ff14156767b0d7dd3d607a99238be9d1f6ce7d569bdadfc7f5ad533258"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_run::run_task (cyclomatic 21): cargo_run::run_task 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":"tools/cargo-run/src/main.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17b90d11fed80a55211bea2c61b51cf28c052c3f535a320f7b3ad21c985d4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_message_tree::write_tree_txt_node (cyclomatic 21): editor_message_tree::write_tree_txt_node has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/editor-message-tree/src/main.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba90082b8d0bccf8337e5a476c9971d6fb5e84c278d2c452356c97bd25d9f07"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown.parseMarkdown (cyclomatic 21): markdown.parseMarkdown 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":"frontend/src/utility-functions/markdown.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd1beb088cd198681d4d324e1c0b92dd7522c5f9e843e86557363a044149f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_desktop::start (cyclomatic 20): graphite_desktop::start 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":"desktop/src/lib.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7575a1e7017f9c35289c42d0a53aa55887f791be35f78aef7a3c197a039ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::follow (cyclomatic 20): Session::follow 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":"document/graph-storage/src/session.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d7bcb5889069d8078a8684170e13ef1946a6eabff363d286df569f39110313"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapSession::snap_features (cyclomatic 20): SnapSession::snap_features 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":"editor/src/messages/tool/common_functionality/snap_session.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c75252f48e2f3aedda5fcce33fd8ea83cf3722dff436902abbc1ccbd903a70b"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectedEdges::snap_stretch (cyclomatic 20): SelectedEdges::snap_stretch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d471e142b35ac226faf43ef8b356c04242d2ef9ad1bb14ba4b25a09a1f7b8a28"}},{"ruleId":"D1","level":"warning","message":{"text":"PenToolData::drag_handle (cyclomatic 20): PenToolData::drag_handle 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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"191b50d0f4ef04ce6171ac9cacbaf53e201c1488b9d3e8d55cb8204f178976dc"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath (cyclomatic 20): graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath 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":"editor/src/messages/portfolio/document/utility_types/wires.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"809183a82b69d4c7df876b1af292bfd9121ebe217ab90f5e244762106bfe47a8"}},{"ruleId":"D1","level":"warning","message":{"text":"snapping::constructions::find_constructions (cyclomatic 20): snapping::constructions::find_constructions 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":"libraries/snapping/src/constructions.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f50ee13af9190b1de6e8a49959e2dd9f71f8315579b519d7c414203e89002af"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorModification::chain_legacy_segments (cyclomatic 20): VectorModification::chain_legacy_segments 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"087f653ffbeb94a533dbb25dfbf1f16123628278940955cd476fc7224f1cc935"}},{"ruleId":"D1","level":"warning","message":{"text":"Vector::normalize_winding_directions (cyclomatic 20): Vector::normalize_winding_directions 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"62805d2b8e7095cdaf3864d4e36fb5121fdffb25b657f61b47e9e18164299b63"}},{"ruleId":"D1","level":"warning","message":{"text":"text_nodes::format_number (cyclomatic 20): text_nodes::format_number 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":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdacdb5329af3d7c3128fc0a9861bb2bcc62723755e4e1d9fb7bfd41ff484e5"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::grid_topology::pair_odd_points (cyclomatic 20): vector_nodes::grid_topology::pair_odd_points 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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb2395935741068e75eabe3add0fc2dcfcba84015db43312aec4f4666c08613"}},{"ruleId":"D1","level":"warning","message":{"text":"input.tabBetweenTextFields (cyclomatic 20): input.tabBetweenTextFields has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5b3ba613b5191031e46596ed008a2963abc6da43a13079ea6edddc4a8a8650"}},{"ruleId":"D1","level":"warning","message":{"text":"keyboard-entry.getLocalizedScanCode (cyclomatic 20): keyboard-entry.getLocalizedScanCode 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":"frontend/src/utility-functions/keyboard-entry.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b6a179d2ac1454ced441df85c1559984eba27f13094b9c6ed11fbb2475e469"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::load_structure (cyclomatic 19): NodeNetworkInterface::load_structure 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":"editor/src/messages/portfolio/document/utility_types/network_interface/structure.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"18979951749b21b8cde5ee7d2880c34333eb3ba15b2e138bb77ca8a0dcc734dd"}},{"ruleId":"D1","level":"warning","message":{"text":"PointRadiusHandle::handle_actions (cyclomatic 19): PointRadiusHandle::handle_actions 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40b8e34d66cd81fbd7ca50eb851e622fa3a2f697f93f35f18df49cc5f971d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::convert_manipulator_handles_to_colinear (cyclomatic 19): ShapeState::convert_manipulator_handles_to_colinear 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4659bb8396bc975a18f8af8b9a57a1f4fde4044cae96a681057fc4b7195818"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options (cyclomatic 19): graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options 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":"editor/src/messages/tool/common_functionality/color_selector.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7d102b4d2a44c70d04e9c6fd9e249cec756723de6d1172430a878865695833"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::measure::measurement_marks (cyclomatic 19): graphite_editor::messages::tool::common_functionality::measure::measurement_marks has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/measure.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8944810f6d5c470b70882c2024d9ce6e27da7279069d9f0e7f1a5b2b53af3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::lex_number (cyclomatic 19): Lexer::lex_number 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. This is NOT this file\u0027s highest cyclomatic complexity: Token::fmt (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/lexer.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4693194e64dec4692f278596749b2474871b96e92fd746af60cdeae47ceb85f"}},{"ruleId":"D1","level":"warning","message":{"text":"Sorter::sort (cyclomatic 19): Sorter::sort has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/sort.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"46edac0b6dd65bdd4bd3454025b65a84640ef300061fa04a883487dddcfeb5bb"}},{"ruleId":"D1","level":"warning","message":{"text":"snapping::find::find_near_probe (cyclomatic 19): snapping::find::find_near_probe 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":"libraries/snapping/src/find.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eef5e4022ab8e57f51325f691c0578855b47b08701f191bc596b0ea94cd49dd"}},{"ruleId":"D1","level":"warning","message":{"text":"rendering::vello_scene_builder::finite_path (cyclomatic 19): rendering::vello_scene_builder::finite_path has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/vello_scene_builder.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"154d8fa5d867089531fc850067370a48601d66c773520f0bbbdd6fd3508b93e7"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::convex_hull::refine_transitions (cyclomatic 19): vector_types::vector::algorithms::convex_hull::refine_transitions 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":"node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4800dc5450cd53996eb93d52261f8581c3c5f74e78664c90ac840f52c716eb85"}},{"ruleId":"D1","level":"warning","message":{"text":"node_macro::destructure::derive_destructure_impl (cyclomatic 19): node_macro::destructure::derive_destructure_impl has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/destructure.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"059c3816182296cee1d0de03503f8e31a76b8feabb79e60b13b407d22273341c"}},{"ruleId":"D1","level":"warning","message":{"text":"text_nodes::string_capitalization (cyclomatic 19): text_nodes::string_capitalization has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5f361fd1500b36eac7ff2042932884a1719b8a07adab9a7e2fe19ff7d852d6"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::vector_nodes::decimate (cyclomatic 19): vector_nodes::vector_nodes::decimate has cyclomatic complexity 19 (threshold 15). Of this number, 11 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae51465ad6b6f6e6dac4a423a2f2d8c5720bb46ba02e8ea4317e1eb38d17970"}},{"ruleId":"D1","level":"warning","message":{"text":"navbar.setRipples (cyclomatic 19): navbar.setRipples has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/static/js/navbar.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"838a421d4ead3217a2603c85dbccf20a8861a3941a94154afc8fe3c9f2c5a1ab"}},{"ruleId":"D1","level":"warning","message":{"text":"membership.window.addEventListener(\u0022DOMContentLoaded\u0022) (cyclomatic 19): membership.window.addEventListener(\u0022DOMContentLoaded\u0022) has cyclomatic complexity 19 (threshold 15). Of this number, 14 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":"website/static/js/page/membership.js"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1072a3bc253f6a05c8a353840f2174ba64c3f5b725ee1a0e96ab09f54153e3"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderState::render (cyclomatic 18): RenderState::render 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":"desktop/src/render/state.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"238070c4cd4ff6bb169870f219b048d2f8b833fc87c00650ff72841ccc806950"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspacePanelLayout::restore_panel_to_default_position (cyclomatic 18): WorkspacePanelLayout::restore_panel_to_default_position 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":"editor/src/messages/portfolio/utility_types.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d04e9f2bfbae85cd1b96e9de09388323138a36c63f2417aded4997b0320c09"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectedEdges::new_size (cyclomatic 18): SelectedEdges::new_size 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":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a571ae5caf11c907795192a723b442c3da0e7b37d0e1bc95f9680a55a7b1f52"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::network_interface::editor_delta::stage_conversion (cyclomatic 18): graphite_editor::messages::portfolio::document::utility_types::network_interface::editor_delta::stage_conversion 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":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8079bd211e61f43b18ff86c7922101e90c1d60796c094e92ecc4d66ba67bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"Gradient::interpolated_samples (cyclomatic 18): Gradient::interpolated_samples has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (linear_samples, subdivide). 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":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"709bf43b8fb7f0aa1712b763601fcc9030d728f51453d464a4c80aea1d6fba88"}},{"ruleId":"D1","level":"warning","message":{"text":"node_macro::validation::ranked_input_violations (cyclomatic 18): node_macro::validation::ranked_input_violations 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":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6361f272ac9944aa38896998e7b1b0cff178e9d6a1029b438f112b0e3ba4de45"}},{"ruleId":"D1","level":"warning","message":{"text":"Lattice::loop_route (cyclomatic 18): Lattice::loop_route 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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e904ea234016f708595042e16a000198b3cf4c48ad648d0f53b60c89047d67d"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::vector_nodes::round_subpath_corners (cyclomatic 18): vector_nodes::vector_nodes::round_subpath_corners 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de2a6d9f66c947997082122970dd5f84778760cab16822e3ef64224f4773de2"}},{"ruleId":"D1","level":"warning","message":{"text":"Preprocessor::new (cyclomatic 18): Preprocessor::new has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/preprocessor/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"555acd71114db632e54bd7858e55a09482ebebdc30f29e45b88e324b9e628a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_proc_macros::helpers::clean_rust_type_syntax (cyclomatic 18): graphite_proc_macros::helpers::clean_rust_type_syntax 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":"proc-macros/src/helpers.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2e59a2cfe73b38a10ff535025901a4bc3c816fe07d0661a91aa4f608cc3705"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_message_tree::write_tree_html_node (cyclomatic 18): editor_message_tree::write_tree_html_node 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":"tools/editor-message-tree/src/main.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc5558c4bf4cf181e50d7a8bbfe115a72eb1d58c5c356cf482bfb70ec3b23da"}},{"ruleId":"D1","level":"warning","message":{"text":"clipboard.readAtCaret (cyclomatic 18): clipboard.readAtCaret 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":"frontend/src/utility-functions/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d377c3c227fc64676dcd6c5761e8abc67aa105dae30ca61c6987301700e71a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Gdd::open_stored (cyclomatic 17): Gdd::open_stored 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":"document/format/src/lib.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2e72b96171f527da90124a78e2ef5b6b869d0c30ee835ce3752e574aa0100b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimationMessageHandler::process_message (cyclomatic 17): AnimationMessageHandler::process_message 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":"editor/src/messages/animation/animation_message_handler.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fa2af405be2f05fd8666c4a6dd2d212c49535ea7d9b92354557d46b5022aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::set_to_node_or_layer (cyclomatic 17): NodeNetworkInterface::set_to_node_or_layer 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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dfc5def47b68c39f331263d285386793a450ee398a938f5f4abe63e4b301eb"}},{"ruleId":"D1","level":"warning","message":{"text":"PreferencesMessageHandler::process_message (cyclomatic 17): PreferencesMessageHandler::process_message 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":"editor/src/messages/preferences/preferences_message_handler.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f521a7b507d5b40d96f69435b033bcc8ecfd9829a892b0de9d266679b4bb41"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::select_connected (cyclomatic 17): ShapeState::select_connected 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1796afc29585c50688ed609ae268037a77fb4ab9a6d493e3c9402d6bf8f80c"}},{"ruleId":"D1","level":"warning","message":{"text":"BrushToolFsmState::transition (cyclomatic 17): BrushToolFsmState::transition 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":"editor/src/messages/tool/tool_messages/brush_tool.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"890dcf85824665b33ff8e2f86d293734df1d5df6af9934f755096df87692cfad"}},{"ruleId":"D1","level":"warning","message":{"text":"FillToolFsmState::transition (cyclomatic 17): FillToolFsmState::transition 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":"editor/src/messages/tool/tool_messages/fill_tool.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4d29d86a653bcb682fe2d100420fa91e7c47ec84c4cb6feb1954e53a0b736d"}},{"ruleId":"D1","level":"warning","message":{"text":"FreehandToolFsmState::transition (cyclomatic 17): FreehandToolFsmState::transition 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":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c9690e4358eb514df51b7ea9410f41c3666ce06a10210d8da230dd2fb689fc"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::data_panel::data_panel_message_handler::context_widgets (cyclomatic 17): graphite_editor::messages::portfolio::document::data_panel::data_panel_message_handler::context_widgets 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":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1cdc7053f307ed896c0b7b586cf8c13e258e33cd6f357418b6c190dc53a987"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::utility_functions::fit_handles_to_segment_pair (cyclomatic 17): graphite_editor::messages::tool::common_functionality::utility_functions::fit_handles_to_segment_pair 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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c827b225ebb6859cab174c70d152046b1db08ec7697857947d140b5f53f323"}},{"ruleId":"D1","level":"warning","message":{"text":"math_parser::documentation::matrix_literal_tooltip (cyclomatic 17): math_parser::documentation::matrix_literal_tooltip has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Operator::doc (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/documentation.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce1dc341420159c95ab7f95fd6b9f8404d3d03403d1015cad5c1d6eeb903ca2"}},{"ruleId":"D1","level":"warning","message":{"text":"snapping::solve::solve (cyclomatic 17): snapping::solve::solve 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":"libraries/snapping/src/solve.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"02211e82f8419fea5b83521b6205b6078f7bb51d76fe800df27e0127ee2734f2"}},{"ruleId":"D1","level":"warning","message":{"text":"PointModification::apply (cyclomatic 17): PointModification::apply 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"12059772cf5c421254f432dc203a2697cce8528271bca1e5398a3b359a312af8"}},{"ruleId":"D1","level":"warning","message":{"text":"Vector::anchor_tangents (cyclomatic 17): Vector::anchor_tangents 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8174aa96e8d43f0b747b4886f70f690279d6919ac8726472af4a4ef6b4b26653"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::contour::contours_with (cyclomatic 17): vector_types::vector::contour::contours_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":"node-graph/libraries/vector-types/src/vector/contour.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace8de05d08f82d202509ecf5c550ff64730396842daeb7649de5e452813bf2d"}},{"ruleId":"D1","level":"warning","message":{"text":"Lattice::spiral (cyclomatic 17): Lattice::spiral 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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cd6daf1895c9f1be81ca125c5c311982c89f94d3bdd4e6db82d6aceb28c68b"}},{"ruleId":"D1","level":"warning","message":{"text":"input.onPotentialDoubleClick (cyclomatic 17): input.onPotentialDoubleClick 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f163d0249af04e2370d979a023c147a3725b9f2924bdc737399bd8a64953966"}},{"ruleId":"D1","level":"warning","message":{"text":"navbar.initializeRipples (cyclomatic 17): navbar.initializeRipples has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 69, 87, 83). 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":"website/static/js/navbar.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f83ef1ccf24944455a3064e5c25af09562c8ec56dc9ce680fe95918a24ab0e"}},{"ruleId":"D1","level":"warning","message":{"text":"bisect-tool.document.addEventListener(\u0022DOMContentLoaded\u0022)::presentCommit (cyclomatic 17): bisect-tool.document.addEventListener(\u0022DOMContentLoaded\u0022)::presentCommit 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":"website/static/js/page/contributor-guide/bisect-tool.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e139ab427ff1a52bf2f93189e9cf5707a32fa4f5d37048c5f5d2bb6c8bf725"}},{"ruleId":"D1","level":"warning","message":{"text":"membership.window.addEventListener(\u0022DOMContentLoaded\u0022) (cyclomatic 17): membership.window.addEventListener(\u0022DOMContentLoaded\u0022) 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. This shape REPEATS in the file: one other method here (membership.window.addEventListener(\u0022DOMContentLoaded\u0022)::update) 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":"website/static/js/page/membership.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1d986cd81d97c03c6f3cfa65ec41ccda5cd2d3479e9edfc0e6a90a139508d3"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyboardHandlerImpl::on_key_event (cyclomatic 16): KeyboardHandlerImpl::on_key_event 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":"desktop/ui/src/internal/keyboard_handler.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a80ddfaddd2958dffd35cd85fbbd2075bf8fa5efd547e74198e977938668ba"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_desktop_ui::remote::spawn::spawn_host (cyclomatic 16): graphite_desktop_ui::remote::spawn::spawn_host 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":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9a4feea83b10b62f940673de35ad4849a7cb80db75bc74f6292372f2aa4b85"}},{"ruleId":"D1","level":"warning","message":{"text":"migration_runner::node::upstream_most (cyclomatic 16): migration_runner::node::upstream_most 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":"document/migrations/runner/src/node.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af722941aa04c6d0a68da80b66718c414f89299b5e390571f112c1eccd7f33e"}},{"ruleId":"D1","level":"warning","message":{"text":"migration_runner::node::apply_runs (cyclomatic 16): migration_runner::node::apply_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":"document/migrations/runner/src/node.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"debdd60192fb0f9f25f3e9eb9436ebac67fe7f314d6f48c7cc574d4ed7237738"}},{"ruleId":"D1","level":"warning","message":{"text":"migration_runner::node::rewrite_history (cyclomatic 16): migration_runner::node::rewrite_history 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":"document/migrations/runner/src/node.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"acebfbf0f5fd58de44f26747de2660ac181bdc896f520ded78126ac0e2643acf"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentMessageHandler::selected_layers_reverse (cyclomatic 16): DocumentMessageHandler::selected_layers_reverse 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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"260d212d75628a599c73a8e71833d4cb02452f8e5d5b1e86fb54b4bc389a12b1"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeNetworkInterface::compute_node_click_targets (cyclomatic 16): NodeNetworkInterface::compute_node_click_targets 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":"editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a152efeac965db552ec03f540eeb5da22922e64428e59e0bb84c1dc5a4c7536"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformOperation::hints (cyclomatic 16): TransformOperation::hints 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":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aefbb100163d9408e2f07fa7776e68ea91a9fb69b18d9d4a8af6967c2b3365c"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::alternate_selected_handles (cyclomatic 16): ShapeState::alternate_selected_handles 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"b551ec60043b50f264b5245bc5a06a02ef80c23c2a8b7bec6e657323ece20e77"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeState::select_all_in_shape (cyclomatic 16): ShapeState::select_all_in_shape 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb398ac3d60c5f5499db1c33e3cffa0091e396d0c8e2ebe24876e32901a8a59"}},{"ruleId":"D1","level":"warning","message":{"text":"BrushTool::process_message (cyclomatic 16): BrushTool::process_message 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":"editor/src/messages/tool/tool_messages/brush_tool.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb968906fa669d9b92c1a7affb983ae01e2237f6a533c7ce66a2e48404da35e"}},{"ruleId":"D1","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays (cyclomatic 16): graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays 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":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee0b9104c59ea856b61653d008097b28465721b82db99e49cdd1c7357969a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Sorter::call (cyclomatic 16): Sorter::call has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/sort.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40c79a39f1b24a6d917b9c0a66f470afbb2be65a281d605368e0567355896bd"}},{"ruleId":"D1","level":"warning","message":{"text":"math_parser::lexer::classify_bars (cyclomatic 16): math_parser::lexer::classify_bars has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Token::fmt (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/lexer.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35a31cc25246879fdfdef1ca6c979ef645b52a37b391a25b05a4a337d983ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"graph_craft::application_io::http::send (cyclomatic 16): graph_craft::application_io::http::send 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":"node-graph/graph-craft/src/application_io/http.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4a63abc8e06cb5114bb618df222a9537590617fc3a882687584eea9b8774e6"}},{"ruleId":"D1","level":"warning","message":{"text":"graphene_cli::main (cyclomatic 16): graphene_cli::main 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":"node-graph/graphene-cli/src/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"821009082324067902ec8f5bdba818690cc3d25bdfecfc663f068669df043cce"}},{"ruleId":"D1","level":"warning","message":{"text":"rendering::renderer::render_graphic_item_to_vello (cyclomatic 16): rendering::renderer::render_graphic_item_to_vello 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"852595a7c047360147240923c9012834378e7e1f823a554ef734354c3e258f57"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorModification::modify (cyclomatic 16): VectorModification::modify 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc82c7dbe08037c75557cc227b21920a979e95ac5af2995b09c67d920b7b526"}},{"ruleId":"D1","level":"warning","message":{"text":"Vector::weld_connected (cyclomatic 16): Vector::weld_connected 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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0e54102e257cff6eec64ce05ae09367847eebbaae551f16375576624f5a0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::end_candidates (cyclomatic 16): vector_types::vector::algorithms::concave_hull::end_candidates 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad14b6a8ca847f6694d4f609f03ee8a0e7a0abe6c39bf9be79ef2331a81d828e"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_types::vector::algorithms::weld::weld_nearby_points (cyclomatic 16): vector_types::vector::algorithms::weld::weld_nearby_points 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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a29ac987f19ea2946a6f88fbb938645b31b2483622d56cbe2c7797e4802ed21"}},{"ruleId":"D1","level":"warning","message":{"text":"node_macro::validation::validate_no_item_parameters (cyclomatic 16): node_macro::validation::validate_no_item_parameters 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":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35a84c4ba23f9b8c9054e3616fa70812c1e7b04688955d8325964dcc6af10bd"}},{"ruleId":"D1","level":"warning","message":{"text":"brush_nodes::basic_brush::render::render (cyclomatic 16): brush_nodes::basic_brush::render::render 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":"node-graph/nodes/brush/src/basic_brush/render.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcfddeb94dc561db6eaae1d870d0cd3c88e20a4e5daa27b27490a57652a0316"}},{"ruleId":"D1","level":"warning","message":{"text":"raster_nodes::color_lookup_table::format_3dl::parse (cyclomatic 16): raster_nodes::color_lookup_table::format_3dl::parse 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":"node-graph/nodes/raster/src/color_lookup_table/format_3dl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c3276f35c6516ebe2cb3a2580cc3dedf86db4c38fc852c6a949c5f57fbc753"}},{"ruleId":"D1","level":"warning","message":{"text":"raster_nodes::color_lookup_table::format_csp::parse (cyclomatic 16): raster_nodes::color_lookup_table::format_csp::parse 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":"node-graph/nodes/raster/src/color_lookup_table/format_csp.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4573ecf47d5b2f8ddbbfe4c7e9ccaf18c10dc38775de3f01d4d14d680abbac"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::vector_nodes::fill (cyclomatic 16): vector_nodes::vector_nodes::fill 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5858ffea8d94e99812520dcf6c724ad8eb9eccf488ab270941539cde66f355"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::vector_nodes::morph::lerp_appearance (cyclomatic 16): vector_nodes::vector_nodes::morph::lerp_appearance has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (vector_nodes::vector_nodes::morph) 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3038}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc808d3898d1eb6529fc5cda1fed44bf163a2e092907f995c02b4a6e92401776"}},{"ruleId":"D1","level":"warning","message":{"text":"vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments (cyclomatic 16): vector_nodes::vector_nodes::bevel_algorithm::update_existing_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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3677}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9cfc416e3c864f0f82c575ae07ffa2aa080e71967f5e9415559c79e89af676"}},{"ruleId":"D1","level":"warning","message":{"text":"persistence.migrateToNewFormat (cyclomatic 16): persistence.migrateToNewFormat has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 174). 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":"frontend/src/utility-functions/persistence.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ad88289cebd0f7dcd36a670482f5182cfff7dcc264084c7320482b1d949dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"membership.colorPopover (cyclomatic 16): membership.colorPopover has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 946, 900, 913, \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":"website/static/js/page/membership.js"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"817e3c3b9d4572c361a841a9b6cff8144af97594d0f2ecf2f51495ed954643c7"}},{"ruleId":"D1","level":"warning","message":{"text":"book.trackScrollHeadingInTOC::updateVisibleHeading (cyclomatic 16): book.trackScrollHeadingInTOC::updateVisibleHeading 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":"website/static/js/template/book.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d362768d6724e337115367af1cf4a4cadad41d8bf4674222b654dfffb64e71c4"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeGraphMessageHandler::process_message (cognitive 762): NodeGraphMessageHandler::process_message has cognitive complexity 762 (threshold 15). Drivers by points: if/else 248 (575 pts), loops 34 (87 pts), boolean chains 52, match/switch 17 (48 pts) (nesting depth added 411). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"542abae7b8fdd9be46ba84d4f6393f4e7a00800b52328ef0a404b950c76ff10e"}},{"ruleId":"D2","level":"warning","message":{"text":"PathToolFsmState::transition (cognitive 608): PathToolFsmState::transition has cognitive complexity 608 (threshold 15). Drivers by points: if/else 148 (416 pts), loops 32 (110 pts), boolean chains 43, match/switch 17 (39 pts) (nesting depth added 368). 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc58adeb99745febaabbdb8f540ce1db70d67a8903d358eafbe961bc9e16c53e"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentMessageHandler::process_message (cognitive 401): DocumentMessageHandler::process_message has cognitive complexity 401 (threshold 15). Drivers by points: if/else 164 (319 pts), loops 19 (42 pts), match/switch 12 (23 pts), boolean chains 17 (nesting depth added 189). 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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce864a33e037ba404ce4fede178d97abe256b3efbaa229b98ac9c02b5b273ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::migrate_node (cognitive 382): graphite_editor::messages::portfolio::document_migration::migrate_node has cognitive complexity 382 (threshold 15). Drivers by points: if/else 136 (206 pts), boolean chains 76, match/switch 24 (54 pts), loops 25 (46 pts) (nesting depth added 121). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf364037bb768f7a69ec274d28a595bd3356faeb657c37aa53f47802d0e7829"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectToolFsmState::transition (cognitive 369): SelectToolFsmState::transition has cognitive complexity 369 (threshold 15). Drivers by points: if/else 116 (278 pts), match/switch 17 (42 pts), boolean chains 36, loops 4 (13 pts) (nesting depth added 196). 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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d70e25448548f47cbd781ab0758d01a63ad04554878ca5c7c57cfc296790b4"}},{"ruleId":"D2","level":"warning","message":{"text":"GradientToolFsmState::transition (cognitive 304): GradientToolFsmState::transition has cognitive complexity 304 (threshold 15). Drivers by points: if/else 80 (218 pts), match/switch 12 (36 pts), loops 9 (28 pts), boolean chains 22 (nesting depth added 181). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4c37603d0dd9138c6637b7f60cc7b47f3a82315ec4dbda42a591dfdbd6075b"}},{"ruleId":"D2","level":"warning","message":{"text":"PortfolioMessageHandler::process_message (cognitive 249): PortfolioMessageHandler::process_message has cognitive complexity 249 (threshold 15). Drivers by points: if/else 83 (185 pts), loops 13 (32 pts), boolean chains 20, match/switch 7 (12 pts) (nesting depth added 126). 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":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4a0e1182d773fb8526e4b2b7dfd2042447cf2c7bcbf09d65010e193167a314"}},{"ruleId":"D2","level":"warning","message":{"text":"PenToolFsmState::transition (cognitive 219): PenToolFsmState::transition has cognitive complexity 219 (threshold 15). Drivers by points: if/else 82 (179 pts), boolean chains 18, loops 4 (11 pts), match/switch 6 (11 pts) (nesting depth added 109). 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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a14a68da595127ed9700c8cbc4c1bfc89300503cb5e2e0430bb0be92357f791"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::document_migration_upgrades (cognitive 202): graphite_editor::messages::portfolio::document_migration::document_migration_upgrades has cognitive complexity 202 (threshold 15). Drivers by points: if/else 62 (133 pts), loops 21 (35 pts), match/switch 9 (21 pts), boolean chains 13 (nesting depth added 97). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45c1ce97150a75fb8ae24163e247b3438fda98015973e90d08715b14030d147"}},{"ruleId":"D2","level":"warning","message":{"text":"ClipboardMessageHandler::process_message (cognitive 197): ClipboardMessageHandler::process_message has cognitive complexity 197 (threshold 15). Drivers by points: if/else 41 (111 pts), loops 19 (58 pts), match/switch 6 (20 pts), boolean chains 8 (nesting depth added 123). 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":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cafcd3220623a8935ae5af45bb56caec1ecc3dee6a26659aaefae2c58d3105"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformLayerMessageHandler::process_message (cognitive 190): TransformLayerMessageHandler::process_message has cognitive complexity 190 (threshold 15). Drivers by points: if/else 66 (157 pts), boolean chains 16, match/switch 6 (12 pts), loops 2 (5 pts) (nesting depth added 100). 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":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87929f9a113119b0e89225635a57ba963b1527e7a6a339fa6864d6cb63bf2cc"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceMessageHandler::process_message (cognitive 135): WorkspaceMessageHandler::process_message has cognitive complexity 135 (threshold 15). Drivers by points: if/else 48 (106 pts), loops 10 (21 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 70). 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":"editor/src/messages/portfolio/workspace/workspace_message_handler.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fe4fe5243d30a74c3b70a2efd5b4f423c20a91604c4e18b6a19baff15fa6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::constants::builtin_function (cognitive 126): math_parser::constants::builtin_function has cognitive complexity 126 (threshold 15). Drivers by points: if/else 51 (100 pts), match/switch 9 (16 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 58). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/constants.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"408ece0af8d498846272acb1045c3b70e5a7af2cd727f9b8c4a65d1e86cb8db9"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutMessageHandler::handle_widget_callback (cognitive 125): LayoutMessageHandler::handle_widget_callback has cognitive complexity 125 (threshold 15). Drivers by points: if/else 26 (76 pts), match/switch 24 (45 pts), loops 1 (4 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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c16e06d4bb214b9c55ad98837a649c59fe3a2b228ad33f6dcef17498630a5"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path (cognitive 121): graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path has cognitive complexity 121 (threshold 15). Drivers by points: if/else 40 (90 pts), boolean chains 31 (nesting depth added 50). 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":"editor/src/messages/portfolio/document/utility_types/wires.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faabfec32a50c657050f3a2390519b29960178d72b99b34435967011f92851b"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::morph (cognitive 121): vector_nodes::vector_nodes::morph has cognitive complexity 121 (threshold 15). Drivers by points: if/else 82 (111 pts), loops 16 (24 pts), match/switch 9 (15 pts), boolean chains 12 (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. This shape REPEATS in the file: one other method here (vector_nodes::vector_nodes::morph::lerp_appearance) 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfdf97e3122a4cd33aa50777e7f0e75ab470edff4a0cfead0906898d0ebf83a"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigationMessageHandler::process_message (cognitive 119): NavigationMessageHandler::process_message has cognitive complexity 119 (threshold 15). Drivers by points: if/else 59 (105 pts), boolean chains 8, match/switch 3 (6 pts) (nesting depth added 49). Of this number, 113 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":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f606eef43e4ef380bdc5407fdf700e155014f0a7249fee2597074baa652d8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeToolFsmState::transition (cognitive 118): ShapeToolFsmState::transition has cognitive complexity 118 (threshold 15). Drivers by points: if/else 43 (94 pts), boolean chains 15, match/switch 5 (9 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4644c5854787a7deb38800cc18afd0a565f1264fcb7f326b6be235efae495eb"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::merge_qr_squares::merge_qr_squares (cognitive 102): vector_nodes::merge_qr_squares::merge_qr_squares has cognitive complexity 102 (threshold 15). Drivers by points: if/else 11 (46 pts), loops 13 (44 pts), match/switch 1 (7 pts), boolean chains 5 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/merge_qr_squares.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e9905f11b927e43e313f87ad04d48f2e73739cae2647406cd2e2f92344d9e7"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphOperationMessageHandler::process_message (cognitive 100): GraphOperationMessageHandler::process_message has cognitive complexity 100 (threshold 15). Drivers by points: if/else 40 (78 pts), loops 5 (13 pts), match/switch 4 (9 pts) (nesting depth added 51). 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":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8143485fcb34ac6919ea030cfb28d3744788ca2cf9db8cd7f19e1eeec16b6068"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::codegen::generate_node_code (cognitive 100): node_macro::codegen::generate_node_code has cognitive complexity 100 (threshold 15). Drivers by points: match/switch 41 (47 pts), if/else 28 (36 pts), boolean chains 11, loops 2 (6 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a8ff72bb8cdb9d745ca704bffc797f935895b788a97af0e4b0ae7105892f68"}},{"ruleId":"D2","level":"warning","message":{"text":"text_nodes::json::parse_json_path (cognitive 100): text_nodes::json::parse_json_path has cognitive complexity 100 (threshold 15). Drivers by points: if/else 21 (56 pts), loops 6 (27 pts), match/switch 2 (14 pts), boolean chains 3 (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":"node-graph/nodes/text/src/json.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c71853a3fc87a3ddab9b43855cddbdd0785a27f634fc07ab38881991da0725e"}},{"ruleId":"D2","level":"warning","message":{"text":"TextToolFsmState::transition (cognitive 99): TextToolFsmState::transition has cognitive complexity 99 (threshold 15). Drivers by points: if/else 40 (87 pts), boolean chains 8, loops 1 (3 pts), match/switch 1 (nesting depth added 49). 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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1639898d0760869574ad85b08569a6d5bad19f2fbff7bf3816185d09d9240428"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_run::requirements::check (cognitive 90): cargo_run::requirements::check has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (45 pts), match/switch 8 (29 pts), loops 6 (10 pts), boolean chains 6 (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":"tools/cargo-run/src/requirements.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9878424cc5db54c10ed39e15b7df6f508fcfd91e25d99278b424b3bfe6c9f475"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeGraphExecutor::poll_node_graph_evaluation (cognitive 89): NodeGraphExecutor::poll_node_graph_evaluation has cognitive complexity 89 (threshold 15). Drivers by points: if/else 19 (53 pts), match/switch 8 (24 pts), loops 4 (8 pts), boolean chains 4 (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":"editor/src/node_graph_executor.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d1c56e931183c01f104ba3fe1d7d9ad70a2daddb79939f389da099d821e0df"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays (cognitive 87): graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays has cognitive complexity 87 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 7 (24 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"17232b68c56ed59adde9efc2f367f89bd79638a8befd6e460ee886c0078a80c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::convert_selected_manipulators_to_colinear_handles (cognitive 86): ShapeState::convert_selected_manipulators_to_colinear_handles has cognitive complexity 86 (threshold 15). Drivers by points: if/else 22 (72 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 3 (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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c04d31b03bcbdbe9d3d9f99f10cfeef75805e04ad339bfa31fe1f9a6a50e4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::flatten::chain_order (cognitive 85): vector_types::vector::flatten::chain_order has cognitive complexity 85 (threshold 15). Drivers by points: if/else 25 (58 pts), loops 9 (15 pts), boolean chains 9, match/switch 1 (3 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":"node-graph/libraries/vector-types/src/vector/flatten.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16344e701c54db556fec5af8a4f8d8dcdb3c54ecd5fb37be0e7db1d21418183"}},{"ruleId":"D2","level":"warning","message":{"text":"PathToolData::mouse_down (cognitive 81): PathToolData::mouse_down has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (57 pts), loops 4 (13 pts), boolean chains 8, match/switch 1 (3 pts) (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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c33ae4cb5a6e024ad2310950c27e2acd94979fac57b8bb0c24374f943b4b079"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints (cognitive 78): graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints has cognitive complexity 78 (threshold 15). Drivers by points: if/else 29 (66 pts), boolean chains 7, match/switch 3 (5 pts) (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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3550}}}],"partialFingerprints":{"codehealthFindingId/v1":"89537f566aead31e34190d7caf7a276e95f1e3b4f861f343249feafb025f41a1"}},{"ruleId":"D2","level":"warning","message":{"text":"graphene_cli::dump::print (cognitive 77): graphene_cli::dump::print has cognitive complexity 77 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 9 (21 pts), match/switch 4 (9 pts), boolean chains 5 (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":"node-graph/graphene-cli/src/dump.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b12c2b2341df0fd0fd521432ebcda6fe518069544593d8792a34f7f2fe37e2"}},{"ruleId":"D2","level":"warning","message":{"text":"graphic_types::graphic::flatten_graphic_list::flatten_recursive (cognitive 77): graphic_types::graphic::flatten_graphic_list::flatten_recursive has cognitive complexity 77 (threshold 15). Drivers by points: if/else 12 (48 pts), loops 6 (21 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f63221f4c886fded9dd670200e716b4d750c00693e84aeebef8ac2c98a5ea6a"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::renderer::render_vector_item_to_vello (cognitive 76): rendering::renderer::render_vector_item_to_vello has cognitive complexity 76 (threshold 15). Drivers by points: if/else 41 (50 pts), match/switch 8 (13 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 17). 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e288101e52f0575586f7caab1f5e50e7b39e8e117116ab6eba9ca33b394fe321"}},{"ruleId":"D2","level":"warning","message":{"text":"Replica::handle_packet (cognitive 72): Replica::handle_packet has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (50 pts), match/switch 6 (11 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 31). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/peer-transport/src/replica.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc1d93bce41c174e6cd17a1064b4f958cd3728e783cae9760955a42c9d589d0"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::load_stack_dependents_for_nodes (cognitive 68): NodeNetworkInterface::load_stack_dependents_for_nodes has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 11 (21 pts), match/switch 1 (3 pts), boolean chains 2 (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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7562f90c85d48aade930061f7b10601e70569782447a47ff1944c78778386a87"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtboardToolFsmState::transition (cognitive 67): ArtboardToolFsmState::transition has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (49 pts), match/switch 4 (11 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c72e96e630be981c761cfbc27d90b933c50772f5c8a05467d561eaf88a722a8"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::refine_cycle (cognitive 66): vector_types::vector::algorithms::concave_hull::refine_cycle has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 8 (11 pts), match/switch 3 (8 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a214acc9d565b460592e25502ebe0a863abfee61147bfae08014d00f4404305"}},{"ruleId":"D2","level":"warning","message":{"text":"App::handle_desktop_frontend_message (cognitive 64): App::handle_desktop_frontend_message has cognitive complexity 64 (threshold 15). Drivers by points: if/else 29 (57 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ba4240fc07731a98a63781e97851458afce45017f9149341320cccec9a8a72"}},{"ruleId":"D2","level":"warning","message":{"text":"PointRadiusHandle::overlays (cognitive 64): PointRadiusHandle::overlays has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 2 (6 pts), match/switch 2 (3 pts) (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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e46a1c65911f6ab2cb5e85109da2622f735073d3530f91410c3705c693e97"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::delete_selected_points (cognitive 63): ShapeState::delete_selected_points has cognitive complexity 63 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 6 (15 pts), boolean chains 5, match/switch 1 (3 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e28ad478cbc462aea6b1d231aa9a679175badb02dd3e29b6bbb7407202cefee"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::weld_flow_ends (cognitive 63): Vector::weld_flow_ends has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 14 (24 pts), boolean chains 3 (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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71d5813f9eb31abeba10cea468b8941c4e3e4da83351fc8615b8e7669124d60"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::grid_topology::fewest_trails (cognitive 63): vector_nodes::grid_topology::fewest_trails has cognitive complexity 63 (threshold 15). Drivers by points: loops 16 (31 pts), if/else 7 (18 pts), match/switch 3 (11 pts), boolean chains 3 (nesting depth added 34). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b23ca4528107a0a3a15b162f0f66db86c749afc2806acf42675c42ab6777958"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeGraphMessageHandler::collate_inspector_sections (cognitive 61): NodeGraphMessageHandler::collate_inspector_sections has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 4 (8 pts), boolean chains 5, 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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dd0f4390ed848307fe665fdcd8a5fc14ef0ad6f046af8ae61b40d31980f2a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::get_inside_points_and_segments (cognitive 61): ShapeState::get_inside_points_and_segments has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 5 (19 pts), loops 4 (8 pts), boolean chains 3 (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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a24b27c992b5ad1b8f2fb90ec2db1f188a02ac32ad819e5cd26b1838e3bde0"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::load_structure (cognitive 58): NodeNetworkInterface::load_structure has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 7 (17 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/structure.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4b2301138cabdefcedc0c0a1acc7d9447f7e3c8b86c3ed5d8ae8348f553618"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncMessageHandler::process_message (cognitive 58): SyncMessageHandler::process_message has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (54 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10fbc5183646127e9fe1256724cfe4d65d2ec0d3e262a643548495c43d50b75"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolMessageHandler::handle_message (cognitive 58): ToolMessageHandler::handle_message has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (51 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"11db7e22ae659384d5d248bb655752c1a6e84cd7ad96fc36a46d03021e910bc0"}},{"ruleId":"D2","level":"warning","message":{"text":"InputState::process (cognitive 57): InputState::process has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 16 (35 pts), if/else 8 (18 pts), boolean chains 4 (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/input.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"029dbb7e5ea94d75a769d5392623355ceabd5fd0ac25fa4c3023e98924264c67"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkingVector::reweave (cognitive 57): WorkingVector::reweave has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 7 (11 pts), boolean chains 9, match/switch 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/flatten.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73b654a3e455172ebc36d3d221eea9797bcda52c6d9a363a9248526c34632e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::move_selected_points_and_segments (cognitive 56): ShapeState::move_selected_points_and_segments has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (48 pts), loops 3 (5 pts), match/switch 1 (3 pts) (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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"277ed5315400c6866068f7d68c14f6651d37ec185f808ccb2ea51e941be6307a"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentModification::apply (cognitive 54): SegmentModification::apply has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 6 (14 pts), loops 4 (5 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c9013bbed10717b9f35e6b3de79455d717495b99d60807b9d1ac442e7d4ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceMessageHandler::process_message (cognitive 53): ResourceMessageHandler::process_message has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 7 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 30). Of this number, 51 points are the body\u0027s own statements and 2 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":"editor/src/messages/portfolio/document/resource/resource_message_handler.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c1c49790e639425b4f6cbbe1a44c50189b55b94988961410d9e7e2ef1f7d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"SplineToolFsmState::transition (cognitive 52): SplineToolFsmState::transition has cognitive complexity 52 (threshold 15). Drivers by points: if/else 25 (47 pts), match/switch 2 (4 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":"editor/src/messages/tool/tool_messages/spline_tool.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabbc15965aef393d46393c1d22953045853c17f30d798d7599b8cf8e068c0f6"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector (cognitive 50): graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (3 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"13210e7e8262078826ae5b697ac6844617a23e5a9e4928982d3c8f388dd5ef4c"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::constructions::find_constructions (cognitive 50): snapping::constructions::find_constructions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 7 (18 pts), match/switch 2 (5 pts) (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":"libraries/snapping/src/constructions.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21edb4cc878ac10fe218c57864a0a169157f3894163da23977223c07e312b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorPickerMessageHandler::apply_gradient_update (cognitive 49): ColorPickerMessageHandler::apply_gradient_update has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (44 pts), boolean chains 4, 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":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea6c8f1c684ce21017a0b5ea0ea6725e45a0cae53048f54153b1604f758a3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::highlight::highlight (cognitive 49): math_parser::highlight::highlight has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 4 (11 pts), boolean chains 6, loops 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":"libraries/math-parser/src/highlight.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba6cb4d2f959dac1aa42c62226374d0d2610abd6e337a68882ccf56696cdf2"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::smooth_anchors (cognitive 48): vector_nodes::vector_nodes::smooth_anchors has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 6, loops 3 (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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dcdbea59fd7bd329241f2baefea81f667749511d6654316feb773cc3b782a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Gdd::stream_entries (cognitive 47): Gdd::stream_entries has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 8 (12 pts), match/switch 3 (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":"document/format/src/export.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3022baba9014fd5ad1f8c4ea17c41250378d2a39689c18718737c3c5b918943"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments (cognitive 47): graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 9 (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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"669ba963730b8e5e9c919c54a8f4e8a426fdfada5fb0dbae61f4f337810a050c"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_proc_macros::editor_commands::editor_commands_impl (cognitive 47): graphite_proc_macros::editor_commands::editor_commands_impl has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 5 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 23). Of this number, 34 points are the body\u0027s own statements and 13 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":"proc-macros/src/editor_commands.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"db01b6dcf86d21221cbbf4ce65bfba18836143e916866161e8663541143c2b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"PointRadiusHandle::handle_actions (cognitive 46): PointRadiusHandle::handle_actions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf64b2abdc6e6f52b2a0385d0bb7ae3ef1f8ee3db75f605955fd0ddc3d2d8d4"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::codegen::generate_register_node_impl (cognitive 46): node_macro::codegen::generate_register_node_impl has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 5 (18 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":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff81dc88e4496ae526b9b8c489fcfd40cc7ebb05a54840fa35d2f5463dc3173"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::validation::ranked_input_violations (cognitive 46): node_macro::validation::ranked_input_violations has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 3 (9 pts), boolean chains 3, match/switch 1 (2 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":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb640f73e15d93d0aa14e54a60e95485e490ad35f9f07bd561977acf3f59053"}},{"ruleId":"D2","level":"warning","message":{"text":"PathToolData::drag (cognitive 45): PathToolData::drag has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 6, match/switch 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0685f44d3aaac6e86711a390429ea515805681751aff32cb2669035159e565"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectedGradient::update_gradient (cognitive 44): SelectedGradient::update_gradient has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 4, 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"de995206e29c48545999c48b6bedbc4dff47c0dfa4d3059df7c873094a9b8676"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::apply_op_with (cognitive 43): Document::apply_op_with has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/document.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a0d493e6a5961e0b76a279d5e8e643a8ef28c17dccf6feaaa7fc868933b62f"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::trace_hull (cognitive 43): vector_types::vector::algorithms::concave_hull::trace_hull has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 10 (14 pts), boolean chains 7 (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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc61edf836a760337ce3628100d9af36f9408964dc71ae64ef4dedeb6a3a769"}},{"ruleId":"D2","level":"warning","message":{"text":"Lattice::loop_route (cognitive 43): Lattice::loop_route has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (9 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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b86cb9f4af5c8f04707f2b16d7c3bee53e4388c834c983190d5df80f11653b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::alternate_selected_handles (cognitive 42): ShapeState::alternate_selected_handles has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 3 (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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e554e0e505e153e5b0833a7e902151eb1a1f94405db301aafce98ae61ea4b70"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays (cognitive 42): graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 8 (12 pts), match/switch 1 (2 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":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12261dcdf0caca08b71e3b21369d93378b2159a8a7c10e013acb5a6ca9480d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueNode::eval_in (cognitive 42): ValueNode::eval_in has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 6 (11 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/executer.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d520da5208373cff6ba1ba2e92ea49d98a0b669ceb1bf87fc8812c12a89c98"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_token (cognitive 42): Lexer::next_token has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 7, match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/lexer.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9212ce443757035a7b7b526de81cee998801812ff790a9aa3b72e3a389c7ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::unweld (cognitive 42): Vector::unweld has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 8, loops 5 (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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd8b27f392548578e5b7b50cd940c6b42156c376b5167321aea29a059a6ef33"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_message_tree::write_tree_txt_node (cognitive 42): editor_message_tree::write_tree_txt_node has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/editor-message-tree/src/main.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aadb1157a340a01b637a0d5dac79d03a036b0021ff739be8124613d2e8fa173"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::weld::weld_nearby_points (cognitive 41): vector_types::vector::algorithms::weld::weld_nearby_points has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 8 (16 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf5bfb3fb8be9ef1d25dad8b35d8c0474f42e7578d39271ba29ffd6b8c00b57"}},{"ruleId":"D2","level":"warning","message":{"text":"document_graph_storage::delta::compute_deltas (cognitive 40): document_graph_storage::delta::compute_deltas has cognitive complexity 40 (threshold 15). Drivers by points: loops 13 (23 pts), if/else 7 (17 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":"document/graph-storage/src/delta.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"80047cfa0ed8e0392054f86169b936457eb6b3c51c7bb3682406556a2d135864"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher::handle_message (cognitive 40): Dispatcher::handle_message has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/dispatcher.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c208b046b9302f6e546e5fa5b4bef43146f0a1ce405d166744ec03c6a0dbf5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::flip_smooth_sharp (cognitive 40): ShapeState::flip_smooth_sharp has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 4 (14 pts), match/switch 1 (4 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"966425b712737927ff623bb55b47f235106b34b2b6d8ddba46fd15e940bb5404"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundingBoxManager::check_selected_edges (cognitive 40): BoundingBoxManager::check_selected_edges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 11 (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":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a9a079d9b679369bc6f01da76e50de5fd02d4415a37d405babdb53738e5e74"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section (cognitive 40): graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 5, loops 4 (5 pts), match/switch 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"1494b108fcdc9023f36706beada0849afd79679d0bca7908f97e098ede3a9f9f"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::emit_cycle (cognitive 40): vector_types::vector::algorithms::concave_hull::emit_cycle has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (10 pts), loops 7 (9 pts), boolean chains 4 (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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"1083270e117ffd5aced7672d3b98e53fcc201633e62b9a383dbdba5fb8493074"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_proc_macros::helpers::clean_rust_type_syntax (cognitive 40): graphite_proc_macros::helpers::clean_rust_type_syntax has cognitive complexity 40 (threshold 15). Drivers by points: loops 10 (31 pts), if/else 3 (7 pts), match/switch 1 (2 pts) (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":"proc-macros/src/helpers.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca02718b18bdd2a5391bc643251e606237141cc5060a371c96f829242a80841"}},{"ruleId":"D2","level":"warning","message":{"text":"GradientTool::process_message (cognitive 39): GradientTool::process_message has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (31 pts), match/switch 3 (5 pts), boolean chains 3 (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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bc64be2a5f92db6c866ddf62866ad2077b55b4b3da7d52aea36a8ac694f4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays (cognitive 39): graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (10 pts), match/switch 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"557767425db164f2db63e383df1305ced0fea15f892fbe4bf37d17a7338c46f1"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::completion::completions (cognitive 39): math_parser::completion::completions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 7, loops 4 (5 pts), match/switch 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":"libraries/math-parser/src/completion.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4e188428630a7dfc5da6961fce5d35c89a6132be7d135a7f5c5a96fb4abb3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Curve::subdivision_intersections (cognitive 39): Curve::subdivision_intersections has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 8, loops 4 (5 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":"libraries/snapping/src/curve.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4946a813b0f4bd0a6a7367ef7caa7d403b7dbe38091a896ecdb92c814212b5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetwork::flatten_with_fns (cognitive 39): NodeNetwork::flatten_with_fns has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 6 (8 pts), match/switch 2 (6 pts), boolean chains 3 (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":"node-graph/graph-craft/src/compiler/flatten.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcce1ebea6d7670988e3e47d389f20d47efd05722c3de95e2084248c6beeff0"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutMessageHandler::get_widget_path (cognitive 38): LayoutMessageHandler::get_widget_path has cognitive complexity 38 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 5 (16 pts), match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e2246b144bb4223f9b7abb7ccca2e73d6a430ef3b3cea81618c04d711274c0"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::delete_nodes_leaving_dots (cognitive 38): NodeNetworkInterface::delete_nodes_leaving_dots has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 6 (11 pts), boolean chains 4 (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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f80b61959ab79464d1cf16f7bf248b6473b2e052bfb6212c7de0cea5d54b84"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::solve::resolve_freely (cognitive 38): snapping::solve::resolve_freely has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 8, loops 5 (8 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":"libraries/snapping/src/solve.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fdc3b7cb347f6bf7b3f90f93c0ec13a194cc08c6904b92f35ae67e4726edad"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::offset_bezpath::offset_bezpath (cognitive 38): vector_types::vector::algorithms::offset_bezpath::offset_bezpath has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 2 (6 pts), boolean chains 2, 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":"node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fa27593143812bd9b4228043267e1c6ae1a26296aebfb4b010f68d48de9f34"}},{"ruleId":"D2","level":"warning","message":{"text":"path_bool_nodes::flatten_vector (cognitive 38): path_bool_nodes::flatten_vector has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (12 pts), boolean chains 4, match/switch 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":"node-graph/nodes/path-bool/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b966a4461c43ff826809fba3bbed407580583e24496e17444bb53346df91d4c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorPickerMessageHandler::process_message (cognitive 37): ColorPickerMessageHandler::process_message has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 5 (9 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb476bf6a086e2f0cd3eff00d4be17be5179122a228eb6d0670d45fd11ee97d"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath (cognitive 37): graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25 (33 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). 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":"editor/src/messages/portfolio/document/utility_types/wires.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc96d2fdd118a9f17f999a957e67c261f32919f19e0364b99a568126aa3d393"}},{"ruleId":"D2","level":"warning","message":{"text":"TypingContext::infer (cognitive 37): TypingContext::infer has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (7 pts), boolean chains 2, match/switch 2 (nesting depth added 18). Of this number, 33 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":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc045b698cce3a6d3b7712cc2362cdb08bf23368da5b22a14c9bfae784a47ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::renderer::render_vector_shape_svg (cognitive 37): rendering::renderer::render_vector_shape_svg has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20, boolean chains 10, match/switch 2 (4 pts), loops 2 (3 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f680a1221b0d1964af1348540f23d2007925eee40f89f64335fc1036e649265d"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::end_candidates (cognitive 37): vector_types::vector::algorithms::concave_hull::end_candidates has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 2, loops 1 (2 pts), 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"680372fa87831ef0986bcb8923899bfc8ea39e12c2e07277fa37c422b6133c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::solve_span (cognitive 37): vector_types::vector::algorithms::concave_hull::solve_span has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (8 pts), boolean chains 7, match/switch 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cefbdb6f27e2a94edf9d50d723546f4d47041194fde34ab2d1d32b32fd17fb"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::replace_with_polygons (cognitive 37): vector_nodes::vector_nodes::replace_with_polygons has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (13 pts), match/switch 1 (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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1d601663e953b03ad7422288e4d40ad7d53f4fe8a2e2d4357cf1b921faec0c"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown.parseMarkdown (cognitive 37): markdown.parseMarkdown has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/markdown.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f950871bded231cfdc1c5996295e68fa78008207e24570c8b43240e34889366c"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::set_input (cognitive 35): NodeNetworkInterface::set_input has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 8, match/switch 4 (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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f835a5c00861de2344eaac5378287cf855d6a7d14cc398f6aa61952bf59a96"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector (cognitive 35): graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24 (26 pts), boolean chains 9 (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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80f7154b90d9fcbdc3a229ffb4f25719346963fe2c15c273cef18d3c6772441"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::anchor_tangents (cognitive 35): Vector::anchor_tangents has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 4 (10 pts), match/switch 2 (6 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcf03254bac5b7289f620e85041829bf2d2499c4f64596dfdc63081bdf7c0da"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::normalize_winding_directions (cognitive 35): Vector::normalize_winding_directions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 5 (7 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79cce89356791bdaa4e6f1aec7202d0947c12c3832dc171796295d998a92ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::contour::contours_with (cognitive 35): vector_types::vector::contour::contours_with has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (5 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":"node-graph/libraries/vector-types/src/vector/contour.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e34db69fc2f62f8776bfd58b1c8a24f981e328ed55fb595a205da49e1f1abd"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::compute_node_click_targets (cognitive 34): NodeNetworkInterface::compute_node_click_targets has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c03e62cb693c801576382f5ac52e379a20d1bc8c92550e30eefffa9d28c574"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::resolve_position (cognitive 34): NodeNetworkInterface::resolve_position has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 4 (9 pts), loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"463053c346ecc81d8e8e38e98a5506839df0c3c1dc587ec26334dee2b2184727"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeFnAttributes::parse (cognitive 34): NodeFnAttributes::parse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 1 (2 pts), loops 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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d779095aa5cc77d66bf588bae3aae42b0f014826af8fb3fdc0f5f78664334a"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::break_path_at_selected_point (cognitive 33): ShapeState::break_path_at_selected_point has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 4 (10 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d093b15a36077d70d75a5b098dfa68f29e4dae879f1d69380bf8a81504f7ecd4"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::grid_topology::pair_odd_points (cognitive 33): vector_nodes::grid_topology::pair_odd_points has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 8 (13 pts), boolean chains 5 (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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"60880061d554dfa0824885d71317df52f2d8794e2dd27719517cee29a8dc0a89"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocessor::new (cognitive 33): Preprocessor::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (9 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/preprocessor/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b4af987959ab4cc0beb78b7f9ea0d7f46e0650107c6415d544d510339943bd"}},{"ruleId":"D2","level":"warning","message":{"text":"keyboard-entry.getLocalizedScanCode (cognitive 33): keyboard-entry.getLocalizedScanCode has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 1 (3 pts), ternaries 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":"frontend/src/utility-functions/keyboard-entry.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d857f88d917224c5367ae7ee8863b9cefd1dd6b16a57366d6c59b305aa3070e7"}},{"ruleId":"D2","level":"warning","message":{"text":"migration_runner::node::upstream_most (cognitive 32): migration_runner::node::upstream_most has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (11 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":"document/migrations/runner/src/node.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7c499497cd0ff3cabcf96d9fc1dbe9a27fd72721ed382b67fdab5f53dc0260"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::convert_manipulator_handles_to_colinear (cognitive 32): ShapeState::convert_manipulator_handles_to_colinear has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (26 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b26543fd4bc600beedd29d2d8154ae784b67587e2e9aa76fbd6f11b9d3ef7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::migrate_copy_to_points (cognitive 32): graphite_editor::messages::portfolio::document_migration::migrate_copy_to_points has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 6 (9 pts), match/switch 5 (7 pts), boolean chains 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":4013}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc4b86c4ed009b4733151e9790d23156ec52a82d5a97bc795f2d1b34c8a3366"}},{"ruleId":"D2","level":"warning","message":{"text":"PointModification::apply (cognitive 32): PointModification::apply has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"be57665d3a9e9525d50848a0146a406ef3d8e6d82a143a9dd477dec11aca46a3"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::parsing::parse_field (cognitive 32): node_macro::parsing::parse_field has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 1 (3 pts), boolean chains 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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"b059663d9c7cc44faa44e7c8442c88e3735522693e51180325819b7a34678542"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::decimate (cognitive 32): vector_nodes::vector_nodes::decimate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). Of this number, 16 points are the body\u0027s own statements and 16 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4c2d4888d983b876bf0d57d82dddef53a581ae0348700968c13021515d8d20"}},{"ruleId":"D2","level":"warning","message":{"text":"App::window_event (cognitive 31): App::window_event has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3310b5d96f44ea2be8fb9606fae9117176ed71b4013d96625f8a82c4a591a9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_desktop_ui::input::process (cognitive 31): graphite_desktop_ui::input::process has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 5 (11 pts), boolean chains 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/input.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8c5247b0ac6a4f5e68c176c90e68c2ec70dc411083edb5d340d2defb1b7955"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::upstream_nodes_below_layer (cognitive 31): NodeNetworkInterface::upstream_nodes_below_layer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (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":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"0319866a3c49e3a8a4ec7c929f1e31e7c9c30be4549e3fffe5f553dc9c1e33b6"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions (cognitive 31): graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (8 pts), boolean chains 7, match/switch 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3739}}}],"partialFingerprints":{"codehealthFindingId/v1":"572b0ef1b44e393204d8c7e1cac3b2aba2954377dc754983b315f63b64ad9610"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::utility_functions::fit_handles_to_segment_pair (cognitive 31): graphite_editor::messages::tool::common_functionality::utility_functions::fit_handles_to_segment_pair has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (21 pts), loops 4 (7 pts), match/switch 1 (2 pts), boolean chains 1 (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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b3548dde20bd50747ce0177b538be2f0bdfcdfccd0b4e4a5873995a75bc689"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection (cognitive 31): graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 8, 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":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4994c42cbb5a63a0b652d883d642551ff22a8e45fd4c58397bb5813054c13413"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::convex_hull::refine_transitions (cognitive 31): vector_types::vector::algorithms::convex_hull::refine_transitions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (7 pts), loops 3 (5 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":"node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f7a03cbbfb37d85a1f9d6f2793da6b399d18734be71a18425c73e6910699b1"}},{"ruleId":"D2","level":"warning","message":{"text":"text_nodes::format_number (cognitive 31): text_nodes::format_number has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 4, loops 2 (4 pts), 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":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd09ebc1ddfb5f6cdb532e70ed2edf443020a7f106e6ee8405ea722faf54e9b9"}},{"ruleId":"D2","level":"warning","message":{"text":"input.shouldRedirectKeyboardEventToBackend (cognitive 31): input.shouldRedirectKeyboardEventToBackend has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 13, 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70f45a6a2fddcc1a656c32d1f665b4b23759d7c12411b7bc4c87d307ff9f377"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::move_layer_to_stack (cognitive 30): NodeNetworkInterface::move_layer_to_stack has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, match/switch 2 (4 pts), loops 2 (3 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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"0615bb2d0014c5129a5d18d9c9b9ad6a50c80d4ffac866fd0b492caba35310ac"}},{"ruleId":"D2","level":"warning","message":{"text":"OriginalTransforms::update (cognitive 30): OriginalTransforms::update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff01421f26b48403a9ce5acce8f8818d397336bf2e8cd327e00c1b92024f948a"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncMessageHandler::apply_dirty (cognitive 30): SyncMessageHandler::apply_dirty has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc71e509cb6c83a2000c31ecc43691868e82c9824c3ea11ffce86dab3c75ad5a"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::network_interface::editor_delta::stage_conversion (cognitive 30): graphite_editor::messages::portfolio::document::utility_types::network_interface::editor_delta::stage_conversion has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (9 pts), boolean chains 3, 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":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"558ea77afd0006d080775ee0538cbeb2ae9d53b341d3f010f7cfd08934eb9384"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options (cognitive 30): graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (24 pts), match/switch 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":"editor/src/messages/tool/common_functionality/color_selector.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5318ac44c60455d3316d69466a063f3275e9e3e9b6bef23f2065d4a563dcf1"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::constants::combinatorial (cognitive 30): math_parser::constants::combinatorial has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 3, 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":"libraries/math-parser/src/constants.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b1e8fd5c1113b4f1c876df424003e899fd8511d9b69e06683d7c0ee1157201"}},{"ruleId":"D2","level":"warning","message":{"text":"rawkit::postprocessing::gamma_correction::generate_gamma_curve (cognitive 30): rawkit::postprocessing::gamma_correction::generate_gamma_curve has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/postprocessing/gamma_correction.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb037ec009da84009cfa3fd4550f985ca66bbe694b363456078c52528b23f79b"}},{"ruleId":"D2","level":"warning","message":{"text":"graph_craft::document::value::deserialize_tagged_value_with_legacy_migration (cognitive 30): graph_craft::document::value::deserialize_tagged_value_with_legacy_migration has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 4, 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":"node-graph/graph-craft/src/document/value.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a00b9a880774e1ec56c9ab222542e4d9722acb90412fcf257c4eb60706fbd4"}},{"ruleId":"D2","level":"warning","message":{"text":"membership.window.addEventListener(\u0022DOMContentLoaded\u0022)::update (cognitive 30): membership.window.addEventListener(\u0022DOMContentLoaded\u0022)::update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10, ternaries 8 (10 pts), boolean chains 9, 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":"website/static/js/page/membership.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e2579f7302a81ef1b5bd9e08f22ac0ab2a7c15100d35f012b9ce118f86eb6d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentMessageHandler::selected_layers_reverse (cognitive 29): DocumentMessageHandler::selected_layers_reverse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 7 (11 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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab0fff3790faad735dca11beb6c734d346a570cf5660ba8b95b19db348b7639"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::check_collision_with_stack_dependents (cognitive 29): NodeNetworkInterface::check_collision_with_stack_dependents has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"043af875c92028ea43c74650dd8c7f910fcd1e7fbef3472fe5f41263ef6470f8"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::copy_nodes (cognitive 29): NodeNetworkInterface::copy_nodes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bba31826011a19bbb0cbacf972f4a6821c41c46a772014bea960b9dfe2be016"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::output_type (cognitive 29): NodeNetworkInterface::output_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8466a5685cfb80ebeb9cf2eb86178890d2dbe921705f122da1e8f48876f63b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapSession::snap_features (cognitive 29): SnapSession::snap_features has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, match/switch 2 (3 pts), 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":"editor/src/messages/tool/common_functionality/snap_session.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90873fe29de9e8dab8d37938e76470ad0ba395294b399549cf795bbae08ffa4"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector (cognitive 29): graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 9 (14 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d867556df5eed5b914f989a162eafbb4432182863796f513aabf6b63617835bc"}},{"ruleId":"D2","level":"warning","message":{"text":"rawkit::metadata::camera_data::pseudoinverse (cognitive 29): rawkit::metadata::camera_data::pseudoinverse has cognitive complexity 29 (threshold 15). Drivers by points: loops 11 (22 pts), if/else 3 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/metadata/camera_data.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a21e71ede3d702faabe7778eb37e27a4c9e55b7a4cadf30980a9d7ec383278"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::destructure::derive_destructure_impl (cognitive 29): node_macro::destructure::derive_destructure_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 3 (4 pts), loops 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/destructure.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07fe4fb21dd3cabe06a33663e574800012da892b1e22c707bb108e957f960df"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::follow (cognitive 28): Session::follow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 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":"document/graph-storage/src/session.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"221af8092d1ea87447f4cb1dc65f5e6696a7e9c9d65da0a8936cde154ce2ea53"}},{"ruleId":"D2","level":"warning","message":{"text":"migration_runner::node::rewrite_history (cognitive 28): migration_runner::node::rewrite_history has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (4 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":"document/migrations/runner/src/node.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad31d7784937da5897732a801cd6afe368b78fcaff92433968eb5cf99af1c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryMessageHandler::process_message (cognitive 28): HistoryMessageHandler::process_message has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (8 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/history/history_message_handler.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4f99b70c5bdcf588bb2e564144e34b9507273d03b96839776c9ae597529c47"}},{"ruleId":"D2","level":"warning","message":{"text":"IngestMessageHandler::process_message (cognitive 28): IngestMessageHandler::process_message has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 5 (9 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/ingest/ingest_message_handler.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf695944fc48456d4d134865089f0325f2b8f316154d8495a7fe3fbd31a0092"}},{"ruleId":"D2","level":"warning","message":{"text":"TextTool::process_message (cognitive 28): TextTool::process_message has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, 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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"6097c694ad362cb41d7ecdca4ed4e0139ef2767a0647ea6226b7ea1b6a9b1854"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::shapes::grid_shape::calculate_grid_params (cognitive 28): graphite_editor::messages::tool::common_functionality::shapes::grid_shape::calculate_grid_params has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (27 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":"editor/src/messages/tool/common_functionality/shapes/grid_shape.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"de01235b73e0203b279953bc0da3272f0ff895542432af1e76e36f1ebddda7f2"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::spacing::find_equal_sizes (cognitive 28): snapping::spacing::find_equal_sizes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 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":"libraries/snapping/src/spacing.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efa4b17e8e5a8c61c4e0a699560ab49f6b76652abf98d07273ad198794a323d"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::stroke_manipulator_groups_and_anchor_indices (cognitive 28): Vector::stroke_manipulator_groups_and_anchor_indices has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (22 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b63a4b684f71bac40f43f56917be8d0e4f82c305246f2072088d9d47d3ad72"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments (cognitive 28): vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 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. This shape REPEATS in the file: 2 other methods here (vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split, vector_nodes::vector_nodes::bevel_algorithm::sort_segments) 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3677}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe62a0c0d6aafc39ad7a099ba2981d57669bd3cb4049214092388775a98c81e0"}},{"ruleId":"D2","level":"warning","message":{"text":"migration_runner::order::order_migrations (cognitive 27): migration_runner::order::order_migrations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 7 (11 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":"document/migrations/runner/src/order.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f28484703f8eff6b68eadc4401190d20c2e150cecad63b16b5c4ff06b622fb"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::valid_upstream_chain_nodes (cognitive 27): NodeNetworkInterface::valid_upstream_chain_nodes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, 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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"24403ebb6442b61ecb095bf87f1f82c5eccd4b36119c508f3059fef938e49a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"NumberOfPointsDial::overlays (cognitive 27): NumberOfPointsDial::overlays has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4, 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c827cc7edd5f87bbbf5e821e180683e2c773658b5e523763e6e3deade975c691"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::select_connected (cognitive 27): ShapeState::select_connected has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (10 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"336ef0f209102ddd0be244698fdc896a10fe6df6aa7f57f767c9a6641d27ef34"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector (cognitive 27): graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 6 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"9924f528c61bd97dcb32b7c3399980962d440b16e16c87683e92657f5726cffe"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::spacing::find_spacing (cognitive 27): snapping::spacing::find_spacing has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 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":"libraries/snapping/src/spacing.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"24264d6db11d2f8b55b557d73aea8d67dd0123ac09b481c953ed9e7e0677d9c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::weld_connected (cognitive 27): Vector::weld_connected has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f87eed6aed0d11cc287ab527210641082cf84936ec2838a957698086dc4669"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::concat (cognitive 27): Vector::concat has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb62aedbcd08891b1643d3739edc651bbf04bc7a1ce52422cecc73d7abd420fd"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::extract_pieces (cognitive 27): vector_types::vector::algorithms::concave_hull::extract_pieces has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (8 pts), boolean chains 2, 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27862e411aaa726adae3ab65eadbcf0bf08d3a3e0ecd63cf4026df3e1f17cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"text_nodes::l_system::rewrite (cognitive 27): text_nodes::l_system::rewrite has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (7 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/l_system.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8fbe6e22a254596ac5b8f1fd5764f5ca8a85b8d495eb5f0d74e007c2185262"}},{"ruleId":"D2","level":"warning","message":{"text":"document_graph_storage::prior::restore (cognitive 26): document_graph_storage::prior::restore has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 4 (11 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/prior.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4252de8a537601c2ca296ca53bfacad06c8d96d51a72475dfc27367c0e971075"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutMessageHandler::process_message (cognitive 26): LayoutMessageHandler::process_message has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (2 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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c2f41bb42908fbfd90ad64e51cede368f1555784bbfbf8b58c59685f9b8360"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::set_to_node_or_layer (cognitive 26): NodeNetworkInterface::set_to_node_or_layer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 2, 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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deb272918002891de5147f664625a7d537baed85e4b588bd4f66eaee0f05e10"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::select_all_in_shape (cognitive 26): ShapeState::select_all_in_shape has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a819017707e344780181f61d1f23347c1a63cb59a264cca25ddb79e9135f8693"}},{"ruleId":"D2","level":"warning","message":{"text":"PenToolData::drag_handle (cognitive 26): PenToolData::drag_handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, 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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8987a0e6dc96640d07aa7a642858cbe6245a45b7b0ee4008d6ab8a5c7bc2e7be"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::network_interface::storage_metadata::apply_entries_into_tree (cognitive 26): graphite_editor::messages::portfolio::document::utility_types::network_interface::storage_metadata::apply_entries_into_tree has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/storage_metadata.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"89137e0a0f40f5fd308179ba0527bc03749471084fa4e68abb2112786828503c"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::gradient_tool::detect_hover_target (cognitive 26): graphite_editor::messages::tool::tool_messages::gradient_tool::detect_hover_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (7 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac159002a235852649b095456b972ae0c99593eea7037e547f17d68386d26cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Lut::apply (cognitive 26): Lut::apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (6 pts), boolean chains 5, match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/color_lookup_table.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cf1d0efb54e60eae65c80768320ab9eaffae8d941aafefec3b6571a5fc7187"}},{"ruleId":"D2","level":"warning","message":{"text":"document_container::backends::opfs::drain_queue (cognitive 25): document_container::backends::opfs::drain_queue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/container/src/backends/opfs.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"640a6cbc64d25d598b76c831545a2b0fa02ad0b1129704c3b2a35867a4adfe18"}},{"ruleId":"D2","level":"warning","message":{"text":"migration_snapshot::api::api_problems (cognitive 25): migration_snapshot::api::api_problems has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 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":"document/migrations/snapshot/src/api.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3cbdcc37b0e2eab9162e46b149e25d522539406e6533c15e6a8b74d0dbcf8a"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkView::connected_to_output (cognitive 25): NetworkView::connected_to_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), 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":"editor/src/messages/portfolio/document/utility_types/network_interface/view.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a90b288de3352a95f23dfe94112137ac8c82921b29c9bd1c734c8fa941e275b"}},{"ruleId":"D2","level":"warning","message":{"text":"FillToolFsmState::transition (cognitive 25): FillToolFsmState::transition has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/fill_tool.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"81741175c97b3bf01c2ae9578cffcf7a39a4fda08754f59636f38a2918c9937c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeTool::process_message (cognitive 25): ShapeTool::process_message has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4565f253c0837c8434e57fd0cee5b2b3542109a4cbc805b6b1f7beb2a4b19188"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type (cognitive 25): graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 9, boolean chains 4 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e34eadd8e0dd06ba09c8b9e4c58390b45fe434e8221fb426235e9075a4fe04"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::utility_functions::transforming_transform_cage (cognitive 25): graphite_editor::messages::tool::common_functionality::utility_functions::transforming_transform_cage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20a7f2cbc3cf0ce339b15f8c80a562ca7a2c9e174dcf5a09acfea9b0e83ca89"}},{"ruleId":"D2","level":"warning","message":{"text":"Graphic::collect_metadata (cognitive 25): Graphic::collect_metadata has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1dd6313f4eb45b1c8b1358ea557a6d244ba776bcb7efec14d96e9397721d8"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::renderer::collect_vector_items_metadata (cognitive 25): rendering::renderer::collect_vector_items_metadata has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (5 pts), 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"6327ea723e3af96c33b86c9e4e37a2031c87af9ae40fd096c992f576afbcf0bc"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::renderer::render_raster_cpu_item_svg (cognitive 25): rendering::renderer::render_raster_cpu_item_svg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (25 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad44a10841d66ee6687bb8494e0858656374bb6b70b5f36ddfaeb4fdb8ec8a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::vello_scene_builder::finite_path (cognitive 25): rendering::vello_scene_builder::finite_path has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 6 (10 pts), boolean chains 3, 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":"node-graph/libraries/rendering/src/vello_scene_builder.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"081f1d4cc92527bf64f55bc6b32c0bd6624a710332657eee8e2c8c4983259dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorModification::chain_legacy_segments (cognitive 25): VectorModification::chain_legacy_segments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4, match/switch 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"366579a474c23a677c161ea0fcbcca111a826b36ec5a09effed2cb7cb52b8f04"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::poisson_disk::poisson_disk_sample (cognitive 25): vector_types::vector::algorithms::poisson_disk::poisson_disk_sample has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/poisson_disk.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d10661c1d8c08225b3d26db1791511bc7d85ddd4861da671b2b0052d354b352"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::validation::validate_implementations_for_generics (cognitive 25): node_macro::validation::validate_implementations_for_generics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (6 pts), boolean chains 4, 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":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e21426a9df210a46efe3d8f04f03f8f60f69076819fce8abe4f47222db666"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::turtle::turtle_path (cognitive 25): vector_nodes::turtle::turtle_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/turtle.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2790908a3f14a2de255443d181e181537937be59d1ea1018710591d389383dab"}},{"ruleId":"D2","level":"warning","message":{"text":"bisect-tool.document.addEventListener(\u0022DOMContentLoaded\u0022)::presentCommit (cognitive 25): bisect-tool.document.addEventListener(\u0022DOMContentLoaded\u0022)::presentCommit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (24 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":"website/static/js/page/contributor-guide/bisect-tool.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfcf46aac2d4b8a0f723361a04d82b565c5fe88bfba8875f9508438e45c405b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::user_event (cognitive 24): App::user_event has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 1, 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":"desktop/src/app.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07d2b58ff0d7d16eca54f47166a91f5b736b8ce810effea1584c8c4e2f80131"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::selection_with_bridging_dots (cognitive 24): NodeNetworkInterface::selection_with_bridging_dots has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 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":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e4b14176fb8f1e3cf69b169f9f8b7c6a4c0d8276b41a9762480424794fb579"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelLayoutSubdivision::prune (cognitive 24): PanelLayoutSubdivision::prune has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 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":"editor/src/messages/portfolio/utility_types.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e99771e381916d001dd33a0e405620a04f738c801c505c989f8ef655930918"}},{"ruleId":"D2","level":"warning","message":{"text":"PathToolData::start_dragging_point (cognitive 24): PathToolData::start_dragging_point has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e445d8a2e5a5eababb9b6b80d96bd1a353555c71363e103b62cd47f4256b403"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::find::find_near_probe (cognitive 24): snapping::find::find_near_probe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, 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":"libraries/snapping/src/find.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"711646a96cd94bc4a2be577f7eb06985c46be92081435df456e77e5283619b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"MmapResourceStorage::garbage_collect (cognitive 24): MmapResourceStorage::garbage_collect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/application_io/resource/mmap.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b18a45ce0fe3fcafb24e9a7cf88028ae01b09715272fa6ecd6a03f20c6994d"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::convert_usvg_path::convert_usvg_path (cognitive 24): rendering::convert_usvg_path::convert_usvg_path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/convert_usvg_path.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f954848495280610536cb1136047d93fd82e10ade896c2a06f36731362d028a"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetPath::from_contours_and_faces (cognitive 24): TargetPath::from_contours_and_faces has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (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":"node-graph/libraries/vector-types/src/vector/click_target.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b2d4a390224cff71646642e652b70ce1606cdfb8744245c72dbcf08b9b742b"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::convex_hull::normalize_geometry (cognitive 24): vector_types::vector::algorithms::convex_hull::normalize_geometry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 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":"node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34d288b1027b1b69e970e94650f62d82a60540d68e98e255cf464233ac60cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"brush_nodes::basic_brush::render::render (cognitive 24): brush_nodes::basic_brush::render::render has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (3 pts), boolean chains 2, 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":"node-graph/nodes/brush/src/basic_brush/render.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbc4758ef7ad3a1cfa4f4147cc2b96d9e745669333f8735043d4a6b43f49914"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::color_lookup_table::format_csp::parse (cognitive 24): raster_nodes::color_lookup_table::format_csp::parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/color_lookup_table/format_csp.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c87167a5af2f5d4c5fea144d523decc3a928e69387aaabb523c14d5b1613faf"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::spline (cognitive 24): vector_nodes::vector_nodes::spline has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bb85f1dc2d7c1ee8619aaff316c20dc46391db5325cab3bd5049a788b8ad33"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_run_internal_watch::watch (cognitive 24): cargo_run_internal_watch::watch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cargo-run/internal/watch/src/main.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"230ca65344cf826da40301ea197cc5719d738d48e09869157c1ef2fc118c1d98"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_run::cmd::supervise (cognitive 24): cargo_run::cmd::supervise has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 8 (11 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cargo-run/src/cmd.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f91024a8b9bff51f70d6df83576ab1c8ab32092def02517392b875231fcc18"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_message_tree::write_tree_html_node (cognitive 24): editor_message_tree::write_tree_html_node has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (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":"tools/editor-message-tree/src/main.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d4dc20247da2af343e61d25bccd00ece86df198011004f4ab314a54317278"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::mirror (cognitive 23): NodeNetworkInterface::mirror has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/apply.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a06bd7fb458fd15a65d9fa4e026dcf82527f03159a2157078ba2b1a8c96609"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::is_sole_dependent (cognitive 23): NodeNetworkInterface::is_sole_dependent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 2 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a185dfb25003d102e4ad9bb7a8899f0aff2ac74e6ad5dd175d6961680c635fd"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::complete_valid_input_types (cognitive 23): NodeNetworkInterface::complete_valid_input_types has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 4 (8 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c2af98d2568b6887b185e598e154c9ca7331a827679cfc82ff26514656b8bd"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelLayoutSubdivision::insert_split_adjacent (cognitive 23): PanelLayoutSubdivision::insert_split_adjacent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (23 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":"editor/src/messages/portfolio/utility_types.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6d807476bf1670555aa409da00217af46ce9d03da5fffacfa387657ffc4456"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::delete_point_and_break_path (cognitive 23): ShapeState::delete_point_and_break_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a319a049a15bf0b7b27beea08cecbe336b273af0ca7df659aad7b231fe98c3"}},{"ruleId":"D2","level":"warning","message":{"text":"PathToolData::update_colinear (cognitive 23): PathToolData::update_colinear has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43fed9c92d889faf73f331b7bbad9e0aedfc6886d5ed260723ec638c87a968b"}},{"ruleId":"D2","level":"warning","message":{"text":"PathToolData::start_sliding_point (cognitive 23): PathToolData::start_sliding_point has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (4 pts), boolean chains 2, 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86b844ac726cabc5dd0eaa5bff0e4983837d639b0b14929865874f3d43efdc2"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::data_panel::data_panel_message_handler::context_widgets (cognitive 23): graphite_editor::messages::portfolio::document::data_panel::data_panel_message_handler::context_widgets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (5 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":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabb3e8e6fe693f1dc49c3abdc4686021c1039e02a2836987543fa720c77e425"}},{"ruleId":"D2","level":"warning","message":{"text":"core_types::types::rewrite_ranked_type_wrappers (cognitive 23): core_types::types::rewrite_ranked_type_wrappers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/types.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c1a43f45c85f489de93984b0dd771a514d7c5b4eb500217ab9e0af6655a5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Gradient::interpolated_samples (cognitive 23): Gradient::interpolated_samples has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (linear_samples, subdivide). 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":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e318e5b12eaed825bae807ea4354b610f09641733b1e2ce0fb70537c62695ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentGraph::face_orbits (cognitive 23): SegmentGraph::face_orbits has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 3 (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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e13bee122e991f740f662daaf222cc790790cde2266ddd8e12ed50b3b48de"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::parsing::parse_node_type (cognitive 23): node_macro::parsing::parse_node_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"5198677ba64c958f80536f74e9909022c2fa274f905b8eb95faac27bb23361ea"}},{"ruleId":"D2","level":"warning","message":{"text":"graphene_std::render_background::render_background (cognitive 23): graphene_std::render_background::render_background has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (4 pts), boolean chains 2, match/switch 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":"node-graph/nodes/gstd/src/render_background.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"013ea883e8da5c5699ca9c6bdf75ec7801757bc21e62b1b9955ba73bc231d84c"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::filter::gaussian_separable (cognitive 23): raster_nodes::filter::gaussian_separable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (10 pts), match/switch 1 (2 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":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fad072b31b67ad42dcb331fe4d75607d9d5e2be4184a5d417700ee1c25a554"}},{"ruleId":"D2","level":"warning","message":{"text":"Lattice::spiral (cognitive 23): Lattice::spiral has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 6 (8 pts), match/switch 2 (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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab4778e590b3a031ed42d4ec480ce0ea500dc5a8abf6e5424dc501f9932f660"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_desktop::socket::run (cognitive 22): graphite_desktop::socket::run has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (9 pts), loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0b2e4d1b49b059f23e89fbf16419020719020804ebe84f9aa79d268268ef14"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_desktop_ui::remote::spawn::spawn_host (cognitive 22): graphite_desktop_ui::remote::spawn::spawn_host has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (7 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":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7de43db31d28006e7e89f92a1bbfa754a489af5744ba545a21ff493e28b5d2"}},{"ruleId":"D2","level":"warning","message":{"text":"migration_runner::node::apply_runs (cognitive 22): migration_runner::node::apply_runs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 8 (10 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/migrations/runner/src/node.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f85512eb0de7da42dfeaeb6f0c63901a3cfc2728ead2c74153b214740573d0"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::give_diverged_catalog_entries_new_ids (cognitive 22): NodeNetworkInterface::give_diverged_catalog_entries_new_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab05505643e21b94a26f8898af66afcc1e01197df1ba2f0265012504e2243ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Selected::revert_operation (cognitive 22): Selected::revert_operation has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (8 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b732b312e05108a6a010e847cb56dba1631f82374f7c4b08bb06c9163e0ba20"}},{"ruleId":"D2","level":"warning","message":{"text":"SweepAngleGizmo::overlays (cognitive 22): SweepAngleGizmo::overlays has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (21 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/sweep_angle_gizmo.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe41f63da9ab7e38d1304913f8ba47af0e1b7d4e9195fca28aaa0f096802fbc3"}},{"ruleId":"D2","level":"warning","message":{"text":"FreehandToolFsmState::transition (cognitive 22): FreehandToolFsmState::transition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1, 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":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a659f3dcabb52762538b979d53af6702a396493f3002594794689e3ed6680dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::renderer::render_graphic_item_to_vello (cognitive 22): rendering::renderer::render_graphic_item_to_vello has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"7189afcba91ec18d518398af86727a785c8e37b0c84f05ac6fda6951d7ff49c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentGraph::construct_faces (cognitive 22): SegmentGraph::construct_faces has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"6770ea29deaff91e1485088c6f794c1a05819381c7a941a4958266af9f37c16e"}},{"ruleId":"D2","level":"warning","message":{"text":"PointModification::move_in_place (cognitive 22): PointModification::move_in_place has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"708146a285ab19dff0449f93d9048a06564d04561cba55f04961b7d0a1cdaa8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::auto_join_paths (cognitive 22): Vector::auto_join_paths has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1143f1b3887490ef9606d9be39b90bb4209919bac4b929e0a01c6db738fda0"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::fill (cognitive 22): vector_nodes::vector_nodes::fill has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (6 pts), match/switch 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d5fbd76d75083a418bd611a6ef11330487684b10f7d29ff5b97dd5c9d7ad40"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::round_subpath_corners (cognitive 22): vector_nodes::vector_nodes::round_subpath_corners has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5342165b6e5c1e45f381d50df109407a69a2e467c27bfd95c71c0988f54a137"}},{"ruleId":"D2","level":"warning","message":{"text":"carousel.initializeCarousel (cognitive 22): carousel.initializeCarousel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, ternaries 1 (nesting depth added 8). None of this is in the body itself: all 22 points belong to 8 function literals inside it that branch (lines 94, 36, 88, \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":"website/static/js/component/carousel.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2ecb93cb45f3ee61db4398eff7249bd619e05cfa0ec49ee8ae6a8bedc107ef"}},{"ruleId":"D2","level":"warning","message":{"text":"navbar.setRipples (cognitive 22): navbar.setRipples has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/static/js/navbar.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb0d64e0d1f7bbdeecce07e41460f672d73c3ea4b61027e8373a9575c83bfd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorPickerMessageHandler::pickers_and_gradient_layout (cognitive 21): ColorPickerMessageHandler::pickers_and_gradient_layout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 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":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"371ce56a793eb814bdb597b609e08ca0c5487994abcc3ee254e4ca0695b2a905"}},{"ruleId":"D2","level":"warning","message":{"text":"InputPreprocessorMessageHandler::process_message (cognitive 21): InputPreprocessorMessageHandler::process_message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_preprocessor/input_preprocessor_message_handler.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aba30a525efdc8091b44d3285dee6c53641a7ef77c83e1a5fba42e7be10c774"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::remove_references_from_network (cognitive 21): NodeNetworkInterface::remove_references_from_network has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), match/switch 1 (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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f92f8e08b4f81006696f2756e9b1845c04756845b89f74620a14d5a17ffffd"}},{"ruleId":"D2","level":"warning","message":{"text":"Resize::snap_box (cognitive 21): Resize::snap_box has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 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":"editor/src/messages/tool/common_functionality/resize.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"120b63be3dd3ddf9bcee67965455c4113bf0e0b66b173838a23d5de3e039218c"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::renderer::render_gradient_item_svg_with_thumbnail_rect (cognitive 21): rendering::renderer::render_gradient_item_svg_with_thumbnail_rect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 pts), loops 1, 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a247cef38611f18412e6c0767db78c83238be7d46b4cc1f849aa1b22a7f0dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::vector_attributes::reverse_spans_in_place (cognitive 21): vector_types::vector::vector_attributes::reverse_spans_in_place has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282147d431bdaf3b0287717fa13724508316d93eb46a1ffcf6dc9eccfa89a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::parsing::parse_inputs (cognitive 21): node_macro::parsing::parse_inputs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c43c8f5bd254f18f825055a95e3e7cf3a55cc46fc0ba8c85daba2d59071134"}},{"ruleId":"D2","level":"warning","message":{"text":"graphene_std::render_cache::split_oversized_region (cognitive 21): graphene_std::render_cache::split_oversized_region has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (5 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":"node-graph/nodes/gstd/src/render_cache.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32d69c04e34f440fbfa8aedaf2076e2227905f13e38158d648efcc0c5380455"}},{"ruleId":"D2","level":"warning","message":{"text":"text_nodes::string_capitalization (cognitive 21): text_nodes::string_capitalization has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca81897ae9ddbdc32b8de2504b100ab1723458ad57d8956afe5376a1943ab66a"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split (cognitive 21): vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (5 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. This shape REPEATS in the file: 2 other methods here (vector_nodes::vector_nodes::bevel_algorithm::sort_segments, vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments) 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65c368d3ddbc682500b9e246ea68386f3de4ab83d1ddcee61673ab84b27ebd1"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_proc_macros::discriminant::derive_discriminant_impl (cognitive 21): graphite_proc_macros::discriminant::derive_discriminant_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (9 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":"proc-macros/src/discriminant.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7859e72d82030b233656aaff1ab5811fc34880f7bc9119a2df1b9254af1572c"}},{"ruleId":"D2","level":"warning","message":{"text":"crate_hierarchy_viz::main (cognitive 21): crate_hierarchy_viz::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 pts), 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":"tools/crate-hierarchy-viz/src/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49d2d64aa270085c1c359e688a069362821463de493dbd82565ad22c724deee"}},{"ruleId":"D2","level":"warning","message":{"text":"persistence.migrateToNewFormat (cognitive 21): persistence.migrateToNewFormat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 174). 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":"frontend/src/utility-functions/persistence.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4d6d48d7a77de2728d399b9f182a2bd003ed3dbba261e70626edb70303b88"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::try_set_upstream_to_chain (cognitive 20): NodeNetworkInterface::try_set_upstream_to_chain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"275cb0a0a1a8c745a26790d2987817ad3fe357884481b85eabe04ebdfa60d425"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::post_node_with_index (cognitive 20): NodeNetworkInterface::post_node_with_index has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe12af5bb4f8c4f55fa4e4503fdf3c5e5e6ecae9c4bafe151ad2e67353dc6b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"BrushToolFsmState::transition (cognitive 20): BrushToolFsmState::transition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/brush_tool.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f5ab477a5cbf83d80115bb67c183790bda38abaaeeb00fc77efc3cfc053d42"}},{"ruleId":"D2","level":"warning","message":{"text":"HintData::to_layout (cognitive 20): HintData::to_layout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (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":"editor/src/messages/tool/utility_types.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75304f0bd232e521797802b9a409d93605d5fa672d1cc04d5dc88ac607bb9cb"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRuntime::run (cognitive 20): NodeRuntime::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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":"editor/src/node_graph_executor/runtime.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"473a3eac887a5a946676906f1aaffc9433f32b8a8e46d804ce20e122af46ec0b"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::document_node_derive::post_process_nodes (cognitive 20): graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::document_node_derive::post_process_nodes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), 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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions/document_node_derive.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06ffcbc834e6c12ef080c2cef1c8734b882d62e0c17787e0ccc614aca2ad1bc"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::network_interface::reconcile::field_deltas (cognitive 20): graphite_editor::messages::portfolio::document::utility_types::network_interface::reconcile::field_deltas has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/reconcile.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3601476f19e6c09469c070a59aa87db0b5e9e00c25693714c3e2af4aeebd357f"}},{"ruleId":"D2","level":"warning","message":{"text":"MatrixNode::eval_in (cognitive 20): MatrixNode::eval_in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/executer.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"889f663365112edda07210be321813522bc3aff392658f6203bed37ac7b6f5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_number (cognitive 20): Lexer::lex_number has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, 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":"libraries/math-parser/src/lexer.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5411e01f42e28831a604aa2690e1d5209712390dfa571a70db29a094e2d48ec"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::snap::snap_features (cognitive 20): snapping::snap::snap_features has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/snapping/src/snap.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f88bb6f0eb4c251338a900da1b4fc9847627411fc43c9f9186d9a36e78b3f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetwork::remove_dead_nodes (cognitive 20): NodeNetwork::remove_dead_nodes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 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":"node-graph/graph-craft/src/compiler/flatten.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7f621eaabf806ce4f9b8f97b677d1b77ca21da5c8bdde414c44d7fd8421e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"graphene_cli::main (cognitive 20): graphene_cli::main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 pts), 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":"node-graph/graphene-cli/src/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d97fd35485bfa9989c47c6a6d4fe4097deca5b2f1aa57f3c29ac6559ea9f67"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::render_ext::render_gradient_paint (cognitive 20): rendering::render_ext::render_gradient_paint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (3 pts), 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":"node-graph/libraries/rendering/src/render_ext.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecea82a67e384363a69119f43b5bff2c9725df65ab083090f7c19f35f2495db8"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::bezpath_algorithms::compute_sample_locations (cognitive 20): vector_types::vector::algorithms::bezpath_algorithms::compute_sample_locations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 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":"node-graph/libraries/vector-types/src/vector/algorithms/bezpath_algorithms.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f19bf5702b391ded04e4da2413270b5bb7522e3f34ae08182d3f2c336092d24"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::normalize_geometry (cognitive 20): vector_types::vector::algorithms::concave_hull::normalize_geometry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"443566edbe71bb0124e2239b70df6de41dc37effd5b5730b95031607464edc6c"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::convex_hull::extract_contacts (cognitive 20): vector_types::vector::algorithms::convex_hull::extract_contacts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c5859da242b22e6bf2d5fa505d80e692391b96ca93fca909647e1cf3fb34a9"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::std_nodes::noise_pattern (cognitive 20): raster_nodes::std_nodes::noise_pattern has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (5 pts), match/switch 5, 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":"node-graph/nodes/raster/src/std_nodes.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b55045dfc3817747c7e7cde2b8337f1ba1b33dbb5fd767fbdb0c844ef6813c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Lattice::new (cognitive 20): Lattice::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), boolean chains 2, 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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1925aa993332f9cc929bab00446bffc6b596171f66d12f618b828e643512e873"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_proc_macros::message_handler_data_attr::message_handler_data_attr_impl (cognitive 20): graphite_proc_macros::message_handler_data_attr::message_handler_data_attr_impl has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (5 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":"proc-macros/src/message_handler_data_attr.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a690b9d9223aaa7a886cb9c4827067edf055654f8a60f37705cef87b65e171"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorSession::dispatch (cognitive 20): EditorSession::dispatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/web-editor-driver/src/session.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b237baac8495be34ed590e6dd8a22825149302b340bfa67e803807c20581761"}},{"ruleId":"D2","level":"warning","message":{"text":"clipboard.readAtCaret (cognitive 20): clipboard.readAtCaret has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, ternaries 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":"frontend/src/utility-functions/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1188ba2e5a9bcb4ce37eae11b9157c5e3920bc671f5f7ef443f1e5555c6bb926"}},{"ruleId":"D2","level":"warning","message":{"text":"membership.window.addEventListener(\u0022DOMContentLoaded\u0022) (cognitive 20): membership.window.addEventListener(\u0022DOMContentLoaded\u0022) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3 (nesting depth added 2). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 87, commit, a function literal at line 136, \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":"website/static/js/page/membership.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62acd86672a5dd92514c6002bbb73337abc625d541143dbe1473ea91133631d"}},{"ruleId":"D2","level":"warning","message":{"text":"book.trackScrollHeadingInTOC::updateVisibleHeading (cognitive 20): book.trackScrollHeadingInTOC::updateVisibleHeading has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, 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":"website/static/js/template/book.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"84771c3f15e2d45bde7e28c8b01f28c3c7cfc539b0f6fd7de35232626240b6f2"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::remove_export (cognitive 19): NodeNetworkInterface::remove_export has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5c4522779cc3376fdc12e792bd806960cee871d08303bb2a071b10cd1df375"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformOperation::hints (cognitive 19): TransformOperation::hints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"445fd3cfd185b37ccbd9f4409f97923a02c75d761a6294ca8bdf1951b3be618a"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncMessageHandler::poll_document (cognitive 19): SyncMessageHandler::poll_document has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec28782057ea36bce360991a38ed653a2ef1ca696b2e00a1a26a40e3c254123"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::close_selected_path (cognitive 19): ShapeState::close_selected_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"0614f469901abcfc18981957d0ddb307efd65590846f62e8994eec39b616de1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::disable_colinear_handles_state_on_selected (cognitive 19): ShapeState::disable_colinear_handles_state_on_selected 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fb4f379fb8516fe7da9c37f424f8aeda98537d0ada6181ec90da4aa8d50480"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectedEdges::new_size (cognitive 19): SelectedEdges::new_size has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab4bad28956a53e7bb8287a31fbff5dc9bd83a014f47a72eb44d98722613a64"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectedEdges::skew_transform (cognitive 19): SelectedEdges::skew_transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a0dbb03dbe33a4a30cd472335ea32efb434c5cb361c58b93572770c6d20d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::graph_operation::utility_types::set_stroke_paint_order (cognitive 19): graphite_editor::messages::portfolio::document::graph_operation::utility_types::set_stroke_paint_order has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts), loops 2, 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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8cf56412facb98516268787c3d1588278e5ab2f1cf6a0259ed073d5d57ab70"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::graph_modification_utils::get_gradient_stops (cognitive 19): graphite_editor::messages::tool::common_functionality::graph_modification_utils::get_gradient_stops has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"a783f508e3e07ae6e69722fe14aaf07a5a932c77a85090808bdf9fdfd16d6b19"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::highlight::mark_exponents (cognitive 19): math_parser::highlight::mark_exponents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 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":"libraries/math-parser/src/highlight.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1497aa0528bd7330c22be6d047e6acf11f499364dea316a8c02664f6ea57129"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::solve::solve (cognitive 19): snapping::solve::solve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 6 (7 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/snapping/src/solve.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"7109f0deb11fdd03b9bd6626607796a88d43a75bcd46b3d199d2ed67188b94ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh::locate (cognitive 19): Mesh::locate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1d84da2d5f3cb7d58ee1b11a8341da6ef25039ee543d9683af55e960415797"}},{"ruleId":"D2","level":"warning","message":{"text":"ObstacleGrid::nearest (cognitive 19): ObstacleGrid::nearest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bfabd480e8706cc5d7e29358ac984acac96b694e3d6e11c1a2a68ff7fa27c8"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorModification::follow_segments_turned_elsewhere (cognitive 19): VectorModification::follow_segments_turned_elsewhere has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c335ccb2e9a56ca0cc60eea00122b80772d652e910a2beee7186232edc414adc"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::validation::validate_min_max (cognitive 19): node_macro::validation::validate_min_max has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1da7128bf44d05124c9a9de059b453b21652f6347beaab8c8640d3a513d129"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::color_lookup_table::format_3dl::parse (cognitive 19): raster_nodes::color_lookup_table::format_3dl::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/color_lookup_table/format_3dl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"377c02b5975f74f365212823252f0e6dc86cdfe5583f0ccddfece93feebd0ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::std_nodes::channels_to_image (cognitive 19): raster_nodes::std_nodes::channels_to_image has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3, loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/std_nodes.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2612fd4b08f6ef8a57efb57ba5d44f2863159f7bb0fc73684ec6eb2a20bafd88"}},{"ruleId":"D2","level":"warning","message":{"text":"text_nodes::text_context::for_each_styled_glyph_run (cognitive 19): text_nodes::text_context::for_each_styled_glyph_run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (3 pts), match/switch 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":"node-graph/nodes/text/src/text_context.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"25953195f502bfa79a150516082411db494f4447d55a2db6a6169fe42603d59d"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::pack_strips (cognitive 19): vector_nodes::vector_nodes::pack_strips has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4, 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8216eb1620d5ddc7397e70db299ebcff6b40e162d752a46b419dbf06fb92c232"}},{"ruleId":"D2","level":"warning","message":{"text":"input.tabBetweenTextFields (cognitive 19): input.tabBetweenTextFields has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 5 (6 pts) (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4b6486cc2b0a4d402cdea061488122145173a918951ccd48d86d379ed0939d"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_desktop::start (cognitive 18): graphite_desktop::start has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 6 (7 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/lib.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6323964f826d525c845e8d522bbb4bb54bb6e6c36e4ff027caef78c6f338045b"}},{"ruleId":"D2","level":"warning","message":{"text":"migration_runner::format::run_format_migrations (cognitive 18): migration_runner::format::run_format_migrations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), match/switch 2 (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":"document/migrations/runner/src/format.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8d9091b3a907cba3e027f7c14bd257708db1b37a18acc4df8d140c7c4f2a89"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffUpdate::apply_keyboard_shortcut (cognitive 18): DiffUpdate::apply_keyboard_shortcut has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), match/switch 4 (nesting depth added 6). Of this number, 10 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a2bb7b22ebcebaa92bc047f40190ddfe4dbe82b4bbb40c38fdf3e1e91250a0"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentMessageHandler::has_selected_descendant_in_graph (cognitive 18): DocumentMessageHandler::has_selected_descendant_in_graph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cfd07845b59d5832a16453379fce1a05fc4e7b074146436c447b95dab6a704"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlaysMessageHandler::process_message (cognitive 18): OverlaysMessageHandler::process_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/overlays_message_handler.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b20037f738ace75385b31f9f0ab5135045950fe542baaef318e3e522d4543dd"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelLayoutSubdivision::recalculate_default_sizes (cognitive 18): PanelLayoutSubdivision::recalculate_default_sizes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/utility_types.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"6947b0864afcd12274dc549d9dba439ed3971028cfbf728c6c545d7d99a146e4"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspacePanelLayout::restore_panel_to_default_position (cognitive 18): WorkspacePanelLayout::restore_panel_to_default_position has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2, 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, 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":"editor/src/messages/portfolio/utility_types.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f8822a54a2972fe0a4203b46939657a3aeddbbdaa4c72209aa0961667b1dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"NumberOfPointsDial::handle_actions (cognitive 18): NumberOfPointsDial::handle_actions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9bb1cde1bba0fcafe96e22243556566f9889c620d6106c958a6528b5d86ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"PenToolData::place_handle_or_segment (cognitive 18): PenToolData::place_handle_or_segment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba25c1967d61d7195c59a7d117f1bd468316e6a4c131722325c282ceaa589a41"}},{"ruleId":"D2","level":"warning","message":{"text":"PenToolData::adjust_handle_length (cognitive 18): PenToolData::adjust_handle_length has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfc85847847856044ca6785a10328926dfda5bc132166008217ecc2dc68a02a"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::graph_operation::graph_operation_message_handler::extract_graphite_gradient_stops (cognitive 18): graphite_editor::messages::portfolio::document::graph_operation::graph_operation_message_handler::extract_graphite_gradient_stops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (5 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":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b413d5e458f3eda3134987730feed45310dc04511b9aaea8225db7489331902"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::network_interface::storage_metadata::apply_network_view_settings (cognitive 18): graphite_editor::messages::portfolio::document::utility_types::network_interface::storage_metadata::apply_network_view_settings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, match/switch 1 (3 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":"editor/src/messages/portfolio/document/utility_types/network_interface/storage_metadata.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe36d7f38b2e0dd458c31633d88fe08b6b0cef2d0c0f9e7c7ea6ffafa27f41c4"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::utility_types::wires::build_vector_wire (cognitive 18): graphite_editor::messages::portfolio::document::utility_types::wires::build_vector_wire has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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":"editor/src/messages/portfolio/document/utility_types/wires.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c18e1ebc39d1a6cff676f0e7445da40e47139d114871f082ec916734c6abbe0"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_migration::document_migration_replace_resources_referenced_by_hash (cognitive 18): graphite_editor::messages::portfolio::document_migration::document_migration_replace_resources_referenced_by_hash has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 7). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (collect_resources_referenced_by_hash). 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb27b1363ac4ba69bd462b769853b5e884ee00d8e40b852367a5f65d052d0cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::snap_session::scene_mirror::mirror_layer (cognitive 18): graphite_editor::messages::tool::common_functionality::snap_session::scene_mirror::mirror_layer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/snap_session/scene_mirror.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e720728e8d1f408a27900ef2cbcbdd0dbc58b04ac8a148263f5df3648c24906"}},{"ruleId":"D2","level":"warning","message":{"text":"Sorter::clause (cognitive 18): Sorter::clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (7 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":"libraries/math-parser/src/sort.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"34514a9096e85b7809f3292842b774bd5c57460a718d0ea3f4c53d53d545d873"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::constants::clamp_to_region (cognitive 18): math_parser::constants::clamp_to_region has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/constants.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ecb6546992567693e4e1ccb95160a0ade782478916d46dc0c75f85579e0a61"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::executer::value_of_matrix (cognitive 18): math_parser::executer::value_of_matrix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/executer.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0b446dcb718e6b4d17bd6e9da378118ec2eaf0e43ae13cee62da09d9ac3cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::vector::algorithms::concave_hull::strand_partners (cognitive 18): vector_types::vector::algorithms::concave_hull::strand_partners has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), match/switch 3 (6 pts), boolean chains 3, loops 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"d402aa658338da3ac6e2058089b9b5722b692d117f3144e1d50306eb228f71ad"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::validation::validate_no_item_parameters (cognitive 18): node_macro::validation::validate_no_item_parameters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"338135b5c5246a75c066eaa4ecf3d88212e4a69fe34f4fa57b7fff53d6b7e294"}},{"ruleId":"D2","level":"warning","message":{"text":"graphene_std::render_cache::render_output_cache (cognitive 18): graphene_std::render_cache::render_output_cache has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (7 pts), if/else 6, boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gstd/src/render_cache.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae5c029cf9d7995d05ac35b657239153798b62332d7435c4aec7f4b77b9423e"}},{"ruleId":"D2","level":"warning","message":{"text":"carousel.updateVideoSyncForTransitions (cognitive 18): carousel.updateVideoSyncForTransitions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3 (nesting depth added 6). 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 items inside it that branch (syncTornVideos, a function literal at line 297). 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":"website/static/js/component/carousel.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5078f05805c3f25074804d8f6b2b9442b019ab19b3d130cb200fac86eecf560"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaneReceiver::recv (cognitive 17): PlaneReceiver::recv has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 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":"desktop/ui/src/frames/plane/linux.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7f168d3519553ea605e112919ca8a700c4c9ed963264627fb90388abf4fdad"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameStreamer::publish (cognitive 17): FrameStreamer::publish has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 pts), boolean chains 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":"desktop/ui/src/frames/streamer.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e44aad64afff132d3605f632be001d39dc0b82c7dbb174818af999df06cfee1"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_desktop_ui::remote::spawn::event_receiver_loop (cognitive 17): graphite_desktop_ui::remote::spawn::event_receiver_loop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 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":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"777bcfc7c05eac22e970e0628b50e938751a524b602f65c76192f3ef79edc116"}},{"ruleId":"D2","level":"warning","message":{"text":"document_container::backends::opfs::list_entries (cognitive 17): document_container::backends::opfs::list_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 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":"document/container/src/backends/opfs.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b53736fdb08553943f07eb8cd5381f9153066d30bb09067c22d35d22be9da1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentMessageHandler::collect_descendant_tree_paths (cognitive 17): DocumentMessageHandler::collect_descendant_tree_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":2914}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff678d2f90e4e9df16a19d44d72b9d6e924e30c76d5ad77ffc34d66753d249d"}},{"ruleId":"D2","level":"warning","message":{"text":"ModifyInputsContext::gradient_stops_set (cognitive 17): ModifyInputsContext::gradient_stops_set has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8d649bd8302e0cf72be7baf336f48856df3a6175f951e0e84c8707c1edc649"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeGraphMessageHandler::wire_to_insert_on (cognitive 17): NodeGraphMessageHandler::wire_to_insert_on has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, loops 2 (3 pts) (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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":3207}}}],"partialFingerprints":{"codehealthFindingId/v1":"724acd1ba1cbb473acfd4f549ee01a7fbb009a19caf028618b602615ed2167c8"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::combined_document_bounds (cognitive 17): NodeNetworkInterface::combined_document_bounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"241e5b58221a1f2829487f8bb91d92d43ffba3b35d9160e86717a8bb37f3dfd3"}},{"ruleId":"D2","level":"warning","message":{"text":"SweepAngleGizmo::handle_actions (cognitive 17): SweepAngleGizmo::handle_actions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/sweep_angle_gizmo.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"067ee4563f3ed5a81f40d46628d3333e956d81b0760116672e06f3f543256e47"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeState::select_handles_and_anchor_connected_to_current_handle (cognitive 17): ShapeState::select_handles_and_anchor_connected_to_current_handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), match/switch 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"959c1941938acc8d2e7f3320349c9cb501743444d190e73f1b6fd7843b78a70b"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectedEdges::snap_stretch (cognitive 17): SelectedEdges::snap_stretch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 5, loops 2, match/switch 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":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1974a574d85d45d0ad89c6298ef5292874e4ab5d4e5d02c537a439e943da40"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRuntime::process_monitor_nodes (cognitive 17): NodeRuntime::process_monitor_nodes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"editor/src/node_graph_executor/runtime.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa6c7232efd0774ae2e5a1f93e9c325d23a4bc82b33edab8a54a001d49f1623"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::overlays::grid_overlays::grid_overlay_rectangular_dot (cognitive 17): graphite_editor::messages::portfolio::document::overlays::grid_overlays::grid_overlay_rectangular_dot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 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":"editor/src/messages/portfolio/document/overlays/grid_overlays.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2c65d0997f280075d827a7bd20efd1e9f2c83feaf69a96183d3fd07ffe3f36"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document_storage_io::load_legacy_document (cognitive 17): graphite_editor::messages::portfolio::document_storage_io::load_legacy_document has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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":"editor/src/messages/portfolio/document_storage_io.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"357350359d422bef364bb8a7ee58507a4021eb4d9b73bdbdccd9de7445be15a7"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::select_tool::drag_shallowest_manipulation (cognitive 17): graphite_editor::messages::tool::tool_messages::select_tool::drag_shallowest_manipulation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ebc075ae659a96d88ed65cd7d364022d75d496750c981295974dcf48c4ab28"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::transform_layer::transform_layer_message_handler::update_colinear_handles (cognitive 17): graphite_editor::messages::tool::transform_layer::transform_layer_message_handler::update_colinear_handles 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":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"2716bda5d77e18f4226ee070fe1b2a18ce5d840f63f908251e0f7a9746697c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_wasm_wrapper::helpers::render_image_data_to_canvases (cognitive 17): graphite_wasm_wrapper::helpers::render_image_data_to_canvases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (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":"frontend/wrapper/src/helpers.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7ed20472c89535471900ef031103b088b19a04a2c2b2577d8993d552bc6b13"}},{"ruleId":"D2","level":"warning","message":{"text":"rawkit::decoder::arw2::sony_arw2_load_raw (cognitive 17): rawkit::decoder::arw2::sony_arw2_load_raw has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (4 pts), match/switch 1 (4 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":"libraries/rawkit/src/decoder/arw2.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"22da6024c81113117b3a16b12b5ac6fc5182c50b59e0adbdfd4feefc6872bc9d"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetwork::replace_node_with_its_exports (cognitive 17): NodeNetwork::replace_node_with_its_exports has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (5 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/compiler/flatten.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bec31cd86ef750bfb1e0b7d9702ada3486367ff1e2af93c72c380450beb5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rendering::renderer::render_graphic_item_svg (cognitive 17): rendering::renderer::render_graphic_item_svg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b05792383b487f21f9b49293112cbbf8efce9cafade2320863fc0b545f090d"}},{"ruleId":"D2","level":"warning","message":{"text":"Connectivity::build (cognitive 17): Connectivity::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/connectivity.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8deebd209bebce22f1a24d56e35aa152ae6247e12552590f95d6a72fe993d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_types::gradient::hue_delta (cognitive 17): vector_types::gradient::hue_delta has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0cfb26016cc076fd9846221fdf55c5c3a2b9b72b958ee45c23646a6660fef9"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::adjustments::selective_color (cognitive 17): raster_nodes::adjustments::selective_color has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 4 (6 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":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba78198868a5be365879a65382157bd433925577eab2a1d6babf8c5bd39850f2"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::filter::box_separable (cognitive 17): raster_nodes::filter::box_separable has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8ce102b6ff110fafad0840a572c908037b7344d647377279c28fd0c3b844f0"}},{"ruleId":"D2","level":"warning","message":{"text":"text_nodes::string_pad (cognitive 17): text_nodes::string_pad has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 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":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"93735398cbfdbf36641167f19ff8eb9e9119eb1c6fbb8c8a588cde73a539bfce"}},{"ruleId":"D2","level":"warning","message":{"text":"Lattice::chain_outline (cognitive 17): Lattice::chain_outline 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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2dcf0cdf854c9a4b56f7c3beb648a7a938ac48f5d0e688cd33c63617ed2cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::sample_polyline (cognitive 17): vector_nodes::vector_nodes::sample_polyline has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bbd00f9ba579bc6d2b0c9f99392c1b977a784e25c50eefba359066678bd773"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::voronoi::clip_to_convex (cognitive 17): vector_nodes::voronoi::clip_to_convex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 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":"node-graph/nodes/vector/src/voronoi.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6aebb0b0e9bde97088956b14a12e77bcacac04ecff215ab3185d1bfb1af0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"BlobStore::absorb (cognitive 16): BlobStore::absorb has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 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":"document/format/src/blob_store.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5cad1dee99c1f89ffab74716c8f381c7f35bc63458dc5d956518940ca19abd"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutGroup::diff (cognitive 16): LayoutGroup::diff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a951f40272076baad9d2f6d4c5b2159aab1242d9f0f27f1114fdc506725124b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentMessageHandler::group_selected_layers (cognitive 16): DocumentMessageHandler::group_selected_layers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"147f96e56c3634b958cdce498f01e14227a45400824c0acecdfcc31189d06346"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowIter::next (cognitive 16): FlowIter::next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4847dac1ac55945b976d0eb2981644cef214d3055e33fc5a4d0e99f66e53128c"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::compute_outward_wires (cognitive 16): NodeNetworkInterface::compute_outward_wires has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9397a5e759c26baaa24e1d669de4b265c8ddcecf4b9cfe5fa250df9a30194a8"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::shift_node (cognitive 16): NodeNetworkInterface::shift_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"1429f7b7c457ca92505563060d76c28801c575cdc12d62c69a43a9220bcc73c0"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::from_old_network (cognitive 16): NodeNetworkInterface::from_old_network has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), 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":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec06109d5bfc807fae3bab2b738ec4e3e7d1ec9da6548080daf59949de2d3bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetworkInterface::carry_definitions (cognitive 16): NodeNetworkInterface::carry_definitions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 3 (4 pts), match/switch 2 (4 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":"editor/src/messages/portfolio/document/utility_types/network_interface/store/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7117d448a1a7f1298908594b69c0ccf9d426689f6ef8693127f9e3909e2fafb8"}},{"ruleId":"D2","level":"warning","message":{"text":"FontsMessageHandler::process_message (cognitive 16): FontsMessageHandler::process_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/fonts/fonts_message_handler.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2ecdfeee8e314a7d2c1860f9f27882a423d31c7f29953bfcae70a934b5cb40"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapSession::draw_overlays (cognitive 16): SnapSession::draw_overlays has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (6 pts), 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":"editor/src/messages/tool/common_functionality/snap_session/presenter.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"222d8eabd8f8539a9d58646cc9f2acd0657b9a8afb54753b969b2381095e0231"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigateToolFsmState::transition (cognitive 16): NavigateToolFsmState::transition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"editor/src/messages/tool/tool_messages/navigate_tool.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1f7bb4f02062032179eaa95f0d7b4dc1f4835031babd34ce960bbf95db0886"}},{"ruleId":"D2","level":"warning","message":{"text":"PathToolData::slide_point (cognitive 16): PathToolData::slide_point has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8385534b45bbc1831f11c529f3037845815d943677ce03ccff4408313659ad6a"}},{"ruleId":"D2","level":"warning","message":{"text":"PenToolData::bend_from_previous_point (cognitive 16): PenToolData::bend_from_previous_point has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df3307e7fe5a28b4ebe24fe78b53fe52366138297a37af411d54ebd7484bbaf"}},{"ruleId":"D2","level":"warning","message":{"text":"PenToolData::swap_handles (cognitive 16): PenToolData::swap_handles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ed70472b1f7b9470047eba1832aedc8473c8875c43b8d855e3996cb1118558"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::portfolio::document::graph_operation::graph_operation_message_handler::declared_color_interpolation (cognitive 16): graphite_editor::messages::portfolio::document::graph_operation::graph_operation_message_handler::declared_color_interpolation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 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":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a339c747c8aaf9e0caf0f0071885bb3d746b1aa54f85570dfebab726f86a92a4"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::common_functionality::graph_modification_utils::replaceable_paint_chain (cognitive 16): graphite_editor::messages::tool::common_functionality::graph_modification_utils::replaceable_paint_chain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7f31f564dddfb64dd14bae226825bfb0bc18a8c107e5c015ea2fc82fa638a4"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::gradient_tool::apply_gradient_update (cognitive 16): graphite_editor::messages::tool::tool_messages::gradient_tool::apply_gradient_update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"0610b7033007dedf64707b114728eb61292517add7047ed12bcf1a0282eae32b"}},{"ruleId":"D2","level":"warning","message":{"text":"graphite_editor::messages::tool::tool_messages::path_tool::calculate_lock_angle (cognitive 16): graphite_editor::messages::tool::tool_messages::path_tool::calculate_lock_angle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54c6d383a9074b89b7e7bdcbaaee472a2d6dcb8171f7e6ad737a9c4368f8407"}},{"ruleId":"D2","level":"warning","message":{"text":"Sorter::call (cognitive 16): Sorter::call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, 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":"libraries/math-parser/src/sort.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cf94690be500223e022387b7d88009e3b9017a117b62acbbe7ba5220969520"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::highlight::draw_literals (cognitive 16): math_parser::highlight::draw_literals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 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":"libraries/math-parser/src/highlight.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfe0b901672161efe75f511d9e689ad2d4cd36de0637a21f45fb9b66190e018"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::lexer::classify_bars (cognitive 16): math_parser::lexer::classify_bars has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/lexer.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"044d93445bc1f080c476ea58280df221f66b8c184283709a10f89c141b9ec0d3"}},{"ruleId":"D2","level":"warning","message":{"text":"math_parser::parser::oversized (cognitive 16): math_parser::parser::oversized has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 5). 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":"libraries/math-parser/src/parser.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8c71a12d63c3fe1b9d8da477dacc9d42b06b622d3ddd6831bedec5728a7dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"snapping::curve::roots_between (cognitive 16): snapping::curve::roots_between has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/snapping/src/curve.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d703b75860bf9dba265c2dd6e3bcb382879a990e4b8fa980ac86b4af8711d8"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeNetwork::lift_nested_networks (cognitive 16): NodeNetwork::lift_nested_networks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (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":"node-graph/graph-craft/src/document.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6942d8203530b0e636314792b011c869acc4b41c728d09b95f89c595b58c3980"}},{"ruleId":"D2","level":"warning","message":{"text":"graph_craft::application_io::http::send (cognitive 16): graph_craft::application_io::http::send has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (5 pts), boolean chains 3 (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":"node-graph/graph-craft/src/application_io/http.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a858bc58d1c042cd3c769a2eef3a64648d7ad38c0b320cf7bbac4334d10179e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::connected_points (cognitive 16): Vector::connected_points has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), 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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb480afc84718c3a9c9ff3201b50593969a8464718f018d84b509540da585e0"}},{"ruleId":"D2","level":"warning","message":{"text":"node_macro::derive_choice_type::derive_enum (cognitive 16): node_macro::derive_choice_type::derive_enum has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 5, 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":"node-graph/node-macro/src/derive_choice_type.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a06c45d160259e57db499f58b0f8c93ed38092a01b3e0425cd80768130abba6"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_nodes::image_color_palette::image_color_palette (cognitive 16): raster_nodes::image_color_palette::image_color_palette has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/image_color_palette.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"85db0c4390d58c3fcdecd161c1c296ceb75d36564c75f34741df199d47bbaad5"}},{"ruleId":"D2","level":"warning","message":{"text":"text_nodes::string_occurrences (cognitive 16): text_nodes::string_occurrences has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 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":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"61edcb5913598a6b6549def316af5004f8200d3053430678930d4f1b8fb13c98"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::generator_nodes::rectangle (cognitive 16): vector_nodes::generator_nodes::rectangle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 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":"node-graph/nodes/vector/src/generator_nodes.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cdf82c9a97a2a00a5770e3c4b749996e52e21d8b000d331402dcffaba0f2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::evaluate_path (cognitive 16): vector_nodes::vector_nodes::evaluate_path 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"759020702039c51c328a7e98a4ca4e1bf0dd20e7ebdfc4a6cdc5d2bb948c5420"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::morph::lerp_appearance (cognitive 16): vector_nodes::vector_nodes::morph::lerp_appearance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, loops 2, match/switch 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. This shape REPEATS in the file: one other method here (vector_nodes::vector_nodes::morph) 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3038}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5f3d826290c34f3ccdece87e007d0f9bb5f022f8024822836950fed5f8ca47"}},{"ruleId":"D2","level":"warning","message":{"text":"vector_nodes::vector_nodes::bevel_algorithm::sort_segments (cognitive 16): vector_nodes::vector_nodes::bevel_algorithm::sort_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), 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. This shape REPEATS in the file: 2 other methods here (vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split, vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments) 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"33630596807e67f80feadd341a696295b6e47d53f54153f0fee8dfe9f1f4f979"}},{"ruleId":"D2","level":"warning","message":{"text":"Preprocessor::replace_inputs_with_producer_nodes (cognitive 16): Preprocessor::replace_inputs_with_producer_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (4 pts), match/switch 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":"node-graph/preprocessor/src/lib.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cb16cdeba976a568af0334c21c3fcbf01e8e0a7a57ba0ad4d0ea2e62c7b6c9"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_run_internal_download::extract_tar_gz (cognitive 16): cargo_run_internal_download::extract_tar_gz has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cargo-run/internal/download/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cc3671694a64f11e08e1bbb089132936c24aaf87203225b6825b752c64cb05"}},{"ruleId":"D2","level":"warning","message":{"text":"membership.window.addEventListener(\u0022DOMContentLoaded\u0022) (cognitive 16): membership.window.addEventListener(\u0022DOMContentLoaded\u0022) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, ternaries 1. Of this number, 11 points are the body\u0027s own statements and 5 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":"website/static/js/page/membership.js"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d1ea92630884f9147a650ce36af68dccbd5a96abe3fa78cece615cea308a4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeGraphMessageHandler.process_message: MethodTooLong \u2014 process_message runs 1698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1598 over it, 16.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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7374239f82fa02d18e8bdeef1d54e048b1db69f8dd70baa71fa02bce351dfa03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeNetworkInterface: TooManyMethods \u2014 404 methods, declared across 15 files: network_interface/queries.rs (98), network_interface/caches.rs (64), network_interface/layout.rs (59), network_interface/mutations.rs (55), \u002B11 more file(s). The bar is 30 methods; this is 374 over it, 13.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9082d0c37f0ba81cc2fc82ca6ac8a28c585460483515a8b383f82dbea27266"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentMessageHandler.process_message: MethodTooLong \u2014 process_message runs 1261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1161 over it, 12.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeca3dcc08488f5db10f4e0366812ad0f6bfcd53ec168d94496ce842fb2327e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathToolFsmState.transition: MethodTooLong \u2014 transition runs 1097 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 997 over it, 10.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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d97b7911fca1d13f421f04e489e752873cdc89e4c0464d16e3b0653581e7b35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document_migration::migrate_node: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document_migration::migrate_node runs 1046 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 946 over it, 10.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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0738b1b5acd6f17ad0832d083c4c972bd2ba561784c45afa5bca6967e7522a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node_macro::codegen::generate_node_code: FunctionTooLong \u2014 node_macro::codegen::generate_node_code runs 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 645 over it, 7.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":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"84438c52994199d893c7889569d812153ab3c63e969c381cca34b4d6776a53e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PortfolioMessageHandler.process_message: MethodTooLong \u2014 process_message runs 740 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 640 over it, 7.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":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"442a292d98c3745e8c31ca7a4d00888d47b242df7b03b0a8ecaca4d42a21e104"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectToolFsmState.transition: MethodTooLong \u2014 transition runs 739 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 639 over it, 7.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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb95b8852f6fcf145d4cfd24db13c4f0d85de5a46d74de3c111aebb1708acc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DocumentMessageHandler: ClassTooLong \u2014 2716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 85 methods, 4 blocks, lines 92-4272. The bar is 400 significant lines; this is 2316 over it, 6.79\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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03d9fb289cb504cac72c72a96c99ea1488ae896c8544ebdca8e7d4da5382dad"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NodeGraphMessageHandler: ClassTooLong \u2014 2686 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 5 blocks, lines 58-4109. The bar is 400 significant lines; this is 2286 over it, 6.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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"48021b0893564543bf26134016b96a6c8a22fc7364a76b925f097304f35074f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MenuBarMessageHandler.layout: MethodTooLong \u2014 layout runs 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 554 over it, 6.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":"editor/src/messages/menu_bar/menu_bar_message_handler.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f580be85091116419b15de0380c6ef02158db2ac0eb908847123b61eeb24f22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/document_message_handler.rs: FileTooLong \u2014 3027 significant 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 90% of them inside a single declaration: DocumentMessageHandler (4 blocks, 92-4272). The bar is 500 significant lines; this is 2527 over it, 6.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72684582118b062d267892eee11c53ca7a25e6018c700eba5e40663cc0cbbac8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_graph/node_graph_message_handler.rs: FileTooLong \u2014 2759 significant 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 97% of them inside a single declaration: NodeGraphMessageHandler (5 blocks, 58-4109). The bar is 500 significant lines; this is 2259 over it, 5.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d90d626702e52293480d7e412609802c0e7ca15badab86ec53628be5e6d17d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: portfolio/document_migration.rs: FileTooLong \u2014 2748 significant 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 2248 over it, 5.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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dd4ca01160f4db6e1c299ae13c7ae8ec34d79caaac400ad6b9cf39ec63524d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_graph/node_inspector.rs: FileTooLong \u2014 2715 significant 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 2215 over it, 5.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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cade16ce812c09c670ed71f511c146d14118691c6b0fc9df4545b244f5e473"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PenToolFsmState.transition: MethodTooLong \u2014 transition runs 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 429 over it, 5.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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"077e1bd18e00b1bd16fb0716ca0e3b7ff9af31e9a674554a086740c3faf3d909"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::document_node_definitions: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::document_node_definitions runs 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 405 over it, 5.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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa05cb313a948c128d8b05fc3b3c9e2c0f830d2acca236d73b11950c8e1d1f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_messages/path_tool.rs: FileTooLong \u2014 2494 significant 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 1994 over it, 4.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0757c885abdb7069a381958dc1adf523c2d5acad8b73f4ffb781d158db1ccb0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GradientToolFsmState.transition: MethodTooLong \u2014 transition runs 494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 394 over it, 4.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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"de05e9a7b8307a48f4b5a309f040cf7daa4559875898a7705b2db56444c8ea48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vector_nodes.rs: FileTooLong \u2014 2418 significant 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 68 free functions. The bar is 500 significant lines; this is 1918 over it, 4.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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7395c08950b61f874ae9887fd0f7398c65e16f0e2260b8467129d6d221414d16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector runs 453 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 353 over it, 4.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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"07da12ab29bcdddcc2fdeb9dbd166a568f175b8b0b768202def719d9a32db4f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document_migration::document_migration_upgrades: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document_migration::document_migration_upgrades runs 446 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 346 over it, 4.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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe13253a737188e865a54633888603d7849c2fd9c6f0f4fce882b0ec5a8c391"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: interpreted_executor::node_registry::node_registry: FunctionTooLong \u2014 interpreted_executor::node_registry::node_registry runs 427 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 327 over it, 4.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":"node-graph/interpreted-executor/src/node_registry.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"94722bbce009a84bc772b7b9ef790bf0c5e62d05767a1a1f285cd82d908b8db6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/renderer.rs: FileTooLong \u2014 2126 significant 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 67 free functions. The bar is 500 significant lines; this is 1626 over it, 4.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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c514b60e5996bbe63738407e23c411fa94db8128eb96a27f8cada751611c45d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vector_nodes::vector_nodes::morph: FunctionTooLong \u2014 vector_nodes::vector_nodes::morph runs 414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 314 over it, 4.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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f9b41f672567cff296705c7b6203ac9de28835d8cba71a22a26c1c892cd1ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::input_mapper::input_mappings::input_mappings: FunctionTooLong \u2014 graphite_editor::messages::input_mapper::input_mappings::input_mappings runs 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 305 over it, 4.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":"editor/src/messages/input_mapper/input_mappings.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"04956b30800a047f633aee9f8d230400bd906cf7b328401180907931498e49e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bisect-tool.document.addEventListener(\u0022DOMContentLoaded\u0022): FunctionTooLong \u2014 document.addEventListener(\u0022DOMContentLoaded\u0022) runs 384 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 284 over it, 3.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/static/js/page/contributor-guide/bisect-tool.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc62e84b40220157b4a3daff9aa51541f9011817dca235a0a5e586100db5a3e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransformLayerMessageHandler.process_message: MethodTooLong \u2014 process_message runs 383 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 283 over it, 3.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":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"099fbed4a3d8072ffe01d93a0eee25f58f642a6510163ac965a8c94aaabd7533"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/adjustments.rs: FileTooLong \u2014 1912 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 1412 over it, 3.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53892d88bf096bb5663efa55ef5272568a4a6bfd15c10b7c2f631800f90168c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gdd: TooManyMethods \u2014 110 methods, declared across 6 files: src/persist.rs (46), src/lib.rs (25), src/network.rs (15), src/resource.rs (15), \u002B2 more file(s). The bar is 30 methods; this is 80 over it, 3.67\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":"document/format/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfa98ae4e1e789c7f7d1e51365764090199bf1fede48c000eb567d877590dab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphOperationMessageHandler.process_message: MethodTooLong \u2014 process_message runs 346 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 246 over it, 3.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":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c217bb7ad16510a891b042a699e1a3b69498b890daa8c9126062bf783cb06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_messages/pen_tool.rs: FileTooLong \u2014 1619 significant 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 1119 over it, 3.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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4302beb64e646d4ec8fbe308d1a5ff30b79846b6535fcedd54a4b9b717da3c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: math_parser::constants::builtin_function: FunctionTooLong \u2014 math_parser::constants::builtin_function 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":"libraries/math-parser/src/constants.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab9ae16c19ec1bbece69fd223be96df89d353ef9a7fa5cb07594088f3ed78d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextToolFsmState.transition: MethodTooLong \u2014 transition runs 315 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 215 over it, 3.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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1309e8c0f53c48dc86ff33d9ea1b304652426afcdf78654628b8432a0ced88bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_messages/select_tool.rs: FileTooLong \u2014 1552 significant 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 1052 over it, 3.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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3742b3c30c80400dff990c7e848d972b5cae5b81ee8b8cf888769da3859231e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClipboardMessageHandler.process_message: MethodTooLong \u2014 process_message 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":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c4281de177ac0249d9b23d902aae761e50bbf3eb01b7e861215aae538a7032"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NavigationMessageHandler.process_message: MethodTooLong \u2014 process_message 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":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20243a85287fe8b987bb363001008fae23517a3a42b43c9a1a9d209cd6200a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 86 methods. The bar is 30 methods; this is 56 over it, 2.87\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":"document/graph-storage/src/session.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbb95087979b0e353bbc721e93b4bf01815b9e172b6a633793eca0213448238"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DocumentMessageHandler: TooManyMethods \u2014 85 methods. The bar is 30 methods; this is 55 over it, 2.83\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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1336b2a048b0c367a724b1bb3df19c100369adde5d6dd69201a989ff54034b6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1410 significant 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 93 free functions. The bar is 500 significant lines; this is 910 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/math/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b053e11aa53afbd86496266090a37656dc845682c86e9cb28d457951b3543da8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ShapeState: ClassTooLong \u2014 1119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 62 methods, 2 blocks, lines 157-2336. The bar is 400 significant lines; this is 719 over it, 2.80\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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f5159e56ffa5fc4fc4909800f4a6bc45037b8610ba0f8447362c5a67e5b695"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PathToolFsmState: ClassTooLong \u2014 1110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 563-3298. The bar is 400 significant lines; this is 710 over it, 2.78\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a44b6b23423f04f2c16adc5f1fdca9139faf67f5847e346d7815487baec752"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common_functionality/shape_editor.rs: FileTooLong \u2014 1373 significant 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 82% of them inside a single declaration: ShapeState (2 blocks, 157-2336). The bar is 500 significant lines; this is 873 over it, 2.75\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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6d3aaf909c54314a47ecedfc5a9a4608e423ba2b4747afe29ca3825ab461c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_messages/gradient_tool.rs: FileTooLong \u2014 1354 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 854 over it, 2.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c55f5257117189d4fd2c032254cf815140f94c183639c6c056f9d8f0e05500d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreferencesDialogMessageHandler.layout: MethodTooLong \u2014 layout runs 268 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 168 over it, 2.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":"editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b16cb2e6c742235a7d4c96bc313d84425be26fccbd67611689dfa85d848f15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/documentation.rs: FileTooLong \u2014 1277 significant 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 777 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/documentation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7415bc14d1dcbeb5fc4b4178119fdf35b6e6a0cc5028d60dbc8dd0b1633fe98"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rendering::renderer::render_vector_item_to_vello: FunctionTooLong \u2014 rendering::renderer::render_vector_item_to_vello runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a169460483ed0613fd911ed62a504dbc74777dc3500d0d70d4c713b8d522de8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: membership.window.addEventListener(\u0022DOMContentLoaded\u0022): FunctionTooLong \u2014 window.addEventListener(\u0022DOMContentLoaded\u0022) 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":"website/static/js/page/membership.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be59477d9f4ffe1dcdda6d7bf7a35dc180dcceef638ea9d0e1826a52d99759"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_graph/document_node_definitions.rs: FileTooLong \u2014 1200 significant 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 700 over it, 2.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"453ee48250b94312e9c8321644315b53e2531d41087aeb3fa2b04a37f0175d99"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vector: TooManyMethods \u2014 71 methods, declared across 2 files: vector/vector_types.rs (60), vector/vector_attributes.rs (11). The bar is 30 methods; this is 41 over it, 2.37\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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bed2f574f77c692adb75f486f5b27e6ca6f5e85d74de0906e02e7bcf7ab0c4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: algorithms/concave_hull.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), declaring 31 free functions. 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"065f8b0a537a0c16d8c3bce332d7fd6ee56099351513a81620813db3573f2564"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutMessageHandler.handle_widget_callback: MethodTooLong \u2014 handle_widget_callback 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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca589a423552aecd1c3c3d758a1b1e67d06209cd3ba193bf3b35c7a5e1166ad6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PortfolioMessageHandler: ClassTooLong \u2014 934 significant 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, 3 blocks, lines 54-1461. The bar is 400 significant lines; this is 534 over it, 2.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d3e102e9a7047d3390f0647608a88e472420bdd3d22d37a1e39fb78a11349"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolMessageHandler.handle_message: MethodTooLong \u2014 handle_message runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"829f42402cbe036ce5df58a7eb07ebb90ed8a12041dda05f00593c8a65eb9c8f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Color: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_types.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5791b0a8ad5059f177883eaf167d825b66aa12d1601c8eb75765b9c7210627f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_messages/shape_tool.rs: FileTooLong \u2014 1096 significant 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 596 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":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18925deeb07a3aa9044f8821b17bda4fd3f92335a568a1c5a73571ae876649f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data_panel/data_panel_message_handler.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":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1ce8d76933d7eb90aa67bc5919104c0781b68ccb7ea2a62cdf33ce42b1b874"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gradient.rs: FileTooLong \u2014 1086 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 586 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc3afc87be011c06bf12bc5cf7e7c6f26c1a11cbb7f53fa5bda02daa81a095a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArtboardToolFsmState.transition: MethodTooLong \u2014 transition 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":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec02fe2cf0af0321c3eee137ec24a58f6848ab39cd83d8f6b6b645ae13eec070"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SelectToolFsmState: ClassTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 3 blocks, lines 485-2142. The bar is 400 significant lines; this is 439 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eef4ae74007335e1a9cb9539133deae6d410a0b12af970a14706dc780800742"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShapeState: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedfb5da0d928f64123b04455c15fb79de159eb7fbce2d26558fee4edccb0b76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/icons.ts: FileTooLong \u2014 1029 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 529 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":"frontend/src/icons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1735e64f8d513851377d9d9a3447f7fccae393fff9646d02f22ca752e4782447"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: component/credits-particles.js: FileTooLong \u2014 1023 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 523 over it, 2.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":"website/static/js/component/credits-particles.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08985a59de96e84a7e34880662788e795792d0da2adc2ce8e7ee088a6cc10302"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codegen.rs: FileTooLong \u2014 998 significant 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 498 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"287ed272c4fe0594e6aab1e1f17aedbc9e2380f961fe72e083d08398d118b9cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network_interface/layout.rs: FileTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: NodeNetworkInterface (8-1690). The bar is 500 significant lines; this is 496 over it, 1.99\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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b1126301c620d9742f273cdb3e04831fc01f6379cc83a0eaaf97aa4629f5d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: portfolio/portfolio_message_handler.rs: FileTooLong \u2014 991 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: PortfolioMessageHandler (3 blocks, 54-1461). The bar is 500 significant lines; this is 491 over it, 1.98\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2200ddb0d580289162218e40334cb5daa7de683008105f7b7d7f5904dbe084"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceMessageHandler.process_message: MethodTooLong \u2014 process_message 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":"editor/src/messages/portfolio/workspace/workspace_message_handler.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2ed0da7aee7cc8cd06fde5f577497b0a69abcd5342a99e43423c324c91dfd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::overlays::grid_overlays::overlay_options: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::overlays::grid_overlays::overlay_options 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":"editor/src/messages/portfolio/document/overlays/grid_overlays.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3865493bedf8799346ffc40641f29f698aa9fb2debdd32ecc160136f778eefe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dispatcher.handle_message: MethodTooLong \u2014 handle_message 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":"editor/src/dispatcher.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a1b78ab14d8e367b5295a66e5f54ecea6ac2e7d24d2357debb7c3d2efb351"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PenToolData: ClassTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 2 blocks, lines 435-1596. The bar is 400 significant lines; this is 354 over it, 1.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5936eebb555aa2a27fa094b40dea7739c8a9337254704ed4871697ba969b798"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path 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":"editor/src/messages/portfolio/document/utility_types/wires.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de97faa92d04f6b1809a3a8c19a460e653a42e36e1208fa1c51837c736d7bf0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VectorGeometry: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"node-graph/libraries/vector-types/src/vector/geometry.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1ff6914914b83f766f9a1a487ea8c83560f028a1f9208f0b9ee76e3cdfcdcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColorPickerMessageHandler.details_layout: MethodTooLong \u2014 details_layout 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":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cd69d26ccb107c1b29e3eecb29445f828901b89efc0226a5c3a2e5f62522aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/list.rs: FileTooLong \u2014 895 significant 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 395 over it, 1.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":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17edb12cd256c73250ea217c3db75416cae5cf04f87e67c111db54b4de3c8a67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 879 significant 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 77% of them inside a single declaration: Session (3 blocks, 16-1245). The bar is 500 significant lines; this is 379 over it, 1.76\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d85810f47d31a4b7a25844a6cc078c4fe648db464240b60a564ca191dc091f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node_macro::parsing::parse_field: FunctionTooLong \u2014 node_macro::parsing::parse_field runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"1934925a2d80c984bd3694e87fcb5b73682694b678cbb528f0a188700f1a041e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SplineToolFsmState.transition: MethodTooLong \u2014 transition 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":"editor/src/messages/tool/tool_messages/spline_tool.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"24081e0f3588c19fdb73720992c162c2c3c12d0194283a928876e565c4aecf8c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MenuBarMessageHandler: ClassTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 3 blocks, lines 9-798. The bar is 400 significant lines; this is 284 over it, 1.71\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":"editor/src/messages/menu_bar/menu_bar_message_handler.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1af112b4456a1a8179888f685523ad0c5a0f2393727969e844b583fb246673"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 86 methods, 3 blocks, lines 16-1245. The bar is 400 significant lines; this is 281 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":"document/graph-storage/src/session.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a783050edd499143d92caeb0470006095e895bbbdb4d6bed6aa5b6d6e560133"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Replica: 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":"document/peer-transport/src/replica.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f12629119e6b5e632029cad2ddd6252a45b41b084f78924b813aca71582a589"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NetworkView: 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":"editor/src/messages/portfolio/document/utility_types/network_interface/view.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5c2d1cd3fbcf75cf8a40f219f99baaa1c6022232c1fadcd5e4ffc6ef500ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"72919b8c252a0ccfe61e7b6e12e8d6c10fad6fbeca346aad748bc29954746d2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network_interface/mutations.rs: FileTooLong \u2014 835 significant 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 100% of them inside a single declaration: NodeNetworkInterface (4-1438). The bar is 500 significant lines; this is 335 over it, 1.67\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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c7a3226338fbd0f5b0a8b9c6fbe8f4ec15bf99eecc45a84eedca57c4b6d6aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModifyInputsContext: 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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e3aaf4b8992aa991df3771451c72207b2d05a53403fdcd9e5cef0c3f1ca589"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overlays/utility_types_native.rs: FileTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: OverlayContextInternal (3 blocks, 488-1302). The bar is 500 significant lines; this is 315 over it, 1.63\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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d46108e12be1709a409d0844c7a915b6e16f90746837e7975e3216a9797c43"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PathToolData: TooManyFields \u2014 48 stored fields beside 27 methods. The bar is 30 stored fields; this is 18 over it, 1.60\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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ab775c4e008ffd4ab5be1e3e73d0cd1b28ba94449a09cbf0baae26f18e4a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node_macro::destructure::derive_destructure_impl: FunctionTooLong \u2014 node_macro::destructure::derive_destructure_impl 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":"node-graph/node-macro/src/destructure.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"900f859280be9d3e46b48bc230016e09bf15de2e568cb4494ed39142aafd5e84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vector_nodes::vector_nodes::bevel_algorithm: FunctionTooLong \u2014 vector_nodes::vector_nodes::bevel_algorithm 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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"535df4a64692cdec1b607ccf4af763135db2dd19a845624b52329d2232ad8fa3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OverlayContext: ClassTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 45 methods, 3 blocks, lines 195-1173. The bar is 400 significant lines; this is 237 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d4c6de36e8bcbd1f571f70befc7f5097bd226b0ee84d8b3b233debba4fba19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Replica.handle_packet: MethodTooLong \u2014 handle_packet 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":"document/peer-transport/src/replica.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"7892c0cf9cc25433efd9ef372ce0162a681927159753d771b878903c85ba5054"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Preprocessor.new: MethodTooLong \u2014 new 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":"node-graph/preprocessor/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff93338c072c6fbff0a2715d5e75711145300de3b3fe6df23764cba3898126c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: math_parser::completion::completions: FunctionTooLong \u2014 math_parser::completion::completions runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/completion.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce72e45a86bc17b3f535c6b8b4eb2c92988056dd011918ab07077d0bd01634a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PathToolData: 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), 27 methods, 2 blocks, lines 588-1570. 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"555921ee8619b6a40394469b12e8c1036219e4bc141bd1502747a33288c7e903"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parsing.rs: FileTooLong \u2014 788 significant 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 288 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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c8c6c9d7b338708151f47fec5fa91de9a44d4aafcef8c46a77f0860f647175"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overlays/utility_types_web.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: OverlayContext (3 blocks, 195-1173). The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"697a26d0023491dedef202679418745c0205341b37825db9c7b54ceff8be0d9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graphic.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64229e81c97b8d3b418033d6af7dfc279c12d49556bf999567ddfd2ab79874ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gradient: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4c1cbab78f95a5d986637287ed3b7433d11b6b84b0872a0e44faf080c6f316"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool_messages/text_tool.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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25a06cf2c6f23f4c98f6f3013364639f14c12b38f347b9c13072ecdfde32e47"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModifyInputsContext: ClassTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 2 blocks, lines 33-1041. The bar is 400 significant lines; this is 223 over it, 1.56\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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa464bb77b3777dd048e533fde8f9a56ddfee878634a7b21171dd3ccf256bab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColorPickerMessageHandler.process_message: MethodTooLong \u2014 process_message 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":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf918dc6ce4dbae29b54ea5a3384d4345705e64079a9654d16a47670946b529"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints: FunctionTooLong \u2014 graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3550}}}],"partialFingerprints":{"codehealthFindingId/v1":"1391e14bb52050de34e72fab40e039e4f323c153d79ae637ccd682bfe2e6f8b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OverlayContextInternal: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd65c9d93caf1f50e0744841613e2433038c519c18f613c37c480920fbd4c086"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vector/vector_modification.rs: FileTooLong \u2014 766 significant 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 266 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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8011802974b3c143ba1cdff3f2f2557d24918762aa7eece5cc758092bb780e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common_functionality/graph_modification_utils.rs: FileTooLong \u2014 756 significant 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 256 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efdce72ccec1a3236442bcaf892fbd496efe2b0c6fc92a676e90e69c5e023eb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OverlayContext: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e0b26bf1a119923fd024ff66452d03beb78fda8a4a326488e077b93f4fd84a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utility_types/layout_widget.rs: FileTooLong \u2014 746 significant 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 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ed076f1fa9065b0471a37bea710d66385844509997f92d2cbf8722f2dfc082"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ColorPickerMessageHandler: ClassTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 4 blocks, lines 15-823. The bar is 400 significant lines; this is 192 over it, 1.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37e02d4f584e282aedc606ff97fd48016bcc0104e57186df61805fcd9554d25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/grid_topology.rs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae73be0fe59b8c242ac5cd1ad2d13daa5f8a6baeac23ad01d5384c0cb84fabe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network_interface/queries.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), about 100% of them inside a single declaration: NodeNetworkInterface (2 blocks, 7-1248). The bar is 500 significant lines; this is 238 over it, 1.48\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":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"592c4b40d1f24c519f0cd00eed36e03a8551ca39cc623dee03bf6e00d3461706"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PenToolFsmState: ClassTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 114-2497. The bar is 400 significant lines; this is 186 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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"697004672149e9d1ac9bd56b15986ebbf987adef630919ba5fd758e0f3c5e039"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network_interface/types.rs: FileTooLong \u2014 732 significant 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 232 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":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bd0ed4fbceeff0de691df6d45272c3550b3e1653965fc0e6939733560f4cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rendering::renderer::render_vector_shape_svg: FunctionTooLong \u2014 rendering::renderer::render_vector_shape_svg 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad697d049f978fed22e2e05fc148b1a5d2d6b97d96c1d9e8a72a95e06fbc0f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_graph_executor.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":"editor/src/node_graph_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff057aca29fd9a01adc1c9a4a9be61a5d07508259ed737b2a3bc017f85b09fa0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeNetwork: TooManyMethods \u2014 42 methods, declared across 4 files: src/document.rs (22), compiler/flatten.rs (13), compiler/scope.rs (5), compiler/lowering.rs (2). The bar is 30 methods; this is 12 over it, 1.40\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":"node-graph/graph-craft/src/document.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6510457a6222d21c06c5c61f2921a66ce825ba67d824883ca321a38d249c202b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform_layer/transform_layer_message_handler.rs: FileTooLong \u2014 694 significant 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: TransformLayerMessageHandler (3 blocks, 80-726). The bar is 500 significant lines; this is 194 over it, 1.39\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":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba03464a41dae87767838bdf24581d6cf5e1726f70eaf6d1dbd291a99f9709c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph_operation/utility_types.rs: FileTooLong \u2014 693 significant 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 90% of them inside a single declaration: ModifyInputsContext (2 blocks, 33-1041). The bar is 500 significant lines; this is 193 over it, 1.39\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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a87868093944ea62867f2a00aaf86dc2ee692bad5f994450b5d35fd282de42b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/input_widgets.rs: FileTooLong \u2014 692 significant 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 192 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":"editor/src/messages/layout/utility_types/widgets/input_widgets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e451195df465ed75e60186361c8af98d3f94dc19d939f9e47a35c74791fe488d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: menu_bar/menu_bar_message_handler.rs: FileTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: MenuBarMessageHandler (3 blocks, 9-798). The bar is 500 significant lines; this is 192 over it, 1.38\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":"editor/src/messages/menu_bar/menu_bar_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"426c56a9f9ff3953a5586966fbda85dc7501703657a07785aa626edf9ec77769"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Replica: ClassTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 2 blocks, lines 76-969. The bar is 400 significant lines; this is 153 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/peer-transport/src/replica.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae7393bde92597ab26c9a32ba9fc5c37cc88c2946e252f20cebd3a0a3bfd0ed"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GradientToolFsmState: ClassTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 3 blocks, lines 329-1785. The bar is 400 significant lines; this is 153 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"15602a280606ec1c3f23d67bb68d16f9a92f8ee43f2b94834fca6faeaaf0abeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b7fd947cb71de0547d20bc12b2b9dbe6c60a80bda236c5c6d521a063b724e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathToolData.mouse_down: MethodTooLong \u2014 mouse_down 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"87637f1b8c89cc25df794e69ab746fcaafd2fd9469ba4a34edaf715daf484a24"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodeGraphMessageHandler: TooManyFields \u2014 41 stored fields beside 39 methods. The bar is 30 stored fields; this is 11 over it, 1.37\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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0332dd5de21d3bb1dac8e9a8568d15b0e16ad8c53f9bf5b02065cd7ecb329c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.handle_desktop_frontend_message: MethodTooLong \u2014 handle_desktop_frontend_message 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":"desktop/src/app.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b14e865251d12e080143e9bc244796cf0f9c5803e4ee39d8e946d5fcc5da6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vector_types::vector::algorithms::concave_hull::refine_cycle: FunctionTooLong \u2014 vector_types::vector::algorithms::concave_hull::refine_cycle 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04abda23a4a976b1d451ec9f858c806782456c2b33f56263a4eae06b503e9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompositeBackground.create: MethodTooLong \u2014 create 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":"node-graph/nodes/gstd/src/render_background.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"29653085df3b7560dad87edc6d3bc82fe81237670c4e13fcf139f50c521f26ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OverlayContext: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"491226ddfe141f1620e1bc609e30543cca912d21d7096ac43daec9efcb2a0099"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph_operation/graph_operation_message_handler.rs: FileTooLong \u2014 666 significant 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 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b648f523560b1fbd66a985eb550adaf5dcf1614dab42bd4c4ce17135a60232"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IngestMessageHandler.process_message: MethodTooLong \u2014 process_message runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/ingest/ingest_message_handler.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfd0001f3d3b12065cb2dbbdea5c4e50f0340d4a7048b9f9df8e49e81fbc0f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: page/membership.js: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/static/js/page/membership.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d060c993058ccf39f84de0c117556dbc463ac7fe248a9045edda7ca976b329bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathTool.layout: MethodTooLong \u2014 layout 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14212da8af185f70dbfabab4b08c4caf26aaa167da3eed36a9297b082b7c20c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: color_picker/color_picker_message_handler.rs: FileTooLong \u2014 653 significant 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 91% of them inside a single declaration: ColorPickerMessageHandler (4 blocks, 15-823). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b3e4b8168f73627c8fc449a24555f65845396355ded7215f0159fb6212cc1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeGraphMessageHandler: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f7d700252af9ada51d451da2e87cdc53c0846140e29f895e613a425809688a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/proto.rs: FileTooLong \u2014 649 significant 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 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af5b9f81a67bb714ab26f9d5eb0c387e9ae4172acc750987a294c79bb35388e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8b99ce0acb76a67650bef2cd019ae893d6c237e9d71a51fbb66116b1c89c5e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OverlayContextInternal: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 3 blocks, lines 488-1302. The bar is 400 significant lines; this is 109 over it, 1.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"08467ad0ab38a48bdf3dfe62afa578bb26c8deb67258a32f46a7496c498b8633"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 635 significant 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 135 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":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4752490387cac6115e77abe9053e12dfae0017ead460ad3655cb30b9d516b8c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PenToolData: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b255f813efd95f066707aef87b90c426b10a0320fe9c557c51f68cbc28bbc28d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/value.rs: FileTooLong \u2014 632 significant 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 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":"node-graph/graph-craft/src/document/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"039a78e43d372628f7edd3d8f6b4fc84fa9a287c523ad3c64d4ebc32c3ae6020"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeGraphMessageHandler.update_graph_bar_left: MethodTooLong \u2014 update_graph_bar_left 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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":3312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2eef858bbc4a97466c7930021e4eac9a75a52ffb5af2519d58f9d7ca5c39af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e3ec151961726d54ee49523c149bd9a67fa321ec0e5a7a76774b4b605d6a32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: crate-hierarchy.document.addEventListener(\u0022DOMContentLoaded\u0022): FunctionTooLong \u2014 document.addEventListener(\u0022DOMContentLoaded\u0022) 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":"website/static/js/page/contributor-guide/crate-hierarchy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef9ca20d7f0b09bb409eaff1ccb51575cbb933a7583c3eb5490e5ec2437ed69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: raster_nodes::std_nodes::noise_pattern: FunctionTooLong \u2014 raster_nodes::std_nodes::noise_pattern 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":"node-graph/nodes/raster/src/std_nodes.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f1f8006c1ec3c16dbc43ee10bc653f6e6aa23d056bab2f6ed63286202d6026"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderState.new: MethodTooLong \u2014 new 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":"desktop/src/render/state.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe3b395af5af704babe0a5c19a21182f6b58fb2e2ee405aeec1cd554ca615b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypingContext.infer: MethodTooLong \u2014 infer 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":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"735ae38369f0ef2e7183766fa56015b434950eac232f3e6db83878097ce69656"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: credits-particles.createParticleScene: FunctionTooLong \u2014 createParticleScene 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":"website/static/js/component/credits-particles.js"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1a1bd91db85ca2587caacb0585a5cfc50a905ad59f458b01c354babdc63d4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/constants.rs: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 114 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":"libraries/math-parser/src/constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88cddfca92de1b03d6a6eaee1a2949d1c895e6ceba300771e20ca3923b3395f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document_migration::migrate_copy_to_points: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document_migration::migrate_copy_to_points 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":4013}}}],"partialFingerprints":{"codehealthFindingId/v1":"1897c222463bd2ee785f02530112f94132295f279cbd952cf607baf187d9d601"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node-graph.createNodeGraphStore: FunctionTooLong \u2014 createNodeGraphStore runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/node-graph.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5445aad8f110347358c39e7d035a35298ee568c2924fd9ecb46774203c07ea0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/replica.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Replica (2 blocks, 76-969). The bar is 500 significant lines; this is 103 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/peer-transport/src/replica.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4a574276dad4560e18713e298aef12707359cee9a5a8052cbf5921d81df8d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: color/color_types.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: Color (11 blocks, 193-1013). The bar is 500 significant lines; this is 103 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"634b6f4cabd56272e2da265eaf6667353a05c4a1e470ab9db7a34c1bfa360cd7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeMut: 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":"editor/src/messages/portfolio/document/utility_types/network_interface/store/cursor.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"13db3d986d72f0a21c3176c61c8553442186ab6a52c833f442db0cc6190ecf76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network_interface/editor_delta.rs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7656871e125083ede4bb546e92f65fb3bff0b5d3c9f12fe9d5afcb9ce4ac0d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vector/vector_attributes.rs: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 95 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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226ba6f7f5d6ace09fd00c506a5fafebee624d33eeecc37e82b7463a37b5421"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_desktop_wrapper::utils::menu::convert_labeled_keys_to_shortcut: FunctionTooLong \u2014 graphite_desktop_wrapper::utils::menu::convert_labeled_keys_to_shortcut 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":"desktop/wrapper/src/utils.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"032ff1412c78784182116bd3fc251ff4ab4fd74caf781634e82cdbdd622a2353"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyncMessageHandler.process_message: MethodTooLong \u2014 process_message 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":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cd6cff535845f4c6faff3197191fb2812bd21d36b038ce9f7d874919543a73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network_interface/caches.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: NodeNetworkInterface (5-940). The bar is 500 significant lines; this is 90 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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e846b349e8c327295ee5700963630e9b261190784442c95a0872570dac2c86b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Document.apply_op_with: MethodTooLong \u2014 apply_op_with 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":"document/graph-storage/src/document.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3689857bacfa06fb5b0f1a637659c896d567f32b10ac23347770eed38305eb83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeNetworkInterface.compute_node_click_targets: MethodTooLong \u2014 compute_node_click_targets 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":"editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b886d728f83ff8456d31d89ccab36a96c7d6babb74e1bc79e33c793ddf7e137"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: math_parser::highlight::highlight: FunctionTooLong \u2014 math_parser::highlight::highlight 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":"libraries/math-parser/src/highlight.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1d350b6684caeb1aaa8e00c6f264e61b30c5c7459e63218c9dd8474b6657a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InputState.process: MethodTooLong \u2014 process 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":"desktop/src/input.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a9a48d75706978a572eca4a5876b07d5c8ffb0a02aa998e8fe617d29a02e6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeFnAttributes.parse: MethodTooLong \u2014 parse 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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4620526c7e3e5012344776d6fcd20b2c27202c21181a316f8d28e52a4fa72bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cargo_run::requirements::check: FunctionTooLong \u2014 cargo_run::requirements::check 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":"tools/cargo-run/src/requirements.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b75596a5d6e4e06e40b795788ebe77acc54b284f20f79e878d7c30314eebd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DocumentMetadata: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/document_metadata.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"120fc8ed8f3dd294da5710299d9485344406b5e7532d06684d98e11217785bba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::document_message_handler::navigation_controls: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::document_message_handler::navigation_controls 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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b809496623d2f6fd51bee4df25f49067f5ae02363ae52e43b38bead153e3b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sync/sync_message_handler.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":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60b70d9a0af5e2d3f42d429a95638b62fb851a148669b723a6aaec4355c1f2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 456 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 3 blocks, lines 31-710. The bar is 400 significant lines; this is 56 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec0b6fce60865e659b8d6463acd50513a02f574323eb0f75e7b3659d974842e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResourceMessageHandler.process_message: MethodTooLong \u2014 process_message 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":"editor/src/messages/portfolio/document/resource/resource_message_handler.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bb1b3c4693ab42cf7b1e8d21dd2bba790515fa164acd6c0afa0ecabc283940"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Operator.doc: MethodTooLong \u2014 doc 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":"libraries/math-parser/src/documentation.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"18834867d16cecbc5f73c02c84cf48e773f1cf4f208898de3fd0959f6d2831ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Color: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 68 methods, 11 blocks, lines 193-1013. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_types.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5aedcf40889a7307ea468e47b7841842b99ceafb4e9792fbe4cf301546d1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DocumentMessageHandler: TooManyFields \u2014 34 stored fields beside 85 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a75e5c4e02cd6f485841b1bb6c454a239c17e0798426389fcb0f0d14d4666"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PenToolData: TooManyFields \u2014 34 stored fields beside 38 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5f013e0e437c676ea7b643d29eb62a29bb6153a8e26937173646d16a8ec5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Matrix: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/matrix.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d331ff33f51f18fc9ea2ed07e38fb46b53f744ab2dc12e6a63a00c54aead8bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: List: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"31537af71e3a77d741b226d03000465ce476fef87790fca862e6eff6d67a0cf3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lattice: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6afeb0408e412c7ad2403460e3834330ea03415c334cd8eda4a9cc922bae8be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_proc_macros::editor_commands::editor_commands_impl: FunctionTooLong \u2014 graphite_proc_macros::editor_commands::editor_commands_impl 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":"proc-macros/src/editor_commands.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e50126e3a5c715f14bfc5e08d9e52af95bb2023262a963989aeaf95a27636e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::sync::sync_message_handler::collaboration_panel_layout: FunctionTooLong \u2014 graphite_editor::messages::portfolio::sync::sync_message_handler::collaboration_panel_layout 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":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d449871a5f68eee5731126b2257e8e82a55c1dd5f7c09c8cc0e7cf94856114bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graphic.rs: FileTooLong \u2014 558 significant 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 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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21fdff183135826d3896ff9633215d4a04055be04a6b9b0860eef5aa15bf87d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node_macro::codegen::generate_register_node_impl: FunctionTooLong \u2014 node_macro::codegen::generate_register_node_impl 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":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87e0457b258d19ab14482c7836a85fae1190c377e49c8c8c277ddf8559dbb5c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TransformLayerMessageHandler: ClassTooLong \u2014 443 significant 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 80-726. The bar is 400 significant lines; this is 43 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"50db4bb656db76ceedf1a3a2696c8819ce8cf4877ab60c34a17f58e2643ec5e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common_functionality/transformation_cage.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":"editor/src/messages/tool/common_functionality/transformation_cage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f2005663550080b58f406135a72a97a178211bc21981e4c2a527bc24004d57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PointRadiusHandle.overlays: MethodTooLong \u2014 overlays 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9b9fe56ba5e0da3f8056c14906db2996b81abc758b95d5cfdc6d1525786de2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrushToolFsmState.transition: MethodTooLong \u2014 transition 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":"editor/src/messages/tool/tool_messages/brush_tool.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"56025788dd4ff13e2cbc85e25e4cbc7893e57b4319a73ba9bac60f8ff8283d97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sort.rs: FileTooLong \u2014 546 significant 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: Sorter (2 blocks, 287-829). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70aab1fcf3958444002ed7b9cac121d90a14ada52eb8bfaf9b5ac8301c01984f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_wasm_wrapper::helpers::translate_key: FunctionTooLong \u2014 graphite_wasm_wrapper::helpers::translate_key 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":"frontend/wrapper/src/helpers.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2673b0a9eb4223a977f5e60a0fa6c840be34148158dbae81ae37dff2de52590"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lattice: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 2 blocks, lines 98-813. 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":"node-graph/nodes/vector/src/grid_topology.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"23745ed7a519416288764d6a18ee906d5f9e10205b36dc7266e82c63f7b2d282"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphene_cli::dump::print: FunctionTooLong \u2014 graphene_cli::dump::print 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":"node-graph/graphene-cli/src/dump.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc57fee23a1fbd33f373b082f5bb0e521ea3223d39b7ea946c9c6b0b45bbd3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gradient.interpolated_samples: MethodTooLong \u2014 interpolated_samples 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":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0901b20e72155ded435a73d456bbc151a5ef9eb6f669bf4b7111bfbfcb50dfc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utility_types/transformation.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":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f7de778f3487fd22b4812c7142a103f075a44094a7bce3d7aa9e859a2928ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.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). The bar is 500 significant lines; this is 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62f3139b0bbe41fc89fbe7ff13c81255c33fdad160447668643dc895a47e9a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_desktop_ui::remote::spawn::spawn_host: FunctionTooLong \u2014 graphite_desktop_ui::remote::spawn::spawn_host 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":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"86825c4507cfb89481ea9245114794ca23cd5f9293d5f27fa072ad6c323cb432"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector: FunctionTooLong \u2014 graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e468e0eb9ca8782d6a32faafd72c77813084cfb0a495c8f28829169e79fcf2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectedGradient.update_gradient: MethodTooLong \u2014 update_gradient 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3d33a56f183653fae41141e9318ed65fbff4c6e24521d5b8e5faee9991f0c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: brush_nodes::basic_brush::render::render: FunctionTooLong \u2014 brush_nodes::basic_brush::render::render 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":"node-graph/nodes/brush/src/basic_brush/render.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b757373b1bc68279b8cb549cb2f5142d3b1d5eac14789215979d5e80c49bf8b8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Curve: 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":"libraries/snapping/src/curve.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b054e980ece657e65281951a65399c5193a083146be846bcf70efb249ec9641f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/editor_commands.rs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 115 free functions. The bar is 500 significant lines; this is 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/wrapper/src/editor_commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1fb91e56741cc56e8ce00535cedfbdece76ae3f910c85c1717f71aa6f93a11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutGroup.diff: MethodTooLong \u2014 diff 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":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e025cd7316dcc432f76b3f0c8b8b978bb3c6fb0d273696cda8c10547dc46fae8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vector/misc.rs: FileTooLong \u2014 528 significant 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 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/misc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f96eeab12065685b1b9774a14e3a4da204d65683f008bc2f822daf6d7cd180"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 528 significant 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 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/web-editor-driver/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba81cb48ffc13c037998893bf3f69ceb16ffbecade69e0f170671727d54af13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vector_types::vector::flatten::chain_order: FunctionTooLong \u2014 vector_types::vector::flatten::chain_order 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":"node-graph/libraries/vector-types/src/vector/flatten.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b718646c313d2e9cd67f110d16452727d0f8a9a4797d597c16f7ecc654eaff97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vector/vector_types.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: Vector (11 blocks, 23-959). The bar is 500 significant lines; this is 20 over it, 1.04\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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f3efdb83cd8d6efb9878c9c3b1f4811a33a709f4f9881591d86b7418fc3836"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Vector: ClassTooLong \u2014 414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 71 methods, 11 blocks, lines 23-959. The bar is 400 significant lines; this is 14 over it, 1.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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ef5a253afd667c6cc7cdd498eead8b3ed7722d72825144e4b5189431951456"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ShapeToolFsmState: ClassTooLong \u2014 414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 3 blocks, lines 782-1466. The bar is 400 significant lines; this is 14 over it, 1.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":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd85b9d078cf288d6e5e7dbb2d247517b2d0329471094cd81bc134d78eb8dc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graphite_desktop_ui::input::process: FunctionTooLong \u2014 graphite_desktop_ui::input::process 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":"desktop/ui/src/input.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5c27ea5b74cd7c350accaf090662107c79e39dcaf68a12b5b62e25eb2b0a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 29 shared lines): editor/src/messages/portfolio/document/overlays/utility_types_web.rs:244-300 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:307-352 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:369-426 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:439-490 \u2014 These 4 members are variants of one another: a block of 29 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":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d5fb890f1ccb16ab64edd973a18fb4fdf49b590f5cb3d979f6870433d32391"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:635-769 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:771-877 \u2014 These two members are variants of one another: 37 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc701167a2ce373255531c0fc8b0e5f81b78a737435d3987afb1706dda5e3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): node-graph/nodes/transform/src/transform_nodes.rs:38-58 | node-graph/nodes/transform/src/transform_nodes.rs:70-90 \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":"node-graph/nodes/transform/src/transform_nodes.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"928fa9c5f504f82972cbc9b93fde1550a90c8bd416610aae23f11453b8b01093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:183-197 | node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:246-260 \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":"node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fe469acb475f332813001b81e4a479cfacd6c70cff11a60844eea896d59bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): node-graph/nodes/transform/src/transform_nodes.rs:259-274 | node-graph/nodes/transform/src/transform_nodes.rs:313-327 \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":"node-graph/nodes/transform/src/transform_nodes.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8955b3c26a0db44381315f9635368b32b9ff1c906f90ceae9f1d3b1f798ffa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): node-graph/libraries/rendering/src/renderer.rs:799-871 | node-graph/libraries/rendering/src/renderer.rs:1462-1664 | node-graph/libraries/rendering/src/renderer.rs:2364-2443 | node-graph/libraries/rendering/src/renderer.rs:2657-2683 | node-graph/libraries/rendering/src/renderer.rs:2789-2869 \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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56efcd30bef1cdf077edbbd1c60ef94c79e05d152ea1812b94c49a9df488125"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:779-789 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:802-812 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:830-840 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:843-853 \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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce3909a11998fa8825461739e36601a719c2b71139619b0bd833c14253b4a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): document/graph-storage/src/schema/value.rs:44-112 | document/migrations/formats/src/v4.rs:317-384 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/schema/value.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b30a817236e34f606b17d9577775fc0567c9f220053bb13f6d5d0c9e2348a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:147-211 | node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:145-223 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"054b9b12759c255b8d5a1ab9db875cf124494e16dd49119e8e52d0b0bb69abd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): node-graph/libraries/rendering/src/renderer.rs:2446-2494 | node-graph/libraries/rendering/src/renderer.rs:2578-2629 \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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c44462a57916aa1831967687f5c725965a568808b176e162bddef69034b55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:127-168 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:131-177 \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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1c86a7c9882bbafeda68649f530e2ac48fc22aacf7f4944b0d38a87e757c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): node-graph/nodes/raster/src/filter.rs:210-255 | node-graph/nodes/raster/src/filter.rs:261-298 \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":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9c89b8031a1c938332bf01c7a31bf721df9ff5b0e34e4def6087f275cb66f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 47\u002B corresponding lines): editor/src/messages/tool/tool_messages/freehand_tool.rs:157-203 | editor/src/messages/tool/tool_messages/pen_tool.rs:251-305 | editor/src/messages/tool/tool_messages/spline_tool.rs:164-217 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 47 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":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb0da35cea777f686c59344877076db11f76c2206a84b60b023bcd781943dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_functions.rs:91-133 | editor/src/messages/portfolio/document/overlays/utility_functions.rs:143-191 \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":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb33af7dc7175ebf5a17ec13bfc391b6d6ed54e7fe997a1d9fb82f6e06e0017d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): editor/src/messages/tool/tool_messages/freehand_tool.rs:97-152 | editor/src/messages/tool/tool_messages/spline_tool.rs:104-159 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3941cb6b02e44e572431f01f17cd213ebc05c53a818fbd980b8016a74ed38e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:76-106 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:88-122 \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":"editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4c5c0c40d3020044d4889adc03b1cc3c0923a4ce735cf554b5770b9020c34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): editor/src/messages/tool/tool_messages/artboard_tool.rs:649-675 | editor/src/messages/tool/tool_messages/text_tool.rs:1123-1153 \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":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d458f33c312ad1a169e77e09d9e3f2cf11ce440890e62edc9dc7ffd4421750"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): editor/src/messages/dialog/simple_dialogs/failed_to_load_documents_dialog.rs:46-112 | editor/src/messages/dialog/simple_dialogs/failed_to_open_document_dialog.rs:19-83 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/dialog/simple_dialogs/failed_to_load_documents_dialog.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba9a7c1e5b9db66108dd87de6824a48675e4c80bfbf7024679c5e3e71a75dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): editor/src/messages/tool/tool_messages/select_tool.rs:565-602 | editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:749-776 \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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5307c796f123dfaf11238bf93361afe06e5b1211a83d6e7481939675f39396a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:685-712 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:558-592 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"b083551b6dbd962da32b4f4e929e447bb386c81be8ca83d32c2bc7f239f3ee8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): editor/src/messages/layout/utility_types/layout_widget.rs:275-312 | editor/src/messages/layout/utility_types/layout_widget.rs:325-364 \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":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf680b8ec6ba7bd3ab0a7af343aeaa52ac0c32a7c74ff21b43e218296939d621"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): libraries/rawkit/src/decoder/arw2.rs:24-58 | libraries/rawkit/src/decoder/uncompressed.rs:25-67 \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":"libraries/rawkit/src/decoder/arw2.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b9a4c5daf154cec3cdbe628c538e4a5b0cb67a10ca89d6d7ac89db6d11887d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): node-graph/libraries/graphic-types/src/graphic.rs:825-844 | node-graph/libraries/graphic-types/src/graphic.rs:846-865 \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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1541f778f779a699e0dff93cb9ae143a34f948999d4f5211c853a6ca9bdd24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): node-graph/libraries/rendering/src/renderer.rs:1057-1076 | node-graph/libraries/rendering/src/renderer.rs:1078-1104 | node-graph/libraries/rendering/src/renderer.rs:1209-1228 | node-graph/libraries/rendering/src/renderer.rs:1230-1249 \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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7c46aeb70333e19ac38b4135c5cb9f9832cc484221d0b659ac1cf49dea925d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:35-74 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:53-86 \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":"editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"599a569a78b29f88fa6e64ef06a995a226fc0bf6b4fe84a9f599ffaaef9c3d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): node-graph/nodes/brush/src/basic_brush/pipeline.rs:271-315 | node-graph/nodes/gstd/src/render_pixel_preview.rs:107-173 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/brush/src/basic_brush/pipeline.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"287d5048f5d45f95462f17790019e57a4cccfc5037315284564cd34b53ce6980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): editor/src/messages/tool/common_functionality/compass_rose.rs:13-44 | editor/src/messages/tool/common_functionality/pivot.rs:229-262 \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":"editor/src/messages/tool/common_functionality/compass_rose.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf54514b2f920c713d9e3488ef599eda9db9789486f7d0c5dc96b43525e5314"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): editor/src/messages/tool/common_functionality/shapes/ellipse_shape.rs:29-50 | editor/src/messages/tool/common_functionality/shapes/rectangle_shape.rs:29-50 \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":"editor/src/messages/tool/common_functionality/shapes/ellipse_shape.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5a5eb1b0f0fc7b1f7f84bf5c0f944babcfa8a8cb4095ab534f3bf3ca0966be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): editor/src/messages/layout/utility_types/layout_widget.rs:728-756 | editor/src/messages/layout/utility_types/layout_widget.rs:758-786 \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":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"237fb11a42584ebc11897e4dfe3b7c7b4c4412c826ee5c4f0abd4bc2576652f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): document/container/src/backends/opfs.rs:362-388 | document/container/src/backends/opfs.rs:390-425 \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":"document/container/src/backends/opfs.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52664adc41c31dc99ee565082a0495d108395c5c05540dd3369a083ea3090db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): node-graph/nodes/repeat/src/repeat_nodes.rs:86-115 | node-graph/nodes/repeat/src/repeat_nodes.rs:146-172 \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":"node-graph/nodes/repeat/src/repeat_nodes.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3055b764c70df1f482c00bd79f8925d9fc759d7edabbf4842d5b044629a23ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): editor/src/messages/tool/common_functionality/shape_editor.rs:769-791 | editor/src/messages/tool/common_functionality/shape_editor.rs:795-817 \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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e02eb0075d227479423bb2b970d7ed485014eeaef6c467e90d9c05474f9550"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:531-557 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:560-586 \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":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"024fe197fa23e8703aa6dc1004ab1d664dccdcf538e980a8e73b0e200cd1298c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libraries/math-parser/src/value.rs:504-525 | libraries/math-parser/src/value.rs:527-548 \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":"libraries/math-parser/src/value.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53b9eafc5bd0d0abf7957aa8902ed8e0f28bf0aa5a5d0da6e6955013658a0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:653-674 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:677-698 \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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90bea521b1d79a5f776c17c45ccb5620b9ba5f031707ec684c712c8ebea7cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): editor/src/messages/tool/common_functionality/gizmos/gizmo_manager.rs:135-146 | editor/src/messages/tool/common_functionality/gizmos/gizmo_manager.rs:156-167 \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":"editor/src/messages/tool/common_functionality/gizmos/gizmo_manager.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4b6f9256a424f4005eac05970742c2b65aee2c2adc0daab0e619b8d268ff87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): node-graph/nodes/gstd/src/platform_application_io.rs:99-118 | node-graph/nodes/gstd/src/platform_application_io.rs:137-161 \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":"node-graph/nodes/gstd/src/platform_application_io.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d84ac6d7558ad2eff3c65f2fa53a8ab843827f707c0f4309b326b0bd6678ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): editor/src/messages/portfolio/document/utility_types/document_metadata.rs:557-572 | editor/src/messages/portfolio/document/utility_types/document_metadata.rs:575-590 \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":"editor/src/messages/portfolio/document/utility_types/document_metadata.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69747a28ce89b99c9d565b8422188a485238ebdd2095f003fb18b5383198574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): node-graph/libraries/vector-types/src/vector/misc.rs:525-541 | node-graph/libraries/vector-types/src/vector/misc.rs:546-565 \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":"node-graph/libraries/vector-types/src/vector/misc.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d72ed31a480eb610cd2790d015e44827ce2b6cf8ac383b065ce8ffa3dc3584b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): editor/src/messages/tool/utility_types.rs:175-194 | editor/src/messages/tool/utility_types.rs:196-215 \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":"editor/src/messages/tool/utility_types.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1045bdd159bf6030f66463411452713c691f2619f1d301ecc549532afd7a95e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): node-graph/libraries/wgpu-executor/src/vello_render.rs:654-689 | node-graph/nodes/brush/src/basic_brush/convert.rs:54-79 \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":"node-graph/libraries/wgpu-executor/src/vello_render.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"8955ac7f0aeb227aeeb4642874f876bceb663c074fbb4ef2a0356bcd7ead75f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): document/graph-storage/src/schema/value.rs:24-38 | document/migrations/formats/src/v1.rs:398-411 | document/migrations/formats/src/v4.rs:299-313 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/schema/value.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4e1f8990f1c37f4c5345ad4bcae5d98c13c28206ea8eb6b1a4b710627128d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_functions.rs:712-722 | node-graph/libraries/core-types/src/color/color_types.rs:113-125 \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":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"c459b21f7f8fc508d4fd4fe4085c953a42d5ffc209224386faab352080086740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:321-346 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:349-381 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:649-665 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0d79f3ffd966949d6db66911efc2fb04919cbacb0fcf2eb57649b890709512"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): editor/src/messages/dialog/simple_dialogs/close_document_dialog.rs:15-39 | editor/src/messages/dialog/simple_dialogs/failed_to_load_documents_dialog.rs:14-42 \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":"editor/src/messages/dialog/simple_dialogs/close_document_dialog.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aa172de7a53bf3a21be69b8f65075a972b2d6102569046c26cfd945f717d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:269-285 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:288-303 \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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0be3537d3aea654031f81467bc44405fd88054870a391afb7783c7c7c8cf61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libraries/math-parser/src/executer.rs:162-171 | libraries/math-parser/src/executer.rs:174-183 \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":"libraries/math-parser/src/executer.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23f4eab02d988542c4d763153d17b52066d9c6ac4080fa4d46a6c5635e9858c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:863-877 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:741-755 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb95a148cb4c36b493bc924e2f766297ddf0ca85b132ed0f89f99ed851753c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): desktop/bundle/src/mac.rs:20-36 | desktop/bundle/src/win.rs:9-22 \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":"desktop/bundle/src/mac.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ba5dd6bbdbe16ebdd294293d32fcaa458ce6783a926621796260682caeb9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:277-287 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:304-317 \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":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbcae0a11d2e955d23fd40ef669d8a5cc104703a37d0011012adf8b5f613e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): node-graph/nodes/graphic/src/graphic.rs:287-299 | node-graph/nodes/text/src/lib.rs:289-306 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e4b5f51e3be7ece0bd3ea09cabfa81cf479478e7ad4d7915f9b07f901eb660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): editor/src/messages/tool/common_functionality/color_selector.rs:545-566 | editor/src/messages/tool/common_functionality/color_selector.rs:569-588 \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":"editor/src/messages/tool/common_functionality/color_selector.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f24420b4b2ab2c548d18022787705c4df9d13e04773d6aed10d7cda5c87ecb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): node-graph/libraries/core-types/src/list.rs:1641-1659 | node-graph/libraries/core-types/src/list.rs:1661-1682 \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":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"addf23a22b06ee1afb562681866563973a0d2808d1d641afdd07c1e750047075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:597-616 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:618-633 \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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d26c14a17300541aa93b7e2e2b9ed9e158384df8f161542936a5f37f00da9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): node-graph/libraries/core-types/src/poll.rs:164-184 | node-graph/libraries/core-types/src/poll.rs:218-237 \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":"node-graph/libraries/core-types/src/poll.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f6c7e14d527474f844b4b64e9ca5021f6485272f21434b27b8d69dbbb7eac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): document/format/src/persist.rs:491-510 | document/format/src/persist.rs:530-548 \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":"document/format/src/persist.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e5c14b5bc1f137e081db475e501759ad561f936f0447504a8efe6eca471ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): editor/src/messages/layout/utility_types/widgets/input_widgets.rs:185-206 | editor/src/messages/layout/utility_types/widgets/input_widgets.rs:400-416 \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":"editor/src/messages/layout/utility_types/widgets/input_widgets.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"223c9db849a6aa878c1c03ab79a49047df61946b7a592d8355762391a083ea3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): node-graph/libraries/graphic-types/src/graphic.rs:687-703 | node-graph/libraries/graphic-types/src/graphic.rs:706-722 | node-graph/libraries/graphic-types/src/graphic.rs:725-746 \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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"4309d9b75d5880cf42fffc366da40ff33d66cc5185823a085172f42ac731d8f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:732-746 | editor/src/messages/portfolio/document/overlays/utility_types_native.rs:762-773 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9bd65d17610bcf97142581f8e4b1d61ff58118f877da3e6fccc09ffc62536c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1085-1103 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1007-1025 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ce9c4b7e3b319ddb03101048cce0e8ca591f399c8820ec76e035ba05f1ef84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:464-481 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:534-551 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:969-986 \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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc6326d08d81289a485f090c7e4ebbde482991955f995d03fa42578e407331f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/portfolio/sync/sync_message_handler.rs:747-759 | editor/src/messages/portfolio/sync/sync_message_handler.rs:761-778 \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":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"401bdf6c6b784c71303dfb141476eee02568bfb6f6c38290aff59ad991705851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:474-487 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:490-503 \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":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"619bce73b0d3cb07bdfdfae6a86372b21196dbb286dbd9ca3efcad06d6a1e3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): editor/src/node_graph_executor.rs:1082-1098 | node-graph/preprocessor/src/value_types.rs:112-131 \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":"editor/src/node_graph_executor.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4145c3baa55289364bd46b5bde03d3e7e848ec03898302e62bc2b58d83f207f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:3797-3815 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:3821-3835 \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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":3797}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cbe56c7c71b8f4a2c11b7e4e0585eac80dda4bc36172d16d63a418c03183b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libraries/rawkit/src/tiff/types.rs:310-325 | libraries/rawkit/src/tiff/types.rs:331-350 \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":"libraries/rawkit/src/tiff/types.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff84e228f16d206af037355c937150b0743be2ae9166489c4f5b24fbcbbc59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/portfolio/document_migration.rs:3854-3866 | editor/src/messages/portfolio/document_migration.rs:3894-3906 \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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3854}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71aca90559f1d380f307a17e0758767ab33d67f5f7c074dd263d9a6ede425ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): node-graph/libraries/vector-types/src/vector/algorithms/shapes.rs:179-192 | node-graph/libraries/vector-types/src/vector/algorithms/shapes.rs:195-210 \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":"node-graph/libraries/vector-types/src/vector/algorithms/shapes.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2fc138ab423334f76de5dd6d47fb5db894f1114288a9f5ad5b3d7155e00913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): editor/src/messages/tool/common_functionality/utility_functions.rs:142-156 | editor/src/messages/tool/common_functionality/utility_functions.rs:166-179 \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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d240f971d36e36d7bd5bda003cf0c183f55cd1919088743d137b5d322bbb481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): frontend/wrapper/src/editor_commands.rs:352-367 | frontend/wrapper/src/editor_commands.rs:390-405 | frontend/wrapper/src/editor_commands.rs:420-435 \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":"frontend/wrapper/src/editor_commands.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3f2a59b2f1342178a5ce8019c9a537ada372af9509e2f0e195a751047ec459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): node-graph/nodes/graphic/src/graphic.rs:1058-1086 | node-graph/nodes/vector/src/vector_nodes.rs:1867-1886 \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":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"210c304604997e7e51e08a55d63865d6c9077680dc4a08fe2501ebc109680328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs:911-922 | editor/src/messages/portfolio/document/utility_types/network_interface/storage_metadata.rs:173-184 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"a911fd5fe71698473a28e3529d1d6e94e90f21722dc1386290018b72c9a0c3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): editor/src/messages/tool/common_functionality/shape_editor.rs:121-135 | editor/src/messages/tool/common_functionality/shape_editor.rs:137-151 \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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c899f55cdace12387b8abefe9ee40f23bebc3d9eb63d634983c041aec352c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libraries/rawkit/src/lib.rs:235-252 | libraries/rawkit/src/lib.rs:269-287 \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":"libraries/rawkit/src/lib.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e983988a8ebf898f6286d1e8eaaf52bbbdf661f3984c488e389c8acc99261c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): document/format/src/export.rs:297-312 | document/format/src/persist.rs:370-385 \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":"document/format/src/export.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a23029fdcc10b505096342450529909af5a9c54c99bb4f6e8e121e35523ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): node-graph/nodes/raster/src/filter.rs:177-190 | node-graph/nodes/raster/src/filter.rs:192-204 \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":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6171602572adcfe23f9e5afabd2378e7590edccdec7ccc0d143c43338a1b802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:813-827 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:1030-1043 \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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"11229fdcfaef7622c734204de3c6c7d8c595fbe03d2c7157af88e434cede8a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): editor/src/messages/tool/tool_messages/brush_tool.rs:581-591 | editor/src/messages/tool/tool_messages/eyedropper_tool.rs:177-189 | editor/src/messages/tool/tool_messages/fill_tool.rs:225-235 | editor/src/messages/tool/tool_messages/freehand_tool.rs:388-399 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 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":"editor/src/messages/tool/tool_messages/brush_tool.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b14b697ba8ead89d312ea2e65b1914bc1dae9085b49dbb74393d38299dec624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): editor/src/messages/portfolio/document/utility_types/document_metadata.rs:531-541 | editor/src/messages/portfolio/document/utility_types/document_metadata.rs:544-554 \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":"editor/src/messages/portfolio/document/utility_types/document_metadata.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd399d6062f62e0c115eb264f9a67ed3fd43f2dd0a335420f327956f915a7e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/tool/common_functionality/color_selector.rs:507-519 | editor/src/messages/tool/common_functionality/color_selector.rs:522-537 \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":"editor/src/messages/tool/common_functionality/color_selector.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a705c77d7b5c1b58fdf84d0ab506b5fec248fc979c522c2ef9b9442ab3e2b1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): editor/src/messages/tool/common_functionality/stroke_options.rs:100-112 | editor/src/messages/tool/common_functionality/stroke_options.rs:117-127 | editor/src/messages/tool/common_functionality/stroke_options.rs:171-181 \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":"editor/src/messages/tool/common_functionality/stroke_options.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2323d44133668fc0544ddae26c968ba9885ec4c18dbe9cf844b8cae67283e986"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): editor/src/messages/tool/tool_messages/path_tool.rs:657-672 | editor/src/messages/tool/tool_messages/select_tool.rs:716-731 \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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05c4f0839efb83b7853181f7b34e2443e74e6a498c595fda1f624eeae582780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:1457-1473 | editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:1516-1533 \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":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebc0fc17e5cb09f5ba50ccf9194bb7346e06d4f031ba86b30ce4330bb532a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:855-861 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:733-739 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"658222d7344aaf1429755f26b015793c256df31e8a9a32fb75b105743704aba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/portfolio/document/document_message_handler.rs:2331-2343 | editor/src/messages/portfolio/document/document_message_handler.rs:2369-2382 \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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"16db4fc66065d92eb4758cfb31a4fde97686abf327dba0fd34768011d3d336f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): node-graph/libraries/core-types/src/list.rs:936-946 | node-graph/libraries/core-types/src/list.rs:949-961 \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":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6569b0fc3e9dd61ddec34fa9dc5095a1cdab80d058223238d1ceecffde6b2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): node-graph/nodes/graphic/src/graphic.rs:434-446 | node-graph/nodes/text/src/lib.rs:973-985 \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":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c6f15f721d0849cee1b455379ccff651d2b78ef6cd1b83310c3d2be0b575c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): editor/src/messages/tool/common_functionality/snap_session/scene_mirror.rs:66-73 | libraries/snapping/src/curve.rs:288-295 \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":"editor/src/messages/tool/common_functionality/snap_session/scene_mirror.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed343d10547ef5107b6518645c1efdfd81f4f86de06b7bd83d435ca1f2c28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): node-graph/libraries/rendering/src/vello_scene_builder.rs:110-117 | node-graph/libraries/rendering/src/vello_scene_builder.rs:120-127 \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":"node-graph/libraries/rendering/src/vello_scene_builder.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ea9b5a8eaa0c73d202f8da84ef1ec7e574df0490ade3e8f7b602542030a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): node-graph/nodes/gcore/src/animation.rs:108-119 | node-graph/nodes/gcore/src/animation.rs:154-163 \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":"node-graph/nodes/gcore/src/animation.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"30477bc9279b9d929e57d03837df553fcfff8faec43a0f5d815ca1b0e9d0eae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): editor/src/messages/portfolio/document_migration.rs:1878-1887 | editor/src/messages/portfolio/document_migration.rs:1890-1898 \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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcafcd4eec67846393a08ce8dabf1ce6a0e92fa2536210fc632e244a9af96a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): node-graph/libraries/vector-types/src/vector/vector_modification.rs:1108-1119 | node-graph/libraries/vector-types/src/vector/vector_modification.rs:1128-1139 \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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37d9cd878c5c0621416d28894852561728aef309e0fbba5319c93c84522f226"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): node-graph/libraries/vector-types/src/vector/vector_types.rs:170-176 | node-graph/libraries/vector-types/src/vector/vector_types.rs:179-185 \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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc36f8ca5994fc408d0d2884611859c4c9c673b503f871d4bc69eb691a2b077"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): node-graph/nodes/vector/src/vector_nodes.rs:1759-1773 | node-graph/nodes/vector/src/voronoi.rs:300-309 \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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec68727fd9a9385fa8873005a7ba98cda9106aef79c1e97dbe9330ecaf802ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): node-graph/libraries/core-types/src/color/color_types.rs:763-768 | node-graph/libraries/core-types/src/color/color_types.rs:771-776 \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":"node-graph/libraries/core-types/src/color/color_types.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7f03bbd4a84fba2f90bf3098439b5432b4481fb9686547bb1d5ab8b23feac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): desktop/ui/src/frames/plane/mac.rs:80-89 | desktop/ui/src/frames/plane/mac.rs:91-100 \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":"desktop/ui/src/frames/plane/mac.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cd814b30f576bb4fbefcc6aa576508e11a735db26f8343cb3e1a86871793a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): editor/src/messages/color_picker/color_picker_message_handler.rs:825-836 | editor/src/messages/color_picker/color_picker_message_handler.rs:838-850 \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":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d3dd9b1f6cfab012eaf39f02855c59118a2347a4348fadc69ce24255da8e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/messages/portfolio/document/utility_types/nodes.rs:140-146 | editor/src/messages/portfolio/document/utility_types/nodes.rs:148-154 \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":"editor/src/messages/portfolio/document/utility_types/nodes.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d827d344161ecb8ad1025ef1a1de17f399c837cfc0734ff0bdda64274c7ec5b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/tool/tool_messages/path_tool.rs:739-752 | editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:713-725 \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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016c31e8fcb952a08b8926d978b13af1e3fa86c9788d0b81a745b1d54f34e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 9\u002B corresponding lines): document/container/src/lib.rs:364-372 | document/container/src/lib.rs:374-382 | document/container/src/lib.rs:384-392 | document/container/src/lib.rs:394-402 | document/container/src/lib.rs:404-412 | document/container/src/lib.rs:414-422 | document/container/src/lib.rs:424-432 | document/container/src/lib.rs:434-442 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/container/src/lib.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"60204a9d76a622f88905778434d519e35cf89b3ca36fd179b06bba6c028548b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): document/format/src/persist.rs:263-274 | document/format/src/persist.rs:361-368 \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":"document/format/src/persist.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c34e4f17390f976844a57310c378b5a686d7dafbb5f7d1ea44ad5ab4e39a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1294-1301 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1165-1172 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"63104eeeb3417afc6599fae5df42e6c8df044e49fe6039e49fa99ca71673141a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/store/cursor.rs:259-273 | editor/src/messages/portfolio/document/utility_types/network_interface/store/cursor.rs:289-303 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/store/cursor.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae1f7dc82be8f0dfc3311f6ad5b88bfe2dfb6b7ed114d08240287ac42be853e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/types.rs:845-849 | editor/src/messages/portfolio/document/utility_types/network_interface/types.rs:852-856 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d18f14fe3cd36751e6333d64dc0433c387ef9aa89145fcea93cceb684d5700"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): editor/src/messages/tool/common_functionality/shapes/arc_shape.rs:134-143 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:113-122 \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":"editor/src/messages/tool/common_functionality/shapes/arc_shape.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"455a00ff841219da293c0e1b91e36c0ddc1274cd6fc6bd9a43ca3eca41b1e365"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): node-graph/libraries/core-types/src/list.rs:796-804 | node-graph/libraries/core-types/src/list.rs:1326-1334 \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":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"7913bef872579a9133f4abe1f5a2216fe5a5e08d09793d5ad576859824c75c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:84-95 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:97-107 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:109-119 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:237-247 \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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0989b0b699245dba4cbfa4c70a590fb49372b051e84202c95b8da7d81f0d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/types.rs:419-426 | editor/src/messages/portfolio/document/utility_types/network_interface/types.rs:428-435 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfbefd1439fbf82bb880c8f85c50a939e9c35161c711ee43a6714463941618b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): editor/src/messages/tool/tool_messages/shape_tool.rs:141-156 | editor/src/messages/tool/tool_messages/shape_tool.rs:158-171 | editor/src/messages/tool/tool_messages/shape_tool.rs:237-251 | editor/src/messages/tool/tool_messages/shape_tool.rs:253-267 | editor/src/messages/tool/tool_messages/shape_tool.rs:269-283 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1930bb48b4157e7f5af196d62dcf67ed180aa066cf2a6a7a8b13dc1200ba95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libraries/snapping/src/scene.rs:233-246 | libraries/snapping/src/scene.rs:249-262 \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":"libraries/snapping/src/scene.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"088c6d25af6ab1077b746133fff5eda47b7c7882c205821b9b71c466fea36e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): node-graph/interpreted-executor/src/dynamic_executor.rs:315-319 | node-graph/interpreted-executor/src/dynamic_executor.rs:336-340 \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":"node-graph/interpreted-executor/src/dynamic_executor.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9780d91977331e7fb9558b2f622f82562377642653cb6e88b71e73205eb61b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): node-graph/libraries/core-types/src/math/bbox.rs:30-35 | node-graph/libraries/core-types/src/math/bbox.rs:48-53 \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":"node-graph/libraries/core-types/src/math/bbox.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fb85e06071040b73efe863cfe4ba1ba2a043317ab09a5af2853431db7f84c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): node-graph/libraries/wgpu-executor/src/vello_render.rs:513-530 | node-graph/nodes/brush/src/basic_brush/pipeline.rs:390-404 \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":"node-graph/libraries/wgpu-executor/src/vello_render.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcd322665c7c935c2002a6905d7c0194c3625fc09c070e67aa413639b090a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3133-3151 | editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3153-3170 \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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d47bcaf046c5e452097dfc1b17522386b07072e6c903bd5d5100df1b5fa6fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): node-graph/libraries/core-types/src/misc.rs:111-125 | node-graph/libraries/core-types/src/misc.rs:129-143 \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":"node-graph/libraries/core-types/src/misc.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24b664b8bbfc093c5023a1e4f318949b0e63a721958cfcf66f62bb5dd1679c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): document/container/src/lib.rs:444-452 | document/container/src/lib.rs:454-462 | document/container/src/lib.rs:464-472 | document/container/src/lib.rs:474-482 \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":"document/container/src/lib.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f975bf5b457da87ed12eadb30c1146cb6bab1ce88036499badc68dc79256bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:77-92 | editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:66-81 | editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:431-438 | editor/src/messages/dialog/simple_dialogs/close_all_documents_dialog.rs:17-32 | editor/src/messages/dialog/simple_dialogs/confirm_restart_dialog.rs:13-28 \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":"editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a920896a9e56bf2e9d2c1dac6b1b1f631a65d48faf6c2f9c440465da2a4b3869"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:202-213 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:215-226 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:228-239 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:241-252 \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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7de05c6b00e533208278a0d8bc9060fa13a3fc7847b1e350703d8b4f9ac3fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): editor/src/messages/tool/common_functionality/shape_editor.rs:1911-1925 | editor/src/messages/tool/common_functionality/shape_editor.rs:1928-1943 \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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"846d83f48543cb22a2224729e02deea68fed8c53b3ad899991a694a6ad283aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libraries/snapping/src/curve.rs:180-189 | libraries/snapping/src/curve.rs:193-207 \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":"libraries/snapping/src/curve.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f773809e1a4a843f813fb67d7e91fd0a4f68047f1d9a799456a3c74aaec673d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): document/graph-storage/src/prior.rs:151-159 | document/graph-storage/src/prior.rs:161-169 | document/graph-storage/src/prior.rs:171-179 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"document/graph-storage/src/prior.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e294b7c555f06a22763aee3d216b688043a4bbcc1d8435875e37c4d720595033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): node-graph/libraries/rendering/src/renderer.rs:963-974 | node-graph/libraries/rendering/src/renderer.rs:1025-1038 | node-graph/libraries/rendering/src/renderer.rs:1041-1054 \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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"2784c0fd30902f2717eeb72d75764166d180432b959ddc19a0e0ce584446a92f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:176-184 | editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:187-195 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeee329a5891271028b09842668453d8a2a785a01be9dfc08ae8532bede04a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): node-graph/nodes/math/src/lib.rs:1506-1514 | node-graph/nodes/math/src/lib.rs:1524-1532 \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":"node-graph/nodes/math/src/lib.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1b23b2fe4af2e3921551278bf7496b64c96c8fa20fe013171b3c74c6ff663"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/view.rs:276-286 | editor/src/messages/portfolio/document/utility_types/network_interface/view.rs:301-310 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/view.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d7bde30859188618cbf7f6fcfba6e41960bb3908f58445f82491280d689db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:1046-1057 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:1060-1071 \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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"964201a17f7cef5c060ae15e750b718478e2facbf1099a7b7f6e3542920a5013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:1159-1166 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:1181-1188 \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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5730fa2a794f5178fabc045ba5ee20f4e7727aaf574d6e6fdff7c5af02a9c33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): document/container/src/backends/opfs.rs:186-196 | document/container/src/backends/opfs.rs:198-208 | document/container/src/backends/opfs.rs:210-217 \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":"document/container/src/backends/opfs.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be216db7dfd429ffd5a14d9ee78680352982bb929c3a75a1c3710e71859e3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): node-graph/libraries/rendering/src/renderer.rs:118-124 | node-graph/libraries/rendering/src/renderer.rs:126-132 \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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54dca404c3c64ea32c98d5ad443c965c52f040c344268a214ae648175d94359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): document/format/src/persist.rs:423-428 | document/format/src/persist.rs:699-706 \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":"document/format/src/persist.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff790ce448a3b2b8984b55720de10e855286be937f6a477df9f681c2da5d2a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1648-1655 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1658-1665 \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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"050dfcd809de188bcde936c435723eafff6dfac003dccbe0607523f3476f58dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_web.rs:928-940 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:942-954 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbd3af9ddbf1b90148d568094c8a2e1d25b2e82a3d89da55592e4cbe22ba6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:292-296 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:404-411 \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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8dba979f41e6ffd620decb5bfa12aaeb4de63dc4c750d6492583d384e7e15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): document/migrations/formats/src/steps/v3_to_v4.rs:45-66 | document/migrations/formats/src/steps/v3_to_v4.rs:142-163 | document/migrations/formats/src/steps/v3_to_v4.rs:197-210 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/migrations/formats/src/steps/v3_to_v4.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e715d3a44b0346746e6cad4211833d501a9fb2c2bdd95a642072adae89417f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1026-1032 | editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1035-1041 | editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1043-1049 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b82a6339cfb76ddf8863bdc8666bf63c5b3cefa4859d3b3c874670d17a2554"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): editor/src/messages/tool/common_functionality/shape_editor.rs:868-876 | editor/src/messages/tool/common_functionality/shape_editor.rs:879-887 \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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c713cf73c2b8a0435e57171382a2b26df30f611dc6b05e47f297f7edbbfb1b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): node-graph/libraries/vector-types/src/gradient.rs:1104-1113 | node-graph/libraries/vector-types/src/gradient.rs:1117-1126 \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":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee9428ae030fb88bc972d9e6fc3a0b4047b143c0766d137910fb5a4c7b6bad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): node-graph/nodes/math/src/lib.rs:1827-1835 | node-graph/nodes/math/src/lib.rs:1858-1865 | node-graph/nodes/math/src/lib.rs:1887-1894 \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":"node-graph/nodes/math/src/lib.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bb70b01edaf523a225ccd38989d22cdc1ba818541fc0a7d26d4b15fd0b589b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): node-graph/nodes/text/src/l_system.rs:557-568 | node-graph/nodes/vector/src/turtle.rs:278-294 \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":"node-graph/nodes/text/src/l_system.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c95df0dcbe1101c338c63b20112887a29e360a3bb4486fe16e5805d9edf03c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): document/container/src/backends/opfs.rs:125-133 | document/container/src/backends/opfs.rs:135-141 | document/container/src/backends/opfs.rs:143-151 \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":"document/container/src/backends/opfs.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0ff7c69326fbee2ce2db57504ff15e42be59029eaa507c66429a028b10b75a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:513-519 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:855-862 \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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a61129b16999180fbf79b58b791e36bfceac75e8c1e0b347c42cbb1d7c4b0a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:629-636 | editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:638-645 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc618c04ecf3cef997bdf34f7770a108abc847d3d34bfa3513199bf0118e162d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): document/graph-storage/src/schema/value.rs:121-129 | document/migrations/formats/src/v4.rs:389-397 \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":"document/graph-storage/src/schema/value.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2d3dfaba1e0aa684f403a23b9a04b15ebcdf854fb81a1721d2cb95665eca68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:447-455 | editor/src/messages/layout/utility_types/layout_widget.rs:128-136 \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":"editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b1a8d7a952d6877593de61db732574ffa905b21d949815afe2a2c26857aa95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:292-304 | editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:437-450 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a5687da608ba4f13f595037c148c7b50cdcc7738540774b675b745d84e3f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/store/cursor.rs:186-198 | editor/src/messages/portfolio/document/utility_types/network_interface/store/cursor.rs:201-213 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/store/cursor.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19dd953fd4478c4d0f8d1dcc536412896a7493552a277d85def6f8e849abbb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:1152-1156 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:1169-1178 \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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf831e2d4179b4d217563c68712f676820c5facbb6cf83835cefaccd79c5e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): editor/src/messages/portfolio/document/document_message_handler.rs:2965-2974 | editor/src/messages/portfolio/document/document_message_handler.rs:2976-2984 \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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b19c25fb95b3cb4776c0234ebdeded55c1066417925c1397b076cf2b5192fe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:531-537 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:558-564 \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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"404fae34e82ac389c1bdded3e76347e81e951cab85fa34c0baa4114f9a3a8571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): editor/src/messages/tool/utility_types.rs:639-649 | editor/src/messages/tool/utility_types.rs:685-695 \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":"editor/src/messages/tool/utility_types.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2a6dcde034d28e44abf665fc82b28472f679f5d24cbbb1743a640d239621a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): node-graph/libraries/core-types/src/types.rs:497-512 | node-graph/nodes/text/src/l_system.rs:600-615 \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":"node-graph/libraries/core-types/src/types.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78ff5a95fad3b31f90c3285fddb262de0a547003c3d49c5adbffad7feddfb59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): node-graph/libraries/rendering/src/renderer.rs:1415-1422 | node-graph/libraries/rendering/src/renderer.rs:1424-1431 | node-graph/libraries/rendering/src/renderer.rs:2196-2204 \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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"49745d8aa44718bba9fe4dc7eecacd50c3a7975b71fbab4ce223eaafaf1cbc66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): document/container/src/backends/opfs.rs:81-92 | node-graph/graph-craft/src/application_io/resource/opfs.rs:35-48 \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":"document/container/src/backends/opfs.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e99f3e71d74f347c3686732116115e9c41ab8b82244e7de91c671c3bbfc968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/messages/portfolio/document/utility_types/document_metadata.rs:84-90 | editor/src/messages/portfolio/document/utility_types/document_metadata.rs:224-230 \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":"editor/src/messages/portfolio/document/utility_types/document_metadata.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc441ed4d7bc56a6a0a4685cc0b8705b3dbce099118689b2bfd3ad2f3c4f8f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): node-graph/libraries/core-types/src/list.rs:920-932 | node-graph/libraries/core-types/src/list.rs:1254-1267 \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":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1076c18e2a46888b905fcf5cb0478308ddcd208d1b2a627e1f265501edc4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): node-graph/libraries/core-types/src/math/midpoint.rs:7-20 | node-graph/libraries/core-types/src/math/midpoint.rs:24-31 \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":"node-graph/libraries/core-types/src/math/midpoint.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f41c49e0fd25baae7c1f611f6f799aaa346f6c582856c0515eacd1dd6e2e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:902-910 | editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:929-939 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cccd9cb122a599ed451bff82f79d3c7275388e4c95e88f3548eb6eb5042454"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs:967-972 | editor/src/messages/portfolio/document/utility_types/network_interface/storage_metadata.rs:106-110 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad7787361daadb5cc275b35707f6dfcc245bc24ba451356ff4963218f1d037e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/template.rs:238-244 | editor/src/messages/portfolio/document/utility_types/network_interface/template.rs:247-257 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/template.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"911b0945465a59f86c3789832517768a20fc01c013fe81333426c58290bb9fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): editor/src/messages/tool/common_functionality/shapes/ellipse_shape.rs:17-20 | editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:110-118 | editor/src/messages/tool/common_functionality/shapes/rectangle_shape.rs:17-20 \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":"editor/src/messages/tool/common_functionality/shapes/ellipse_shape.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"673b31a2281ea71765aec010d77eb364e2e5a494f0fcaf76e76b14f96a4f564b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): editor/src/messages/portfolio/utility_types.rs:464-470 | editor/src/messages/portfolio/utility_types.rs:473-479 | editor/src/messages/portfolio/utility_types.rs:482-488 \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":"editor/src/messages/portfolio/utility_types.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc1c22dfc3eb8228fa3deb63bab4052662891ad85b72def2adfb8a78d5807c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): node-graph/libraries/core-types/src/context.rs:671-678 | node-graph/libraries/core-types/src/context.rs:812-818 \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":"node-graph/libraries/core-types/src/context.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f402ee02e1aa6dd35cb575d62be7898919591512f02c8fb0ab1f3b807df9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): node-graph/nodes/text/src/l_system.rs:375-387 | node-graph/nodes/text/src/l_system.rs:390-401 \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":"node-graph/nodes/text/src/l_system.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"17323bc124eecf3aae98035f54c09001e08a1257d8e4711a05d46b24db1c54c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): node-graph/nodes/vector/src/generator_nodes.rs:43-51 | node-graph/nodes/vector/src/generator_nodes.rs:362-365 \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":"node-graph/nodes/vector/src/generator_nodes.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebac0d2f8d4e7fbf336895ddb14d8b33bc596f9e2e6b3c9f430a15f300f5a4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:792-798 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:414-420 \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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"8141819ff48ac81864480ba6a5d0ff6d67ef91e04369b79592290adb2295df59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libraries/math-parser/src/executer.rs:96-103 | libraries/math-parser/src/executer.rs:106-113 \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":"libraries/math-parser/src/executer.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8f5987b591e549409fd829bc64a7553dd40e187fdd712b9abf82ec2cf940ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): node-graph/node-macro/src/parsing.rs:812-819 | node-graph/node-macro/src/parsing.rs:821-837 \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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a0cac9f46d07e964a76c27186db564731043eaa6911bdebc996c5480a83fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:138-149 | editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:152-164 | editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:928-940 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e552720689320104de7dfe45faef7c359d92dd7b224e160f26002920aabc511"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): node-graph/nodes/math/src/lib.rs:1013-1019 | node-graph/nodes/math/src/lib.rs:1032-1038 | node-graph/nodes/math/src/lib.rs:1051-1057 | node-graph/nodes/math/src/lib.rs:2135-2146 \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":"node-graph/nodes/math/src/lib.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"602b985777a427c01757997767b91e44c973a2537f850da9666208d102acfaf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): document/peer-transport/src/mock.rs:165-171 | libraries/snapping/src/find.rs:45-50 \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":"document/peer-transport/src/mock.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee50a1f0466ca7279b8418897a4755f40d71bdf5cc716d35bafbffd0429ef1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): editor/src/messages/portfolio/document/document_message_handler.rs:2251-2256 | editor/src/messages/portfolio/document/document_message_handler.rs:2309-2313 \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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a6fdbf0e3ef6a903a94654989c17ccff7af919fe35e922d256183954a6d05f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 4\u002B corresponding lines): editor/src/messages/dialog/simple_dialogs/about_graphite_dialog.rs:15-19 | editor/src/messages/dialog/simple_dialogs/demo_artwork_dialog.rs:22-26 | editor/src/messages/dialog/simple_dialogs/documents_open_elsewhere_dialog.rs:14-18 | editor/src/messages/dialog/simple_dialogs/error_dialog.rs:14-18 | editor/src/messages/dialog/simple_dialogs/failed_to_open_document_dialog.rs:12-15 | editor/src/messages/dialog/simple_dialogs/licenses_dialog.rs:12-16 | editor/src/messages/dialog/simple_dialogs/licenses_third_party_dialog.rs:12-16 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/dialog/simple_dialogs/about_graphite_dialog.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e043066d662c3ed3d30ac95a3f1f3300f784ebec238dd44734883b5593c69aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): editor/src/node_graph_executor/runtime.rs:543-549 | node-graph/libraries/core-types/src/poll.rs:40-46 \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":"editor/src/node_graph_executor/runtime.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec86ae3ceb9abd84dd4aa242b69f467936e8b3bec30104cab6ab11b639ae60fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): node-graph/libraries/graphic-types/src/graphic.rs:491-499 | node-graph/nodes/gcore/src/ops.rs:70-78 \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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"920b87a15a8f6050b9c886be8211473aa1c7dd204c17211dd86c46827491aa2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): document/graph-storage/src/sorted.rs:12-16 | node-graph/libraries/resources/src/lib.rs:372-376 \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":"document/graph-storage/src/sorted.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5077b2c2442f353ac05a32d1af8079d5be90aeed99993283a9a6de533bb8dbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): editor/src/messages/portfolio/document/document_message_handler.rs:4344-4346 | node-graph/libraries/vector-types/src/math/mod.rs:10-12 \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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9856227e4b0e428ddfad9326ec9ce3d539047455c336b986326de0f8acf1da35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): editor/src/node_graph_executor.rs:714-720 | node-graph/libraries/vector-types/src/vector/click_target.rs:88-90 \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":"editor/src/node_graph_executor.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d88c66041e5c7bab4f53273176799f634126a4bc961d46eca6c06062038865"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): node-graph/graph-craft/src/compiler/flatten.rs:10-15 | node-graph/graph-craft/src/compiler/scope.rs:231-237 | node-graph/preprocessor/src/lib.rs:20-26 \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":"node-graph/graph-craft/src/compiler/flatten.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62edb5d1d5d89ce25175d030d321d046db0f3c8b50734cdb3000d9accb5801a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:714-717 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:630-633 \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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eab5a728e02c041a373802a45b9847f251922994e1f53b595f3ca021d55f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): node-graph/nodes/vector/src/generator_nodes.rs:171-174 | node-graph/nodes/vector/src/vector_nodes.rs:571-574 \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":"node-graph/nodes/vector/src/generator_nodes.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71d7bff06a56d4694c71f96206046e7a55cd6aa2a9ab8b11aab1b27a3ea57ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1353-1358 | editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:199-204 \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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad8a0e6011acaac2e3aed769660d21fe618dff3df6fc183b36c61cf1aae1700"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:30-33 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:30-33 \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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"deacdd95bd091ce21d437bdea11501bc6fb8fcb382ec09feb1a6aaf6d1ff2ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): desktop/ui/src/internal/keyboard_handler.rs:90-96 | desktop/ui/src/internal/life_span_handler.rs:44-50 | desktop/ui/src/internal/render_process_handler.rs:107-113 | desktop/ui/src/internal/render_process_v8_handler.rs:66-72 | desktop/ui/src/internal/resource_request_handler.rs:40-46 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/keyboard_handler.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3029147aa29dc216cdf5616002166f3aa6c7d0b5e26ea56b9906fd1d15e49d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs:924-927 | editor/src/messages/portfolio/document/utility_types/network_interface/storage_metadata.rs:78-80 \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":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb54dba27f1e5517875a7d9edcb9bce3182a743ae1b221c1003c227a0eb40b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): node-graph/libraries/rendering/src/render_ext.rs:186-194 | node-graph/libraries/rendering/src/renderer.rs:2544-2546 \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":"node-graph/libraries/rendering/src/render_ext.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ff5ba0bd6182f0a390f7ee12763d4030d5ed9eef1664b4e7a469599963ddde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): libraries/math-parser/src/matrix.rs:497-499 | libraries/snapping/src/curve.rs:606-608 \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":"libraries/math-parser/src/matrix.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af763296740981d24329427f2eaec3b72ffbea427fcad025dcad811ba69a8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59\u201360 lines \u00D7 3): document/graph-storage/src/schema/value.rs:45-104 | document/migrations/formats/src/v1.rs:416-474 | document/migrations/formats/src/v4.rs:318-376 \u2014 before extracting anything, compare \u0060document/graph-storage/src/schema/value.rs\u0060 and \u0060document/migrations/formats/src/v4.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060document/graph-storage/src/schema/value.rs:45\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/schema/value.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46ca7f5258826580009829025575997fdc3fad461c3e3b85917cbabe58ca587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201338 lines \u00D7 3): document/graph-storage/src/schema/resources.rs:47-84 | document/migrations/formats/src/v1.rs:245-279 | document/migrations/formats/src/v4.rs:205-239 \u2014 before extracting anything, compare \u0060document/migrations/formats/src/v1.rs\u0060 and \u0060document/migrations/formats/src/v4.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 109 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":"document/graph-storage/src/schema/resources.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b35cca983d30715f84e48010c99839a5cdcba6f978d4b4241a16c9ef60a0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): editor/src/messages/portfolio/document/utility_types/wires.rs:496-526 | editor/src/messages/portfolio/document/utility_types/wires.rs:535-565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/utility_types/wires.rs:496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/wires.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2cfc5b9b084230aa889b4e6608f1c4f9b886d6c665ccbd948a34ec9cd6500b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:2361-2389 | editor/src/messages/tool/tool_messages/path_tool.rs:2466-2493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2361\u0060 it begins part-way through the construct above it, so those exact 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, \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2494\u0060 calls \u0060add\u0060 and \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2391\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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b16fce03b4cd1bfa395ed6bf517defb15d51a4779571f718f2441909180076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): editor/src/messages/portfolio/document/document_message_handler.rs:583-608 | editor/src/messages/portfolio/document/document_message_handler.rs:3503-3530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/document_message_handler.rs:583\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cc9c87477493b18490aae5bf779c7424351b09bb92e499f4102e2e52209cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201325 lines \u00D7 3): editor/src/messages/tool/common_functionality/compass_rose.rs:16-40 | editor/src/messages/tool/common_functionality/pivot.rs:232-256 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:226-229 \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 \u0060editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:226\u0060 it begins part-way through the construct above it, so those exact 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":"editor/src/messages/tool/common_functionality/compass_rose.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"701ce07a1d1f6f8d25ac0b2b1e20a85f66599740d7e0d85be02b9a3485a0fa62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): editor/src/messages/tool/tool_messages/path_tool.rs:2087-2110 | editor/src/messages/tool/tool_messages/path_tool.rs:2212-2235 | editor/src/messages/tool/tool_messages/path_tool.rs:2311-2334 \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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"849cff2bd90e70b8126c1ef350b036c1040e0985490f97b3e92cd1536ad1fb8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201324 lines \u00D7 16): editor/src/messages/portfolio/document_migration.rs:2157-2161 | editor/src/messages/portfolio/document_migration.rs:2595-2599 | editor/src/messages/portfolio/document_migration.rs:2608-2610 | editor/src/messages/portfolio/document_migration.rs:2624-2626 | editor/src/messages/portfolio/document_migration.rs:2636-2638 | editor/src/messages/portfolio/document_migration.rs:2848-2850 | editor/src/messages/portfolio/document_migration.rs:2909-2913 | editor/src/messages/portfolio/document_migration.rs:2924-2926 | editor/src/messages/portfolio/document_migration.rs:2937-2939 | editor/src/messages/portfolio/document_migration.rs:2967-2969 | editor/src/messages/portfolio/document_migration.rs:3240-3241 | editor/src/messages/portfolio/document_migration.rs:3315-3338 | editor/src/messages/portfolio/document_migration.rs:3380-3403 | editor/src/messages/portfolio/document_migration.rs:3440-3441 | editor/src/messages/portfolio/document_migration.rs:3453-3454 | editor/src/messages/portfolio/document_migration.rs:3492-3493 \u2014 all 16 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060editor/src/messages/portfolio/document_migration.rs:2610\u0060 calls \u0060set_input\u0060, \u0060node_at_index\u0060, \u0060clone\u0060 and \u0060editor/src/messages/portfolio/document_migration.rs:2161\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c83583c208d048fb85ec7c5ebc4b4c514acbcce6bae195b7ed1d67a39b2194d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:103-125 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:90-112 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9e5b82eeedeb95453f4d4ff5f5b81f00b40a76ff47c7c743fbd9eadc5de5af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:925-947 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:964-986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/graph_modification_utils.rs:925\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"323392c3604f5a221d4b90f6f1453a8b09c217dc159b9a240312044a2a679477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): editor/src/messages/tool/tool_messages/pen_tool.rs:2215-2237 | editor/src/messages/tool/tool_messages/pen_tool.rs:2254-2275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/pen_tool.rs:2215\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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"024134c625d233f50d8ec606ba122181271c794799592cb3c083ff28a18cd070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): node-graph/libraries/graphic-types/src/graphic.rs:223-245 | node-graph/nodes/path-bool/src/lib.rs:251-272 \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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"17827521b61d0849e672c9db020e2eb7cf2dcfa548f2dd38b4bb659462bf87c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): node-graph/libraries/graphic-types/src/graphic.rs:255-274 | node-graph/nodes/path-bool/src/lib.rs:214-236 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3d61777bb8b0ee14f8d157707d1aea4399cee18bd8aa62c5ffd88bf9b3cc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): editor/src/messages/tool/tool_messages/gradient_tool.rs:714-735 | editor/src/messages/tool/tool_messages/gradient_tool.rs:760-781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"94452daf7f52d42d72b07d47b04af688ce6420bc65db1a2f7d5b651f0ff75956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:135-155 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:139-159 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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 \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c836f265225ad5f1792d08106024b97228c223ac12dd66ff644d472bfbed78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:537-557 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:566-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 \u0060editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:537\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d50a544c5d539d21a7b1b2f3739693502e583889ef20dafe3e7cc5acdb0aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): editor/src/messages/portfolio/document/document_message_handler.rs:1054-1072 | editor/src/messages/portfolio/document/document_message_handler.rs:1115-1132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5c16481ebdce1f5a4f654b2150477b226d5eb75ef943441533a1e73a725b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:1025-1043 | editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:1054-1071 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:1025\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":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"512b1ef858e2c4359fb8a37abb50aa44da9594d0c893c4cc60c2dd05ae87b466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): editor/src/messages/portfolio/document/overlays/utility_types_web.rs:252-268 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:311-327 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:375-391 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:450-466 \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":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3057d1fe267594ae624b2a266413a54c49fa47eecb3684cc54efe407cdacc65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): document/migrations/compiled/src/vary_nodes_from_copy_to_points.rs:151-167 | editor/src/messages/portfolio/document_migration.rs:4191-4207 \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":"document/migrations/compiled/src/vary_nodes_from_copy_to_points.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca43aae758956b755e7149fab1561c55c47703df2cea4274160c30254facf687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:232-248 | editor/src/messages/tool/tool_messages/select_tool.rs:944-960 \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":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b29c9268ed342857cad7b92ef1ffbe99927015165cbcb5fc03b02a04b903720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): editor/src/messages/layout/utility_types/layout_widget.rs:623-638 | editor/src/messages/layout/utility_types/layout_widget.rs:639-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e3a7ce3dec9cc1ba73ba616b0dbf9bd75dcddb65b48c6a09efeee3351e74f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:636-653 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:772-789 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4e3dff45a1719c8f61b576c15c8e8fa6dc2f647e3fc2203b5ee22663d80ce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:247-273 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:277-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:247\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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5874eda0369656115ddb8d02dcd72fd8009355be6584b37ba383c29e203f7a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:1863-1884 | node-graph/libraries/rendering/src/renderer.rs:1953-1974 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/rendering/src/renderer.rs:1863\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b31104d97ad1e47154d4530e7d37032007e2f44185aae76b1dad8978e31ae70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:158-171 | node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:158-173 \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 \u0060node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b38d84cc99796a97f58d9d652813def044403e6409278957c0bbe99aabacd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): node-graph/nodes/repeat/src/repeat_nodes.rs:99-115 | node-graph/nodes/repeat/src/repeat_nodes.rs:156-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/repeat/src/repeat_nodes.rs:99\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/repeat/src/repeat_nodes.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c6de4e3b7dc9fbf2d5311c66939e84ff60da5e8b13e676e89ab8961c034f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): node-graph/nodes/transform/src/transform_nodes.rs:43-58 | node-graph/nodes/transform/src/transform_nodes.rs:75-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/transform/src/transform_nodes.rs:43\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":"node-graph/nodes/transform/src/transform_nodes.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c49b64a5de6559cfb7891be24d0901819fd627719622d2901ee175e2cecde7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): document/graph-storage/src/schema/value.rs:98-112 | document/migrations/formats/src/v4.rs:370-384 \u2014 before extracting anything, compare \u0060document/graph-storage/src/schema/value.rs\u0060 and \u0060document/migrations/formats/src/v4.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060document/graph-storage/src/schema/value.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":"document/graph-storage/src/schema/value.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d7384893aec77d52f4c5b92122b8c54f27bd8c421897d86f4ccca5a1f31850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): editor/src/messages/portfolio/document/document_message_handler.rs:4083-4095 | editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3397-3411 \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 \u0060editor/src/messages/portfolio/document/document_message_handler.rs:4083\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"451ab6a60c8be6047293b7c759269de3827d93d82d0759123f94e2357582f9de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_web.rs:406-420 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:470-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3143b3305676c89b4c43b9d765a53ccaa12773e863b959073a10343889120a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): editor/src/messages/tool/common_functionality/utility_functions.rs:440-454 | editor/src/messages/tool/common_functionality/utility_functions.rs:475-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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"66887cc45631d078be508bd7b6f95aabe19285a7c7eed59ccf98fbd8f5106106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): editor/src/messages/tool/tool_messages/select_tool.rs:1907-1920 | editor/src/messages/tool/tool_messages/select_tool.rs:2207-2220 | editor/src/messages/tool/tool_messages/select_tool.rs:2267-2280 \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 \u0060editor/src/messages/tool/tool_messages/select_tool.rs:1907\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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1d0f3880f68a21b06c934830c2e18f3520888409d2b828a4fb8ee5db53669a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): document/container/src/backends/opfs.rs:375-388 | document/container/src/backends/opfs.rs:412-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060document/container/src/backends/opfs.rs:375\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, \u0060document/container/src/backends/opfs.rs:411\u0060 calls \u0060from\u0060, \u0060seek_with_f64\u0060 and \u0060document/container/src/backends/opfs.rs:374\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":"document/container/src/backends/opfs.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea3900186829f508b66ffb0bc21a46f7c5db4b601b787efad28ada913becafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:3362-3375 | editor/src/messages/portfolio/document_migration.rs:3423-3436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:3362\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c13c788e1387bc6f3cd04f3852d6e17551bd7293d95e8c9bca20f1071d9f3cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:659-672 | editor/src/messages/tool/tool_messages/select_tool.rs:718-731 \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 \u0060editor/src/messages/tool/tool_messages/path_tool.rs:659\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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef17a8fd229db8702e9f4a5a70c4b6261fa4157d56b64154c86cffe89e1372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:2950-2963 | editor/src/messages/tool/tool_messages/path_tool.rs:3066-3076 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2950\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2950}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec42ac959f69c95a74659f26bfd1ad26b830a4080a1645c77d338e7a73f2272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): editor/src/messages/tool/common_functionality/shapes/arc_shape.rs:166-178 | editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:142-154 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:146-158 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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":"editor/src/messages/tool/common_functionality/shapes/arc_shape.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"959295d6ff325fecef79a9148778470073580d438e262fe309b5fa225a97fdae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): frontend/wrapper/src/editor_commands.rs:353-365 | frontend/wrapper/src/editor_commands.rs:391-403 | frontend/wrapper/src/editor_commands.rs:421-433 \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":"frontend/wrapper/src/editor_commands.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ace93f06a8875a5fa6bd6f74cecd7eacc45f00192d76840adfa77b84f450f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): editor/src/messages/clipboard/clipboard_message_handler.rs:496-507 | editor/src/messages/tool/tool_messages/path_tool.rs:2919-2931 \u2014 before extracting anything, compare \u0060editor/src/messages/clipboard/clipboard_message_handler.rs\u0060 and \u0060editor/src/messages/tool/tool_messages/path_tool.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060editor/src/messages/clipboard/clipboard_message_handler.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":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b16d8cacc3f5b051cbf7b239553e86caee2496dada0a9f3fc6683dd60bac677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): editor/src/messages/portfolio/document/document_message_handler.rs:724-733 | editor/src/messages/portfolio/document/document_message_handler.rs:745-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/document_message_handler.rs:724\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a00f1136cab798a6c2a9dfea88b39d3ea24a04e60df6036b3716ee91ad114a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:591-603 | editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:620-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dedc9d6c482d509246745b81d8bf6dfdc9b50b2db8c2906ef448ca871ec9f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:667-679 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:687-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/node_inspector.rs:667\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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1d45f706f11e40eac4f5287f36a8bb3bc75b579be7c44670ee6e2a203ec1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:710-722 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:731-743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/node_inspector.rs:710\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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"805e8b46daddefbed5f5e52fd53e487795953b3871dea9d7a6e31c3fe0f1e82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:990-1002 | editor/src/messages/tool/tool_messages/text_tool.rs:125-137 \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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"302ab465b7f151ae6888c562606ea73ccffc1e1314da3e366aee6aad6ccea497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:2202-2222 | editor/src/messages/portfolio/document_migration.rs:2254-2272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:2202\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"283bb41dd2ad4efcb1ecb80e2af039daa856c59be52d26625797b1c7be6e09cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): editor/src/messages/portfolio/portfolio_message_handler.rs:100-115 | editor/src/messages/portfolio/portfolio_message_handler.rs:230-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"352b5215eed1f8c3a94c57ee6c728d50980daf6b1c338d1c832c7b30ef8f1cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/tool/common_functionality/utility_functions.rs:293-305 | editor/src/messages/tool/common_functionality/utility_functions.rs:379-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/utility_functions.rs:293\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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c31fae11a4d449921a44624e977e3a040bf3e9048219c89b6a99f3d744dba28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:2340-2352 | editor/src/messages/tool/tool_messages/path_tool.rs:2431-2443 \u2014 both copies are in the same file, so extract the block 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, \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2354\u0060 calls \u0060add\u0060 and \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2445\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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92ad526c080a8ce2a42e0c3c86f0b16ab8c5e3cf0b87074bdd1cf9c6c662b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): editor/src/messages/tool/tool_messages/text_tool.rs:873-885 | editor/src/messages/tool/tool_messages/text_tool.rs:943-954 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/text_tool.rs:873\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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccccfd9262b51ce62f1bb68f7fb7eb67cd073e5b6472b8efc11fa9871831105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/tool/utility_types.rs:179-191 | editor/src/messages/tool/utility_types.rs:200-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/utility_types.rs:179\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":"editor/src/messages/tool/utility_types.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"732b25d1ca899f5026fd65fbc863fc57cceaafe3e824a7a3c763fce3237885fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:1470-1482 | node-graph/libraries/rendering/src/renderer.rs:1734-1745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80382121e65cbf7e8bad3ea6d459eafcf6697d6fbbf0fac93216a0d46ef0d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): node-graph/node-macro/src/parsing.rs:688-701 | node-graph/node-macro/src/parsing.rs:983-996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/node-macro/src/parsing.rs:688\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f17f00d236ef755dc10c07e1703937011143ff5558d04ce1f4d7aa60990ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): node-graph/nodes/brush/src/basic_brush/convert.rs:68-79 | node-graph/nodes/gstd/src/render_pixel_preview.rs:217-229 \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 \u0060node-graph/nodes/brush/src/basic_brush/convert.rs:68\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":"node-graph/nodes/brush/src/basic_brush/convert.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f04c51852a103340a9598d2550994f348439eae0815963daa22cbfbf4e678a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): node-graph/nodes/text/src/json.rs:147-159 | node-graph/nodes/text/src/json.rs:166-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":"node-graph/nodes/text/src/json.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2684fcb7fc2dea3b1ee763c7b200f5f2d9e389a6d726a632ec55ca41ee5f2ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): editor/src/messages/portfolio/document/overlays/utility_types_web.rs:289-300 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:341-352 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:415-426 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:479-490 \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 \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs:289\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, \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs:284\u0060 calls \u0060unwrap_or\u0060, \u0060set_stroke_style_str\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs:411\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":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cfa9643b61fb2064fe9d1726c843677d3ce6cb2e83b453e48667df19633837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): document/container/src/archive/xz.rs:45-56 | document/container/src/archive/zip.rs:40-51 \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 \u0060document/container/src/archive/xz.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":"document/container/src/archive/xz.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3b09ff9ef9970967e4104e02d32ff0b8012847910724241464b823abb67700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:608-619 | editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:667-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7084a1a9c0b8ce7386680e184d2b1ab4f9126afe65a517276e44a4105b73b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:2284-2298 | editor/src/messages/portfolio/document_migration.rs:2327-2341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65f81bb745b15ed8ac8e82bb4e721a73e0537221598f546e1437e3d82632127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): editor/src/messages/tool/tool_messages/gradient_tool.rs:1919-1930 | editor/src/messages/tool/tool_messages/gradient_tool.rs:1974-1985 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/gradient_tool.rs:1919\u0060 it does not close everything it opens, so those exact 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"1660493c40645ae6f36d1bd400319be08d59fa0eb4d18f5ea94da2822c70aeb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:1850-1861 | node-graph/libraries/rendering/src/renderer.rs:1939-1949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/rendering/src/renderer.rs:1850\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3ed5aaab7f73172d440ff566e581262b1d8c94b5b2e0ed55ffee9daf1aad3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): node-graph/node-macro/src/codegen.rs:918-929 | node-graph/node-macro/src/codegen.rs:938-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/node-macro/src/codegen.rs:918\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a823e67c94d58b75b6cec093427c1c377569db9845694f54bfb4045d04d87cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): node-graph/nodes/brush/src/basic_brush/convert.rs:41-52 | node-graph/nodes/brush/src/basic_brush/pipeline.rs:304-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/brush/src/basic_brush/convert.rs:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/brush/src/basic_brush/convert.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf5e03f931b45eff242ce41c88be6ad69eabd5b01d192b0e4274ea30407424a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): node-graph/nodes/graphic/src/graphic.rs:1074-1086 | node-graph/nodes/vector/src/vector_nodes.rs:1874-1886 \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 \u0060node-graph/nodes/graphic/src/graphic.rs:1074\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":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27b65592727b5e810cfa7fa01bf5bcff47308c2154aca442aff4b411dcd7f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): proc-macros/src/combined_message_attrs.rs:79-92 | proc-macros/src/combined_message_attrs.rs:103-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proc-macros/src/combined_message_attrs.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96813d08a75d4e8fa7a451b586a3f6b2db43d447c081cde7b2b73b17155713a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): node-graph/nodes/brush/src/basic_brush/pipeline.rs:303-313 | node-graph/nodes/gstd/src/render_background.rs:233-243 | node-graph/nodes/gstd/src/render_background.rs:262-272 | node-graph/nodes/gstd/src/render_background.rs:304-314 \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 \u0060node-graph/nodes/brush/src/basic_brush/pipeline.rs:303\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/brush/src/basic_brush/pipeline.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e7447af86a167b91c1ae581007b3cb68ffaff520ba88c9ff0f8dd61550125d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:823-833 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:707-717 | node-graph/libraries/vector-types/src/vector/algorithms/shapes.rs:152-162 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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 \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs:823\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc7f344d35475cecb795d2730907408bdeba096b3c4608ccb0301151cb4ed48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): node-graph/libraries/wgpu-executor/src/vello_render.rs:519-529 | node-graph/libraries/wgpu-executor/src/vello_render.rs:675-685 | node-graph/nodes/gstd/src/render_background.rs:406-416 \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 \u0060node-graph/libraries/wgpu-executor/src/vello_render.rs:519\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":"node-graph/libraries/wgpu-executor/src/vello_render.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"458912132a47ed36bb62fa1a976f2564cbf7eb7b771de7443d4d2a17b824a3e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): document/migrations/formats/src/steps/v3_to_v4.rs:379-389 | document/migrations/formats/src/steps/v3_to_v4.rs:392-402 | document/migrations/formats/src/steps/v3_to_v4.rs:403-413 \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 \u0060document/migrations/formats/src/steps/v3_to_v4.rs:379\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":"document/migrations/formats/src/steps/v3_to_v4.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08fa72f258e77b6f59a3b70f1aa30ec85627b40afb5e7d123ccd9bd0601e37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/layout/layout_message_handler.rs:154-164 | editor/src/messages/layout/layout_message_handler.rs:182-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/layout/layout_message_handler.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060editor/src/messages/layout/layout_message_handler.rs:180\u0060 calls \u0060push\u0060 and \u0060editor/src/messages/layout/layout_message_handler.rs:153\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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd62dc45e0415ae1f9103b6ae351dcd33a88b5b146f0c8576dd7959b773efdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1143-1153 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1158-1168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1143\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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"469d661269079995ed9f946bc77300efc741033dda756864fb89c50d408e7726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:867-877 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:745-755 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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 \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs:867\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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca118ef15c7b1427c38437848239e7789fd1492982f363757e8aac2a39f355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:98-108 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:177-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.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. 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, \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:172\u0060 calls \u0060manipulator_handle\u0060 and \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:93\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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7044d280306ecd561ab2268a0965aeb932a6958f13707538d367109230ef714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/tool/common_functionality/shape_editor.rs:2293-2303 | editor/src/messages/tool/common_functionality/shape_editor.rs:2318-2328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/shape_editor.rs:2293\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c9e78973ab9e36cd03a43d853a605b50115bb8f00becfb2c212bb243501e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:93-102 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:110-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/shapes/arrow_shape.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":"editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9584f75ee83bef4a3939a0afa1d9564e01f1d809dab8fcd9f252c757d88d15c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:1654-1664 | editor/src/messages/tool/tool_messages/path_tool.rs:1707-1717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/path_tool.rs:1654\u0060 it begins part-way through the construct above it, so those exact 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9053fe46992111b9f5e6afa1ad2dfbbc3fb0801209e3ff60f930de7a4c4465d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:3279-3286 | editor/src/messages/tool/tool_messages/select_tool.rs:1982-1992 \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 \u0060editor/src/messages/tool/tool_messages/path_tool.rs:3279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3279}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f72a46cebc3ad07f4544092b3bb76704a160e2ffde2bcd19097dc5a2259705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/tool/tool_messages/spline_tool.rs:477-487 | editor/src/messages/tool/tool_messages/spline_tool.rs:513-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/spline_tool.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"078d55335256263122e0cf6a69032594182d858adc408ff01467f3dd76fd2a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/node_graph_executor.rs:1088-1098 | node-graph/preprocessor/src/value_types.rs:121-131 \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 \u0060editor/src/node_graph_executor.rs:1088\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":"editor/src/node_graph_executor.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"02358876f46f6e1a09c8e56c8b10df986265a1c267bce2d4637bb18ae101fb7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 3): node-graph/libraries/rendering/src/renderer.rs:979-987 | node-graph/libraries/rendering/src/renderer.rs:1027-1037 | node-graph/libraries/rendering/src/renderer.rs:1042-1045 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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, \u0060node-graph/libraries/rendering/src/renderer.rs:987\u0060 calls \u0060extend\u0060 and \u0060node-graph/libraries/rendering/src/renderer.rs:1045\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5af9573cf2628f418f6b9d9a77ec6c18bf7234e004258eb3352a3bc8aa2b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): node-graph/node-macro/src/codegen.rs:882-893 | node-graph/node-macro/src/codegen.rs:895-906 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec027bb46fe0b6f1b3a015cbd396d48624d3084ccb8a6afc517c8000bb6ff7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): node-graph/nodes/vector/src/vector_nodes.rs:1819-1829 | node-graph/nodes/vector/src/vector_nodes.rs:2198-2208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/vector/src/vector_nodes.rs:1819\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3c88ce5660bd624f9dc647786e1c0546337472e2b0a675dff8e9fa81b7d536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): editor/src/messages/menu_bar/menu_bar_message_handler.rs:749-758 | editor/src/messages/menu_bar/menu_bar_message_handler.rs:763-772 | editor/src/messages/menu_bar/menu_bar_message_handler.rs:777-786 \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 \u0060editor/src/messages/menu_bar/menu_bar_message_handler.rs:749\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/menu_bar/menu_bar_message_handler.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba50078e3b994b35c8f0ec9090dcecc40492702a6ae6cdcb67800ab1561c0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/layout/utility_types/layout_widget.rs:291-300 | editor/src/messages/layout/utility_types/layout_widget.rs:343-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/layout/utility_types/layout_widget.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"756b06a0b001e48c822303d3201b76f5a801612b0ab0436c7239c169fd8d90a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/portfolio/document/document_message_handler.rs:3970-3979 | editor/src/messages/portfolio/document/document_message_handler.rs:3992-4001 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/document_message_handler.rs:3970\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":3970}}}],"partialFingerprints":{"codehealthFindingId/v1":"a175e1ea0b06a1c9593ae371709532d2b741b993d70672b0e0065ae0d3ebc7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:2343-2351 | editor/src/messages/portfolio/document_migration.rs:2364-2373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:2343\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490ba890fce6628b0a561977f1c1f2938f5438e39959627bcad45b264219978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/portfolio/portfolio_message_handler.rs:1066-1075 | editor/src/messages/portfolio/portfolio_message_handler.rs:1098-1107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/portfolio_message_handler.rs:1066\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"5271a56d92c80f13507dddb3ddd89a9213f763bbec90ba95cd2e6e1c4ecb64b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:204-213 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:217-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 \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:204\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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20b3badf0e8945e1cbd1dc36639c7cdae4cca4e4928c3028022b01c0de9850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:230-239 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:243-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:230\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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11ea27cc7df2b762d3b3755283a8b447bdce883a35d3a8d0bdb726fa853ec39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:1840-1849 | editor/src/messages/tool/tool_messages/path_tool.rs:1966-1975 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/path_tool.rs:1840\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e323374671ac9f25434fc7a6f5d015fc594b5b345b5dd9a2eab904df28ee94d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/tool/tool_messages/shape_tool.rs:1207-1216 | editor/src/messages/tool/tool_messages/shape_tool.rs:1222-1231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba2bb44ce204717d0e0d5fd11cdf4cc598245d6d3a5e3d7a8187002fbff8f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libraries/math-parser/src/executer.rs:386-396 | libraries/math-parser/src/executer.rs:542-552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/executer.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d69ce775c1bc374c47339aba73caf4ea4e868ac9a9e5c7250efab581b1b5acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libraries/math-parser/src/parser.rs:504-513 | libraries/math-parser/src/parser.rs:540-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/parser.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c10404b2ee68552ff4de04b50c88a0e0183ac60c7563e06e59b0e62b0abbe72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libraries/rawkit/src/tiff/types.rs:314-323 | libraries/rawkit/src/tiff/types.rs:339-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libraries/rawkit/src/tiff/types.rs:335\u0060 calls \u0060try_into\u0060, \u0060Err\u0060 and \u0060libraries/rawkit/src/tiff/types.rs:312\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":"libraries/rawkit/src/tiff/types.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2048dd5df1ca786ccfd6e21a9a00bbbce8df1cd8bfd8b6d41d3074ead5fe089e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): node-graph/libraries/rendering/src/render_ext.rs:90-98 | node-graph/libraries/rendering/src/renderer.rs:649-658 \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 \u0060node-graph/libraries/rendering/src/render_ext.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060node-graph/libraries/rendering/src/renderer.rs:660\u0060 calls \u0060is_empty\u0060, \u0060push\u0060 and \u0060node-graph/libraries/rendering/src/render_ext.rs:99\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":"node-graph/libraries/rendering/src/render_ext.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"42709cb4c88623738f3e92b792aa3de36d777e1fa93d280678d7753a74c1613e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): node-graph/libraries/vector-types/src/vector/vector_types.rs:327-336 | node-graph/nodes/vector/src/vector_nodes.rs:1920-1929 \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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdce57c12b3debc47f2110c136604fb41ab2c1baa2ea415a47311aab6367fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): node-graph/nodes/brush/src/basic_brush/convert.rs:66-75 | node-graph/nodes/brush/src/basic_brush/pipeline.rs:394-403 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/brush/src/basic_brush/convert.rs:66\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":"node-graph/nodes/brush/src/basic_brush/convert.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5948d8268ea0ddf832b2dd1dc11a50de45670d415edd67423152b643e2733e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): node-graph/nodes/raster/src/filter.rs:217-226 | node-graph/nodes/raster/src/filter.rs:268-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/raster/src/filter.rs:217\u0060 it does not close everything it opens, so those exact 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, \u0060node-graph/nodes/raster/src/filter.rs:266\u0060 calls \u0060min\u0060, \u0060max\u0060 and \u0060node-graph/nodes/raster/src/filter.rs:215\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":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"047bd5218256366049a2fe870be52ca8d08b53c3f22624da89142d02fb293532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): editor/src/messages/portfolio/document_migration.rs:1549-1556 | editor/src/messages/portfolio/document_migration.rs:1610-1617 | editor/src/messages/portfolio/document_migration.rs:1668-1676 \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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb225d72e5f2abd0e2d83b8a3c2ae0093f0cf5203a03d037f776d7c6d11789b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): node-graph/libraries/rendering/src/render_ext.rs:284-292 | node-graph/libraries/rendering/src/renderer.rs:1875-1882 | node-graph/libraries/rendering/src/renderer.rs:1965-1972 \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 after the matched lines, \u0060node-graph/libraries/rendering/src/render_ext.rs:293\u0060 calls \u0060GradientList\u0060 and \u0060node-graph/libraries/rendering/src/renderer.rs:1883\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":"node-graph/libraries/rendering/src/render_ext.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1896bbfb205d2be280227b98c86198c53be4662d774059ad65b5f1cc96acb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:465-473 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:535-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/node_inspector.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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"93021e85044c06dfc05e1df45781736a805edfdd4fe84b5f4920fbe94630b679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:659-667 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:524-532 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d06ee4fff318fc25fab0ed035350ac134530d89b7a8278b59b3f14d3ab7c9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 4): editor/src/messages/portfolio/document_migration.rs:2062-2064 | editor/src/messages/portfolio/document_migration.rs:2686-2690 | editor/src/messages/portfolio/document_migration.rs:3152-3160 | editor/src/messages/portfolio/document_migration.rs:3166-3174 \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 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a3192512278c58171a1fa31385478401fa08b5bc1246a0d901b1100574316b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:3352-3360 | editor/src/messages/portfolio/document_migration.rs:3413-3421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:3352\u0060 it does not close everything it opens, so those exact 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, \u0060editor/src/messages/portfolio/document_migration.rs:3347\u0060 calls \u0060set_input\u0060, \u0060node_at_index\u0060, \u0060clone\u0060 and \u0060editor/src/messages/portfolio/document_migration.rs:3410\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6975f2217d9c79d13277d1980bc487466a04a0be4ddd1a1068eb12bb72ba3494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/portfolio/workspace/workspace_message_handler.rs:71-79 | editor/src/messages/portfolio/workspace/workspace_message_handler.rs:214-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/workspace/workspace_message_handler.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d649bb1e6acbf22146ca6d09eab117fcd24c6fd2d39f09a6ecf86cdcfa11b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/spiral_turns_handle.rs:261-269 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/spiral_turns_handle.rs:274-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/spiral_turns_handle.rs:261\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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/spiral_turns_handle.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d31ab051658a60f02ca8382b7dc037523b79b8d5893819512ae2a564234cfe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): editor/src/messages/tool/common_functionality/utility_functions.rs:124-132 | editor/src/messages/tool/common_functionality/utility_functions.rs:167-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d12b02a150e772d9d3e23b4c3babe5315f8a49104be0ae29f29bb633acd1fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:2913-2926 | editor/src/messages/tool/tool_messages/path_tool.rs:3028-3039 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2913\u0060 it does not close everything it opens, so those exact 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afcd81d148578100149064e9ace3d9a26863abdc6ac65b0136ab0646fbeeff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:3701-3709 | editor/src/messages/tool/tool_messages/path_tool.rs:3711-3719 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3701}}}],"partialFingerprints":{"codehealthFindingId/v1":"997369f612974226565931e8cb030f820a6d49681abff12dd0b946d983bc2e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): editor/src/messages/tool/tool_messages/select_tool.rs:2164-2178 | editor/src/messages/tool/tool_messages/select_tool.rs:2226-2240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/select_tool.rs:2164\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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaa252450e3d4775a466e9c64cd924c3e2c38eeda6a72474dacbcfe0e383196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:849-857 | node-graph/libraries/rendering/src/renderer.rs:2405-2413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/rendering/src/renderer.rs:849\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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a3f83d7febb04e05c542d5ae98d4e924921d8d0642b6f61d0e9565b40ced49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:1536-1546 | node-graph/libraries/rendering/src/renderer.rs:1994-2004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fa67c81b70cde088f28be78152725c131e4a9cf4c0770182d21467c7366aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): node-graph/libraries/vector-types/src/vector/style.rs:262-272 | node-graph/nodes/vector/src/vector_nodes.rs:3302-3312 \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":"node-graph/libraries/vector-types/src/vector/style.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd14c0dc681637c5bf8aa2f9ace78b2ada26c3aa7a056fe09494eaf820233c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 6): node-graph/libraries/rendering/src/renderer.rs:848-855 | node-graph/libraries/rendering/src/renderer.rs:1641-1648 | node-graph/libraries/rendering/src/renderer.rs:2404-2411 | node-graph/libraries/rendering/src/renderer.rs:2434-2440 | node-graph/libraries/rendering/src/renderer.rs:2674-2681 | node-graph/libraries/rendering/src/renderer.rs:2860-2867 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060node-graph/libraries/rendering/src/renderer.rs:2401\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060node-graph/libraries/rendering/src/renderer.rs:2432\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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3e1d8a1c7beddda17fe4244ddb078e8ba3801fee24ebdf61f3bdfdc7d82df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:780-789 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:803-812 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:831-840 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:844-853 \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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c7745a26e06c609a6dbc12984c8a7873e7c15f662729cbd723be41f5bc585b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): document/graph-storage/src/schema/value.rs:25-35 | document/migrations/formats/src/v1.rs:399-409 | document/migrations/formats/src/v4.rs:300-310 \u2014 before extracting anything, compare \u0060document/graph-storage/src/schema/value.rs\u0060 and \u0060document/migrations/formats/src/v4.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060document/graph-storage/src/schema/value.rs:25\u0060 it does not close everything it opens, so those exact 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, \u0060document/graph-storage/src/schema/value.rs:36\u0060 calls \u0060Blob\u0060, \u0060collect_map\u0060, \u0060once\u0060 and \u0060document/migrations/formats/src/v1.rs:410\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":"document/graph-storage/src/schema/value.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a8528c7a18eeea995146f5b7c46f075d18cc17ffaa988f48cc58f5fb70fb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): editor/src/messages/tool/tool_messages/freehand_tool.rs:110-117 | editor/src/messages/tool/tool_messages/pen_tool.rs:174-181 | editor/src/messages/tool/tool_messages/spline_tool.rs:117-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/freehand_tool.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"53872140fbc8e5de5287aca13aede3947d12b64a8ddfd4075ed3a4af119904eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): document/graph-storage/src/schema/value.rs:122-129 | document/migrations/formats/src/v4.rs:390-397 \u2014 before extracting anything, compare \u0060document/graph-storage/src/schema/value.rs\u0060 and \u0060document/migrations/formats/src/v4.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/schema/value.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"507513f1f12169e7bbfdd16c1c4f34e8ef974e0f27e383edbc9cefd4cfa89a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/clipboard/clipboard_message_handler.rs:469-476 | editor/src/messages/tool/tool_messages/path_tool.rs:2899-2908 \u2014 before extracting anything, compare \u0060editor/src/messages/clipboard/clipboard_message_handler.rs\u0060 and \u0060editor/src/messages/tool/tool_messages/path_tool.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060editor/src/messages/clipboard/clipboard_message_handler.rs:469\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdfa95c63c921ab1e16604f8e6bbc9bb3098dd281b73ba7603446b4cfc263c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/color_picker/color_picker_message_handler.rs:82-89 | editor/src/messages/color_picker/color_picker_message_handler.rs:92-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eacdace2700b0507269abc907dee4e2d3cec35b3f4517c097b93b414ed03d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:85-92 | editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:74-81 \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 \u0060editor/src/messages/dialog/export_dialog/export_dialog_message_handler.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"dece4472d12b64d18b1e1136c43bc3dfabf0fef7aec9ebb849ad71d897a32da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/portfolio/document/document_message_handler.rs:2333-2341 | editor/src/messages/portfolio/document/document_message_handler.rs:2371-2379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/document_message_handler.rs:2333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"331ed3042b93362c557bdead32db18488ccb0f6ae1e2c9eff2c6dc45bfe5393e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:161-166 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:213-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0c8a46901c77c8e71311932ea36936bbab6a68fdbec7397136ebac4c6c589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:677-684 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:804-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/node_inspector.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3fcbe9fac525dd83094a176c756b636d91e0f81716c66c72257ec8c5ab5716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:344-351 | editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:378-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:344\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":"editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0422ef521b400125b18aa7623e0bbff56d2484e52948e899d2371667b1cd26c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:3714-3730 | editor/src/messages/portfolio/document_storage_io.rs:433-451 \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 \u0060editor/src/messages/portfolio/document_migration.rs:3714\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3714}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cca4b393b03b043e0c1bc47822944a29672995b47bb31957479dad3c7620d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:109-116 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:127-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3e201e9b83885dceeb3e6fa580ddb8b5aabb9c6b7a13795bbf6dcbb559687b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:548-556 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:568-576 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e01e6e53c7735c6b88ecad4916bc1c6d92487b93aa5dbe1c17f1e337bfebb1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:64-71 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:78-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2b33abf5add1fc863fb5964275f8193b37df810238c5bc82efbb9fb4bad620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/tool/common_functionality/utility_functions.rs:404-413 | editor/src/messages/tool/tool_messages/text_tool.rs:751-760 \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 \u0060editor/src/messages/tool/common_functionality/utility_functions.rs:404\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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e1df7b9bc4da1d78556b87cd247eb75013f19b96202c0ef239eca0db2e77ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:2789-2796 | editor/src/messages/tool/tool_messages/path_tool.rs:2994-3001 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f018a83a6614eda2787c772479ad20143787106a9ae85f0dae656757196bb687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libraries/rawkit/src/demosaicing/linear_demosaicing.rs:51-58 | libraries/rawkit/src/demosaicing/linear_demosaicing.rs:60-67 \u2014 both copies are in the same file, so extract the block 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":"libraries/rawkit/src/demosaicing/linear_demosaicing.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8371e49d27ca880a293b4f49d049d32eb4a363e35f02e713a208b731a6a15933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/libraries/core-types/src/list.rs:797-804 | node-graph/libraries/core-types/src/list.rs:1327-1334 \u2014 both copies are in the same file, so extract the block 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":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f10868ded7886a67266efc380561c05196755c9a0dcd5398ca826ec79655b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 3): node-graph/libraries/core-types/src/types.rs:453-460 | node-graph/libraries/core-types/src/types.rs:463-470 | node-graph/libraries/core-types/src/types.rs:472-476 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/core-types/src/types.rs:453\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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, \u0060node-graph/libraries/core-types/src/types.rs:453\u0060 calls \u0060Some\u0060, \u0060find_matching_angle_bracket\u0060 and \u0060node-graph/libraries/core-types/src/types.rs:472\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":"node-graph/libraries/core-types/src/types.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d1125a6ead7bb8042bf41d9000752e5d14282d3448bf92e4391cf96b0eced6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 3): node-graph/libraries/rendering/src/renderer.rs:803-810 | node-graph/libraries/rendering/src/renderer.rs:888-895 | node-graph/libraries/rendering/src/renderer.rs:1465-1467 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060ItemRef\u003C\u0027_, Graphic\u003E\u0060 in one and \u0060ItemRef\u003C\u0027_, Vector\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060node-graph/libraries/rendering/src/renderer.rs:803\u0060 calls \u0060attribute_cloned_or\u0060 and \u0060node-graph/libraries/rendering/src/renderer.rs:1465\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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"314390ebc675a845b48e50abf97c378bed775bd6daa39f2dd32172f04b83d679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:831-838 | node-graph/libraries/rendering/src/renderer.rs:1683-1690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/rendering/src/renderer.rs:831\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"1924287cd62e5a9a724cc93ab864a9b7a940cae635390c86eee8ceca51b30c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:185-197 | node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:248-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 \u0060node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:185\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":"node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8dd8fe2dab58009012968992c3decdf9e614292d3fb64643a783fa0d84c673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/node-macro/src/codegen.rs:703-710 | node-graph/node-macro/src/codegen.rs:770-777 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea77e5b274b147e2fb28ebfde48a1771aa998b22d80a24d74c00d1154812dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/nodes/gstd/src/platform_application_io.rs:111-118 | node-graph/nodes/gstd/src/platform_application_io.rs:154-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 \u0060node-graph/nodes/gstd/src/platform_application_io.rs:111\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, \u0060node-graph/nodes/gstd/src/platform_application_io.rs:152\u0060 calls \u0060body_mut\u0060, \u0060Some\u0060, \u0060into\u0060 and \u0060node-graph/nodes/gstd/src/platform_application_io.rs:109\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":"node-graph/nodes/gstd/src/platform_application_io.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24b2f5a54fa99aca05eb32f01866b67280ce9e95946a7842534f0d9abc3b258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/nodes/text/src/lib.rs:866-873 | node-graph/nodes/text/src/lib.rs:889-896 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/text/src/lib.rs:866\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"0431fabe946ee783e26b8af966f1b3d0de60121bcca3762e34617019e50278b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/nodes/vector/src/vector_nodes.rs:1819-1826 | node-graph/nodes/vector/src/vector_nodes.rs:2402-2409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/vector/src/vector_nodes.rs:1819\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7a3cb2c092fe955c7e817369b698d41ba6c56230968a774210de3ef0463729"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 6): node-graph/nodes/raster/src/adjustments.rs:1251-1257 | node-graph/nodes/raster/src/adjustments.rs:1258-1264 | node-graph/nodes/raster/src/adjustments.rs:1265-1271 | node-graph/nodes/raster/src/adjustments.rs:1272-1278 | node-graph/nodes/raster/src/adjustments.rs:1279-1285 | node-graph/nodes/raster/src/adjustments.rs:1286-1290 \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 \u0060node-graph/nodes/raster/src/adjustments.rs:1251\u0060 it begins part-way through the construct above it, so those exact 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":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dc750337e639cd661ce504468e95a5f9013620e9e346222545295a4179ab7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): editor/src/messages/portfolio/document/document_message_handler.rs:1848-1857 | editor/src/messages/portfolio/document/document_message_handler.rs:1877-1886 | editor/src/messages/portfolio/document/document_message_handler.rs:1891-1900 \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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9970033931132ebcdacf795caa492c5ea8612cc595ac8974a80e7f2a86f5980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:163-169 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:172-179 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:181-186 \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 \u0060editor/src/messages/portfolio/document/graph_operation/utility_types.rs:163\u0060 it begins part-way through the construct above it, so those exact 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, \u0060editor/src/messages/portfolio/document/graph_operation/utility_types.rs:163\u0060 calls \u0060default_node_template\u0060 and \u0060editor/src/messages/portfolio/document/graph_operation/utility_types.rs:181\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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8bc66418f30adc876dcf045cb636ffed7160820afa7cc812ea8fb306fbf027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_web.rs:501-507 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:609-616 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"457d9fbb4d971a533026290462ddfa345e597cf0dd05f8a0f789a9461c92ae5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 8): editor/src/messages/portfolio/document_migration.rs:2745-2748 | editor/src/messages/portfolio/document_migration.rs:2758-2760 | editor/src/messages/portfolio/document_migration.rs:2764-2770 | editor/src/messages/portfolio/document_migration.rs:2778-2784 | editor/src/messages/portfolio/document_migration.rs:2819-2821 | editor/src/messages/portfolio/document_migration.rs:3785-3786 | editor/src/messages/portfolio/document_migration.rs:3801-3802 | editor/src/messages/portfolio/document_migration.rs:3815-3816 \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 \u0060editor/src/messages/portfolio/document_migration.rs:2764\u0060 it begins part-way through the construct above it, so those exact 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, \u0060editor/src/messages/portfolio/document_migration.rs:2784\u0060 calls \u0060replace_implementation\u0060 and \u0060editor/src/messages/portfolio/document_migration.rs:2760\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1cdb69c244b755f7a30f03e8e7a23944cd3bbf6978d9ad9eed9b4a00e9d38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:63-69 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:78-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:63\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a71fec3ae5cb51fd1b82ee3e7a288c9c81218514499b79c788ee800377d0bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:2395-2406 | editor/src/messages/tool/tool_messages/path_tool.rs:2637-2648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2395\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ae3ee3ee12206b391ac9d104ff8fee447ebb07427791564084dc45273e3c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/tool/tool_messages/text_tool.rs:991-997 | editor/src/messages/tool/tool_messages/text_tool.rs:1032-1038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"604d614c67714efa67f50e4f3ca5d441ecf6f1763972a0ca2a8d74f5b3b1d2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libraries/math-parser/src/parser.rs:516-522 | libraries/math-parser/src/parser.rs:560-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 \u0060libraries/math-parser/src/parser.rs:516\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/parser.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"2746e22def2a182840a2083814210eca7b651feba832ba9f4624196c4136f3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:2469-2475 | node-graph/libraries/rendering/src/renderer.rs:2602-2608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/rendering/src/renderer.rs:2469\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060ItemRef\u003C\u0027_, Raster\u003CCPU\u003E\u003E\u0060 in one and \u0060ItemRef\u003C\u0027_, Raster\u003CGPU\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a660c8a3f2f066652c22969ab4cecaab683808c7cd0f6cdc0a21bb29e622a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): node-graph/node-macro/src/codegen.rs:617-623 | node-graph/node-macro/src/codegen.rs:653-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 \u0060node-graph/node-macro/src/codegen.rs:617\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"953bd534fc4a35b55daf180151cd7d5d7f633daa7104d084527ae5123fe7c6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): node-graph/node-macro/src/codegen.rs:713-721 | node-graph/node-macro/src/codegen.rs:787-795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec727d66f154f7da14875fcc06ade66f655cf1478ba2e3523853ab2d86276d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): node-graph/node-macro/src/parsing.rs:202-208 | proc-macros/src/editor_commands.rs:82-87 \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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9890d38be18215270f8833252906b3b4cd6092a8417552d33455d8cc35b1c8d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): node-graph/nodes/raster/src/filter.rs:235-241 | node-graph/nodes/raster/src/filter.rs:283-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 \u0060node-graph/nodes/raster/src/filter.rs:235\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":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cccd17748c66d491a2e438fbbb5a0bbed856c4c025828209b5da167ed537174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): proc-macros/src/message_handler_data_attr.rs:54-60 | proc-macros/src/message_handler_data_attr.rs:86-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proc-macros/src/message_handler_data_attr.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e428703be373da7e86c0dc227219349342c1d08df319c67ebbb1bd553b1e46e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/cargo-run/src/main.rs:103-110 | tools/cargo-run/src/main.rs:115-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/cargo-run/src/main.rs:103\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":"tools/cargo-run/src/main.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9141f1d2aae4cd1c52650438b22b53882d19c4365c563d29435701ffdfa34f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1124-1130 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1141-1147 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1156-1162 \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 \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed4f4bdda6a7b6fddb9c8471ec4d62fa43873455aea7276b09bd130064f3079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1143-1148 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1158-1163 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1188-1193 \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 \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d65774ec43bffa42fd8f33f196f11632708cdb79ba847ec5043c45ce491bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): node-graph/libraries/graphic-types/src/graphic.rs:693-698 | node-graph/libraries/graphic-types/src/graphic.rs:712-717 | node-graph/libraries/graphic-types/src/graphic.rs:736-741 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/graphic-types/src/graphic.rs:693\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7de4a82511e013a5364c6a946b4cae99e6da1b1414c9e7c25c006c7dff95e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): desktop/ui/src/internal/browser_process_app.rs:78-83 | desktop/ui/src/platform.rs:27-32 \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":"desktop/ui/src/internal/browser_process_app.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3974eb23144b1918119ce599bc67affff527349cbbf8a48a3790ac7a216fa694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:115-120 | editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:126-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"25037ad144386b3bb33e50f55b0d138269b643d0eb8bff64c43cf914318f15ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/document/graph_operation/utility_types.rs:224-230 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:287-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":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a2b7413056c387f21e4b6e1e2cbe736df38e95d9410810fc5e0d5e59332e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1238-1243 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1253-1258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1238\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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6544d851aae63671a80db8292e95470a3a6191a7458f4af307d59633c112215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:598-603 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:619-624 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"247e66e13043be8d3adb991ede10384325995d7c1d886ef3cd1febaed5b9cc44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1079-1084 | editor/src/messages/tool/tool_messages/text_tool.rs:194-199 \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 \u0060editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1079\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfaab795984abb7059ef7609231d37948ade8368f337a93f72ae7f4509d609a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1732-1739 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1755-1762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf06db5570fdf176c38cbdf927f2dedf1056ab2c749bbbc7bd24b42d91720d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/grid_overlays.rs:123-130 | editor/src/messages/portfolio/document/overlays/grid_overlays.rs:143-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/grid_overlays.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef42b9eb34d394496a6b640703529430fcc96d9580388188e1ff59625c8c1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:528-533 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:213-218 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"98242553168737e2c82e61655a44233ec13a31f9254962bed391cd286db30683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:3707-3712 | editor/src/messages/portfolio/document_storage_io.rs:426-431 \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 \u0060editor/src/messages/portfolio/document_migration.rs:3707\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c29c2f99184936363a147a1c24131f99e1b84877ac208625f220a914235347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/common_functionality/graph_modification_utils.rs:179-184 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:186-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/graph_modification_utils.rs:179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/graph_modification_utils.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff2a654546d9113577a2a6cc617bbe0101a19391b23c9828f00ced34e59b025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:328-333 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:356-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:328\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":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"62456b86d0229e95d39b64be3180e33067e7cf36a36ffe682cc1e524a0e23884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/tool_messages/gradient_tool.rs:1350-1355 | editor/src/messages/tool/tool_messages/gradient_tool.rs:1850-1855 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/gradient_tool.rs:1350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43abc0fbcf04f954c35bd3b37e98b15ab53cf12d57fa46c8e931f2dd7f5e895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:2810-2815 | editor/src/messages/tool/tool_messages/path_tool.rs:3021-3026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/path_tool.rs:2810\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b59d074eae8f9378dc1f20d0fa59237ff4f633ac7d9bf55ad3dbef5f3a2211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/tool_messages/pen_tool.rs:1429-1434 | editor/src/messages/tool/tool_messages/pen_tool.rs:1525-1531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/tool_messages/pen_tool.rs:1429\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e21e11114563467a4a0219ec006eb3d6bfb4fa51b8570076777d0147b23a3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:2021-2028 | node-graph/libraries/rendering/src/renderer.rs:2035-2042 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f2d70371f59618baf96c963f5f9bcd6b100e2eecea993e4bf9b34be40369b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:179-187 | node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:189-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.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. 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":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"32278bbb76aa90914927afae02f1269d221aed880499b5c1a713a39afb7e1b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node-graph/node-macro/src/codegen.rs:734-741 | node-graph/node-macro/src/codegen.rs:808-815 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/node-macro/src/codegen.rs:734\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdf6530525dec4d6e7b80703c90fd395ae525c1189986cb8e9c612ae443034d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 3): node-graph/nodes/raster/src/adjustments.rs:1735-1740 | node-graph/nodes/raster/src/adjustments.rs:1742-1747 | node-graph/nodes/raster/src/adjustments.rs:2015-2015 \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":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d92ac3a95ceeebdaef7ff13fd09b050cec539870ea97d67d8284db43d73e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): node-graph/nodes/text/src/lib.rs:641-646 | node-graph/nodes/text/src/lib.rs:653-658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"85081dbd05d53764071c69bab3dce40741dd89a097446744ee5cc21e4c868667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): tools/node-docs/src/page_category.rs:92-97 | tools/node-docs/src/page_node.rs:234-244 \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":"tools/node-docs/src/page_category.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7adde68556e89511db1599cb69e04223638608f9f073cd94433ec7f43ba991"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 6): editor/src/messages/portfolio/document_migration.rs:2761-2765 | editor/src/messages/portfolio/document_migration.rs:2786-2790 | editor/src/messages/portfolio/document_migration.rs:2822-2826 | editor/src/messages/portfolio/document_migration.rs:3786-3787 | editor/src/messages/portfolio/document_migration.rs:3802-3803 | editor/src/messages/portfolio/document_migration.rs:3816-3817 \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 \u0060editor/src/messages/portfolio/document_migration.rs:2761\u0060 it begins part-way through the construct above it, so those exact 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, \u0060editor/src/messages/portfolio/document_migration.rs:2761\u0060 calls \u0060iter\u0060, \u0060take\u0060, \u0060enumerate\u0060 and \u0060editor/src/messages/portfolio/document_migration.rs:3786\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9602f26b8932313f9f2fb5034dfe55f39e0df4042d8782173885317dee12cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): editor/src/messages/portfolio/document_migration.rs:2772-2776 | editor/src/messages/portfolio/document_migration.rs:3129-3133 | editor/src/messages/portfolio/document_migration.rs:3142-3146 \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, \u0060editor/src/messages/portfolio/document_migration.rs:2770\u0060 calls \u0060replace_implementation\u0060 and \u0060editor/src/messages/portfolio/document_migration.rs:3126\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa207f2034bd332a53e79b6779866880a99e63b042cfad335346b8b8789736b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libraries/math-parser/src/executer.rs:389-393 | libraries/math-parser/src/executer.rs:493-497 | libraries/math-parser/src/executer.rs:545-549 \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 \u0060libraries/math-parser/src/executer.rs:389\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":"libraries/math-parser/src/executer.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6da96ba3800eec33df6a649eed7404180b454a7f9b2ffc16de6568332b021e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): node-graph/libraries/rendering/src/renderer.rs:3055-3063 | node-graph/libraries/rendering/src/renderer.rs:3176-3184 | node-graph/libraries/rendering/src/renderer.rs:3257-3265 \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, \u0060node-graph/libraries/rendering/src/renderer.rs:3266\u0060 calls \u0060attribute_cloned_or\u0060 and \u0060node-graph/libraries/rendering/src/renderer.rs:3064\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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":3055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177a3a497f0bfbe945b6bb5e198ba3be8597cb4267316ec571b094e07350fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/document_message_handler.rs:3215-3219 | editor/src/messages/tool/tool_messages/select_tool.rs:788-793 \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 \u0060editor/src/messages/portfolio/document/document_message_handler.rs:3215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff39c320a38bfc1f23651373c145052a3872b75b5f0782bb3667b1bdbd4832b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:219-223 | editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:230-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e1fdd58524bf6b39265463b7d7296e1c16e3688f47e182082d4891873b5bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:2057-2061 | editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:2091-2096 \u2014 both copies are in the same file, so extract the block 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, \u0060editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:2063\u0060 calls \u0060add\u0060 and \u0060editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:2097\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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"d977f7f9bcfa626ed00360197bf25b3d0a9ff66b075ae265749c0c1abadf6d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:4024-4028 | editor/src/messages/tool/tool_messages/select_tool.rs:2071-2075 \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 \u0060editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:4024\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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":4024}}}],"partialFingerprints":{"codehealthFindingId/v1":"337bb8752b4e0a4741fea3d4851803ca6f6b55490ab287ae25ba87d8381f190a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1149-1153 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1175-1179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a15f995243eca587bd7c1136ec31b99493a59070a9215e49f37aad87e72241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_functions.rs:92-99 | editor/src/messages/portfolio/document/overlays/utility_functions.rs:144-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/overlays/utility_functions.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f0c49ad3a1704b83e9ea768b4dfe737e5099cf9edd34e6eef46e87e881e8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1027-1032 | editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1036-1041 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"5025dee4c41fa9125fb9cdb1bd90a0a2e151d3de8badcd7efd32273aa4a7c87a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1248-1275 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1119-1146 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4355ad3baa01029d5d94a86b6a432653ee2ec622c65ec2a391818517c8700e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_web.rs:224-228 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:802-806 \u2014 both copies are in the same file, so extract the block 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, \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs:801\u0060 calls \u0060line_to\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs:223\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":"editor/src/messages/portfolio/document/overlays/utility_types_web.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3ac9d6257a636ec5214de5b2d0179837c34eae587fe73e1244923ed6ce0eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:409-414 | editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:453-458 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060network_path\u0060 to \u0060\u0026[NodeId]\u0060 in one and \u0060\u0026[NodeId]) -\u003E Box\u003Cdyn Fn(\u0026Type\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":"editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcb9ca078fc80a52d70a7b3b31a1e248a97297319f40fd62d9f8c1c215c7ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:1298-1303 | editor/src/messages/portfolio/document_migration.rs:1360-1365 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3147d6046c1a63e6f0fef8a12bf4e7fa34ea0f6066904c162a6b12a4a9b5acf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:1398-1403 | editor/src/messages/portfolio/document_migration.rs:1583-1588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:1398\u0060 it begins part-way through the construct above it, so those exact 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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4596942c640b9cd7751f7a0f371fc6bb401bfbd22236bb1e1857a6a0912380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:1927-1931 | editor/src/messages/portfolio/document_migration.rs:1939-1943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:1927\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38b33fbf6df351c6d105cd7f3672839e4a825243f5d940b332c1fc36ec428da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:3827-3833 | editor/src/messages/portfolio/document_migration.rs:3842-3848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:3842\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"78476aea4cdfe0327a3188f294b4a6ff3c175549f3c89ad60f3016d02721508e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/portfolio_message_handler.rs:578-584 | editor/src/messages/portfolio/portfolio_message_handler.rs:610-616 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/portfolio_message_handler.rs:578\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":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca519d9aea5dc9a04023e404ce580a2816817edd04c813ea34ef6244fe684dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:37-46 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:55-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff6bc4fadff7a92c1f3bafe2d25d1cf1e3b4db31470e49f2215a94521365e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/tool/common_functionality/utility_functions.rs:147-151 | editor/src/messages/tool/common_functionality/utility_functions.rs:172-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0a036d60feb8e6e0ecfc33da21a8024a52d04cd66939d785057ea6ea4f007e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/tool/tool_messages/artboard_tool.rs:439-443 | editor/src/messages/tool/tool_messages/artboard_tool.rs:458-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"022ee68c576ea8319ea90716b0176f97300c3d8a41c7c8e945c2539f5da761bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/tool/tool_messages/gradient_tool.rs:453-457 | editor/src/messages/tool/tool_messages/gradient_tool.rs:468-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4202559e4740db0da2334e3567cf7129236998b65c547b233333ec807ba9b82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/tool/tool_messages/pen_tool.rs:1798-1804 | editor/src/messages/tool/tool_messages/pen_tool.rs:1919-1925 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7a192184df890033edbe452ce86a69453abc00b61e781ab99daabcb2b9b1bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/tool/tool_messages/select_tool.rs:586-593 | editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:761-768 \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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"187cb154df2c84bff553456665b4569952e769abb6c86549a1fec6a8e02f9131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): node-graph/libraries/core-types/src/list.rs:942-946 | node-graph/libraries/core-types/src/list.rs:957-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 \u0060node-graph/libraries/core-types/src/list.rs:942\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":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eceac5ab209d58f444c61c1db55b5c100e16eec8f011c49c9041477e526404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): node-graph/libraries/rendering/src/renderer.rs:1727-1731 | node-graph/libraries/rendering/src/renderer.rs:2880-2884 \u2014 both copies are in the same file, so extract the block 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 \u0060item\u0060 to \u0060ItemRef\u003C\u0027_, Vector\u003E\u0060 in one and \u0060ItemRef\u003C\u0027_, Gradient\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6a6cbd58348bf0ed2a578d7d168c78b5315847e011751e4f4df4b5705eabcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:603-608 | node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"752f8671661fb6849e6097ed12e730bd3cba7128d29d6430b39ffb9920c56587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): node-graph/nodes/text/src/json.rs:327-331 | node-graph/nodes/text/src/lib.rs:130-134 \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 \u0060node-graph/nodes/text/src/json.rs:327\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/json.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"275a020f8e3a73ad78f8a1a8d10c748de4f1f7ede4cb142508af821b7d979541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): node-graph/nodes/vector/src/vector_nodes.rs:3471-3476 | node-graph/nodes/vector/src/vector_nodes.rs:3484-3489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/vector/src/vector_nodes.rs:3471\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d8295ede0226fb08f18dba4b0696c261490defb9c80e296c407c5102d474f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): desktop/ui/src/internal/browser_process_handler.rs:9-44 | desktop/ui/src/internal/context_menu_handler.rs:9-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060desktop/ui/src/internal/browser_process_handler.rs:9\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":"desktop/ui/src/internal/browser_process_handler.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c9fe2601cfff3194e6ea50208a5d40834fd5a68bebe16363fafce2a1f1f5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): desktop/ui/src/internal/display_handler.rs:132-141 | desktop/ui/src/internal/load_handler.rs:37-46 | desktop/ui/src/internal/request_handler.rs:74-83 | desktop/ui/src/internal/scheme_handler_factory.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 all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/display_handler.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"069b2e47f7a96a0f1ff19c6341b72e19f92f2c83486e1d10c54955a969068e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): document/container/src/backends/opfs.rs:224-231 | node-graph/graph-craft/src/application_io/resource/opfs.rs:117-125 \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":"document/container/src/backends/opfs.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b958d2a48aba252e5c4b0bb6db5e645a2dd5ba442f5b2f3c99dd01b92bc019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): document/container/src/lib.rs:106-115 | node-graph/graph-craft/src/application_io/resource/mmap.rs:150-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060node-graph/graph-craft/src/application_io/resource/mmap.rs:148\u0060 calls \u0060MmappedBytes\u0060 and \u0060document/container/src/lib.rs:102\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/container/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ce60fd9fd0c2a8859314ea615aeb0789c49745c260c621f1a4c4fe90d5016a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:645-649 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:515-519 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"70993e1e0be4f57772d4e98510f4838a8d141c4a37230a01c5dcb5b22b1bb05e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:651-655 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:624-628 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5422f24ee200641d15271b14befe425fd7ee27d7af165334ec7583bdf77a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:719-726 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:635-642 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd83e343fb80d2551e2afa30817ef84056ea374e1dcf5a1df82740b482b3f06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:849-853 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:727-731 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3b676d405179be79d2907fb22bbe7f985ee3203d4116055b64170769a9c311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1003-1007 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:890-894 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac44337166da445c8ce9b64f5c7d82486a78a3842d524768e7ea8b8d30c9c291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1277-1283 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1148-1154 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd791f056074b85c4a933b72e58f659633eae76167034ddc829f2c07fe24ed3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1285-1291 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1156-1162 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d9583bf0104577e5bf5dd1377e2da8016f1c8f43a1e3cf1367db6fd4b5338a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:35-44 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:35-44 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c003623408f0815a04b83a3d8dd2cabd4b24b007ef3605b229ef89fa5519e429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:46-54 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:46-54 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5db89bc6aaef211665019b4171e446f9f8e06b925b68f18adc95512a0fca67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:78-86 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:78-86 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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 \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4f0461a19dbf6d5592ba3fe5a2256f27b7fd3ba908adc41e2d938dd2457464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:88-98 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:93-103 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a707ae0be5f8c4f03eed0c07bc46e7dd98820e3e51a348febc248ecb3f62b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): editor/src/messages/tool/tool_messages/select_tool.rs:2030-2043 | editor/src/messages/tool/utility_types.rs:78-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"146f94e229e4baaffb56a7395029d112d629841d2d6572292e1be499321fb0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): node-graph/nodes/gstd/src/platform_application_io.rs:211-219 | node-graph/nodes/raster/src/std_nodes.rs:222-230 \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 \u0060node-graph/nodes/raster/src/std_nodes.rs:222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gstd/src/platform_application_io.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1975d674903f3d6506e56262f2a7fab589699b94d5a0e37a0e43941c7eb74d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:64-69 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:64-69 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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 \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac4a1c0a36e734a0954360d575b7a4e622d986cda5d0322db6e19769317ffea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/tool/tool_messages/fill_tool.rs:112-119 | editor/src/messages/tool/tool_messages/path_tool.rs:525-532 \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":"editor/src/messages/tool/tool_messages/fill_tool.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"10214d66a568eb8426db0ba2e9a9ce9f411918d86dfea408e2543616960a8554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): node-graph/node-macro/src/validation.rs:164-181 | node-graph/node-macro/src/validation.rs:210-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/node-macro/src/validation.rs:164\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d04213bd22868594e34518b55aeda6ebbc2f0b38724a32adad3c6e39f423b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:117-129 | editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:295-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"59604d8a87b84c92624107d3b05a690de2d6207dc6f95f62e593e18ed8df1494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): editor/src/messages/layout/layout_message_handler.rs:460-471 | editor/src/messages/layout/layout_message_handler.rs:490-501 | editor/src/messages/layout/layout_message_handler.rs:540-551 \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 \u0060editor/src/messages/layout/layout_message_handler.rs:460\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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a8d6b8e7c0a826654347bc1ca515e1d7d9152fee21c969efd885a649eac1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_inspector.rs:717-727 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:844-854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/node_inspector.rs:717\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3764d42431143db50c317e90b9ba12199de0deec3ffcb83eed519d8bf097d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): editor/src/messages/tool/common_functionality/utility_functions.rs:294-300 | editor/src/messages/tool/common_functionality/utility_functions.rs:341-350 | editor/src/messages/tool/common_functionality/utility_functions.rs:380-386 \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 \u0060editor/src/messages/tool/common_functionality/utility_functions.rs:294\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":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23dcfb49ef244df976a3ac446178bc0716095df143abb420b2c818732a41561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): node-graph/nodes/brush/src/basic_brush/pipeline.rs:178-186 | node-graph/nodes/brush/src/basic_brush/pipeline.rs:282-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/brush/src/basic_brush/pipeline.rs:178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/brush/src/basic_brush/pipeline.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e7a018e3cf8ada4fa48c77759b1c72307642f4d4674d1bd0f7b2064595b34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): node-graph/nodes/gstd/src/render_background.rs:214-222 | node-graph/nodes/gstd/src/render_background.rs:243-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/gstd/src/render_background.rs:214\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gstd/src/render_background.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9a4730f3db90243f9d7f5639fde57406d78c314040e74388c4669e7d0d2b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/clipboard/clipboard_message_handler.rs:433-440 | editor/src/messages/tool/tool_messages/path_tool.rs:2863-2870 \u2014 before extracting anything, compare \u0060editor/src/messages/clipboard/clipboard_message_handler.rs\u0060 and \u0060editor/src/messages/tool/tool_messages/path_tool.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060editor/src/messages/clipboard/clipboard_message_handler.rs:433\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":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb39aab817ac18ab2a73be53302ff5fab7a744535ea7a921e1ff028d0a6c3821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/cargo-run/src/lib.rs:43-50 | tools/cargo-run/src/lib.rs:53-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/cargo-run/src/lib.rs:43\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 \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":"tools/cargo-run/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50df011d1a99b9a43a7e7be78897b56518a00eea876d6a398b55e379350c34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document_storage_io.rs:184-191 | editor/src/messages/portfolio/document_storage_io.rs:228-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_storage_io.rs:184\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_storage_io.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"51950994d74dece4ca9a780e98f843aa98f70f0b7e9ad6a5b609212441f8880b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1094-1101 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1116-1123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1094\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"116b1439c2737065198465b1197a8cf37a4b0b9d2fcf0247a4bf3e7480b31066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): node-graph/nodes/gstd/src/render_background.rs:216-223 | node-graph/nodes/gstd/src/render_background.rs:245-252 | node-graph/nodes/gstd/src/render_background.rs:287-294 \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 \u0060node-graph/nodes/gstd/src/render_background.rs:216\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gstd/src/render_background.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"763ab691d52a56300397440b6c6a9d4bf713f1d5749d88ad2b577ea5639ec0a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1204-1211 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1215-1222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2510b3d83462c3da775d94b6da818052a93e299213b06c770ff6cfa787a67bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1281-1287 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1339-1346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1281\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d936fa0528ff66655ddf96edb491d3db44bc927c860469a52ab62cc212764587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): node-graph/node-macro/src/validation.rs:304-310 | node-graph/node-macro/src/validation.rs:326-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/node-macro/src/validation.rs:304\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c411a4f5edc692c308abd5809be9ba236316dedb5803d2f1091a1f673e4f5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libraries/math-parser/src/constants.rs:569-575 | libraries/math-parser/src/constants.rs:583-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libraries/math-parser/src/constants.rs:569\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/constants.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9f7330b4c0f5a4ee8eddcd4fa8c88a990a24a28f91b5159bb9b92221570b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/tool/tool_messages/artboard_tool.rs:669-675 | editor/src/messages/tool/tool_messages/text_tool.rs:1147-1153 \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 \u0060editor/src/messages/tool/tool_messages/artboard_tool.rs:669\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, \u0060editor/src/messages/tool/tool_messages/text_tool.rs:1144\u0060 calls \u0060HintData\u0060, \u0060HintGroup\u0060, \u0060mouse\u0060 and \u0060editor/src/messages/tool/tool_messages/artboard_tool.rs:666\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab1abceb8461061ed5f0206c1c2cc1a9d5bea5218ef867adc49a8e60368d35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): editor/src/messages/tool/tool_messages/path_tool.rs:218-226 | editor/src/messages/tool/tool_messages/path_tool.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 \u0060editor/src/messages/tool/tool_messages/path_tool.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab76fa122cb69c44644826954cfb88f2b7ffdb9530ed71fac810cf4ff62d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:131-136 | editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:107-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ba32981651eda246099e5a4dc20c8791d3c3847fd3ef28ac3f134d34058f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document_storage_io.rs:195-200 | editor/src/messages/portfolio/document_storage_io.rs:241-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_storage_io.rs:195\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":"editor/src/messages/portfolio/document_storage_io.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdc0c6db6d6d9cb2a94a8ff88d62c2aeef1d10809354ca33ceec755f15829a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1136-1141 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1151-1156 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1166-1171 \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 \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1136\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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed610feae9f3aceafc370b7386122f087808a096787acc268988f9f7429aaa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:3254-3259 | editor/src/messages/portfolio/document_migration.rs:3273-3278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/portfolio/document_migration.rs:3254\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"caea66698994d1d45b7262fd15629796f7e63b9c700ab5c32b3ef5a5e524ea16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/tool_messages/gradient_tool.rs:1706-1711 | editor/src/messages/tool/tool_messages/gradient_tool.rs:1719-1724 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3247543507ce4dc6916ce0b5cab5126aee87aea85a514b47b8ab02cdf85e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:148-152 | editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:182-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f743c0357652bb7ee49f98f200eaf3e43697a1efe2a3ef233c9862dfda261763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/layout/layout_message_handler.rs:73-77 | editor/src/messages/layout/layout_message_handler.rs:86-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/layout/layout_message_handler.rs:73\u0060 it does not close everything it opens, so those exact 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, \u0060editor/src/messages/layout/layout_message_handler.rs:70\u0060 calls \u0060handle_widget_callback\u0060 and \u0060editor/src/messages/layout/layout_message_handler.rs:85\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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acad0c7cf1585aa4d1bbc32ac3a99bdba5f431d1c9f1a4ed7be579033183ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:2373-2377 | editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:2392-2396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11f11e2d29c2b9d7194863b06f72e4864592fa556fb3b4b5203a0ce72c4ce50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:772-776 | editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:820-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 \u0060editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:772\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":"editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc048b2292e25bca22458a60a5c4467fb9c8d600b7747202113998e18c1c4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:112-116 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:115-119 \u2014 before extracting anything, compare \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 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 \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060editor/src/messages/tool/common_functionality/shapes/star_shape.rs:120\u0060 calls \u0060Some\u0060, \u0060value\u0060, \u0060Number\u0060 and \u0060editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:117\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"274313bc3e6cad71436063f003b8d3f3449fdf66ccb170d91f31c74fdb06b77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/frontend/utility_types.rs:139-144 | node-graph/graphene-cli/src/export.rs:238-243 \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":"editor/src/messages/frontend/utility_types.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2467e0ff813abd2908b1b5b08eff5ca5cec91db8dd2e36955ecda23031393fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:687-696 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:561-570 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"799306fd781d52b14979030e469a8fb8d823e02d000445e04332ffa8a12dba5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:856-861 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:734-739 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e933ed8631acce07bc3f3ea1592362187a45c83465bcd5db9e3a1ba8e738db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:976-985 | editor/src/messages/portfolio/document/overlays/utility_types_native.rs:988-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c1f27b3aca46a0b244168529afa677b5d3fd630d0cabc7410f360e57f0750c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1295-1301 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1166-1172 \u2014 before extracting anything, compare \u0060editor/src/messages/portfolio/document/overlays/utility_types_native.rs\u0060 and \u0060editor/src/messages/portfolio/document/overlays/utility_types_web.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 153 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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"70480a3413c2fdbad23cd29bcfa13ba2910b5f1c876a7a32f8ad051ad9807e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:2562-2566 | editor/src/messages/portfolio/document_migration.rs:2569-2573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96bdf2fc8727d25f6a5b88ef04ecc5990280ea784312d502895d4f6f62ecf72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/portfolio/document_migration.rs:3341-3345 | editor/src/messages/portfolio/document_migration.rs:3406-3410 \u2014 both copies are in the same file, so extract the block 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, \u0060editor/src/messages/portfolio/document_migration.rs:3347\u0060 calls \u0060set_input\u0060, \u0060node_at_index\u0060, \u0060clone\u0060 and \u0060editor/src/messages/portfolio/document_migration.rs:3413\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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18387b8c1472007a9ba1146e592d16efb309b8b012bd27bccc8290a07f737bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/tool/common_functionality/color_selector.rs:297-301 | editor/src/messages/tool/common_functionality/color_selector.rs:471-475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060editor/src/messages/tool/common_functionality/color_selector.rs:297\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/color_selector.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d22032715ebbdbaa789ad88f9119e48ba248aa0f8caeb9ba914ffd09e3d2af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): editor/src/messages/tool/common_functionality/measure.rs:126-131 | editor/src/messages/tool/common_functionality/measure.rs:148-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/measure.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4037f69358a0dc591ccc2e83c0cd2f110d620fca1fd2ec0ab2f39e13aabe69bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/tool/common_functionality/shape_editor.rs:1159-1163 | editor/src/messages/tool/common_functionality/shape_editor.rs:1973-1977 \u2014 both copies are in the same file, so extract the block 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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aca09e2c8f6050a4d0a606ffe49d2936742655a977131f06ecfc93ad79928e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): editor/src/messages/tool/tool_messages/select_tool.rs:1197-1201 | editor/src/messages/tool/tool_messages/select_tool.rs:1519-1523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ac22a0359a471b087b1276b3b4c3d58a9026dfcfbc4cf3cadc906c5eae11e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libraries/math-parser/src/value.rs:518-523 | libraries/math-parser/src/value.rs:541-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libraries/math-parser/src/value.rs:518\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 \u0060lhs\u0060 to \u0060i64\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":"libraries/math-parser/src/value.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51e14e06cf106f410e8c3bab0384f74b2c8428d315735790529409e3f46c0cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): node-graph/libraries/core-types/src/color/color_types.rs:764-768 | node-graph/libraries/core-types/src/color/color_types.rs:772-776 \u2014 both copies are in the same file, so extract the block 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":"node-graph/libraries/core-types/src/color/color_types.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f9bf081729cf928cd1b68fd9c789d0390eaa82e4f5bc496ba775f2952fbb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): node-graph/nodes/graphic/src/graphic.rs:435-440 | node-graph/nodes/text/src/lib.rs:974-979 \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 \u0060node-graph/nodes/graphic/src/graphic.rs:435\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"996e441bb91c40e3bd267ec120ec13409b1e2a5334494347aa0869eaac863a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): node-graph/nodes/transform/src/transform_nodes.rs:261-267 | node-graph/nodes/transform/src/transform_nodes.rs:315-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node-graph/nodes/transform/src/transform_nodes.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":"node-graph/nodes/transform/src/transform_nodes.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64e510c36d39fc71bc225db4708745d22ad696e6b0e8fb1fe29c232b649d837"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project document-live: document-live has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a5dcf42e21c03ec07cadc86f8a2029cdfe411acef4000b40cfb546242a46360"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project graphic-nodes: graphic-nodes has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44afdd96ed97b66cba495d0ae82d36a127d481de4303f7725e722b7abeca1a40"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project graphite-editor: graphite-editor has instability 0.85 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5cf669cf153f360d82a934512c2129f72b94fda920ab73f7735c0fe601c2b92"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project math-nodes: math-nodes has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"387a62e07c68fb7c633142ec2da9d421521d09f8f22148e462af5f2cea8769b8"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project path-bool-nodes: path-bool-nodes has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"02a31ea8872271e205701d936fab715d0264e5deab59333eceafe8ce2bbb94db"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project vectorize-nodes: vectorize-nodes has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"619c0ffa1a8cb5bf7ebb59ab15be775696afcab975324c73c8c7e4902893c08a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: control-protocol: control-protocol: 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":"08480cad4bd510e777fbe3b31ce4fe9eef8808855305e794b8ec3b7d005f52a1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ipsum: ipsum: 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":"beddc11dcffee58a8e7f761c9ef36887f7a43ad61366195d4416a61b353fa0af"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: snapping: snapping: 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":"ddb99bd5ddd917e36b5cb2567492da22752b52dc3c14f041312b4eb76ece5f61"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: wgpu-sync: wgpu-sync: 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":"be6661f3ca82fa28fee58d1354792279173b4c932c342218574e5d1f60576526"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: math-parser: math-parser: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"82512ec7e904764c078198859b2bca94b3855149cd205cdf7bc6a258422cb24b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: graphic-nodes: graphic-nodes: abstractness 1.00, instability 0.88, distance 0.88 \u2014 zone of uselessness \u2014 abstract and unstable, so it\u0027s likely unused."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"48b121c14ea8edde0e950dbe8ed110cfe545e3365383cad8b985e65dcb4daf8b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cargo-run: cargo-run: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f001cfd534889a95d2ddeac86b13f160fee413bd5890ba47dbc49c108c41630"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: document-graph-storage: document-graph-storage: abstractness 0.02, instability 0.25, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c78e0dd13f840b650f5089161f3f4c90fd1c04ce973b1acb065b086b45d68516"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: document-container: document-container: abstractness 0.28, instability 0.00, distance 0.72 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"039ab8546c0e69e83a9866fcc412bed13fff93121f6870a3576e8cde4c61f6a4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vector-types: vector-types: abstractness 0.07, instability 0.22, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1cfc16ccad01b41177ae7643eba1c50314784fd52258909bcd2d1f16aa308488"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Session (LCOM4 5): Session\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":"document/graph-storage/src/session.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"97417fb9ffb47c5e0e3a0a8c36ec0d91550b0993303e90516088ef8733fe4c54"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LayerNodeIdentifier (LCOM4 4): LayerNodeIdentifier\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":"editor/src/messages/portfolio/document/utility_types/document_metadata.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8e86f194f74e777d21a3b8df04d44de833ff90e197ae2f632b3876c52d8432"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EditorWrapper (LCOM4 4): EditorWrapper\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":"frontend/wrapper/src/editor_wrapper.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3702180239b9eaecf51651254f24ae1602aa18ac51e11d69dbab321548430d91"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Gradient (LCOM4 4): Gradient\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":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3bacb621320f9fb89c84fbc3aa57060594bc8870ac3bd6145638c447c09b7d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vector (LCOM4 4): Vector\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":"node-graph/libraries/vector-types/src/vector/vector_types.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"248c7e456c70c00f3e4cef7f5754b46d85908b37465883efc4908d33b973b274"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/document_message_handler.rs: editor/src/messages/portfolio/document/document_message_handler.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 312 in DocumentMessageHandler::process_message at line 259. 10 of those changes were fix/bug commits, and the other 62 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/document_message_handler.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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a6e557fea6c61a2e945d959d760171d92c4bcc1648645219acf75b690ba3e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs: editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 442 in NodeGraphMessageHandler::process_message at line 144. 7 of those changes were fix/bug commits, and the other 32 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.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":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f495802fa00cbd8bc7ba76fa4849089815aa86fadfedaeb1809351b528feb69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document_migration.rs: editor/src/messages/portfolio/document_migration.rs changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 258 in graphite_editor::messages::portfolio::document_migration::migrate_node at line 1908. 4 of those changes were fix/bug commits, and the other 52 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document_migration.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":"editor/src/messages/portfolio/document_migration.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"84259b571638eb5ca41d7bde0906f2aaf4cf38797cbb3daf9f47ea650893e8b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/path_tool.rs: editor/src/messages/tool/tool_messages/path_tool.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 273 in PathToolFsmState::transition at line 1576. 4 of those changes were fix/bug commits, and the other 20 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/path_tool.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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"9639777e72953911c67669c564a2e8d914614674c241a64822fd0a7bb3a61fed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/portfolio_message_handler.rs: editor/src/messages/portfolio/portfolio_message_handler.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 171 in PortfolioMessageHandler::process_message at line 79. 2 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/portfolio_message_handler.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":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5cd0145d43ab1f38e94843677c9433e3c53568217fa9ca4b2878a8c22087cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/nodes/vector/src/vector_nodes.rs: node-graph/nodes/vector/src/vector_nodes.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in vector_nodes::vector_nodes::morph at line 2842. 4 of those changes were fix/bug commits, and the other 41 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/nodes/vector/src/vector_nodes.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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a8c30584fb707a02a6770b47aad69242a24db1e409385f4592989dbbc302f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/node_graph/node_inspector.rs: editor/src/messages/portfolio/document/node_graph/node_inspector.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/node_graph/node_inspector.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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c907f81429f33536fd726eaec02f8d92d6bf51e2e4c44e6f320de3c66a769"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/select_tool.rs: editor/src/messages/tool/tool_messages/select_tool.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 189 in SelectToolFsmState::transition at line 901. 3 of those changes were fix/bug commits, and the other 12 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/select_tool.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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac781fc340692d777cb0b4895e14a07fe17566373b530a8c8dbf9dd66bee57e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/pen_tool.rs: editor/src/messages/tool/tool_messages/pen_tool.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 134 in PenToolFsmState::transition at line 1602. 5 of those changes were fix/bug commits, and the other 14 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/pen_tool.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":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8b1dbfbe3ab24e2a915f99014eb88fc6c802cac56676a76e53965afcbce5e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/gradient_tool.rs: editor/src/messages/tool/tool_messages/gradient_tool.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in GradientToolFsmState::transition at line 926. 4 of those changes were fix/bug commits, and the other 11 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/gradient_tool.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":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c972b653f9faa25a4d75d52e283fd10d3f88a723c41a111508db260875198"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libraries/math-parser/src/constants.rs: libraries/math-parser/src/constants.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 151 in math_parser::constants::builtin_function at line 465. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- libraries/math-parser/src/constants.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":"libraries/math-parser/src/constants.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf75258c2cf6304b2de456be7873310f1f088ebe5da7caea8f54fc7116251d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/node-macro/src/codegen.rs: node-graph/node-macro/src/codegen.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in node_macro::codegen::generate_node_code at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/node-macro/src/codegen.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"40700e1d3c571d46b094d50aef6c67e3198200bdb219e92f393c9b3857c5ccf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/rendering/src/renderer.rs: node-graph/libraries/rendering/src/renderer.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in rendering::renderer::render_vector_item_to_vello at line 1716. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/rendering/src/renderer.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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d720572a5229db63638cded3d9366fe9419ba5ae657da4719c53b30636bc5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/shape_tool.rs: editor/src/messages/tool/tool_messages/shape_tool.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in ShapeToolFsmState::transition at line 874. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/shape_tool.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":"editor/src/messages/tool/tool_messages/shape_tool.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"81374860f2c356c4807021dead9e80035aa90ec73c31a60ac8620dc85a80fc67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs: editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in TransformLayerMessageHandler::process_message at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/transform_layer/transform_layer_message_handler.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":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2b4f4f4b797230add3dcb95b0a052a4bc0172af0f63c23ea9b4da898ae2322"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs: editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector at line 854. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/node_graph/document_node_definitions.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":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fdea341cf96052d8ecf21e0284ab9195e9308e78e7334ed45e35d8ce814478"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/node_graph_executor.rs: editor/src/node_graph_executor.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in NodeGraphExecutor::poll_node_graph_evaluation at line 452. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/node_graph_executor.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":"editor/src/node_graph_executor.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c6db3f10af352ed2378ddb01ccc8375360520f7cc2f11fbd9dbd3de1fde49c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/clipboard/clipboard_message_handler.rs: editor/src/messages/clipboard/clipboard_message_handler.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in ClipboardMessageHandler::process_message at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/clipboard/clipboard_message_handler.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":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b79662d89b1119f04748b6f72534ffaed70f42979d0ce32d525e1f593e4550"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs: editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in GraphOperationMessageHandler::process_message 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.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":"editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a4211ac9dfa4eefe29b4eec2d82c29a26688a775cfb3701d81bfccb1146e71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/app.rs: desktop/src/app.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in App::handle_desktop_frontend_message at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- desktop/src/app.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":"desktop/src/app.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"86259bbb78ce746c902142732fa02b5794889c0bd5b46e124d372bf2569ebc06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/dispatcher.rs: editor/src/dispatcher.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Dispatcher::handle_message at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/dispatcher.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":"editor/src/dispatcher.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f6c027f045ef1fdec50ce647eef48b7864a96dc431914485d7681685b2686b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/layout/layout_message_handler.rs: editor/src/messages/layout/layout_message_handler.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in LayoutMessageHandler::handle_widget_callback at line 205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/layout/layout_message_handler.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":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5d23bc791f6528f4018ec74d65e95a2ca4fc943add95a06a279167bd5be42d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libraries/math-parser/src/lexer.rs: libraries/math-parser/src/lexer.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Lexer::next_token at line 484. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- libraries/math-parser/src/lexer.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":"libraries/math-parser/src/lexer.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17f93067b6b8d8ea233fd4e731e5170b21a1c622f8b885d53f752cba01095d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/nodes/raster/src/adjustments.rs: node-graph/nodes/raster/src/adjustments.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in raster_nodes::adjustments::selective_color at line 1816. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/nodes/raster/src/adjustments.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":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca978cecedbb70bee00095cd527eeca7edd6fb139dcb240cb37adeb41a0552af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs: editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in NodeNetworkInterface::set_input at line 568. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/utility_types/network_interface/mutations.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":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ca4be412cb0bbefbfd00a942bd745e0b0454ef7c0c923d57b7e084ecd600c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/graph-craft/src/document/value.rs: node-graph/graph-craft/src/document/value.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in graph_craft::document::value::deserialize_tagged_value_with_legacy_migration at line 774. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/graph-craft/src/document/value.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document/value.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"251f466ff3ed9e94afbd107060632d526bab52c4825582086852bf760854ceed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/vector-types/src/vector/vector_modification.rs: node-graph/libraries/vector-types/src/vector/vector_modification.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in SegmentModification::apply at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/vector-types/src/vector/vector_modification.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":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e74ec1577c59278a2abc79d91ca41211604c5b6b5165e7a79ebf12166124c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/layout/utility_types/layout_widget.rs: editor/src/messages/layout/utility_types/layout_widget.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in DiffUpdate::apply_keyboard_shortcut at line 1057. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/layout/utility_types/layout_widget.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":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dd9224a8f94d1af6a947771066479788d47aac8233bb2d714d3fc6ebdc5435"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs: editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in NavigationMessageHandler::process_message at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/navigation/navigation_message_handler.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":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20d475f52828e19fd8c76fdf90d609d8b4ae3de9a1ae3090010f05338f28374"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/node-macro/src/parsing.rs: node-graph/node-macro/src/parsing.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in NodeFnAttributes::parse 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/node-macro/src/parsing.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":"node-graph/node-macro/src/parsing.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"46906e5868691967e545290cfc829579f42596ac3ff0da235ef285dddcad5cda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/workspace/workspace_message_handler.rs: editor/src/messages/portfolio/workspace/workspace_message_handler.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in WorkspaceMessageHandler::process_message at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/workspace/workspace_message_handler.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":"editor/src/messages/portfolio/workspace/workspace_message_handler.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f133bf78392e5b6180ddc143de00269820fe57af47bedda4ba2222763fab4438"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: document/graph-storage/src/document.rs: document/graph-storage/src/document.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Document::apply_op_with at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- document/graph-storage/src/document.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":"document/graph-storage/src/document.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b77c78b46ab95e53b7a3d5d913891feebf5078e689a91a8f22a942cc18c6e72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/nodes/raster/src/std_nodes.rs: node-graph/nodes/raster/src/std_nodes.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in raster_nodes::std_nodes::noise_pattern at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/nodes/raster/src/std_nodes.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":"node-graph/nodes/raster/src/std_nodes.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe37efb0eab8668525895dfc4a545386627ff4367b750b64bbe341417df0a86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: document/graph-storage/src/session.rs: document/graph-storage/src/session.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Session::follow at line 705. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- document/graph-storage/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":"document/graph-storage/src/session.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"688a9848dce64b375d30ff4c735590bba65e0d49288b0c3ece33bc1f09cda958"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_message_handler.rs: editor/src/messages/tool/tool_message_handler.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in ToolMessageHandler::handle_message at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_message_handler.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":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dae19d143e2037391d09cad899734f924ae5fb72e1b7ff43f233448528d228a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/artboard_tool.rs: editor/src/messages/tool/tool_messages/artboard_tool.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ArtboardToolFsmState::transition 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/artboard_tool.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":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a2f4293e2b17e14299e82e87e780056d9024457593e5f635f9a05070b96aec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/nodes/text/src/lib.rs: node-graph/nodes/text/src/lib.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in text_nodes::format_number at line 342. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/nodes/text/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":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"542b1d450178228599c6702aee3bf929ad38b9c6dacb7d8b87f4dd9334d15c37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/text_tool.rs: editor/src/messages/tool/tool_messages/text_tool.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in TextToolFsmState::transition at line 645. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/text_tool.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":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a2006fcac4f17cc37901016e04a7e25c8c98074b8fded41eea431bcba8f12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/nodes/path-bool/src/lib.rs: node-graph/nodes/path-bool/src/lib.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in path_bool_nodes::flatten_vector at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/nodes/path-bool/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":"node-graph/nodes/path-bool/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98049f4ec241003987b1202baad4890e3b12733121a2ad41151c474b416607a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/input.rs: desktop/src/input.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in InputState::process at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- desktop/src/input.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":"desktop/src/input.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c591ec2e4af2f4191ab18dc22f2a09acdd243c509ea19a22bb3b2e12b2a168a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/vector-types/src/vector/vector_attributes.rs: node-graph/libraries/vector-types/src/vector/vector_attributes.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Vector::normalize_winding_directions at line 806. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/vector-types/src/vector/vector_attributes.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":"node-graph/libraries/vector-types/src/vector/vector_attributes.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd3fb30c28492ea7d3c89e0abb68430d1e5dfc4adcb00616b8c9bde9ff8b233"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/spline_tool.rs: editor/src/messages/tool/tool_messages/spline_tool.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in SplineToolFsmState::transition at line 330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/spline_tool.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":"editor/src/messages/tool/tool_messages/spline_tool.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"505f59776c62168929d8a70f5db0d6a492d5d27a9e7eb535b50a29be0ba185f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libraries/math-parser/src/executer.rs: libraries/math-parser/src/executer.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ValueNode::eval_in at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- libraries/math-parser/src/executer.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":"libraries/math-parser/src/executer.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"262da1806e8234a1cf34c06c11d68acb25e34c04b3241c8fd7b4ea411710afbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: document/format/src/export.rs: document/format/src/export.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Gdd::stream_entries at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- document/format/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":"document/format/src/export.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc32a06b0c04bea7abad3003ecc48b80f49ddfae98be18df586a01228b5191a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/graph-craft/src/proto.rs: node-graph/graph-craft/src/proto.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in TypingContext::infer at line 848. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/graph-craft/src/proto.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":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b77e8e00e9284c22c2f0291969b237f857275a6622a21563c7bd4e68533a880"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: document/format/src/lib.rs: document/format/src/lib.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Gdd::open_stored 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- document/format/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":"document/format/src/lib.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6c564898f5c8a7ac49e03b663d51285773e7bed75db1c2e763fcbb63e6ae26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/preprocessor/src/lib.rs: node-graph/preprocessor/src/lib.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Preprocessor::new at line 185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/preprocessor/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":"node-graph/preprocessor/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"72884877dd32936664fc0d0f0e55a03052e470ef8a7cd1f0265a7e872bd41c35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/common_functionality/shape_editor.rs: editor/src/messages/tool/common_functionality/shape_editor.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ShapeState::convert_selected_manipulators_to_colinear_handles at line 1122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/common_functionality/shape_editor.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":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fb97b6e60f4f8202ff76365dd0a4e8401f17b6913ee9a0507447d34fd4f812"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/overlays/utility_functions.rs: editor/src/messages/portfolio/document/overlays/utility_functions.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/overlays/utility_functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_functions.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf9e61b54743b325e550e97d34e8349b56654fe409f15590eaaf6dcf4c06b06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/ingest/ingest_message_handler.rs: editor/src/messages/portfolio/ingest/ingest_message_handler.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in IngestMessageHandler::process_message at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/ingest/ingest_message_handler.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":"editor/src/messages/portfolio/ingest/ingest_message_handler.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"501980ee816dedc4853979564e8f15445f75b5c2be026f465e7d274ad824e6fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs: editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in NodeNetworkInterface::move_layer_to_stack at line 943. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/utility_types/network_interface/layout.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":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f895fb7be7755aaed4ff0c692708d83f0bf885d0463feb4795866ae37c8172"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/graphic-types/src/graphic.rs: node-graph/libraries/graphic-types/src/graphic.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in graphic_types::graphic::flatten_graphic_list at line 183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/graphic-types/src/graphic.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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e535641d0e4cc5ffdfcbc7dfa4e67f25a0724263ef242d0cd3c8c90865f773"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/utility_types/network_interface/apply.rs: editor/src/messages/portfolio/document/utility_types/network_interface/apply.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in NodeNetworkInterface::mirror at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/utility_types/network_interface/apply.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":"editor/src/messages/portfolio/document/utility_types/network_interface/apply.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"04faffa4da21d302e895dc25e28aab6828579b238899309f136b2ceb626012ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/sync/sync_message_handler.rs: editor/src/messages/portfolio/sync/sync_message_handler.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in SyncMessageHandler::process_message at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/sync/sync_message_handler.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":"editor/src/messages/portfolio/sync/sync_message_handler.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa045bf59a2f2c2174167f3d601fad8e6c94e5d1764bfdb5ab220b938102a09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: frontend/src/utility-functions/input.ts: frontend/src/utility-functions/input.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in input.onPotentialDoubleClick at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- frontend/src/utility-functions/input.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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2609ab8b02cc8600ed66841c6a4c908b5713f1bf67dfc2291c5924ceed54073e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/vector-types/src/vector/flatten.rs: node-graph/libraries/vector-types/src/vector/flatten.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in vector_types::vector::flatten::chain_order 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/vector-types/src/vector/flatten.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":"node-graph/libraries/vector-types/src/vector/flatten.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e14f7ecd20d9e8d9e9ba75cd06a4f2ca36fe3632bbe22d03d74dbe12503cc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/graphene-cli/src/main.rs: node-graph/graphene-cli/src/main.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in graphene_cli::main at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/graphene-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":"node-graph/graphene-cli/src/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31a6270b1b4c52ee0cdb414009607059334134b03fc9faca8e6eb122deccb1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs: editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in EditorDelta::construct at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.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":"editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71f7348204895bbf09c6cc2f453d4cfe0a53cf3ab2af97cb820e6925a7f453d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/preferences/preferences_message_handler.rs: editor/src/messages/preferences/preferences_message_handler.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PreferencesMessageHandler::process_message at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/preferences/preferences_message_handler.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":"editor/src/messages/preferences/preferences_message_handler.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3767505cbc78662ab09cafc0345885cb0cde6f8d2d1c0dd5cdf4f5eb0e085f6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/input_preprocessor/input_preprocessor_message_handler.rs: editor/src/messages/input_preprocessor/input_preprocessor_message_handler.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in InputPreprocessorMessageHandler::process_message at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/input_preprocessor/input_preprocessor_message_handler.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":"editor/src/messages/input_preprocessor/input_preprocessor_message_handler.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"db30ac8bb2974a681782a94a457b9dcc22dcab3c45d81b817a772b1a51ec8b60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/common_functionality/snap_session.rs: editor/src/messages/tool/common_functionality/snap_session.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SnapSession::snap_features at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/common_functionality/snap_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":"editor/src/messages/tool/common_functionality/snap_session.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bffd4db449dff19be84e48da5eb37e0983c2ee1fc353b3e066adcf73b85ecee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/utility_types.rs: editor/src/messages/portfolio/utility_types.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WorkspacePanelLayout::restore_panel_to_default_position 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/utility_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/utility_types.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"18145b19a3e476b8c3d5fb64ac5c96b44177b5d87718118925e31e077a4c373e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/nodes/gstd/src/render_cache.rs: node-graph/nodes/gstd/src/render_cache.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in graphene_std::render_cache::render_output_cache at line 321. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/nodes/gstd/src/render_cache.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":"node-graph/nodes/gstd/src/render_cache.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a9522020d7838a56d4cb25657a5b22c2431988b90068901c8386c752ae409"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/fill_tool.rs: editor/src/messages/tool/tool_messages/fill_tool.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FillToolFsmState::transition at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/fill_tool.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":"editor/src/messages/tool/tool_messages/fill_tool.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b471ad034db7cd363833f8474fad5536c0b7092611e2275e8096e78f73c783f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/utility_types/transformation.rs: editor/src/messages/portfolio/document/utility_types/transformation.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TransformOperation::hints at line 427. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/utility_types/transformation.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":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5e0220dcc525d525187e9d03b3e103f1fd7a4024a19831a8db2578078fbf1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: frontend/src/components/widgets/inputs/MathExpressionInput.svelte: frontend/src/components/widgets/inputs/MathExpressionInput.svelte changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in onKeyDown at line 910. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- frontend/src/components/widgets/inputs/MathExpressionInput.svelte\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f690571f84669571fde7543e948b212d853de5974657a70c45f9a57b6b779d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/node-macro/src/validation.rs: node-graph/node-macro/src/validation.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in node_macro::validation::ranked_input_violations at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/node-macro/src/validation.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":"node-graph/node-macro/src/validation.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f7481b10c47e9b1cc336b6b30e0b138dc2b279a2f0aaeb3350486db5034c78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/brush_tool.rs: editor/src/messages/tool/tool_messages/brush_tool.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BrushToolFsmState::transition at line 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/brush_tool.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":"editor/src/messages/tool/tool_messages/brush_tool.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d623f0ddcad58261e94c5c82f100a1af677c052cc0be6a19f21140bc0cfa9fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/tool/tool_messages/freehand_tool.rs: editor/src/messages/tool/tool_messages/freehand_tool.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FreehandToolFsmState::transition at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/tool/tool_messages/freehand_tool.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":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abdb99a47ad937a62bc03f0dadb190021d05d43931807bb9286483f0d30cb19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/vector-types/src/vector/contour.rs: node-graph/libraries/vector-types/src/vector/contour.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in vector_types::vector::contour::contours_with at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/vector-types/src/vector/contour.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":"node-graph/libraries/vector-types/src/vector/contour.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c2ab76d5fb84bfc12aafb156584ab9fa93a318c31bfd6ea763960a7e02bfc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/nodes/vector/src/merge_qr_squares.rs: node-graph/nodes/vector/src/merge_qr_squares.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in vector_nodes::merge_qr_squares::merge_qr_squares at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/nodes/vector/src/merge_qr_squares.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":"node-graph/nodes/vector/src/merge_qr_squares.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d91c19ee4101320ebc122aa192e0c7dd1858ebdf35fd4dc5db73662f8fbcf92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/vector-types/src/vector/algorithms/weld.rs: node-graph/libraries/vector-types/src/vector/algorithms/weld.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Vector::weld_connected at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/vector-types/src/vector/algorithms/weld.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":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8be0a4f2df234c9750685630702552b6ab27907b93951255310dae0d176c6c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/utility_types/network_interface/structure.rs: editor/src/messages/portfolio/document/utility_types/network_interface/structure.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in NodeNetworkInterface::load_structure at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/utility_types/network_interface/structure.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":"editor/src/messages/portfolio/document/utility_types/network_interface/structure.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d42bbd7501abea22164ae262b319ad34273a4d72a53b6c85cfe621695555f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/resource/resource_message_handler.rs: editor/src/messages/portfolio/document/resource/resource_message_handler.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ResourceMessageHandler::process_message at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/resource/resource_message_handler.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":"editor/src/messages/portfolio/document/resource/resource_message_handler.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c844d4d1d6bd1cb501797ec660669097acf77f6fceb1e0744daadec5d8ccc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: proc-macros/src/editor_commands.rs: proc-macros/src/editor_commands.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in graphite_proc_macros::editor_commands::editor_commands_impl at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- proc-macros/src/editor_commands.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":"proc-macros/src/editor_commands.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe7e45e23388ed99249439afce8538a098a59d7d2f5693502119216f237229a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.rs: node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in vector_types::vector::algorithms::offset_bezpath::offset_bezpath at line 23. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.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":"node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21a30d2a042ca066fd421d5d9fb85a961affe974099007c350b031d1854be40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs: editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NodeNetworkInterface::compute_node_click_targets at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/portfolio/document/utility_types/network_interface/geometry.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":"editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a68e63ed166b814244290e6596c5f398eea0a6cdd5ea21bd674a250f8569e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libraries/math-parser/src/sort.rs: libraries/math-parser/src/sort.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Sorter::sort 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- libraries/math-parser/src/sort.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":"libraries/math-parser/src/sort.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc748c421ca4e64de9a657943186439e1d34a8f799b066428c0975b9a9f2c7d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: editor/src/messages/dialog/dialog_message_handler.rs: editor/src/messages/dialog/dialog_message_handler.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in DialogMessageHandler::process_message at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- editor/src/messages/dialog/dialog_message_handler.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":"editor/src/messages/dialog/dialog_message_handler.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8372e1bef4350502eb9763e977199a103cc48ee20b978ed8f050a1c0c533f69e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: document/migrations/runner/src/node.rs: document/migrations/runner/src/node.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in migration_runner::node::rewrite_history 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:14:45 -08:00\u0027 --until=\u00272026-11-13 18:14:45 -08:00\u0027 --full-history --no-merges -- document/migrations/runner/src/node.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":"document/migrations/runner/src/node.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb4185c0f50593c692f9455d8cfee81d173c32dea9fc9bc8b2aac7491d987f6"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 43 significant file(s) lose their only recent owner: libraries/math-parser/src/lib.rs, editor/src/messages/tool/common_functionality/snap_session.rs, frontend/src/icons.ts, libraries/snapping/src/solve.rs, libraries/math-parser/src/constants.rs, editor/src/messages/color_picker/color_picker_message_handler.rs, libraries/math-parser/src/sort.rs, editor/src/messages/layout/utility_types/widgets/input_widgets.rs (\u002B35 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"feb266df3fd60a777f2105aa6dabd0dfd9836f3e10d41bfe2864e46571cbacf8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 30 significant file(s) lose their only recent owner: desktop/src/window/win/native_handle.rs, desktop/ui/src/context.rs, desktop/bundle/src/mac.rs, desktop/ui/src/input.rs, node-graph/nodes/gstd/src/render_pixel_preview.rs, desktop/ui/src/frames/import.rs, desktop/ui/src/lib.rs, node-graph/libraries/brush-types/src/cache.rs (\u002B22 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3af26fb199aa7e82fc6013e5e74e1fd438a53d306d5d5d4fa197205881b99ca2"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 11 significant file(s) lose their only recent owner: document/graph-storage/src/session.rs, document/graph-storage/src/document.rs, document/format/src/persist.rs, document/graph-storage/src/history.rs, editor/src/messages/portfolio/document/utility_types/network_interface/store/accessors.rs, document/graph-storage/src/crdt.rs, document/graph-storage/src/registry.rs, document/container/src/archive.rs (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"12304255b505044f1bb46c0c54345c6dc4b568d7b65bcf0688ea2be84fb190f0"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (85 single-owned of 556 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 556 of the 870 production source files in this repository met that bar). They are anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: node-graph/libraries/animation/src/lib.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Also obtain document nodes, not only proto nodes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/node-docs/src/main.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cde4bad2c07e2ece7818049ed3955707c4d681b43ef1a64c7596216ef84d1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support other compression/archive formats \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/cargo-run/internal/download/src/main.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecf3ce5363298ec234f36fda3c0b553ce2cbad2b0d69bb56e56beb8e11bd9a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this node support stroke align, which it currently ignores \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"563bfbc484d5ed2a5d1d83e3ee52aa4cec3ed13cc1d0cfc25b0926544cc2b4bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: apply transform to points instead of modifying the paths \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a182268f2887b94116b490b4e0ec8e09c7354822d49747cb401e104c6095ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return i64 instead of f64 once automatic type conversion is implemented for nodes with generic type inputs, so an integer output doesn\u0027t wall this count off from the generic math nodes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3866}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a460fc286b7961e0c6f284ea6a48c30bd5ffb756272b48925945900e8761d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return i64 instead of f64 once automatic type conversion is implemented for nodes with generic type inputs, so an integer output doesn\u0027t wall this count off from the generic math nodes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b43eb18730e8e3d77487c8017081835fdeb3fb8bd17514a2e0af96120fe175"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":3867}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de8a0df462dd3549b245fa5214a898e4bfa890867e86a18f4921ec7bf529614"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/lib.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fddda378f4074d29afbbb1f24275733e6efbde725d238a35da4eb112e243b25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25bcb51fed769970302c6664f3a787bb34ad53c110d548884363f05c024df21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gcore/src/context.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebaf0ed3ed510117b06e35b24bf7acef9c414d542f4e8b157ee90c0ff14e93e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this pair of shear angles with a single \u0060f64\u0060 skew angle \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/transform/src/transform_nodes.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc3addc673d3bbdc5813ac48d1dbf01eae70ba00abc5b7bda166430c7c464af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 26 files: The identical TodoComment appears in 26 files (103 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 103 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO: Eventually remove this document upgrade code\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/font.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"997aaf408b9bbf6faabccd01ed83aaf078a7aaec8c466e2f5be4da5cb579b463"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be cached for better performance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/path_builder.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d291970fec4a2dd70a1f17c652721feec578cb3df9ea0f4758c5e1e01acd2d2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this hack and move the attribute up to the parent return value when \u003Chttps://github.com/GraphiteEditor/Graphite/issues/3779\u003E is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/text/src/path_builder.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb4cddc48459141b3e4a72fc02e5e119aa605436d7117609d8f2e66f1c0af06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When using a custom Inspector layout in document_node_definitions.rs and this default is set, the widget weirdly doesn\u0027t show up in the Inspector. Investigation is needed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/repeat/src/repeat_nodes.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e9c1ba1c3f56cb5ef56c27cb832464b48049e9cd9ea6c938ce353030d18bb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A Lab-only mode once Graphite supports the CIE Lab color space. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8d48d7061bae80a72f8f08597a0ec1a7ab079cf6265cdb23895a3a2d28e3ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Residuals in 8-bit PSD interop: the byte-hue colorize table, the colorize lightness slider (up to 2.5 levels), and the range edges (a few tenths of a degree) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"31533667abee74bfab85e7b4f9a5d566e528482b6b9acb71fcf0482af257eb06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Full PSD interop needs a compatibility variant of \u0060GradientInterpolation\u0060 with its own midpoint semantics, position warp, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3c11bfc4c1fa5e1e0b5e2b9578ee8933165f266fbf2818abc091a684a40e2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: and smoothing (a \u0060gradient_smoothness\u0060 attribute), plus noise gradients, which we don\u0027t yet support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6e213485075e7ead239c6a8e5a85fb1b069c9b69cae495767fda92f6f73cd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Its axes differ from ours: its midpoint is always a knee in the position warp and its smoothness blends the curve over \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfa429f65dbe30103d462283255828a938a1600a6975cf9acc9259516d4d79c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: that fixed warp, while each variant here picks warp and curve together, so neither end of the blend is Linear or Smooth. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"72191cd667051e1463c531d843e7cec34af9d4edd919cb0f237d5d9137e11f67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Per channel in the gradient space (measured on gamma RGB): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a068d49fa8d44d4b8bb15f75c32523b1d5fa5cb6d8dd9c29be1a6e512beea8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: - Position t maps to a parameter p by a piecewise-linear knee through (stop position, index) and (midpoint, index - 0.5). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcca6d29b7895edfafd456146bf9a6da78a0f0115b6249523deeda0977d28201"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: - Linear lerps the interval\u0027s stop colors by the fraction of p. Smooth is a cubic Hermite over the stop index with tangent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"127f20676654df6018ba5c2fcc27a02e8a2a7f0eacbdeeaf8b67c4daa98fbbf8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:   \u0060(c[i \u002B 1] - c[i - 1]) / 2\u0060, the end stops repeated past the ends, so two stops give \u00600.5 p \u002B 1.5 p^2 - p^3\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"44acbae5952191aa297d96d36968f67b484b40d94107c9941834bf8a168678a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: - The ramp is \u0060(1 - s) * linear \u002B s * smooth\u0060 for smoothness s, clamped per interval to its two stop colors. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"992b976dfccc5b10ed753f92c941f147b6f732d632b53bd628f4d757102f315b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: CMYK source channels once Graphite supports the CMYK color space. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7600d97ae7a2815d3151c2c38e782d8f6f88274e5aa9d72f72d8b8ab17c2d103"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support dither, which needs the pixel position that a per-color adjustment never sees. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa194c86a18addeb551ee0df236bb01f870aa07713beed4a78cfb5514f7daa14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify the tetrahedral interpolation, which is unconfirmed against other implementations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"da11654b24dd895edbc4ba2244a29d46533debfb9e517955472315526c5c3a3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rename to \u0022Paint Overlay\u0022 and take a \u0060Graphic\u0060 paint like the \u0060Fill\u0060 node, enabling this to serve the cases of Color Overlay, Gradient Overlay, and Pattern Overlay. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/blending_nodes.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1674872cf9cb7858083c5b4f4d9642ebff65624fdec80d9fcafdf313ff6050f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The patch size and guided filter radius are whole source pixels, so the effect\u0027s scale follows the image\u0027s resolution. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/dehaze.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cf9a46f95d8312118247ff8e6762fd7c30b690ab3f112c85d8c25dcd467d86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this algorithm work with negative strength values \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/dehaze.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefa5725d72d67e5cfaedd0786bdd98c1a8b670e8255dd659b3419fc7bc4e130"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Break out this pair of steps into its own node, with a Memoize node which caches the pair of outputs, so the strength can be adjusted without recomputing these two steps. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/dehaze.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb84a7d5fc3145c9b2aea240a150bad7db9185601535d4d67efa21b65f56382"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Scale the radius through the footprint so it acts as the document-space length its Pixels unit promises, with a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"85439e44be9a215b9b1daf05a577204aff7113fd1587d76c876c1ee7967cf715"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Scale the radius through the footprint so it acts as the document-space length its Pixels unit promises, with a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/filter.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf5aecf10a36c27438c2582c940a765986a3e15b965b22a6b38f58efaf56596"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove \u0022clip\u0022 entirely (and its arbitrary 100x100 clipping square) once we have proper resolution-aware layer clipping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/std_nodes.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef07191dab7fb6e1f871f8931a257b650d25a86b8c4469105b9ba5e148d9d59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Generate in layer space, not viewport space \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/std_nodes.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b057c9afb17dc5f8ad3894d211c2a7052194c60174160bdb75f4db8270b38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix boolean ops to work by removing .transform() and .one_instance_*() calls, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/path-bool/src/lib.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b6deec08b5bcff15775cbafba6359be9e429430d0f980fc84e6686e948b15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: since before we used a Vec of single-item \u0060List\u0060s and now we use a single \u0060List\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/path-bool/src/lib.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae60736e3246fc5775452041623967a998f240ed0d3b0f5b55b5a52e370e4e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: with multiple items while still assuming a single item for the boolean operations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/path-bool/src/lib.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"245123203ac622e5f7a6ac2f992b0bb808d5e399a583c1870ce11798646ef833"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test that these are no longer needed in all circumstances, then remove them and add a migration to convert these into Passthrough nodes. Note: these act more as type annotations than as identity functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/math/src/lib.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c258fb689af4dca3a057447cb508e6a3920b5d6156f98b87e22c4af49ea899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test that these are no longer needed in all circumstances, then remove them and add a migration to convert these into Passthrough nodes. Note: these act more as type annotations than as identity functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/math/src/lib.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cccbb4994474dff95bddba80e39790f107b017c8d7533d0342cb1647b134256"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test that these are no longer needed in all circumstances, then remove them and add a migration to convert these into Passthrough nodes. Note: these act more as type annotations than as identity functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/math/src/lib.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbe25f9a4ed6650dff67791740e6fd17b50550908d6d8986e16bd36d5f4e095"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/artboard.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb66b31dffcf1363fb7cc1cfb6e235b1d74a142cb81b76d7fdc1a5de24ca113"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f343e50be4ffb357fbcdcf589b5ad876a54c4fe772d7c5dfb5ed4ebf687bbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7f763fde38ce5e37ddff066b2ba25968fab8aa388700128bcb63a8c53a68df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93f003779349be72a60a7f6ec23e38a16bd20c4007b17548cfafe36642fbb5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return i64 instead of f64 once automatic type conversion is implemented for nodes with generic type inputs, so an integer output doesn\u0027t wall these indices off from the generic math nodes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"390eb8fc2b42fbba440776e808282fca758ef22a9e59a109119f6b92ec88dd25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid mutable reference, instead return a new List\u003CGraphic\u003E? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0108cc93c464fc2433f8127e7a9ecb13dc84b1a2050bc807079b3d1cee07c23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this snapshot hack with per-layer metadata driven by each layer\u0027s Monitor node. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"0261450fc614bde999269936b3a67e0a2809c805291ca640c4387798bb046efc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Flattening here erases the upstream \u0060List\u003CGraphic\u003E\u0060 hierarchy that editor metadata collection walks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"301616fcf2b3f853a1772ead444f78db4de6a13607c3b4bd68aac70fa9ca7d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: to populate \u0060upstream_footprints\u0060 / \u0060local_transforms\u0060 / \u0060click_targets\u0060 per child layer. As a workaround \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace467651068165a9fe75e3f8db8f69b0f912cf8ee14c7e81dda7a04086792ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we stash the pre-flattened list on the output so \u0060List\u003CVector\u003E::collect_metadata\u0060 can recurse into it, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e0a6feea262d0966cc3cf4772ddfd20e29e68f79a7306d768dfebe8eec8357"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: which conflates render output with editor metadata and forces the pre-compensation dance below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3799d63bad0280df0f71843b7fab97e3242b366b6a19607387ba5db1d898b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The cleaner fix is to drive each layer\u0027s metadata from its own Monitor\u0027s captured \u0060(Context, List\u003CGraphic\u003E)\u0060, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"db980089460a801216265853a2cc3eddab326d033b938c5c2dbcbabdb89247f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: at which point this attribute (and the equivalents in Boolean Operation, Solidify Stroke, Combine Paths, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61f5ef9d6c5acd668745035c279a1fc01564795ef2235b6e5ab636cbc78e17c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Morph, Rasterize) become unnecessary. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8031a41bdec58b62ed9f9c16a370b167d23b68fae520bd2bd20b9fa57f81039"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement proper conversion using and existing time implementation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gcore/src/animation.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c436f200803e6d5665dc6de0068b4047cf3e19f2d5ad5d8ad8ec1e8fd79e4fff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Factor in a chosen timezone \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gcore/src/animation.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d75e4bc09618079e32450e3e3391d7bd06b5493a428b66b345acc4195c0ae6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Factor in a chosen timezone \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gcore/src/animation.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad5584f0d8f6b4e0cd4318f5891934e451745e56a16b20d9eb2e85802e17714"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Factor in a chosen timezone \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gcore/src/animation.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b467c54e36acd0eab0fa50bc642d229829872a6d3b9e47292dff07aac04dde16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return i64 instead of f64 once automatic type conversion is implemented for nodes with generic type inputs, so an integer output doesn\u0027t wall this index off from the generic math nodes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gcore/src/context.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"53aae6e5bd22c87d4dbe2e92aac2102bd8517b208461f406255f14bff30c26eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out a better name that doesn\u0027t conflict with so many types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/node-macro/src/codegen.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f46c3c82564252a48c13bb07e675fca8a7d98070b5432a7c46cf079cf4559f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Elide the default again (removing \u0060legacy_gamma\u0060) when switching to the new document format and Ctrl-C node serialization format \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1763e50ed325840cdab3c136692561016f9a3e8bbf44b3d8582566b78177be3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when switching to the new document format and Ctrl-C node serialization format \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/gradient.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"459c4ee49715f01fb1d0b16cc2f9ab3107a0bae37723cd8f617c8316f92e9f37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use point for calculation of bbox \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/click_target.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f09532974db8552d69847dad51d449759fe5bb66c33e5c5ca11988de370556"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is this the cleanest way to handle this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/click_target.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc70bea901e199c88a229b80b4d1f77baa7a2381f119478d3ec2b8d770bfc1b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is this the cleanest way to handle this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f46b94c40536dfce5bdedb0dea8e61b88d84460c87efea3dbe352e26d36f90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is this the cleanest way to handle this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e2eb4a99d0f7167f8b90924dcb10962c0130ab43a533207092fa998bc5437e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is this the cleanest way to handle this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aade1ae8186814dcba962e05017cf01e89d94fac940150c190697c8aa85edd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: actual intersection of stroke \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/click_target.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d72064e30b5ec4c5e712133bef5eff2930242f3daa2b886ceba7bf32f0eaef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This was previously an unwrap which was encountered, so this is a temporary way to avoid a crash \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/misc.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb120eb2c1ad751a8d328a55fad7ac1214dab11c27961c3c91da73a7524b7b17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stop always writing this as a marker when switching to the new document format and Ctrl-C node serialization format \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"899f480d83cb040d766687ccc0edbfa3ce4625430518da7e2efa9d5a32b62198"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do we want to enforce that all serialized/deserialized hashmaps are a vec of tuples? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/vector_modification.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6b28410ffa6acd2891f82ad59bf3dfecaaf754d1ce02166ceabef20c1616ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If a segment curls back on itself tightly enough it could intersect again at the portion that should be trimmed. This could cause the subpaths to be clipped \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/bezpath_algorithms.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"433f9892e08bcd85ae5ed9517027b147dd42b866ecd77051af468310fa1787be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: at the incorrect location. This can be avoided by first trimming the two subpaths at any extrema, effectively ignoring loopbacks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/bezpath_algorithms.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5644bd6f93642ddea17419e9921df7bbc944f02e9120232ad9e5ff8ca9b14770"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Besides returning None using the \u0060?\u0060 operator, is there a more appropriate way to handle a \u0060None\u0060 result from \u0060get_segment\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/bezpath_algorithms.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c59fb4ae834855b9fddcea81d380ba80504a1f28609999f8dcae069ee51035"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add more intersection tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/bezpath_algorithms.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbdb1dbe10054fe104d9282d65aa6e7f9a8da59279fe20fcd06ad7d18b73ab5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use an \u0060impl Iterator\u0060 return type instead of a \u0060Vec\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f8b7dd5eca0e82dbde70a0e9772412ae28e684d31e0e8d5e3c9fa94a24fa49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use an \u0060impl Iterator\u0060 return type instead of a \u0060Vec\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4890df45a0e975558bc4054aeeb9682d33d5667a76a92cd7abe70da1f310c50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We lose information on the winding order by using an undirected graph. Switch to a directed graph and fix the algorithm to handle that. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fea7cc03ce13076a90c5835b7842f4d506f5b026937ea68fe718c1920b4afd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there are a few possible algorithms for this - perhaps test empirically to find fastest \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b302a01c636c7626ff8641f2d40fc1f469595c74cad9808679b5bb060e9ecf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: faces \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/vector-types/src/vector/algorithms/weld.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9cf1d5c6a1baa6cc0109623907cf2450a84cecc56e4c946a1b707e5b738465"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Click targets can be removed from the render output, since the vector data is available in the vector modify data from Monitor nodes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a81654d7c0d5ea3804ee1c973dda43604a210229bb82d5fb025e4d44ee43ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a better non O(n^2) way to merge backgrounds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"815907b8a783a412daf0d445a266c6cd900a90111551339f68054bc960fe3030"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rename to \u0022Graphical\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"044c20731f83ed504cffa74c68f4dc4769b58de57fd9104fb8a5935fe9ac9d73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Store all click targets in a vec which contains the AABB, click target, and 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":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd32444d0186372eaabbf20019619dc2988b2e7ea1157301f59b588a60fbd07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than the first item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4609e09a3edde5cecdf4855d22bd5c3bd6129020ae3f15c630d0af918e6d97e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than the first item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce13a3d69724acba1a1c7bb26943655e1dc0ace8c57d32c78234c389cb140e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than the first item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68aadf9d9a0be93af50849c52410520f03dbe951cadef45d15155634aeeca45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than the first item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1064910ebeb91c30df365beae1f179a5a3446a8def8d6fa8b4afe62472bd6c58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than the first item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01d8949f36a6f737298130294772b79f4410868643edea70a9dc5096ba4b84b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than the first item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"768879bae099b092fda72392782ae19988e08decab0b6481b8548010a5d6527c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than the first item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6366425252bb3787aa3aa491f62724e62bec8b189e619379f6aed975a392ef5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to handle more than one item of the \u0060List\u003CRaster\u003C...\u003E\u003E\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/rendering/src/renderer.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd978b103e281e6c5feb3eda0f33ee6a7268c1dcfa0f65cb2d6562533637daa1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // use crate::vector::Vector; // TODO: Check if Vector is actually used, if so handle differently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/raster-types/src/image.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"24261d2e23e4efc6ca028be7c517861958ebab1b032426f1df188dc62077c02d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add an \u0060origin\u0060 field to store where in the local space the image is anchored. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/raster-types/src/image.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee681e6bf5c0dbb2c81cb5807b532db6c1851225adceeeee2b08b8a32bd5fcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently it is always anchored at the top left corner at (0, 0). The bottom right corner of the new origin field would correspond to (1, 1). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/raster-types/src/image.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43cdbb7855ebdcff046295b3836618c72e8f168e2d83237bea7d112aeacf094"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve sampling logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/raster-types/src/image.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe3ea4be5b9be8fe7f511865bec19a7903b71b7768467dbf24d61c425ea259a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider returning a slice or something like that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/context.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e4f7bdc4b0956502f622f35933a4287d3fb3f1769b6fd7b2e30871e2223f81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider returning a slice or something like that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/context.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69efaf1004aab79e6016967e3c2b6c28a7055ae76aa0545a1327e09b2481cc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider adding \u0022gradient_spread_left\u0022 and \u0022gradient_spread_right\u0022 override attributes to allow setting different gradient spreads on each side of a gradient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1685c0440f27f5e13a5a2926459a8266b9b151b6a2176e5e9472aaa361c0738e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a \u0022fill_rule\u0022 attribute as a sibling of \u0022paint\u0022 on the coverage list (uniform across covers) once a FillRule type ships \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/list.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a4e84c2bb803bb6350ed47d9f9aeb6fd4a25f01fc400087167963c5e26d948"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(TrueDoctor): Replace this with the more idiomatic approach instead of using \u0060trait Clampable\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/misc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce6c55abb2a7d01a98716fd0a4b8c13714624b715c32449d1e7f4c733670e91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Document this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/ops.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3e5ba2de5ecc8c61896d2b256376d34013877532ee26c697ad80267fbdc9f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this safe? This is assumed to be send\u002Bsync. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/registry.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c608ecc2eba1c20fcd818fec6487421d7ee4e42c2e8d63bf6126e35ff25963ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement this on a higher level wrapper to avoid missuse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/registry.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bceb63d92f83f2b5fe26f638bd93309fe5622092f83024d8fe7069cde2c1770"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Evaluate safety \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/registry.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f91df50bc0974c7bc1b2201ebbc67a0aeda6bb2f6f0bab1a1b0b8062285d94f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Timon): check if this would ever cause a problem; running a future on the graph executor thread might also be a bit wierd \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/runtime.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc175091c07057de674786835fadbe0b5dceb6216d3efebd7520a42585c4fb0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rename to NodeSignatureMonomorphization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/types.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c30789435eed2663d4deb6da8cbe6d626b39ccd4b28ed88c5ecb06cad8c06f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a flag to disable this warning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/types.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f11b246ec0639e50df07006630894ca90aa9cc1fdca448cdf54d8f67a3690af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Come up with a better name for this trait \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_traits.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c3cb18e74c429ef3aea6c8766637919c08713fa15acb727bf999d7825eda2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use u8 for Color \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_traits.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb7fd165ad28e7f889743d069ad520f9596f3e9832ce13b63ef21748b45ef9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We might rename this to Raster at some point \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_traits.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7abee5b8c30997c60914fa57b46c550f149ba90e74723ef38823aa9e2ba7d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add an area parameter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_traits.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"095189be13064229fddb6a588961e042e761202a47076e121aa3b2b97549e45b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the \u0060linear\u0060 marker when switching to the new document format and Ctrl-C node serialization format \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_types.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bb205f0e65c43a0186c9749bdcf4b38c5d6d6843e12b346101794ecdf7d90f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the \u0060linear\u0060 marker when switching to the new document format and Ctrl-C node serialization format \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/color_types.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a4b2a1852a58f48f294e9adfe11728c2bcd2b0060d79e4d0809e693fdd696f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider removing this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/application-io/src/lib.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"833f5358036716b7f1e9fc18c83ac0ab3dda2fa96bd29408c1c12104ca15d213"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: https://github.com/GraphiteEditor/Graphite/issues/1767"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/dynamic_executor.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b68f99d754155b6a466878be342f80d63096dd9b5a7ac79c5719f624527fc66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Non exposed inputs are not added to the inputs_source_map, so they are not included in the resolved_document_node_types. The type is still available in the typing_context. This only affects the UI-only \u0022Import\u0022 node. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/dynamic_executor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a997b6c6038b728d53e2b59fcf6dcbd10884b9a0285617bbc337f1587c9485d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Dennis and Timon): Remove this once rank promotion is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/dynamic_executor.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ed0e06bc017c2c2f2ca6c7762d36ad9b5105613779e2dd45b3af640a396e85"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to undo rank promotion while traversing the graph \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/dynamic_executor.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ae17838b2db025d91c4bab946be8dbc726cf337f3eb3f93d9fb5fe74c6f942"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Problem: When a passthrough node is connected directly to an export the first input to the passthrough node is not added to the proto network, while the second input is. This means the primary input does not have a type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/dynamic_executor.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ce3ed229b2723743859f96ab7a00f6130d72f3a1d4996f538414625c9a61a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: turn into hashmap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/node_registry.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2674aea4adadf41a8eea5b3397bae209dd9c88d20a643e887cd102b6dde0b743"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is a hack to remove the newline from the node new_name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/node_registry.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4200ca5dbb7c44783d795121e0c5d039e73d3c31e27c546881dc62d9d7d53cea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with \u0060core::cell::LazyCell\u0060 (\u003Chttps://doc.rust-lang.org/core/cell/struct.LazyCell.html\u003E) or similar"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/node_registry.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57fbf97e6218eaa1ee81b141e06f6a4d5a8ad1bcb108a3df660f6966e441524"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with \u0060core::cell::LazyCell\u0060 (\u003Chttps://doc.rust-lang.org/core/cell/struct.LazyCell.html\u003E) or similar"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6052454b3e7675d5045646258c8f6c286e82fd942f2ace7592ef157f5ae3351"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with \u0060core::cell::LazyCell\u0060 (\u003Chttps://doc.rust-lang.org/core/cell/struct.LazyCell.html\u003E) or similar"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a72ce03da074181ba58b4e5c3464e27eef8e4dd967debecc22baf025d77b24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with \u0060core::cell::LazyCell\u0060 (\u003Chttps://doc.rust-lang.org/core/cell/struct.LazyCell.html\u003E) or similar"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"be03150668c2f92fc9d6cbe4b956f783ee72bde2d95658b2dbde666904d6be31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we currently need to annotate the type here because the compiler would otherwise (correctly) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/node_registry.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c310bbf02351e219523804d32da8989a8dbc81d766fe5a65f34f7bf9c9d236"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: assign a Pin\u003CBox\u003Cdyn Future\u003COutput=T\u003E\u003E\u003E type to the node, which is not what we want for now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/node_registry.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac297f136841cf459e48e1a6d97be44b2a0f8d00384d914c9714c60535f9187f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with \u0022Output\u0022 definition? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/util.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc16ba20d3569b2ad3a1705d5c2f957ce8b631e9e475dc5129c986cb77a068a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider replacing this with a real spawner and benchmarking async nodes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/benches/benchmark_util.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1fe2a15d20341f0e0f4adcb56f75013d229aefc6fb6e84f5a5f7cd69e9c7c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove import_type and get type from parent node input \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f902a3e8c884860b8e0d0cb0fa161877510910badbc41f24dbf2abd2f4b93cdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove this alias document upgrade code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e809a258b0ef84095e361f10a8516dd41daf7897215c6f3de4a05a9586a4ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove this alias document upgrade code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ca538c1a80efbb3a36bdc58116cfec55feecd28bc89b533bf41f649e8b5479"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove this alias document upgrade code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document/migration.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1621a6e8780160205d63233413eabf2ec842a4ce26043a8580dd1df0a35c3145"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove this alias document upgrade code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/misc.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bd925fa9cfe64a82c7e860697288b141d6027e62a9cee5be98bd2d569f4285"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Instead of storing import types in each NodeInput::Import connection, the types are stored here. This is similar to how types need to be defined for parameters when creating a function in Rust. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"98022dc6ff5bb24d0ec5f64cb5b0fa942a83afbab5bc5dbf81ae8dcd6b5b1c39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this since it seems to be unused? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f7811a9507ec4921273f7632f41f7bf7195a9b8190c25c3c2384acd8bfe9d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use a struct for clearer naming. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb775c8871f764d87a8f533d7865934e338b7d1ffbf71184ca5839c972dc0472"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: format with the document graph context so the input index is the same as in the graph UI. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f6643b6dce403ba5703354714f81cb68cac36247b4e6d8b1d2f6c4c732e708"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add proper generic counting which is not based on the name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bb3f10a64a8795fdf6cd7aa29821a5cb10c14a6643ffdf2443f55b3f72b9a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should return a reference to the value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/proto.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"67947ad7129bf70836fcbec63b735cb0ad0bea6d27211874c0013ad46ce24698"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this name with a reference to the [\u0060DocumentNodeDefinition\u0060] node definition to use the name from there instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document/migration.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c881a0e9050eb7f3a4211311744d6b138b324864be0606cad9e5cb04fa0df2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once this references its definition instead (see above 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":"node-graph/graph-craft/src/document/migration.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f555f626b48a86f6f3386613e6829fd209a860992f580f47ca93f7e1b3e994"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(TrueDoctor): Properly solve this disparity between the size of the largest and next largest variants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/document/value.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89725150df2ed3d74e4e4f98bd143de87a5c4ca533cc83e3f433d4e210ff32d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for flattening exports that are NodeInput::Import (https://github.com/GraphiteEditor/Graphite/issues/1762)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/compiler/flatten.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bf985f8fc0b4c4c67a5c08adf3ed0b7f13a8410fd1571817607b6aa4e02ca0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if we can read lambda checking? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/compiler/lowering.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"77206ababaf79c590e372ccc7e9610eaf0237898a4f9dfc0d17e269420dc4a42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extend test cases to test nested network \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/graph-craft/src/compiler/lowering_tests.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecdb2f4367c22e1bdc85456e20934999c360627c1ba6321642485df9b5fc1fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The code below is kept commented because raw data to final image processing is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/tests/tests.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0b7cd33482967b8e55bd896279e5149dc1b9db671ff042a429441c474617d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this later \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/tests/tests.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c611c8e9313c55ef75d954d73eedd969347ab6f3d399a194998962a94d1b3e19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement for arw 1. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21ee71876a409e1de3f374662226ada726e52e1563a6a28fa1568c6a82dd1f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ARW files Store the thumbnail offset and length in the first IFD. Add support for other file types in the future. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/lib.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4033089ac8e4ec9b33c37bf20d795aeb973b9dcd790be9f0cd09a9293950a94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move this at its correct location when highlights are implemented correctly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/preprocessing/scale_white_balance.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d6f5221ec79ff4b7b126de96137ed3d19910cb2dcb50a33d5df106aca8fd50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find the correct way to do this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/decoder/arw2.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6614a9506316b47e229cd1a13db6285dc136c92a947bfd50707da18ee82aaef7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: editor integration, implement these traits for whatever is needed, maybe merge them if needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/math-parser/src/context.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be1e9502f6168a5942b552ca1780d1609de09f300324c0e59a21b7a897d5b57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch to a system where everything is sent to the backend, then the input preprocessor makes decisions and kicks some inputs back to the frontend \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"79085beb58d5c86fef25be958b620ff7cd199bf611344742a24e8a3b7e30e3e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A better approach is to pass along a boolean to the backend\u0027s input preprocessor so it can know if it\u0027s being occluded by the GUI. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f713b61d3b04c53ae86068271a94fab7c82dccde403fd883f550e49ad8154e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This would allow it to properly decide to act on removing hover focus from something that was hovered in the canvas before moving over the GUI. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"63832ce2fdb2c9470ce2e8f89b4813901f1a8b3c6623b2718bdaf8e767c21b45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Further explanation: https://github.com/GraphiteEditor/Graphite/pull/623#discussion_r866436197"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"632ee3ca7b1ccedb53ac2bd357daa9aa03808bfcf372e38d8a0a087a212eb88d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This works in Chrome but not in Firefox \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aafe1a51cd5bdcdbcaed9ae4f1a32bb7adc1d2343cb1d5e08dcf844752a4dbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Possible workaround: use the browser\u0027s history API to block navigation: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c177a7f20b7dfead41bb1d37dfa395046bd7bf912afda3a9214c40e2f1b6b059"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u003Chttps://stackoverflow.com/questions/57102502/preventing-mouse-fourth-and-fifth-buttons-from-navigating-back-forward-in-browse\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bbeafc545701ebd904a7b95d18b4200ab51adba228ff4c7fdacefed465aaba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider passing physical sizes as well to eliminate pixel inaccuracies since width and height could be rounded differently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/viewports.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"610ec25502cd9f869207b65cdea4fa299250c13c54971eac643dcd9561f82c1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could be used to load documents from URL params or similar on launch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/persistence.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"695a302f250fbf89bf05962d740516f682919901988331b2bc91ca5081770568"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add this to user preferences \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/consts.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce6f10c01e9c600c55adb75fc8e9bebc103e3127c3460711b80289448a3d5d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to combine these with the list above. We use strings for now since these are the standard variant names used by multiple messages. But having these also type-checked would be best. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/dispatcher.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29c5dab93b0adaf792cf4e562b36913f520dfc4c5417f0f90048b69dfe74bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Reduce the number of heap allocations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/dispatcher.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e711ecbc9647874927ca096daddb521966509f6e2cb9ba53b12a55b3781dc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: On desktop, SVG Preview mode cannot work with the Eyedropper tool until \u003Chttps://github.com/GraphiteEditor/Graphite/issues/3796\u003E is implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/node_graph_executor.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"06de6325c09dc28736f64b5680af657fdac99513cb4c8d047cc5f190dbaa4a68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: So for now, we fall back to the Eyedropper using Normal mode (Vello) rendering, which looks similar enough to SVG Preview. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/node_graph_executor.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbf7810299a6ced85f32b70c43360b0fd3add3707bade45187d587253eb96b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add Send \u002B Sync requirement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/utility_traits.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea69b967896763bfc37a4c6b66caf3b1b8148b1ffbaac669c01870bd7e6b5dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Tell this from the monitor node\u0027s type once the types the borrow tree records can be compared with concrete ones \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/node_graph_executor/runtime.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb54c2c856469c2c5916a9143f021d4171bbc7f5855257c0a745c7d39c7c5827"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this an event \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e163599083d6a24145a12bb2560237b11c907f65b1fc008b293db670fab29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this an event \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dbe4d5b2ee1e25abaeb94c9d04585c8a4481ad43e30c163682c85b123b890b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this an event \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ffcc7d63ccb2b9e6754cdb6a7069136e8b408a6a9f4c09e5adbea0632089f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this an event \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_message_handler.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fdc6d028ddb6c37df006817739d929aec071781ab25d789c418d708401ba87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this to make tool descriptions mandatory once we\u0027ve written them all \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/utility_types.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dfa8a63e642de32f0cb31c9f04ebc422d826ef666933c2a71406c3600fe9e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get these from the input mapper \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a31373eebc1f30e1caa6b19c9ecb8914d3d9d82445aa03f4f683339312774a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for transforming layer not in the document network \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a51fecd79f368ccda61dae834b4e2a75c00b192090a36d55a6550a49e7c8799"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Here vector data from all layers is not considered which can be a problem in pivot calculation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"22198d54288a4dc6f799e2061b6c59210bc6565a67e1ba6520bc34113f735b7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ensure removing this and adding this doesn\u0027t change the position of layers under PTZ ops \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aa3134be77220a3f3c9b045d87bf25ce8daa3f48b312705bcf3148d8bcbe0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is always zero breaking the \u0060.to_angle()\u0060 below? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ffd7207dfb1a0eec3f5cb63728ac9791e52c0b2e79c856832be36e0e2d0352"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t use \u0060Key::Alt\u0060 directly, instead take it as a variable from the input mappings list like in all other places \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d79b0ab38366dd8e15ad99a24a47d31ed01e3e16641319ee735eeb889f287e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t use \u0060Key::Alt\u0060 directly, instead take it as a variable from the input mappings list like in all other places \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"7108ce5c3189df167b050b2858088338fca76cbeb31af6565fdc09b493091296"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only show this if a single layer is selected and it\u0027s of a valid type (e.g. a vector path but not raster or artboard) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0efcaac62f7eef94b0ebd10d6b2c06c7e5d1cdce908f19d6950978b86df117"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only show this if a single layer is selected and it\u0027s of a valid type (e.g. a vector path but not raster or artboard) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/pen_tool.rs"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49765ae1b2d2e621cab3c6dee8b2612815e640ee0abc7b9ff74953f4bf14ad0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This transform is incorrect. I think this is since it is based on the Footprint which has not been updated yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/gradient_tool.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6857abb27b5f8e15b5050885a6a33508ef8172c068838715b2fa656a4167ae74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove \u0060unwrap_or_default\u0060 once checkboxes are capable of displaying a mixed state \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d526419f67c84db30d0405e95ff93bc88c143bcd95dbe18c37a38d54c1b957"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Keavon): Replace with a real icon \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"973874c5d564ab6f55d2caab8024d6f1048b7333371472a7ae9ddd733eee9bad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Keavon): Replace with a real icon \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"372d6ff853ce0d264a284dd50ea98547e83143259e2231c05fce823f635427a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This function is for basic point select mode. We definitely need to make a new one for the segment select mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3f5cb3207b009a3ad3d7e0ee330a3cf554343d333a39e920ece0e4de5d54f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If the segment connected to one of the endpoints is also selected then select that point \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24e2453aa2dee6b68b50058a74e3f95eac3f05bc41c7e4f39a4d5fc6e5a2041"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mTvare6): Remove once gizmos are implemented for path_tool \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5591ce5f115698ec759a99ba132af1b5487f91c7e33a157d8f49b7976ebfffec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find the segment IDs of which the selected points are a part of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e52caa7f2016ef368e5ff108f190661008c26643508da6c291a7cb3db6c43ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this draw underneath all other overlays \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"4307ceca4cd12aa2a1e69254ca332e24b35d4399dfa52331de27367f6e046ee5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for selected segments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f1e203060c167a044805f9403b8d4cdebbb02c9a93d9cf7220af37ca2feb13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Either the point is selected or it is an endpoint of a selected segment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3005}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7da75286ec7c3fe135687ff77f042e5913c7d6be1fd363db059d916b3bc27ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Dynamically show either \u0022Smooth\u0022 or \u0022Sharp\u0022 based on the current state \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":3639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b6c6ea973454c2087a4e5fb6f8c788a319b2fa20af26eb5ae01acef868350e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t use \u0060Key::MouseMiddle\u0060 directly, instead take it as a variable from the input mappings list like in all other places; or find a better way than checking the key state \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdc41b3dde029a01d7348cb8595eea5c8854332c6da6306fb8cfad30591ecfd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t perform bounding box calculations here because the user can disable overlays which breaks bbox-based resizing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"be34e4dc59b03853b1ccb097eb505df5cf269bd4aad6e1f4e2f50d5973b4fb5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result of \u0060shallowest_unique_layers\u0060 to avoid this heavy computation every frame of movement, see https://github.com/GraphiteEditor/Graphite/pull/481"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9048a52085a413e67a79842c27c496d8241d2d2aac8346f050dc48ded75e3db1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the result of \u0060shallowest_unique_layers\u0060 to avoid this heavy computation every frame of movement, see https://github.com/GraphiteEditor/Graphite/pull/481"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/transformation.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d4f5cbe6e9e25975f416170ec35d7f0ca336d021d63562ac63c2f8b3d0283"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make all the following hints only appear if there is at least one selected layer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa14f9ec5aa5968cb31c48e8d357a0e1b1f71572709c6ec91dc3f2923fef2e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Re-select deselected layers during drag when Shift is pressed, and re-deselect if Shift is released before drag ends. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b220fd65b4eb0a3a56265c796a5bffd0c8788a217cae563ff332fbe6d1f94caf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (See https://discord.com/channels/731730685944922173/1216976541947531264/1321360311298818048)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f6b3687174ca19d4371d3eaf9bbfad5f0210178681feac3615512f2e4958cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle multiple layers in the future \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"531428a23ff70853977c87994f9e93db5ea07ef22672d72b6cc1c347a8a7b831"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement bounding box for multiple layers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"770b3cfd044012248c2b0af1c432b0f9348ebf3084ac6c8fd885231064eab4ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t set both max_width and max_height to true at the same time, only do one based on which edge is being dragged (or both if a corner is being dragged) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/text_tool.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"578450ec950a68685d6e70232bd5c8035905ac31d43f9a43a32b7c3d0dde7446"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add \u0022Individual\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/pivot.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e0fc107e29893f79a87ca2d162dc01c34f610be591931638a75205fbd4cb2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add \u0022Origin (Individual)\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/pivot.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"26516813556a59baaddda01e4fd512f03a6e1857ec21013dbd648fcac8e84920"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find something which is more appropriate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dec2ec03505811cdcb9f8ccd5cf5abe3987fa0438b0ee9b950c731dfcc9e1f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Consider keeping a list of selected manipulators to minimize traversals of the layers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdc925f92911f1c5fca58e603c6182a6f42f77f4f9d265997ae066b477cc92c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is this equivalent to \u0060transform_to_document_space\u0060? If changed, the before and after should be tested. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fdb31ad0a3d5d1d46ee261f6e01bc1e71b9e09ed4ccf4a595eb68b73ad01c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Use quadtree or some equivalent spatial acceleration structure to improve this to O(log(n)) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1499e05a483da1d954d3ad2cc1cd9002413239e34cd90c889fb4179aac4eac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check if this method of finding non-colinear is really required \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shape_editor.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"da137cbc4935f5f831fe61a38d599e5db378d5525ebd966467b265666d8f4463"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace returned tuple (where at most 1 element is true at a time) with an enum. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/utility_functions.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1aed7f803e954f321e628aaea983a75112f911788befdc6eba6b9a478446dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We need to determine how to allow the polygon node to make irregular shapes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1967157c58001fcf714dde70723a2b225587bf53f31dc0a41f7cc89e2e6acf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We need to determine how to allow the polygon node to make irregular shapes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/star_shape.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaae02abff5e1514defc89f9e5324e8409ccad7201c0b927a3fcbcea0efa5ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add descriptions to all the shape tools \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/shapes/shape_utility.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7091d1bfdedc856fd0fd4b1d81e880e88a089da879c38c88f59235c3b9212155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Set this back to false once we have ui acceleration working more reliably \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/preferences/preferences_message_handler.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a43c08484dcfcee5fd60bc3e350afad79a7a4ab45725ad52753e0cf58ca019"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Run document upgrades here once this format has a versioned migration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_storage_io.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe0a49ee35e412d387e3f95d2be8e522ead653284fffc0618fb10a75bd95728"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: After the RCs, call this \u0022Graphite (beta) x.y.z\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"91512885db7f502f2f52e87bc5e8ddf3d7a5c6cd7cae626bd299e825bc232d98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this when we do the SVG rendering with a separate library on desktop, thus avoiding a need for the hole punch. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7aa8e0ec03aa7228226746f41db194ee47b0358b0af02bbc4c07022a6d2711"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: See #3796. There is a second instance of this todo comment and code block (be sure to remove both)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec255698c5afe0d2b4162ca4111e852a837fc369553b02095bacaf96ff3bef7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this and find a way to fix the issue where creating a new document when the node graph is open causes the transform in the new document to be incorrect \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32aa02842fe47a2ca27b14d23bb3ab20c0f08205fa657a3b2b2a6f0a4b1b4f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should this be a BTreeMap instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/fonts/utility_types.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cee946c50c8dece48f374bbd523c97ba1ec034fe52dcd5c783d0ea9aa06cb67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow non layer nodes to have click targets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"13df6463cd4a87699b72d3d5ba6be8c12cd6eef15cffd90b3b55b79c96170416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix this so it works when dragging a layer into a group parent which has a Transform node, which used to work before #2689 caused this regression by removing the empty \u0060List\u003CVector\u003E\u0060 item."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01b5cfba11ec75d02dfacba9b8a9ab571ab94b2325762aff3d2040615e74c31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: See #2688 for this issue."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38056c26f620a72339c58c400b54b12f77cc4c0f9c9e2d71e4f7af4df64b0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix https://github.com/GraphiteEditor/Graphite/issues/2688 and reenable this as part of that fix."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4920}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc0b1b2ebcd5f038d04581698a58cc7bdca398a361216350b26daed6146a007"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should be: DVec2(0., -25.), regression (#2688) causes it to be: DVec2(100., 25.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4988}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb965b90dfbc57fc22e129eab900dc416992344f18332d2a2697fbed8de02f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:    Should be: DVec2(0., -25.), regression (#2688) causes it to be: DVec2(200., 75.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4989}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2643d636ef5058a1196211c75a36bfca78ca1e5bf1c37a180b7e4719bd0d9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:                    Should be: 0.,               regression (#2688) causes it to be: 111.80339887498948"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":4990}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd809aace880906e146e653ee664515db75f136d9d12475737959d400b149ae1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: To avoid storing a stateful snapshot of some other system\u0027s state (which is easily to accidentally get out of sync), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/document_metadata.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cca674f7e9a22c9f994d257025d2e371609fc876d1e71c4382456271ed136d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it might be better to have a system that can query the state of the node network on demand. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/document_metadata.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acc5261e9954cbc44a19f2524818807cc9a80cdac92259c9ed4f146c513d7d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rename \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/misc.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"97265df5d3453f1d5c70b3f9c22f09f79ff818b5f99d87aeeda46ecdf6d08d32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extend to the midpoints of curved segments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/misc.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9655bdf28004a9a1f7615a52c43540d1a54f3403f5b05aa94d9eaf2b7c4c0a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Wrap in a TransientCache \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"edce82eab514c315a09052331c72fec297b812a99ab2e82232a3ae927556c6ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once aborting a transaction (which shaking does) keeps the edits still uncommitted from before it began, instead of dropping them from the stored history \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/characterization_tests.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"674453e661c0a1fc70f1d39d9212743af840d318a39420f0f1f807ab5e885479"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize getting click target intersections from click by using a spacial data structure like a quadtree instead of linear search \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/hit_tests.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab84e437be851af090ed158bed328e5797a169b66e51e308cbaa40aec568e40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use root node to restore if previewing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c995739d6807a4473521f2019c4dba59e4f906c0a9618fd16fd91c15d16cde"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for flattening NodeInput::Import exports in flatten_with_fns https://github.com/GraphiteEditor/Graphite/issues/1762"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ca8e5fba0cbc3dada9e0fe32f66a02b114971a4ab2bfed233d92c7ffff34e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get downstream connections from all outputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4abed117e4a4db0145e39b74e8c60dbe0d19474ba4cf5a8ed1dc9e37f148583"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove 2x2 offset and replace with layout system to find space for new node \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2886272ca7d503be54685376759814a0f8a3ca83a9aa3267b6af8f40e195fc60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6b49d80d00a94ba5ffb95f432be1fcc68c590c42688d3232f86d64d20bbdec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a NodeInput::Indeterminate which can be resolved at compile time to be any type that prevents an error. This may require bidirectional typing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d820644f2033ea0b3933dd7d4d20f447bf7be586969d1c9b9a1bef608d8d933"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix type checking for different call arguments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4b8e08e7eb35bc053440a4b80ea0b5a98b0a8be1e333a0bbec57bb89e2365d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove this document upgrade code, restoring the derived \u0060Deserialize\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54587e7f3ad68943ca1c9b192cfb5937b7996976967b687d95e203c2939703b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Used during serialization/deserialization to prevent storing implementation or inputs (and possible other fields) if they are the same as the definition. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c59705410a94f3077935d86da318f9bbb7a38fc79c7fdb447eb3656c7b684aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Implement node versioning so that references to old nodes can be updated to the new node definition. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7251a8ebb37bfdf93bd34dcc47b6aefde3ed679611ffc9b58d8b1774c5eee4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Custom deserialization/serialization to ensure number of input metadata rows matches number of node inputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4f9009e45143448df894cf58b6b2318799a9dbbd86306307e2fb7f12826c5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove once te click targets are extracted from the native render \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f34ceda9e31089cdaa60b3af1911632c4f633bfa2c6802b2d619d0e6926cc8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove once the import/export positions are extracted from the native render \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/types.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7dd537a1995ce50424b61de59909aa843cf13f5130a05af18d652bc30a5fe5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Have this displayed in italics in the UI \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/view.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e138230abfd1a670fd70d848a011c5f9c26239143b09b53f23cbf140eb390748"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually remove this document upgrade code, along with the migrations that call it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/store/accessors.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5713bdd992f48759893a9f09c957b744d9d02548254f4346d575ad70a7898620"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e9a83e78de80a9e162f87cdf393096a0e8fd95083f8e883105778183e4dfcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afc99aea1ed28ff9a8a5d87fe7d46076e074b451e674e1e5a899bf0728427c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0642ab7cfe34853cd880456cde6e429d476d1c01f36d6b25e9617012e3852e7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abae987faa7d024688bd9dde1638c8044aba1001ac8ffaec8e02f673e196c85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3918f5fa366d30f01a6ab1dc4e65ceb1cb9fee5f7afb27effdbf06440e83f7b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a7b9480ec22717909e5f30401cce54b168f39686d33f4487bc12b9fe805c54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1313298de28f3c1d7091e00713baa8f7990addf96df9709c4e837a84b286127"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"550a8c1b0eda8ce90d00b8ec48cdf62327d0b6527bc3b59e3701a79773fcd54d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Remove duplicated definition of this in \u0060utility_types_web.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26fe596afecca3d9438dffb72d29024f4e1b4e242ea42d6afe55ed682281b8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If dynamic node library is required, use a Mutex as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7f2c0d2fecabfb6bd7592cb10a9136449cbbb9c7ad81c9547ad3bf3058a723"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This does not consider the constrains by nodes not directly connected to the import \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"54503105179604fe8b4486a649ad7a29fa689b98c490707b6df383c99b4e885a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace the .enumerate() with changing the iterator to take a tuple of (index, input) so the user is forced to provide the correct index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"7100ada6428a4b6f6231c66b00191e35a470b6bab21da5f994b573d867db1b01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove network and move to NodeNetworkInterface \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a54ddef0d172227bf3785063416bd92b82ffbc0572b83053471640f03b69ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: automatically remove broadcast messages. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9366072d1f69b78614ac3bda489c83ba3f4879aa8a193e75b00be42915c921"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Create function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a11ddb67075af228cd6feb72deeefa8dd99442a1573cf2fc767a4d88661f6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Filter both directions to the nodes that fit, decided in the backend with the conversion-aware type checks from https://github.com/GraphiteEditor/Graphite/pull/4688"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d49cc3ccd0cd4311425e66f4b9a63b6f231d5cc634a47283cd75947f654d1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"402566bbddd1badab1b2cf816e9b6ac3d31cb835c676e3abefbc74d8d4e24aae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Display Inspector sections for encapsulating node when no nodes are selected in a nested network \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f86004ec85078335689e7c5709f879588f2cf7c3b667eaa6570eeb400b3a194"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this when we have proper entry row formatting that includes room for Assists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a23b5645c86fa9218469fe5186353cdebed2ad6dd889529a7a4667b5677157"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Auto-generate this enum dropdown menu widget \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"66175ea0d7291c1a35ed21f6e7b5411911720743c4e627e911f0428ce962dc24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Record each resource\u0027s data type so a picker lists only the files its input accepts. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e418ca6be99bd8e300680b4668398972deae0a677fc524fb2d713db185f77d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Store information for input overrides in the node macro \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions/document_node_derive.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be7caec8a32036c48eeb1631b27681e303b952aedbef02f5f50f43173ad0615"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache this in node graph coordinates and apply the transform to the rectangle to get viewport coordinates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"70362eeedff1918d2138e0663bf6e9c7cf6bd2e29ae2d6c317b7a8dd2660681d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache this in node graph coordinates and apply the transform to the rectangle to get viewport coordinates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c3d3501378268b8bd3d7ba3b8363ed33f96ecef83048c06e0e8e3a2838ca58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache this in node graph coordinates and apply the transform to the rectangle to get viewport coordinates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ad2a5956d4eb28e420a9ed7c48ed9d8025d6d2e7ea69b75a81a78bb3eb3404"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace with DAffine2::from_scale_angle_translation and fix the errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b336b24578f0f0dced606c9bbdbfea58046495688365e07c789d7c26363b250"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be extracted from the graph at the location of the transform node. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/graph_operation/transform_utils.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74e80fa6ec76ecfa6e1c76eaabc0f9e9b3331adb138601e97766b06c5945ad7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow the \u0027Path\u0027 node to operate on \u0060List\u0060 data by utilizing the reference (index or ID?) for each item. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/graph_operation/utility_types.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ff1bc82143d6b56c370dc3533ee68a1f15d99689c1b8d538d9cda171674756"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We simply try all these types sequentially. Find a better strategy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee32b4ded2db1e2efb1691c23a1362c24dc1e53a7262ec8167c370a8d95411d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Diff insersion and deletion of items \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf246e6ab8c976604776acd4dba56346ef54200a5cac1301582c752fccd7062"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Diff insersion and deletion of items \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fab0479da5af7be9b760eb07df98bb983fb7aaab39e0836e7f36ca279ab999"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Diff insersion and deletion of items \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/layout_widget.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"50380544745007f7eea8222ca636a2089340d4473603954e4f9e38e266d61e64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Convert to an \u0060IconSize\u0060 enum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/widgets/button_widgets.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6c669055f0b37c3461198d9a841b1346fec35dc8f4cbb7d39f003916da1f26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // #[serde(rename = \u0022allowTransparency\u0022)] pub allow_transparency: bool, // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/widgets/button_widgets.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b8c941c184e3db27880833005e624bff634837a3dc81489eaffe0263e8c7f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this (and range_max) apply to both Range and Increment modes when dragging with the mouse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/utility_types/widgets/input_widgets.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53a89f3cfb58833a04471349e537b2f1a5f4be6b91ae73d0622c92743065860"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use a safe solution eventually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/input_mapper_message_handler.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e305dd786c99d2ac545cedb05a09ad36548246605f7a82bf4d785c0c140c3300"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to prevent Left Click \u002B Accel \u002B Z combo (this effectively blocks you from making a double undo with AbortTransaction) \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/input_mappings.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"33025749b56a7692fb86e1fe34cd8771fb37c4a8103e67b27dd17d92c9a4b9ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change to KeyDownNoRepeat when https://github.com/GraphiteEditor/Graphite/issues/2266 is resolved, along with the Path and Pen handle swaps."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/input_mappings.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6087999a745ab05b14ab357424addfe36fbc6e6af0c94e3eb79bbb6833e41aa2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Increase size of type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/utility_types/keyboard.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d651756ca21cf40a780a6f4ecd7911d4c6bb683cec84281da05da83b80aaec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Relevant key labels should be localized when we get around to implementing localization/internationalization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/utility_types/keyboard.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6cd0cc9982edc7fc925c030aa59dda4e4aaf02a12dce1254b2de0e5583eb22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Document the difference between this and EditorPointerState \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/utility_types/pointer.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1073007d631686be6ea45ce6f6a69cbe2b2434a096e17e688710ac0bff75eacf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Document the difference between this and PointerState \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/utility_types/pointer.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"007cc7f8e7948cefefceb834bdd1ebf48ed0f1f2404fade9955d39b595d79b2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Some graphic tablets send key codes not mentioned in the spec. In the future we would like to support these as well. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/utility_types/pointer.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82d81ac681fd88d8a50e7780976e05f217d21abdaf12c82e5e95c2f2dab68c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Color (without \u0060none\u0060) -\u003E Color (with \u0060none\u0060) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/frontend/frontend_message.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88c4ec9314c67971c4b5982ea703efbbb7c69905d46ac34d14e6007a41455df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Align this with what\u0027s generated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/frontend/frontend_message.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26c945f9b017453500f0d827e760b508ea1294bbbb52fb527e163981ca51b73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this an enum with the actual icon names, somehow derived from or tied to the frontend icon set. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/frontend/mod.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0565e826bf5ebe06a054acb23969dd1bebc045d01c76afdbf2bd1bbb1265da5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Then remove \u0060#[widget_builder(string)]\u0060 from all icon fields. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/frontend/mod.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"514e7e245b461255fe3017854e5d073d7b7fe66736c68f2e9a44d7ba90f9a006"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider if this is actually the correct place to put this logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eea0f319977223a3738af2edd57e276460752c41b161c875959d47e2ff38d8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider making paste in general go through the current tool, so that the tool can decide what to do \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/clipboard/clipboard_message_handler.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f32506c45b3d7c7a7a7a42c05d11752e254114b507667a9723d72431c3e396"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support Extract in the Registry format. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/from_runtime.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcb9402d2ed794e766c57da4fac001ed25049db11d93b9130a27b4c672408fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove and make runtime strongly typed again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/attributes/attr.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"955668bc0ea5d6448bd6c15a785d72f1444df124dc5ae89a234a30fcc7fce6e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/attributes/attr.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fed6d16d9e2f911aa4c4233944f6dd97ceaa0f4d57414f2f4fdac17629ce2cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove these graph ui nav-specific attributes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/graph-storage/src/attributes/attr.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a56b9d293ca81122e3ee05d206909406f921c1d70eca0cc42cdc9ac2a54c0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: decide if we should remove empty parent directories \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"document/container/src/backends/folder.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb24fd96e626e47d199970e9f47b1da3fb289d5fc7c7aafc4e51948795d11c34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove if it turns out to be unnecessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/wrapper/src/intercept_editor_message.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"518d15c2c845175f2d6c3d2ded2d7d2154defee3a43ab18a12b2fe66a2d76659"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once https://github.com/chromiumembedded/cef/issues/3822 is fixed"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/context.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0314a8380041540191ffe91ca5223142ad31d18c76a57aa8970f7b5a316f5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider inlining this file into internal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/ipc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde4c67318991907b1ec12abb80202e30e2a2fb0017d2f876c5da09d4461a697"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deny all external requests once we stop relying on google fonts for font preview \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/resource_request_handler.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0741018a03f7eb6fd7fdfbbab60b5d73e2b92b79076ca7c8dc03fe05357c34e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this configurable via cli flags instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/gpu_context.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"643bc6562b41b793a023fcd6eec97f6bacb27baf229b5de575c9f6286e40f803"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a cli flag to list adapters and exit instead of always printing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/gpu_context.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"612ab6ccc36b61149fc21adbb0e92961700d9593bcd8939916f84ed2e3424cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a cli flag to list adapters and exit instead of always printing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/gpu_context.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"82305a0b16abcf8a044eacf874a921de358c7949eed0bb31ed157f27c9d35762"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Timon): Remove and find a less hacky solution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/input.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3eb0c67da455b751dcbfd7e9f83e1178473e721ebd5915abc59001f52e6313"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is a temporary solution to handle pinch gestures, we should handle pinch gestures editor-side instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/input.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99d10c85e4f4f7545772713abb38b9800b39b35dbc27a4f9062ebcc1eb6e44b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this migration code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31f6d714f789624129bff4de7e2450f771cde8fb8a495ec686c05ad8bfa52eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Needs to be integrated/replaced with the action system. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d786b25bbeb3369c4b0890e495c8958b40baa5ce261766e77597769b282a6a3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: At that point this should just wrap the action, meaning all actions bindable by the user can also be accessed via the socket. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"64177f15879cc6b585094cd6db76a9a98a40eedd14883a9d0932117b5271adc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a cleaner solution that doesn\u0027t depend on a timeout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/window/win/native_handle.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bea7d8c73bc98486b50601e47ba03548de38a44cc71cefe866c4315cb94938"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove as much app submenu special handling as possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/window/mac/menu.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8412da3e996649ce5175578aa47df945521ab894896ebac78bfb23b87da58b29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/platform/win/build.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8a8ec35bf447d78b40f41314c9f13a1e439342013b45ab0000f72b8ecdf6f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Pull this year from the Git commit date \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/platform/win/build.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa8a6180591ec3709a8e2850cf5664e7139d4be3b4f0d6d6b6631df410a4e4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this when bundling for linux is implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/bundle/src/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b66b7dd908a6ee0747fbe29e99b90d801cbff815d8bbd99b787077c2bd91bdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement bundling for linux \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/bundle/src/linux.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7317ebf72e685b12406a3a3ff3c92f08e5afeff20a6a5b81b65aee5a5970bd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider adding more useful cli \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/bundle/src/linux.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a3f2b3823491836edab1386f22f2cc052b5f708d704112f40ff99847a7b11c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider adding more useful cli \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/bundle/src/mac.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"908358ab7df4f6db4ef20d919e5efc117be874596b7a7edde0cea9e2f0d2a77d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider adding more useful cli \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/bundle/src/win.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"415a6f900e0a0f7f266425c6e8097f8b474946af340bce5baf08182ad1d26cc4"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: the repository holds project manifests and neither \u0060README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a5992d4bd6ac1ea4b853ae69753fcd7e0410099c58731c86be53325ba8c96"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test build button\u0022 repeats the code it sits on: 3 of its 3 words (test, build, button) are already in \u0060elements.testBuildButton?.addEventListener(\u0022click\u0022, () =\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":"website/static/js/page/contributor-guide/bisect-tool.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f739fb6f7976fa30622909ef03f5c03a02b5f38f39ded423fdf013f9fadc2"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 75 project(s) overshoot their size bounds, lowering Project Cohesion to 9.5/10. The most over is \u0060editor\u0060 (105742 LoC, 718 module-visible types across 61 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c119500d856bea834744996cf2f8aa1ee48609ac8e87366de972c31e466187a5"},"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":"8f177b03a37c3ab9978e4a819ef0a3bfd633f205db9f8d5e791297e027c6df34"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38da8ee4698ed826b06df9b4f6bdffa1f65ae9505573ef7111e4d1c4aaa8ee2c"},"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":"8821b55d65806050012153584ac135ac74c78b2ec105c3873e691b49557edac7"},"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":"ff979c6762b652aa0ce8f47a5749bf2c99d506373239672ecbd4b2b4fc3398b3"},"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":"b0dd5abd78d7dfabbc5a288a20d1bac1ae051d1ce453be16228dce5e439bdf6f"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0213d1f00f628db0164334bb9b7afda01c6668f3376290043b33517e92fa85e"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"126f8fc981eda01db6a44b9d5686e7e47c67a84f93f87a21875d90d35e54b107"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9928edfe30a1168cce63675a820be5586f47fcc065adb9078ead1d34abfbd581"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","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":"ccb63e85c37d2600436a57330ca0d9d5a6cc3f9299516f42c2ee513214df205a"},"taxa":[{"id":"CWE-1104","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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5ab12115cb5ea53b2e3c91fe190a933185ad32564415f3ff4410852790525c8"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8fd1d42926b8d8c17d8c9d0ce3183a448457cd2f869778f3ec8c78be9e94ae3"},"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":"6a59fe262dc55f95bda28ed4e355004babfe8000081069bf78d621173968b9f8"},"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":"425137cbb4e78b33d6c52def04fee9307c04c544029480b66abf9b9e28175c9b"},"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":"b46137e033769a8653ff5313a776db0ed16e6838fc1a995e47486257d7025765"},"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":"eebc52af055be2eadfac3ab5fd8f77b595adc0addbb3e1c3b428a3e0a095b4df"},"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":"a050b2d0ec2866aad1722d20733e389584aad67d9055fe92451c1b4e4da00b34"},"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":"fee48008536778b12020debc3dd50dd502f41b81992dce5a91e69fef8a662bdf"},"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":"78cf199f10a3613d7f57650efc6edf271e3f79eaa857047f4b00a5e76a1a2678"},"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":"1b439e7f42ed8144b23cf292277d2aa52bfee88388a503d040a00213d67dde13"},"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":"2bcdb13468368fc5142745140c7fbaa6de61fbe94ff68368525bdc77404edffc"},"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":"3e7386e370701ebed9d03f612cc442fc064c7b614a1605c210ea54ecd4eef302"},"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":"81b471ee42f27668003929984c75e779375755d45f988f43cb9ef7dd0ad3f304"},"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":"fb214836c3e61d0100efa0dcad3f7558a1ece03bb27e562d80a8503a90e0e0ae"},"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":"1281369290b8e2eb94fb6088e0efd63773b89c3bd2d84548db27cd3486e15c34"},"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":"8aae58bfd7e3c473001da71f4e07b8daf519e7b3b103d727e5bf9fef6440cc7e"},"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":"a24739e8dc875289a01dc2f9d809bb23329a6cf00c7c1c3b5b1d6084b8393da8"},"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":"dfca43bad340cff7b8d0fc555c56975a6a99310a70b4033d2ae7c52e804d9684"},"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":"bf50a6c40420b29dad88df1bf09ed32f73ddc47e9fa7ced6b3be44f804c4df9f"},"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":"a28e01f07a5d1d4f1e1c9da337b5c40ed65d14c418ce3a3c0eb4af595bc2d009"},"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":"e81d5c658b786d575e96bfbfa022838fecb4245cf69f8d39e48645478cb1a62b"},"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":"07313bd927066025a6ea1388b576c4767afae59b8aba1c2861074058f673cd72"},"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":"773d7603f02011cb9ddbb01ed76d2ea0737b68c3d6b7976473bf6e93db55a163"},"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":"c1a9d1691c22fdcc9934f5a9ea7f9b8435e7cbd4b00376dcd60f0505e77d3ff8"},"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":"88c2abd1210958d9326e78455682118961086566641051005e329dc101850679"},"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":"314fd062e7b28e119899151b7276b00c9ec0d30b0d1e3a147dc8dbe4db1bacb4"},"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":"684be9e77f9d6ea7048d3f5a51de20591536490427163a48b34b14d05eb9eda3"},"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":"dc0a198ed09c922c52ac0ebbf2b8de878ad55c71dfc411144f1647ef360736ba"},"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":"b7228b7e223ae452a0d9b4a3dc06dca914ad9672ad1657250a38027dcfc59b7a"},"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":"6b9020f4d9a97218d99f85d3dc71946b0dd67e714afe29063b60570d6e5513b8"},"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":"b76234afa5a2970aa7a850b19631eec490ec63ea0b53b86cca75b29e76054386"},"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":"b4a40f16d642d68fed2c4b483303fbc27f90cfe8c9437e96df58c7f684c91d5f"},"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":"f3b183e042f3eab9db79a03a201dbf3c4532271bef983b553f626bf3508035c5"},"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":"36ef4a7ac57db5d330d543a8a3e0bd16e623c6d998daff216263f73608e17ae4"},"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":"58a2935046da9a605a1d59dfa8286de4b2bcabb2ab5490aaf9b02d4c27509aa4"},"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":"acd69cb6af6b001595f50730a76faf5ac6d6c283e805c9359cb36fc32acd2adc"},"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":"5f929be7e86150912d32348be8afd32f59302d4b4c097fc5344d70db7c6d6edc"},"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":"e6b76e13becfc1ad155f141f1077d71a5ac17234dc23432e8ef2f8bfaf734248"},"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":"41f8c405c044cda2d337e66ee036c02ac9febafe22fd3341b6546c2f02803142"},"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":"4489e08e71e8defe1ce75c1d1849a8eceb61c2b63cc888aaeb64d7394c088cc3"},"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":"c79dc5e6af992fbd2dd4fe4949875edc68e7f5aecbe3a4ec55dcbdac8785674b"},"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":"2a49fa1e3e5b15da18703fc5bfcf9d42d84940676c2a6b035c62e6696719c3d3"},"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":"06fca790ac5adc7ff873a5fa57f93eadcaa9455c2eeff9b1e13bdc8920edebb9"},"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":"17f86c274ac96602540044c1b4467f6192564cfc82110ac2a78c725a6b662701"},"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":"c1e82304c37aa156d9b60bf49943e58e5522705088af2393d9c380c92b66edf9"},"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":"838ff4bca5bd87a8535d1d4a7e90bc51a3cdfe53074d531494e182885ba266d8"},"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":"ae0be11de7fe5bffd7bfde6482dfe628dff4e5177073a6fd40af1239ba155688"},"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":"70fdce4259a7bf512603d24265a57b82a06809fb9a66c4935ffbc45109a0dedf"},"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":"b55dbb1caa38e0ad880a52c1495f08a09d9ae8478a0357f4b4209defc22f3a21"},"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":"49efec20b2c1644aae57ced09c599f25cb1c0ff8972e46491998e641ba58a6c0"},"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":"07f0be46ecca03de11dce0502ba5395ba43e097cdb27d3d7b79a04410de97e54"},"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":"c3a0b9272715be62308d3967c3af4d8ff05867aeed27f83d947338275bc9d794"},"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":"aa33869c78ad46ed326e280574e6bdfafd3747b2bf049f4d8e3e0207454fcfce"},"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":"6515463b67f73842b30eb0d0e03b3cfaae8111e0d4df46007a36fe269f3fc09a"},"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":"a1fb3559d446126ed4c2265986301349ed8c79483af1328cc5f356c807ad440d"},"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":"228c0002bddb77927f361ce781c1977bc4d0561e40f6adb8181bc0efefc76d5a"},"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":"4823e0e9729578e2b58261514efa1f3bba16726c7905f8919726629cde92668d"},"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":"4f9d6aff9782449b4d2289926d44d256b22c78aeafcbd4de0adc750d2e70e3dd"},"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":"2bd0b4634e8e11db7d4e73d1394b4405993833bf9de97094cc6678b2c029e7ea"},"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":"b4c1198c60d4f576f070ba5e4cf6506d3f7ef16caa71c049f15cd8e4de1f89f2"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bad5f3258b8787bcc09b5693878c8fa4ee44a949f2d681737752a6cd5b6b0fa"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0185","RUSTSEC-2026-0338","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcf63fb5706df3aec27c609153ec7c79ebc381134a55b1f0d589a8d798224c92"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.4","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"],"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":"0d9e47f365df7366dff6127218fdf7f4ae013214353b373e241993e169521a09"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3a01687649f53441b648737c4dc4796e76f2edb50dea4a72e73448c572b0544"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac2f8302c0deb8a57e968f919c709be81c57a9a416a9bfc2b03f3c99ce4f1b98"},"properties":{"dependency":{"package":"devalue","version":"5.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"ff9d59b44f030e8c823808c1e7a4d8cb393b328b925c510de121f5a0f4c6e745"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.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]"],"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":"1f104f3e9e695328ee09cf23f68526bd0595986977fd693050e48b24a52908d8"},"properties":{"dependency":{"package":"immutable","version":"5.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4141e5ce78822b6a8d23d83024882238856223fd5b7df4e6e6c3c332d35f930a"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"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":"b40c596fbbdcad6e16b692d69867f780a5a0a6d53280b0a92d1f8143144b6a94"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3770e7db98a6452222cb5726bcfb87f2ace41d8cf8e9c97ec1649e64e2e09034"},"properties":{"dependency":{"package":"postcss","version":"8.5.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e5a889b07d1485cb85eed469b27701b4b6f5450e4b29eadf09d261b76dde6cd"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71260114738aeeb0e0a2319ddb4fcfca646da2c24e6e1fc5a3b085131407ae9f"},"properties":{"dependency":{"package":"vite","version":"8.0.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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"frontend/vite.config.ts","line":6}}}},{"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","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":"23b9e53f93a41b458aac7e090aab5a7a34188f4e6930572bd0b7167290edb5c5"},"properties":{"dependency":{"package":"anyhow","version":"1.0.99","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1377d25c7ab38827564141dcada297efcb40eda2d4793b902f3e9e90f07fa24d"},"properties":{"dependency":{"package":"bytes","version":"1.10.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1102bd8fcf3700cb65cf9567bbea9421e4a1f20b8317b9a7001ea9fa4bf8ffc"},"properties":{"dependency":{"package":"core2","version":"0.4.0","advisory":"RUSTSEC-2026-0105","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":"ee94917a3dc8c695c459b6a60364cc294d37eb7b0fc032c5b29a671db797ffad"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6dbaad6f0e64d89683ed31f4e7a41cd3e510e8cd278ff03fb6f4a7d2b1b3a908"},"properties":{"dependency":{"package":"h2","version":"0.4.12","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b83194eee4577ef403d74482ae46c4e58454020db92bb051850aca6e90f08e92"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bf08420ae9a4d5d206e7ff79f59ec6266d4505a57ad73f87b2ef2f828d1fd39"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"717f139679381a5d30972cd58ac27bc93c726cd5087b57fc624e20992a6e0168"},"properties":{"dependency":{"package":"rand","version":"0.9.2","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fee7e63819a9f1b89023359c47fcffd6fe998200b2abe42e2a8614cb8fd379c6"},"properties":{"dependency":{"package":"rustls","version":"0.23.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"848a32bdb20106c6a36dd4831792bd215103a43dc9c2833caf97714f9f17b6cd"},"properties":{"dependency":{"package":"tokio","version":"1.47.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46d3e19db49a17abc9414d6da264b0ba46b9de321ed4f7d2c35dcdd1b724a48c"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.6","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"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":"3d18748111de24cd35a732e01bdc0bcde9ce08835c43b434acab00e5d3d41016"},"properties":{"dependency":{"package":"@humanfs/node","version":"0.16.7","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de379910d5cd598197f28fca30bd725b3f17808800d6fc3348fa5c5b2849bb1e"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3608aa379d62f9c3a37ee18312e16910e06dadeb159b5cc5ebb6c76d4da1237"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"070c75cb5d46e8269c370368a84d7c56dba39e3f685705c34479a339338b457f"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"934a1db488acba47183c679766bcdce55236fc5e08e78782b6564b226661190c"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"7.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"frontend/eslint-require-data-selectors.js","line":5}}}},{"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":"ff12f8ffa6ffaca31dde9b0048805de8240b7c9796188ae58aac0bcd041e2950"},"properties":{"dependency":{"package":"svelte","version":"5.55.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"frontend/src/App.svelte","line":2}}}},{"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":"5a827d76a000299ddf3bb4110461b92249b55f5a219138f5c28706dc10f4052f"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa275dcc581e31816223ff250817b0083925776ca9db8bc9a83879cc85b97f8d"},"properties":{"dependency":{"package":"derivative","version":"2.2.0","advisory":"RUSTSEC-2024-0388","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89a2be437494c39c91e09951487dc535f52ca0ac17e5d859404e1adbed447ed8"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D32","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7905ff322362f53671944becbfa76e0cf871b29fa214d97972effac5dd785b8e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 17 of 556 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 556 of the 870 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: libraries/rawkit/src/tiff/types.rs, node-graph/libraries/core-types/src/color/discrete_srgb.rs, libraries/rawkit/src/lib.rs, libraries/rawkit/src/tiff/tags.rs, proc-macros/src/helper_structs.rs, libraries/rawkit/src/decoder/arw2.rs, proc-macros/src/hierarchical_tree.rs, libraries/rawkit/src/tiff/mod.rs (and 9 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/tiff/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13af3e390b90ed3b153c4b0ac6b54d7ab1b50380e3c60b91313139a020f7cda"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/color/discrete_srgb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"040d054272baa3bc40ea7f134a772c6508cf45092c4fd9878844e9ad995a0248"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce38ee8d7ff5c70cfdef2b3d545e57089c033218864e6e27bb06fdc4516baad2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/tiff/tags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a964d0e764b149fc57433fe155b6223ed69f80d53b258c02fe2d2123b4331b0f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proc-macros/src/helper_structs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7c1c593f4face395f1b3a9704510e366d00b9be8b106db6f6c49fccf06518a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proc-macros/src/hierarchical_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b22d03f45ea6fc4a7d822649dbc646da6c4c13a7d6a100644fb417edb117675"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/decoder/arw2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07a36f8d240754e131d00b71c610d896242c25e6679fb0e6e584537be5366f2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/tiff/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc306b3c33e57198422af3ba91e990893dd69c67e88ea4ed2bd1c3f9a017eed1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/tiff/file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e78e429eb89e8d8dc896dfd0a7ea5d0d24fc5c6c86b5ead7b0ec8fef907bccc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proc-macros/src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05a1b1a677c2c6d9e3d33d057243d8b3c9449530e89b8ae872e3242ae266868"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/math/bbox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b892e83462016447a03ee32d074b66b69331742e2dbb872847360acc869e082"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/decoder/arw1.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a8170571d657b41461480686c5a61c41d3515a81a19889d5643914fbf01b97"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/common_functionality/auto_panning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8409fdc32b5561139d9b6aac374f1d8238c843499c1db6ec528e4b74ac08149"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/rawkit-proc-macros/src/build_camera_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c430a2379fe9bc64bda2b55610898a4f8e0f9e7bfd5c8d068ebc998c4d11300"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/metadata/camera_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0cc624cb2bf6974e4286139b2437c0882c0d0fdc3afd43e0636e52676d7652"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/tiff/values.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca390fb6a5582d503ce81a287b096b1d75ef4c4c20a8a19b76ed7628b3d6c9d9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libraries/rawkit/src/postprocessing/gamma_correction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f420cfe8058f20184f32fbac44e9aec1de02954c580c869030d36602a10613b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: app.rs \u2194 app_window_message_handler.rs: \u0060desktop/src/app.rs\u0060 (context desktop) and \u0060editor/src/messages/app_window/app_window_message_handler.rs\u0060 (context editor) sit in DIFFERENT parts of the tree yet change together 90% of the time (9 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) \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 9 shared commits counted here, the most recent 3 are \u006063725ea6\u0060 Desktop: Make input routing aware of floating menus (#4498); \u0060d97fe835\u0060 Desktop: Focus app window when loading a document (#4124); \u006095d35562\u0060 Replace globals with editor environment (#3656) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c9ece0a60f77732a3a4f3cab407155936c217be45051e9ae4ddab4e6e9447a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: intercept_frontend_message.rs \u2194 app_window_message_handler.rs: \u0060desktop/wrapper/src/intercept_frontend_message.rs\u0060 (context desktop) and \u0060editor/src/messages/app_window/app_window_message_handler.rs\u0060 (context editor) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 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) \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 \u006063725ea6\u0060 Desktop: Make input routing aware of floating menus (#4498); \u0060d97fe835\u0060 Desktop: Focus app window when loading a document (#4124); \u006007fbcd48\u0060 Desktop: Add fullscreen window mode (#3625) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/wrapper/src/intercept_frontend_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aba17d590a5a766cef5532b1e245fcd4d4c6dbfc5a0401736261b35095889d3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: handle_desktop_wrapper_message.rs \u2194 editor_wrapper.rs: \u0060desktop/wrapper/src/handle_desktop_wrapper_message.rs\u0060 (context desktop) and \u0060frontend/wrapper/src/editor_wrapper.rs\u0060 (context wrapper) sit in DIFFERENT parts of the tree yet change together 75% of the time (9 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 9 shared commits counted here, the most recent 3 are \u006078679a5b\u0060 Implement editor level future message handler (#4182); \u0060b100892b\u0060 Add support for persistent storage of panel layouts, sizes, and activ\u2026; \u00602be7790d\u0060 Improve UX of importing vs. opening files (#3661) (at that commit the file was still \u0060frontend/wasm/src/editor_api.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/wrapper/src/handle_desktop_wrapper_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b3ddb73fbf219f56d1e397d5ab71ad5dfc0110ac01c63ca51d01aae91b249d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: data_panel_message_handler.rs \u2194 lib.rs: \u0060editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs\u0060 (context editor) and \u0060node-graph/libraries/graphic-types/src/lib.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 71% of the time (10 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) \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 10 shared commits counted here, the most recent 3 are \u0060daa8b6a5\u0060 Delete the vestigial region domain, reverting to naive logic for mesh\u2026; \u00604b01abe3\u0060 Add a \u0022Cyclic\u0022 gradient option that closes the ramp into a seamless l\u2026; \u0060fd01d660\u0060 Add a gradient interpolation space attribute with sRGB Gamma (existin\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fcfb42f92a48ee0c834bfcff12ed563f4d6348d5bbf259c1dd7f86da8703c8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: app_window_message_handler.rs \u2194 editor_wrapper.rs: \u0060editor/src/messages/app_window/app_window_message_handler.rs\u0060 (context editor) and \u0060frontend/wrapper/src/editor_wrapper.rs\u0060 (context wrapper) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 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) \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 \u006095d35562\u0060 Replace globals with editor environment (#3656) (at that commit the file was still \u0060frontend/wasm/src/editor_api.rs\u0060); \u006007fbcd48\u0060 Desktop: Add fullscreen window mode (#3625) (at that commit the file was still \u0060frontend/wasm/src/editor_api.rs\u0060); \u006073682b48\u0060 Desktop: Implement pointer lock for NumberInput (#3638) (at that commit the file was still \u0060frontend/wasm/src/editor_api.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/app_window/app_window_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a13d55ce808d7d5ded34be9966644f55401c2d9eb21a3ac53d51de0531ce269"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: document_node_definitions.rs \u2194 text.rs: \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs\u0060 (context editor) and \u0060node-graph/nodes/gstd/src/text.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u0060c91d0cd5\u0060 Update all node parameters with appropriate attributes of #[unit(...)\u2026; \u0060f05a644b\u0060 Revamp the syntax to #[hard(a..b)] and #[soft(a..b)] bounds on node d\u2026; \u00603b55064f\u0060 Add tooltip documentation to the Text node and tidy up node catalog c\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1497dd224a44fdcde7608f26a6b4a3110cf425eea8efab91fb6c7aa0a4633ee"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: document_node_definitions.rs \u2194 repeat_nodes.rs: \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs\u0060 (context editor) and \u0060node-graph/nodes/repeat/src/repeat_nodes.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 6 shared commits counted here, the most recent 3 are \u00608ef7432e\u0060 Rework \u0027Split Vec2\u0027 and \u0027Split Channels\u0027 as multi-output nodes and me\u2026; \u0060c91d0cd5\u0060 Update all node parameters with appropriate attributes of #[unit(...)\u2026; \u00600eab6aa9\u0060 Rename the nodes \u0027Length\u0027 -\u003E \u0027Magnitude\u0027, \u0027Flatten Path\u0027 -\u003E \u0027Combine \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff0e2c76ddc3e000283f01736f55a06608426cd5db66b1e238f14cba7fd3417"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: data_panel_message_handler.rs \u2194 vector_modification_nodes.rs: \u0060editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs\u0060 (context editor) and \u0060node-graph/nodes/vector/src/vector_modification_nodes.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 6 shared commits counted here, the most recent 3 are \u0060f28eab08\u0060 Inspect nodes without recompiling the graph (#4803); \u0060180b78ce\u0060 Improve performance of vector data operations  (#4781); \u00600847d7b0\u0060 Centralize attribute strings in consts and rename \u0022editor:layer\u0022 to \u0022\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78ea71ab13722669bbcd770f0a0cb09e156e2c5fd41c7bf9b3499c670de77a1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: node_graph_executor.rs \u2194 lib.rs: \u0060editor/src/node_graph_executor.rs\u0060 (context editor) and \u0060node-graph/interpreted-executor/src/lib.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 55% of the time (12 of the 22 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 12 shared commits counted here, the most recent 3 are \u00606c158c68\u0060 Warn user when the tile cache invariant is violated (#4815); \u0060180b78ce\u0060 Improve performance of vector data operations  (#4781); \u0060d9cbf975\u0060 Deprecate automatic composition (#3088) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/node_graph_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7f330c4402b600fd0bf112130dc7c7db6d511edfff6cfdf11ff3f35637bb26"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: document_node_definitions.rs \u2194 lib.rs: \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs\u0060 (context editor) and \u0060node-graph/interpreted-executor/src/lib.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 55% of the time (12 of the 22 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 12 shared commits counted here, the most recent 3 are \u006021e5e06b\u0060 Clean up document message wrappers around proto nodes so they\u0027re now \u2026; \u0060d9cbf975\u0060 Deprecate automatic composition (#3088); \u006069ed80b7\u0060 Add \u0060::IDENTITY\u0060 to node macro to return a \u0060ProtoNodeIdentifier\u0060 that\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0144e678b1b35cdedaa1a6e67142dbc15e5ac6d537a94b7640a34e03bfaeb2"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: runtime.rs \u2194 artboard.rs: \u0060editor/src/node_graph_executor/runtime.rs\u0060 (context editor) and \u0060node-graph/libraries/graphic-types/src/artboard.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 53% of the time (8 of the 15 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 \u00607e6e4276\u0060 Render thumbnails with Vello (#4805); \u006069585b25\u0060 Rename the Graphic enum wrapper variants with a \u0022List\u0022 suffix (#4434); \u0060a0d5f418\u0060 Replace Table\u003CTable\u003CGraphic\u003E\u003E with Table\u003CArtboard\u003E where Artboard is \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/node_graph_executor/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"684c7c8e185d4bfed0a4f1649f6542857020f87ff387a88a9aa5c672344632a8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: portfolio_message.rs \u2194 editor_wrapper.rs: \u0060editor/src/messages/portfolio/portfolio_message.rs\u0060 (context editor) and \u0060frontend/wrapper/src/editor_wrapper.rs\u0060 (context wrapper) sit in DIFFERENT parts of the tree yet change together 53% of the time (29 of the 55 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 29 shared commits counted here, the most recent 3 are \u00608a38af5b\u0060 Rework clipboard handling to carry embedded resources across document\u2026; \u006083d03ad6\u0060 Fix panel docking bugs and polish its behavior (#4087); \u0060d44b0cd3\u0060 Make documents fall back to \u0022Untitled Document\u0022 (\u002B number suffix) if \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6376131e127152bdd917e092dc81e23fe4d1cda2650741531831d9614cd6aa6d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: document_node_definitions.rs \u2194 lib.rs: \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs\u0060 (context editor) and \u0060node-graph/libraries/raster-types/src/lib.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 51% of the time (25 of the 49 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 25 shared commits counted here, the most recent 3 are \u0060a182a734\u0060 Extract \u0060gbrush\u0060 (#2784) (at that commit the file was still \u0060node-graph/gcore/src/raster.rs\u0060); \u0060a8e209e4\u0060 Remove the old node macro and fix/clean up several raster nodes (#2650) (at that commit the file was still \u0060node-graph/gcore/src/raster.rs\u0060); \u0060a696aae0\u0060 Instance tables refactor part 5: unwrap GraphicGroup as multi-row Ins\u2026 (at that commit the file was still \u0060node-graph/gcore/src/raster.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacb1e51783128f89a124c1ea2a261de455752250f91ed2acf2dd6d5d0d9ca89"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: node_graph_message.rs \u2194 editor_wrapper.rs: \u0060editor/src/messages/portfolio/document/node_graph/node_graph_message.rs\u0060 (context editor) and \u0060frontend/wrapper/src/editor_wrapper.rs\u0060 (context wrapper) sit in DIFFERENT parts of the tree yet change together 51% of the time (27 of the 53 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 27 shared commits counted here, the most recent 3 are \u00601648e33c\u0060 Implement dragging to reorder Properties panel node sections (#4299); \u00608a38af5b\u0060 Rework clipboard handling to carry embedded resources across document\u2026; \u00606b11b477\u0060 Improve the Data panel with type-specific detail pages and nested-lay\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/node_graph_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a255071700219f05cbf46e6ce0e13176024928e30e08951ebacf9796b621e14f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: document_node_definitions.rs \u2194 transform_nodes.rs: \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs\u0060 (context editor) and \u0060node-graph/nodes/transform/src/transform_nodes.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet change together 50% of the time (8 of the 16 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 \u0060bfd85cab\u0060 Replace \u0027Copy to Points\u0027 and \u0027Assign Colors\u0027 with a family of \u0027Vary\u0027 \u2026; \u0060c91d0cd5\u0060 Update all node parameters with appropriate attributes of #[unit(...)\u2026; \u006021e5e06b\u0060 Clean up document message wrappers around proto nodes so they\u0027re now \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"784a53ee9958fc2df9c4a7376b6ef83623bed1c8242be5d7d2b6b7a4c34e34d0"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: misc.rs \u2194 editor_wrapper.rs: \u0060editor/src/messages/input_mapper/utility_types/misc.rs\u0060 (context editor) and \u0060frontend/wrapper/src/editor_wrapper.rs\u0060 (context wrapper) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 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) \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 \u006007fbcd48\u0060 Desktop: Add fullscreen window mode (#3625) (at that commit the file was still \u0060frontend/wasm/src/editor_api.rs\u0060); \u00602ee8e56c\u0060 Fix sending platform-specific shortcut keys to frontend before editor\u2026 (at that commit the file was still \u0060frontend/wasm/src/editor_api.rs\u0060); \u0060f2994970\u0060 Add shaking input gesture to disconnect a node being dragged (#2889) (at that commit the file was still \u0060frontend/wasm/src/editor_api.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/input_mapper/utility_types/misc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e01814b21479d00c0ac53edb5bc490662442c72c37c2fef006a7fbcc87ac2a8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: handle_desktop_wrapper_message.rs \u2194 dispatcher.rs: \u0060desktop/wrapper/src/handle_desktop_wrapper_message.rs\u0060 (context desktop) and \u0060editor/src/dispatcher.rs\u0060 (context editor) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 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 6 shared commits counted here, the most recent 3 are \u006078679a5b\u0060 Implement editor level future message handler (#4182); \u0060b100892b\u0060 Add support for persistent storage of panel layouts, sizes, and activ\u2026; \u00602be7790d\u0060 Improve UX of importing vs. opening files (#3661) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/wrapper/src/handle_desktop_wrapper_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c46049ddc29264bb879ffeb191f919fe1049345cda15f9a1b9345b0ae9c6d0a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: handle_desktop_wrapper_message.rs \u2194 app_window_message_handler.rs: \u0060desktop/wrapper/src/handle_desktop_wrapper_message.rs\u0060 (context desktop) and \u0060editor/src/messages/app_window/app_window_message_handler.rs\u0060 (context editor) sit in DIFFERENT parts of the tree yet 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) \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 5 shared commits counted here, the most recent 3 are \u006095d35562\u0060 Replace globals with editor environment (#3656); \u006073682b48\u0060 Desktop: Implement pointer lock for NumberInput (#3638); \u0060bb4516e3\u0060 Desktop: Add app menu for Mac (#3428) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/wrapper/src/handle_desktop_wrapper_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a294a065e9b346bd0005003daaddcac5ec306978aed9066ef8154f36eedad380"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: runtime.rs \u2194 test.rs: \u0060editor/src/node_graph_executor/runtime.rs\u0060 (context editor) and \u0060node-graph/interpreted-executor/src/dynamic_executor/test.rs\u0060 (context node-graph) sit in DIFFERENT parts of the tree yet 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) \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 5 shared commits counted here, the most recent 3 are \u0060a43a630a\u0060 Fix the Data panel showing another node\u0027s output for some layers and \u2026; \u0060c914d7be\u0060 Improve NodeError infrastructure (#4836); \u0060a566448a\u0060 Edit the inspected node\u0027s context in the Data panel (#4804) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/node_graph_executor/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83282dde46d98e94c52e0c396d3a614f1f3753c0e92e5870220f413ebbe6b9f8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: app.rs \u2194 handle_desktop_wrapper_message.rs: \u0060desktop/src/app.rs\u0060 and \u0060desktop/wrapper/src/handle_desktop_wrapper_message.rs\u0060 change together 100% of the time (12 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) 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 12 shared commits counted here, the most recent 3 are \u006078679a5b\u0060 Implement editor level future message handler (#4182); \u0060b100892b\u0060 Add support for persistent storage of panel layouts, sizes, and activ\u2026; \u00602be7790d\u0060 Improve UX of importing vs. opening files (#3661) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1825d02f66856b9926376b3964145c2975be8fac1fa561ba81ff190846bed8e7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: frontend_message.rs \u2194 node-graph.ts: \u0060editor/src/messages/frontend/frontend_message.rs\u0060 and \u0060frontend/src/stores/node-graph.ts\u0060 change together 91% of the time (21 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are \u0060fba33376\u0060 Show other peers\u0027 pointers in collaborative editing (#4892); \u00607e6e4276\u0060 Render thumbnails with Vello (#4805); \u0060c6ac909d\u0060 Add virtual scrolling to the Layers panel, sending details and thumbn\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/frontend/frontend_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f734369ea33bce9b43eaa14e50216c4d23c2fc01ed69de80dfa4ebfb0961b19"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: app.rs \u2194 intercept_frontend_message.rs: \u0060desktop/src/app.rs\u0060 and \u0060desktop/wrapper/src/intercept_frontend_message.rs\u0060 change together 79% of the time (19 of the 24 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 19 shared commits counted here, the most recent 3 are \u0060f11e2d76\u0060 Add cross-application copy-paste by also copying layers to the clipbo\u2026; \u006063725ea6\u0060 Desktop: Make input routing aware of floating menus (#4498); \u006078679a5b\u0060 Implement editor level future message handler (#4182) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba63c5926dbdbe9ecf14b2b1aef17b53bb79f952f7880239a43553a717bde304"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: document_message_handler.rs \u2192 export_dialog_message_handler.rs, new_document_dialog_message_handler.rs, node-graph.ts: \u0060editor/src/messages/portfolio/document/document_message_handler.rs\u0060 changes together with 3 other files \u2014 \u0060editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs\u0060, \u0060editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs\u0060, \u0060frontend/src/stores/node-graph.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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc30fe8e40d9aaa3cf68ddbfd05b2b46bfa743612d40da63e98b219e290cc61"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: handle_desktop_wrapper_message.rs \u2194 intercept_frontend_message.rs: \u0060desktop/wrapper/src/handle_desktop_wrapper_message.rs\u0060 and \u0060desktop/wrapper/src/intercept_frontend_message.rs\u0060 change together 75% of the time (9 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) 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 9 shared commits counted here, the most recent 3 are \u006078679a5b\u0060 Implement editor level future message handler (#4182); \u0060b100892b\u0060 Add support for persistent storage of panel layouts, sizes, and activ\u2026; \u00602be7790d\u0060 Improve UX of importing vs. opening files (#3661) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/wrapper/src/handle_desktop_wrapper_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd1caea00ee41a38b7e4c9cd634e158c71e5921de4cdb10693f75ec9afb1293"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: graphic.rs \u2192 context_modification.rs, repeat_nodes.rs, vector_modification_nodes.rs: \u0060node-graph/nodes/graphic/src/graphic.rs\u0060 changes together with 3 other files \u2014 \u0060node-graph/nodes/gcore/src/context_modification.rs\u0060, \u0060node-graph/nodes/repeat/src/repeat_nodes.rs\u0060, \u0060node-graph/nodes/vector/src/vector_modification_nodes.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":"node-graph/nodes/graphic/src/graphic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b388f1e865cf2d196c46116025de93a73e535b9c999c31e20bd3c34e7b61d76"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: portfolio_message_handler.rs \u2194 Welcome.svelte: \u0060editor/src/messages/portfolio/portfolio_message_handler.rs\u0060 and \u0060frontend/src/components/panels/Welcome.svelte\u0060 change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006095c1ab81\u0060 Prep for the RC6 release of the desktop app; \u0060ab7f59ca\u0060 Prep for the RC5 release of the desktop app; \u006083d03ad6\u0060 Fix panel docking bugs and polish its behavior (#4087) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/portfolio_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b51ba64e83ae47f6c3a3afe0f915e6a24a0c4bd35b9455ffc61c3cc10f7496"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: vector_nodes.rs \u2192 artboard.rs, lib.rs, lib.rs, context_modification.rs, filter.rs, transform_nodes.rs, vector_modification_nodes.rs: \u0060node-graph/nodes/vector/src/vector_nodes.rs\u0060 changes together with 7 other files \u2014 \u0060node-graph/libraries/graphic-types/src/artboard.rs\u0060, \u0060node-graph/libraries/graphic-types/src/lib.rs\u0060, \u0060node-graph/nodes/blending/src/lib.rs\u0060, \u0060node-graph/nodes/gcore/src/context_modification.rs\u0060, \u0060node-graph/nodes/raster/src/filter.rs\u0060, \u0060node-graph/nodes/transform/src/transform_nodes.rs\u0060, \u0060node-graph/nodes/vector/src/vector_modification_nodes.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 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 7."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f35f8db3c26940fc81b7dce9ba39be1831118c366a690ed60cd456da353d2e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Layers.svelte \u2194 IconButton.svelte: \u0060frontend/src/components/panels/Layers.svelte\u0060 and \u0060frontend/src/components/widgets/buttons/IconButton.svelte\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) 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 13 shared commits counted here, the most recent 3 are \u0060a024a810\u0060 Add node chains as selectable, draggable icons in the Layers panel (#\u2026; \u006006e2a049\u0060 Implement dragging layers into the group/new/delete buttons in the La\u2026; \u0060938a688f\u0060 Polish up the Layers panel design \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eb9e8d5150978327b938db848ec7f7dde4721ed8683c0f351cd05cfb4691dc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: render_cache.rs \u2194 render_node.rs: \u0060node-graph/nodes/gstd/src/render_cache.rs\u0060 and \u0060node-graph/nodes/gstd/src/render_node.rs\u0060 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) 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 7 shared commits counted here, the most recent 3 are \u0060c20da5c3\u0060 Make the Vello GPU renderer robustly handle complex/degenerate scenes\u2026; \u006058b8aeb0\u0060 Fix viewport zoom perf regression caused by #3848 (#4749); \u0060a040362d\u0060 Change footprint to always be in physical instead of logical space (#\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/gstd/src/render_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f154fb22795cf831818465736df5b61da0a238998d3dd7ccfe86e2508978c6c0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: adjustments.rs \u2194 image_color_palette.rs: \u0060node-graph/nodes/raster/src/adjustments.rs\u0060 and \u0060node-graph/nodes/raster/src/image_color_palette.rs\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 \u0060f05a644b\u0060 Revamp the syntax to #[hard(a..b)] and #[soft(a..b)] bounds on node d\u2026; \u0060f42d12da\u0060 Improve type handling for ints/floats with the #[hard/soft_min/max(..\u2026; \u0060fdb09e33\u0060 Improve the categorization across many nodes (at that commit the files were still \u0060node-graph/gcore/src/raster/adjustments.rs\u0060 and \u0060node-graph/gstd/src/image_color_palette.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16b29f6b4c1168c9fae4617e7d4abf019806adb80893ef726db01bbcb456102"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: node_inspector.rs \u2192 color_picker_message_handler.rs, graph_operation_message.rs, transform_utils.rs: \u0060editor/src/messages/portfolio/document/node_graph/node_inspector.rs\u0060 changes together with 3 other files \u2014 \u0060editor/src/messages/color_picker/color_picker_message_handler.rs\u0060, \u0060editor/src/messages/portfolio/document/graph_operation/graph_operation_message.rs\u0060, \u0060editor/src/messages/portfolio/document/graph_operation/transform_utils.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":"editor/src/messages/portfolio/document/node_graph/node_inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67c801ccc8c4f54d9e5c80365dd6f436aaaa09ebbbbd6fcdd9e23c5c66c6af3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: new_document_dialog_message_handler.rs \u2194 portfolio_message_handler.rs: \u0060editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs\u0060 and \u0060editor/src/messages/portfolio/portfolio_message_handler.rs\u0060 change together 55% of the time (11 of the 20 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 \u006083d03ad6\u0060 Fix panel docking bugs and polish its behavior (#4087); \u0060ba63c26c\u0060 Replace the Artboard struct with a Table\u003CTable\u003CGraphic\u003E\u003E shape (#4077); \u0060da45ab2f\u0060 Add a checkered background to transparent artboards and the infinite \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"368cfa94f77f16ba12336d15c5de64c8d90df931c157b94b16d3a809ca030b45"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: transform_utils.rs \u2194 document_node_definitions.rs: \u0060editor/src/messages/portfolio/document/graph_operation/transform_utils.rs\u0060 and \u0060editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 6 shared commits counted here, the most recent 3 are \u0060332088bc\u0060 Make the Transform node use angles in degrees instead of radians for \u2026; \u0060a6af5d48\u0060 Memoize hashing (#1876) (at that commit the file was still \u0060editor/src/messages/portfolio/document/node_graph/document_node_types.rs\u0060); \u00605bca9318\u0060 Rename handle mirroring to colinear (at that commit the files were still \u0060editor/src/messages/portfolio/document/node_graph/graph_operation_message_handler/transform_utils.rs\u0060 and \u0060editor/src/messages/portfolio/document/node_graph/node_graph_message_handler/document_node_types.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/graph_operation/transform_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bbf72cba816cf3795dd3185081719f1965a10044ec36715ec2f879869634f2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: frontend_message.rs \u2194 files.ts: \u0060editor/src/messages/frontend/frontend_message.rs\u0060 and \u0060frontend/src/utility-functions/files.ts\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060c2afc07a\u0060 Move file filter creation from frontend to editor (#4351); \u00602be7790d\u0060 Improve UX of importing vs. opening files (#3661); \u006096a1b12a\u0060 Desktop: Unify save file handling and add file dialog for export (#3008) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/frontend/frontend_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc447ef6aa98edc6bff5029a791e3b233d9e0a9bd5d08e117884e202dbd5dcc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: adjustments.rs \u2194 blending_nodes.rs: \u0060node-graph/nodes/raster/src/adjustments.rs\u0060 and \u0060node-graph/nodes/raster/src/blending_nodes.rs\u0060 change together 53% of the time (10 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 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 10 shared commits counted here, the most recent 3 are \u0060c91d0cd5\u0060 Update all node parameters with appropriate attributes of #[unit(...)\u2026; \u0060951339a6\u0060 Move the adjustment nodes to 64-bit precision number parameters (#4579); \u0060506690d1\u0060 Fix the \u0027Mix\u0027 and \u0027Color Overlay\u0027 nodes to use spec-compliant math fo\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/raster/src/adjustments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"481093d6be49fb73c4e8551a5276552bc8797b13e30c82db72a4cf89a56db322"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Document.svelte \u2194 IconButton.svelte: \u0060frontend/src/components/panels/Document.svelte\u0060 and \u0060frontend/src/components/widgets/buttons/IconButton.svelte\u0060 change together 52% of the time (11 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) 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 \u006001499de8\u0060 Make the tool shelf adapt to multiple columns and improve panel scrol\u2026; \u0060e877eea4\u0060 Fix all remaining Vue/TS errors flagged in Volar (at that commit the files were still \u0060frontend/src/components/panels/Document.vue\u0060 and \u0060frontend/src/components/widgets/buttons/IconButton.vue\u0060); \u00605518384e\u0060 Vue/TS bug and bad typing fixes (at that commit the files were still \u0060frontend/src/components/panels/Document.vue\u0060 and \u0060frontend/src/components/widgets/buttons/IconButton.vue\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8048c8f810991e63fcc66fd7fb986f0d9a42031bb1a8f385ca503346dd036662"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: layout_message_handler.rs \u2194 WidgetSpan.svelte: \u0060editor/src/messages/layout/layout_message_handler.rs\u0060 and \u0060frontend/src/components/widgets/WidgetSpan.svelte\u0060 change together 52% of the time (23 of the 44 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are \u006076039460\u0060 Turn the Properties panel into a tree of the chains feeding each node\u2026; \u006023e6b0f1\u0060 Make the dropdown widget\u0027s file drop a callback and keep stray file d\u2026; \u0060eb4a1223\u0060 Rename the SpectrumInput widget to SliderInput (#4541) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/layout/layout_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"055fb99ef3f4c4c02345ee8f5ae6258a29a5a8e652b16c1593159fa452096c6e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: node_registry.rs \u2194 lib.rs: \u0060node-graph/interpreted-executor/src/node_registry.rs\u0060 and \u0060node-graph/libraries/raster-types/src/lib.rs\u0060 change together 51% of the time (25 of the 49 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 25 shared commits counted here, the most recent 3 are \u0060e238753a\u0060 Implement clipping masks, stroke align, and stroke paint order (#2644) (at that commit the file was still \u0060node-graph/gcore/src/raster.rs\u0060); \u0060a8e209e4\u0060 Remove the old node macro and fix/clean up several raster nodes (#2650) (at that commit the file was still \u0060node-graph/gcore/src/raster.rs\u0060); \u0060349ec5da\u0060 Add MemoizeImpure node and cache image base64 in graph (#1595) (at that commit the file was still \u0060node-graph/gcore/src/raster.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/interpreted-executor/src/node_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c367bada51f7f44d5e100988cd68cab7901d7c136a287c745b71f1954a091e9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: freehand_tool.rs \u2194 pen_tool.rs: \u0060editor/src/messages/tool/tool_messages/freehand_tool.rs\u0060 and \u0060editor/src/messages/tool/tool_messages/pen_tool.rs\u0060 change together 50% of the time (9 of the 18 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 9 shared commits counted here, the most recent 3 are \u0060525e49f7\u0060 Make the Shape tool\u0027s modes\u0027 parameter controls sync with the selecte\u2026; \u006093880abc\u0060 Experimental vector meshes (#2223); \u0060ed119ad3\u0060 Add Freehand tool drawing new subpaths on an existing layer with Shif\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bd0528c7e69905125106750bc46be34723088f5199208fb5683de09ed795f0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: freehand_tool.rs \u2194 spline_tool.rs: \u0060editor/src/messages/tool/tool_messages/freehand_tool.rs\u0060 and \u0060editor/src/messages/tool/tool_messages/spline_tool.rs\u0060 change together 50% of the time (9 of the 18 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 9 shared commits counted here, the most recent 3 are \u00605612b636\u0060 Extend open paths from endpoints with the Freehand tool and skip hidd\u2026; \u006097430120\u0060 Revert #1594 and #1623 so the Freehand tool no longer extends existin\u2026; \u0060525e49f7\u0060 Make the Shape tool\u0027s modes\u0027 parameter controls sync with the selecte\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/tool/tool_messages/freehand_tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe63fffe288458117172473e103ee7f69150c87877b7645a858b46daf34eec9b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: color_picker_message_handler.rs \u2194 gradient_tool.rs: \u0060editor/src/messages/color_picker/color_picker_message_handler.rs\u0060 and \u0060editor/src/messages/tool/tool_messages/gradient_tool.rs\u0060 change together 50% of the time (7 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 7 shared commits counted here, the most recent 3 are \u0060681b4033\u0060 Add a gradient interpolation attribute with Stepped, Linear (existing\u2026; \u00604b01abe3\u0060 Add a \u0022Cyclic\u0022 gradient option that closes the ramp into a seamless l\u2026; \u00603f082c88\u0060 Make gradient evaluation follow the ramp\u0027s interpolation space attrib\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/color_picker/color_picker_message_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dd0510f96e8fc0e114ee490ce7584c10af1e601e01a663271ab7e0492de9fc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: artboard.rs \u2194 lib.rs: \u0060node-graph/libraries/graphic-types/src/artboard.rs\u0060 and \u0060node-graph/nodes/blending/src/lib.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00604474de46\u0060 Replace the AlphaBlending struct with separate attributes (#4086); \u00600847d7b0\u0060 Centralize attribute strings in consts and rename \u0022editor:layer\u0022 to \u0022\u2026; \u00606d669ad7\u0060 Add documentation to many nodes (#3338) (at that commit the files were still \u0060node-graph/gcore/src/artboard.rs\u0060 and \u0060node-graph/gcore/src/blending_nodes.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/graphic-types/src/artboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c27737f34a9a9472f2ff8980871f8fadb2a8bc25b3bdc219a113bef6502e9c6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 transform_nodes.rs: \u0060node-graph/nodes/blending/src/lib.rs\u0060 and \u0060node-graph/nodes/transform/src/transform_nodes.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060c91d0cd5\u0060 Update all node parameters with appropriate attributes of #[unit(...)\u2026; \u00600847d7b0\u0060 Centralize attribute strings in consts and rename \u0022editor:layer\u0022 to \u0022\u2026; \u00606d669ad7\u0060 Add documentation to many nodes (#3338) (at that commit the files were still \u0060node-graph/gcore/src/blending_nodes.rs\u0060 and \u0060node-graph/gcore/src/transform_nodes.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/nodes/blending/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f1657feb8df285cbbe08f786b67d7fdbf0340d080f27944d8cefa2ee9b670c"}},{"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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","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":"236500441f906175ccd7eeacf8b857fc1311d61f5512d45abcda37a92d67d0de"}},{"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":"3b2d63e6e05d69564bda618a9b61e6e0d4c2c69f3ecbc3e8ca3df61e878a1281"}},{"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":"4e0895c5b97e7e692bb7c2f321730de2247d9744c4d099b4354ba158baa010aa"}},{"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":"frontend/src/components/floating-menus/EyedropperPreview.svelte"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2c59a9c414decc66b89a715f70d2bcec071d344832ab55b1d40193e8a925c6"}},{"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":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70482c22b55e97f71923a8d3f303bc8b6d18f1569a242c181577c9906dcb0b5"}},{"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":"frontend/src/components/views/ThumbnailImage.svelte"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d61d6a309c6acabf3f84060031af56f9e74e600951e0ac5ce8f1cf97331f59"}},{"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":"frontend/src/components/panels/History.svelte"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1fbb9b1535c350fcdd2115a1687bd65227b6fccde8f06c62b5c4aa13b76390"}},{"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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd427a391b1048a084f90e3ef6443e502f84a6d9cf7bd50804d10f813814829"}},{"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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a37d4487aeff904eb426f3828226da09f8aa28ab8da234fbfb52c48ee717a0"}},{"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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2142926fb7aa6a3b9e4c1089e3e1cc2f0bd34a3a64757c0a98ce47429aae77b3"}},{"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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3157d59bca8d83432beb2cae200d77f3b38355840a1b439780c13badbde8eb9"}},{"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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0e55090193241fffa48d049a24f365c9c61ddfc2ff3ee4ddfdc4b1ba267560"}},{"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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60401c21e5e6572577eeaedb8ba800735a02a4c212838917be58052f3c2ceae"}},{"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":"frontend/src/components/widgets/NodeSection.svelte"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f7a849e3e25b53f8768bacc148161d479a8ac0cc519cae3b9f23fd4b296676"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cimg\u003E: This \u003Cimg\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":"frontend/src/components/widgets/buttons/ImageButton.svelte"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bd65ada46a1203d344094df3cbccf0f29a22b55af65695dc67abfaf2d438a3"}},{"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":"frontend/src/components/widgets/inputs/ColorPresetsInput.svelte"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"93152f592208bff99266e4ce80b75815348bf966b5d40cce1fbad8bf9482fff9"}},{"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":"frontend/src/components/widgets/inputs/ColorPresetsInput.svelte"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef28cf5c3b8ffb06c0b153e17849888182111c371f3dc74666c696c4ab11f11b"}},{"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":"frontend/src/components/widgets/inputs/ColorPresetsInput.svelte"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f918e44c92f1e73234008d2898be0835a835d10534c0d5776a5f36fc5ae89965"}},{"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":"frontend/src/components/widgets/inputs/ColorPresetsInput.svelte"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6529e5f910373b6f87ebad5fdfa4609506c880ebeae3fd95ae3261c4b90df6c0"}},{"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":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"a681fde713e94bc1ece54d92b7f73a6f4c5b22af04849d01a0fb909c8f986854"}},{"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":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"12279e047a76ea0888ef8fc83896c94a73c9632422e7cbd433f2bab806057048"}},{"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":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f60011f3536e725298ca1ca75d19fdd6828058bdcc516e71e10693734243fa"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d0b254c0ba188645f3f23e4dafe16e9951dc889b51b868de5bd4998d071847"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4a1ae55d0f250d991cd5f40de624aac2a2d31520f9ce12dae539823adbdd37"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d97fd93bfb94bbfba2729f16f18c44fc304fd40f97f322220f64ada290f481"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edb8a2e5dd531cdfd123743b659379b8a39769e13c294ace4297168038510d6"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b6453435c32fd2c9c01d072ff92b0caf21b539b1b3a608e1b4074a9f20a22e"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b9294aec6ac408a17ba6bcf9e17d35212bfa3b0a747b2b9c313e6ddd777bd3"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8690dc193ec64959e0ea03e315b6a3af123950841b5c1b501b81e99bfd2a8169"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"067073d7234dd90922eab825349b2c509d4641a9c4905cf1a36d63297f37152a"}},{"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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac34e35506eb0ac63b99ee20e30d9f389c931aadf398293c6c75e7a10916f884"}},{"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":"frontend/src/components/widgets/inputs/ScrollbarInput.svelte"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d5e51057889d025e2522b4dc7bf4a4ab7b11be72c5e6eabd27579388b8bc1c"}},{"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":"frontend/src/components/widgets/inputs/ScrollbarInput.svelte"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"68280f43297d3bb3228aae9917dfa658a41646425508c2c88ee397805e824683"}},{"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":"frontend/src/components/widgets/inputs/WorkingColorsInput.svelte"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc53c8512af2ba9d62e3ae1ccd157ddde0f13cbf7474c6fcba0caba7df5c185"}},{"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":"frontend/src/components/widgets/inputs/WorkingColorsInput.svelte"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e3b5367c2125657aa0472c975029f9050965648adb52caff250d79ee28bc52"}},{"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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"66662db3f6c3509adea116970b6dba0d08e46d8b9106b6caea3f7be36e2c9bce"}},{"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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"99870174c1a0325e86f1b09588061f7e525c962471c488e1ab8a6334655ec964"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"774f26e6776645be1ca7eb32c03dfeeff832251473c407c2b0e5ddc34adb1654"}},{"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":"frontend/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"963180a58f160911d5cc234ade89435dbbcab97255eefb2ef06173d86c4d845c"}},{"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":"frontend/index.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e170d35e5f2a1eac0a45ca8bfaaaffda67f421bbaea78a0d466661aae74043"}},{"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":"frontend/src/components/layout/LayoutCol.svelte"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76e92366714465147092a40d73063988687d50ca8a8d8503bff1a32afea1d38"}},{"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":"frontend/src/components/layout/LayoutRow.svelte"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf50383690e26516384ba6a91d9a7ed1c1b20a223947dcb325b790d00e76cb3c"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cp\u003E: This \u003Cp\u003E binds double-click and nothing else. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bbfb98e2604ba1845325bfc815722af660098f45095cfffc1337c808fb2264"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cp\u003E: This \u003Cp\u003E binds double-click and nothing else. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c117b9e9eb4af30d5cea5b7312233b2c4413a590dc396872ba36b22eaa0484"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cimg\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":"frontend/src/components/widgets/buttons/ImageButton.svelte"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f951abbf5c221a6dc2c1e19218fabf1426ca7d46bd8d635f68056f1914694da"}},{"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":"frontend/src/components/widgets/inputs/ColorPresetsInput.svelte"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eb9c5226549ce063f5fae52b1ee808510f7113a7e72af7ab91ea68ee2e8fac"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Csvg\u003E: This \u003Csvg\u003E binds pointerdown and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be328004ac031d1581267817eae5fc53a381ffd2d6cd42566ef43f20b860442"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds pointerdown and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df3dedbc297d495f696b5a9dd854d438a60e96550ee34b253e427bf1e040545"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds pointerdown and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9c14e6e275bc6ce40837f373e6fa22b4140e310f31fb063ffc63bb7d9629a7"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds pointerdown, pointermove and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex=\u00220\u0022, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/TransferCurveInput.svelte"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e095582343c86ab1900934ae8b081bd0625e8b4d3b0854f740be002b80fb66"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060body::after\u0060 moves (\u0060animation: spinning-loading-indicator 1s 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":"frontend/index.html"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"25502e3df7be361d1b4eb8d829c3a940e6725ec0eea9178d7c17ad647d981283"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.donation-picker .picker-body .amount-entry input: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":"website/sass/page/donate.scss"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3c5a458cc4e8ab36c29976b410fb3fde6f15e34a3d22fca589e47172faffb7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.carousel.carousel .screenshot-details .carousel-controls button\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":"website/sass/component/carousel.scss"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"404a3079bcd561645a3175fc77542b01e48e94f3e5dc93ae2ab7502acbe7f42d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060:where(:focus-visible)\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":"frontend/src/components/Editor.svelte"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc833e598b22c4c82ee21598bd344b4358e45e6e58080e9bd7249bfd18295b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.panel .tab-bar .tab-group .tab .name 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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"96569cb5be03ee5369984b5bbda218563a59f37b448c2481899f3b72afab3c54"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.field-input 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":"frontend/src/components/widgets/inputs/FieldInput.svelte"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ac26f386c2ad1455f6b938079c40bf3901b9fd0163bbe5cf48b255aa5ad200"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.math-expression-input .editor\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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a5ba2edcc45da1b175007f5d820d0e423ae16920b3fe0ef2571073090efd81"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.working-colors-button .swatch \u003E button\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":"frontend/src/components/widgets/inputs/WorkingColorsInput.svelte"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d91139cc7652d7f19cf13e512062237eff206167fbde5b2cfa6e407515d0b9b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.graph .name-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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe1eca5bdb9a441383437b2d9d76f5304e347c7f127ea3a7ea3779e69232fab"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.three-column-layout .chapters .wrapper-outer\u0060 moves (\u0060transition: left 0.25s ease-in-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":"website/sass/template/book.scss"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e570b223af1b38d1bd6505cfdfc5c19cb79357f9f21b10eda4b8b0e5ec7662c5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.three-column-layout .chapters\u0060 moves (\u0060transition: height 0.25s ease-in-out 0.25s\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":"website/sass/template/book.scss"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e90481754ee3e7f8b62fe201c4df3f33d87c43e8fc0530975c003f99df6a76"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.membership-panel .notices:has(.notice.passing:not([hidden]))\u0060 moves (\u0060animation: passing-notices-leave 0.4s ease-in 5s forwards\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":"website/sass/page/membership.scss"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f41a6c390712584e7fbc5058880edac063e88da674d2d28d9d172340d72a651"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.carousel.carousel:not(.dragging, .jostling) .carousel-slide :is(img, video)\u0060 moves (\u0060transition: transform 500ms\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":"website/sass/component/carousel.scss"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"962205682f3fe1ba80005315d999b0bb8b76706b2bb992b554f8a9d48e41ade7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.name-fade.fade \u003E .credits-name\u0060 moves (\u0060animation: credits-name-fade calc(1.5s * (var(--name-color-count, 2) - 1)) ease-in-out infinite alternate\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":"website/sass/component/credits-names.scss"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a03ef3d40eb245ef216d2af50c0df8be078869754fc067c0a0534c45f5a498"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.name-fade.flow \u003E .credits-name\u0060 moves (\u0060animation: credits-name-flow calc(2s * var(--name-color-count, 2)) 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":"website/sass/component/credits-names.scss"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4613f263ccc8caadf5e02f40506c48efe6856624025409c234fc506783c89456"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.name-fade.shimmer \u003E .credits-name\u0060 moves (\u0060animation: credits-name-shimmer 3s 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":"website/sass/component/credits-names.scss"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6260e3c4862c8781f46f0d8606acce521d22dc4e6bfd0e580a78e97a5e71988c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.name-fade.rise \u003E .credits-name\u0060 moves (\u0060animation: credits-name-rise calc(2s * var(--name-color-count, 2)) 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":"website/sass/component/credits-names.scss"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1824439991cf1b23345330b4302f485260796b0e92414103f4da7bd139bde5c1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.name-fade.wipe \u003E .credits-name\u0060 moves (\u0060animation: credits-name-wipe calc(2.8s * var(--name-color-count, 2)) 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":"website/sass/component/credits-names.scss"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf7ac8950a3815f0f8255ab598532817593be1a5bf3f1c3b99a3ef63091e7b0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.name-fade.stripes \u003E .credits-name\u0060 moves (\u0060animation: credits-name-stripes calc(1.5s * var(--name-color-count, 2)) 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":"website/sass/component/credits-names.scss"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b2cba56261419cfa71fe3bca8ec1a76076203f8a047bea66cf4aaae35c2b07"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.name-fade.glow \u003E .credits-name::before\u0060 moves (\u0060animation: credits-name-glow 2.4s ease-in-out infinite alternate\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":"website/sass/component/credits-names.scss"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adb0ab1941013973b2ded60c06dfb3a674c88136c23f2f35d5c870e3a7475a0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.image-comparison .slide-bar .arrows svg:nth-of-type(1)\u0060 moves (\u0060animation: 3s infinite ease-out pulse-left, 3s infinite ease-out pulse-opacity\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":"website/sass/component/image-comparison.scss"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae40eb169bffcb2c778222fffb46dff79f0442c22ddec4fa9155adef70bb401"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.image-comparison .slide-bar .arrows svg:nth-of-type(2)\u0060 moves (\u0060animation: 3s infinite ease-out pulse-right, 3s infinite ease-out pulse-opacity\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":"website/sass/component/image-comparison.scss"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"765c2737b0790ffc5c691dd0a3a2d5f27b0a8cb4cf6609a0dd3b02eb745dc4bf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.panel .docking-ghost\u0060 moves (\u0060transition: top 0.2s ease,\n\t\t\t\tleft 0.2s ease,\n\t\t\t\twidth 0.2s ease,\n\t\t\t\theight 0.2s ease\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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"6252a308020e127be20434d8f07e2021015b26bdfea7db73f266cdd6479415c8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.graph .redirect-dot .dot\u0060 moves (\u0060transition: transform 0.1s,\n\t\t\t\t\tbackground-color 0.1s,\n\t\t\t\t\toutline-color 0.1s\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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"84edebd83d6171664869863aa735777a6f07d59810c63363a0acfa717afaf2ca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.graph .connector path\u0060 moves (\u0060transition: fill 0.1s,\n\t\t\t\t\ttransform 0.1s\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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc98c6daf412bf4e0865fd38d59df726f4c051d7d82ce7354edb6f8dabc38105"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: document_storage_io$module.load_legacy_document: \u0060document_storage_io$module.load_legacy_document\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document_storage_io.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2fb6478c0cd8d318a473e1224370117552fa910642285fc5d12b2b0ea5fe93"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): spawn$module.handle_message: \u0060spawn$module.handle_message\u0060 performs two independent DURABLE writes \u2014 a durable state write (\u0060died_reported.store\u0060, :346) and an independent publish to an event bus (\u0060events.send\u0060, :347) \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9998df790b6c831d310f8b334f0ef09f5c35a86d18af295b77aab6afa460a61c"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060graphene_canvas_utils.wasm\u0060 is marked as implementation by its own namespace, folder or name: \u0060CanvasImpl\u0060 (node-graph/libraries/canvas-utils/src/wasm.rs:166, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/canvas-utils/src/wasm.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfcdbf3589dc90afa81b381d8b0241041bea48b919827c28e0d2cde983ca79c"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 2 public types in \u0060core_types.context\u0060 are marked as implementation by their own namespace, folder or name: \u0060OwnedContextImpl\u0060 (node-graph/libraries/core-types/src/context.rs:587, name ends in \u0060Impl\u0060), \u0060ContextImpl\u0060 (node-graph/libraries/core-types/src/context.rs:829, name ends in \u0060Impl\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node-graph/libraries/core-types/src/context.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b30a010d47d0c1bb8be27622fd151933fa8ac964c50fe8fff886bff23880c8e"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 24/29 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060desktop/bundle\u0060, \u0060desktop/platform/linux\u0060, \u0060desktop/platform/mac\u0060, \u0060desktop/platform/win\u0060, \u0060document/migrations/snapshot\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060frontend/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/package.json"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bd665d85b8ea73f9fb446e925b770ca0b54168372ede30b98fb6d338256ca5"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): frontend/src/stores/app-window.ts:26 \u00B7 frontend/src/stores/document.ts:38 \u2014 the two spans are one implementation copied and then locally edited \u2014 276 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":"frontend/src/stores/app-window.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd8de6323833663d8e90821e8dab9cc323e21ffe86a0132e9cc27a9ef8ff17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): frontend/src/components/widgets/inputs/TextAreaInput.svelte:4 \u00B7 frontend/src/components/widgets/inputs/TextInput.svelte:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 147 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":"frontend/src/components/widgets/inputs/TextAreaInput.svelte"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be2aa86b1b6631794415f83d5c0a2da76f72a9622ef13bdb0975087f6f62b79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): frontend/src/utility-functions/clipboard.ts:1 \u00B7 frontend/src/utility-functions/clipboard.ts:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 176 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":"frontend/src/utility-functions/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf3f33e5e7488b2f9bd7275ad2f12b2fa9780087c2fc2b842a2df099ba38d8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): frontend/src/components/layout/LayoutCol.svelte:4 \u00B7 frontend/src/components/layout/LayoutRow.svelte:4 \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":"frontend/src/components/layout/LayoutCol.svelte"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45931f67f9c2776975e7778e5eee94c1de30693381da93e16fdd54d87871e27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): frontend/src/components/widgets/WidgetSpan.svelte:269 \u00B7 frontend/src/components/widgets/WidgetSpan.svelte:287 \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":"frontend/src/components/widgets/WidgetSpan.svelte"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ca69161c1546e511f17b891d56d42fd33432c1bad5ceaa2c01ba50ee01bf42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): frontend/src/components/panels/Inspector.svelte:26 \u00B7 frontend/src/components/panels/Inspector.svelte:38 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Inspector.svelte"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"375f4ac4a510b2e0b1bbabc78257811dd35c2f0175395c7c598206b6a865f756"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): frontend/src/components/panels/Inspector.svelte:81 \u00B7 frontend/src/components/panels/Layers.svelte:745 \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":"frontend/src/components/panels/Inspector.svelte"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a8b1d4ede34fefbb1d93e3909f3317a5164fceea405f1849d19be7572db6c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): frontend/src/components/widgets/inputs/ScrollbarInput.svelte:193 \u00B7 frontend/src/components/widgets/inputs/TransferCurveInput.svelte:268 \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":"frontend/src/components/widgets/inputs/ScrollbarInput.svelte"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa95424889b68e9d3c84fa45d7f984d61f25526b9bd3603e097668b15fdfdbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): frontend/src/components/widgets/inputs/SliderInput.svelte:585 \u00B7 frontend/src/components/widgets/inputs/TransferCurveInput.svelte:250 \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":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"16393e31e08087433ab347be8c0b7e632011deb7e38d1de6349b274f736d914e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): frontend/vite.config.ts:40 \u00B7 frontend/vite.config.ts:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"frontend/vite.config.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc60e1f015ab177f00d5f35b978d6ad5e577f55ae24bea5f02e1a511fc059420"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): frontend/src/components/panels/Layers.svelte:175 \u00B7 frontend/src/components/panels/Layers.svelte:193 \u00B7 frontend/src/components/widgets/inputs/NumberInput.svelte: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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9ec679814dae7403679558457fe181f4385591db91220dad684661ca49dfa9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): frontend/src/components/widgets/inputs/CheckboxInput.svelte:6 \u00B7 frontend/src/components/widgets/inputs/TextInput.svelte:4 \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":"frontend/src/components/widgets/inputs/CheckboxInput.svelte"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dbec8da893367b42fb551ea09d6241b266fd7f53cfbe44dd66615b1466de4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): frontend/src/components/widgets/inputs/DropdownInput.svelte:144 \u00B7 frontend/src/utility-functions/input.ts:297 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/DropdownInput.svelte"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42116860277ee9175c57a4d0fe65e61c57bfbe1071d0860783b998cfd24396c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): frontend/src/components/widgets/inputs/SliderInput.svelte:623 \u00B7 frontend/src/components/widgets/inputs/SliderInput.svelte:633 \u00B7 frontend/src/components/widgets/inputs/VisualColorPickersInput.svelte:146 \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":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1421e30e5cab0d7c5b1066a4ce38d4c287d62ebbe8a707df340d054a704eea40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): frontend/src/components/panels/Document.svelte:420 \u00B7 frontend/src/components/panels/Document.svelte: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":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"328efc57a6395242db730340af6db134bac2d01a62d5355fd3a959b08ddc3a66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): frontend/src/components/widgets/buttons/ImageButton.svelte:5 \u00B7 frontend/src/components/widgets/labels/ImageLabel.svelte:4 \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":"frontend/src/components/widgets/buttons/ImageButton.svelte"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2fb24f4db6f45f2ee633ef6b689ff499f5e9c72ad90ac14eeb9b9937cf9695"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): frontend/src/components/window/Panel.svelte:378 \u00B7 frontend/src/components/window/Panel.svelte: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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e389dcc523cd816c45d7ec10c335dfb8bf0b848cfb4a0283fa47f5c3f5ecfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): frontend/src/stores/app-window.ts:26 \u00B7 frontend/src/stores/document.ts:38 \u00B7 frontend/src/stores/fullscreen.ts:19 \u00B7 frontend/src/stores/tooltip.ts:43 \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":"frontend/src/stores/app-window.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1645524525b7fe64581a2e25705b2673270671f9956ec40351cf16b007b23fc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): frontend/src/utility-functions/persistence.ts:48 \u00B7 frontend/src/utility-functions/persistence.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":"frontend/src/utility-functions/persistence.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6d4f6338aa732ecac76b9e9e3cb2fe3a691a66a85041c6d81bb6271c020e16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): frontend/src/components/layout/FloatingMenu.svelte:91 \u00B7 frontend/src/components/layout/LayoutCol.svelte:17 \u00B7 frontend/src/components/layout/LayoutRow.svelte:18 \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":"frontend/src/components/layout/FloatingMenu.svelte"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7e7003a763fd308a4eb4ee63d716151f4544d93ac405ec103103888745c98a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): frontend/src/components/widgets/buttons/TextButton.svelte:30 \u00B7 frontend/src/components/widgets/inputs/ColorInput.svelte:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/TextButton.svelte"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"01506ed5458243fd932b5bb9fa4690d09c29b75679394219099cea8e77d8f490"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): frontend/src/managers/drag-toggle.ts:23 \u00B7 frontend/src/managers/drag-toggle.ts:37 \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":"frontend/src/managers/drag-toggle.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d09bd1637be420887e257e526c5ba2371f195aa687476705817ff16c4c6170"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): frontend/src/stores/color-picker.ts:25 \u00B7 frontend/src/stores/fullscreen.ts:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/color-picker.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a4f60fc366a2cd7df332d4fc34dc516d49890f29529c4cf10fca172bb7a325"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): frontend/src/utility-functions/rasterization.ts:4 \u00B7 frontend/src/utility-functions/rasterization.ts:65 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"frontend/src/utility-functions/rasterization.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ba74f2bf3e9322b79bf013f7b111548bcf6b761cd46ddc9bd7f8ddbbcbf261"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): frontend/src/components/layout/FloatingMenu.svelte:29 \u00B7 frontend/src/components/layout/LayoutCol.svelte:4 \u00B7 frontend/src/components/layout/LayoutRow.svelte:4 \u00B7 frontend/src/components/widgets/inputs/FieldInput.svelte:14 \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":"frontend/src/components/layout/FloatingMenu.svelte"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"961ffc615159c03fef4517f374c9f741522e2c7d53367f216fc8d0b39ea69ace"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): frontend/src/stores/app-window.ts:20 \u00B7 frontend/src/stores/color-picker.ts:26 \u00B7 frontend/src/stores/dialog.ts:28 \u00B7 frontend/src/stores/document.ts:28 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/app-window.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"060266c460ac37c331d8fcf68d21e46237d94123ff5ef16236da22604511fd70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function positionAndStyleFloatingMenu (cyclomatic 58, cognitive 79): positionAndStyleFloatingMenu has cyclomatic complexity 58 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/layout/FloatingMenu.svelte"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"83de9bb30e8b1f1d74154e0d90838a2043588f04e67bb9f197fa7114e32c9ce9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKey (cyclomatic 42, cognitive 51): handleKey has cyclomatic complexity 42 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":"frontend/src/components/floating-menus/MenuList.svelte"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740a1d9f9e486043aae961eb1eede54d1a80f0bfc373df3a96e029cd2c05886"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeyDown (cyclomatic 37, cognitive 46): onKeyDown has cyclomatic complexity 37 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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"498dc92f66b8dd8ce448135051c264b722ff513c2be4af7f1c308fac41c9443e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldRedirectKeyboardEventToBackend (cyclomatic 33, cognitive 30): shouldRedirectKeyboardEventToBackend has cyclomatic complexity 33 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f7323bf03a141538097f6446fde066f17baa8a4191e74487d9452e9d78232b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 32, cognitive 54): render has cyclomatic complexity 32 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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e72a2af76142916752924c8a52a8dd6fede5bdc5642a3a4c857e971120a4c3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onBeforeInput (cyclomatic 30, cognitive 29): onBeforeInput has cyclomatic complexity 30 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"e101d3605a3e3f3a980d1548524652c9a1a4170600af6ae1c6080f27a057cb8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarkdown (cyclomatic 21, cognitive 37): parseMarkdown has cyclomatic complexity 21 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":"frontend/src/utility-functions/markdown.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef3df5b0c6e3ff39b654dbd593eccc1fd1b509d450574c73564eec9f6d2efe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepThroughBrackets (cyclomatic 21, cognitive 30): stepThroughBrackets 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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"446b1b7ebd0341070df5442be06964e07473c639795c655243a94bba8ce42e91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dragPointerUp (cyclomatic 21, cognitive 25): dragPointerUp 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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"61afbb5f91609d5bacb9798478308e8aa1550958246176f3b139fef9c67a6bed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getLocalizedScanCode (cyclomatic 20, cognitive 33): getLocalizedScanCode has cyclomatic complexity 20 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":"frontend/src/utility-functions/keyboard-entry.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f825f694f00fc2bf671be249e3febbcb42da297c933487fe977aedc24854dd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dragPointerMove (cyclomatic 20, cognitive 22): dragPointerMove 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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"489ee1f5c57669c4006569dc69d7ca52272efdb4c121cda4a15f5fa050619cf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pointerOver (cyclomatic 19, cognitive 17): pointerOver 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":"frontend/src/components/floating-menus/MenuList.svelte"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01a498b6cf638ba42febed16151b4a40290624e6112dc937bf7a12d621bc40e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAtCaret (cyclomatic 18, cognitive 21): readAtCaret 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":"frontend/src/utility-functions/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5e332498fc44caff29bcd0a5ac9dead48b06e37ea90ce87b132da755c9a216"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tabBetweenTextFields (cyclomatic 17, cognitive 16): tabBetweenTextFields 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c048d3ad82c660270e30f4c9ef8f7a5b8764818a4018562242ef372b7ed17e39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPotentialDoubleClick (cyclomatic 17, cognitive 15): onPotentialDoubleClick has cyclomatic complexity 17 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"463df4ed064b312f0d2ff688fec09ccea9f0812318bccd7e6ef2dec732c0ef32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyboardHintIcon (cyclomatic 17, cognitive 9): keyboardHintIcon 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":"frontend/src/components/widgets/labels/ShortcutLabel.svelte"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d500ed8413e097ecf8ea73116e3ff585cd85b3fefd5057335becb40285254876"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resizePanel (cyclomatic 16, cognitive 16): resizePanel 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":"frontend/src/components/window/PanelSubdivision.svelte"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a51b39c43e1f160f811022980eef5dc8a27594572bfad71405fee8a9415de67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateConstant (cyclomatic 16, cognitive 14): updateConstant 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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"778091b277880e98142aced2dd6a6b212d474445e570e9169c40ad1cd5473287"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draggingPointerMove (cyclomatic 15, cognitive 19): draggingPointerMove has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"3794a27604a3ccfe698cf5d3a72b93cbfd2bad8f0c96cc05a5b7d9fbd8d4a726"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPointerDown (cyclomatic 15, cognitive 16): onPointerDown has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d05fac95c1d14ffbb6d11cdd24d0cc1839c0a0ddc4ec963d1e8e406c2cdbc3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chainDraggingPointerUp (cyclomatic 15, cognitive 10): chainDraggingPointerUp has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f5131c1a7f0d31958c8b8a83220fa3220c2c76cd49fea69d77047b4e90e106"}},{"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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d3169f725f9ed84c205156e26347482d5bab8897dc66266a2a105fdfb5644b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveActiveMidpoint (cyclomatic 14, cognitive 14): moveActiveMidpoint 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":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e233d8aa72ce5542017f86c8c0a67db5dbe4d1f8a7faf7b2bf23b82ee17e4271"}},{"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":"frontend/src/utility-functions/persistence.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d477cfca91ca45ce03e6ec3c21e385f611a3202809e2d952881840f568fc15ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/labels/ShortcutLabel.svelte"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"83edcb7770fcb7901fd3515325848070d307c9ee598346964cda23b3d8aec678"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watchOpen (cyclomatic 14, cognitive 10): watchOpen has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/floating-menus/MenuList.svelte"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"35221fe6542b14461c6f2c2789c37dad7a99399fd4b34a60cc5ced24987f6bec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertAtCaret (cyclomatic 13, cognitive 15): insertAtCaret 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":"frontend/src/utility-functions/clipboard.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f00d6f0b057102a2fcedeb755d80fc31773903b958ff704a012c612f0dc30d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function browserVersion (cyclomatic 13, cognitive 14): browserVersion 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":"frontend/src/utility-functions/platform.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5a2bc87f3f870ccc13985bdd5e5a575c19f56c044f69b34eb92f671eb00f1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPointerMove (cyclomatic 13, cognitive 13): onPointerMove 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":"frontend/src/managers/drag-toggle.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c752d89c39e308281a869a9f6debe5944a618955b658f6765fc384e0668a13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chainDraggingPointerMove (cyclomatic 12, cognitive 14): chainDraggingPointerMove 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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"5709cc2f09e2506ccad4ee72f36dd348b198f0fda5242e13d2ad4696cf238820"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typeIntoSearch (cyclomatic 12, cognitive 12): typeIntoSearch 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":"frontend/src/components/floating-menus/MenuList.svelte"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6ea1466bb06af4ade8b00b67bc432d4b1c6431fd0041c4cafffdcd0ab0aaf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectDockingEdge (cyclomatic 12, cognitive 12): detectDockingEdge 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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e72654f9147dc75fbcf008311389add89e5e8e88b92336415e0766d397c24b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clippingHover (cyclomatic 12, cognitive 11): clippingHover 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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f8f2de3677df339c88328cee7396178bfbe80c11bbdfb629c6f89047cfcc39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateExact (cyclomatic 12, cognitive 11): updateExact 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":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d10b7408190631f7781717d88ff77800e5849b2e71f45787b04d9b922159b44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hoverTransfer (cyclomatic 11, cognitive 15): hoverTransfer 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":"frontend/src/components/layout/FloatingMenu.svelte"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb12c26ca2dd3f12719f0bf5af6979ae4c869af5e34005b7b988c4ea0ede0b2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateEyedropperSamplingState (cyclomatic 11, cognitive 13): updateEyedropperSamplingState 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":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9181f9a3eb75266262916f71f1ff997a3623de0376eae94e42685f53e955b8c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateValue (cyclomatic 11, cognitive 13): updateValue 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":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"073ff7a916325b6d679d57f767665fad1f4e7765587d1d7e0096b56a2f3c5e1b"}},{"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":"frontend/src/components/floating-menus/NodeCatalog.svelte"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c20be11a09417ccf15d0140f7a16d65df3c2c2822dd9670d659540432574b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adjustConstant (cyclomatic 11, cognitive 11): adjustConstant 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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"654e9840835fca3844c8dd471e993e6816549a054da154d62a1b390dd4f96e32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeyDown (cyclomatic 11, cognitive 11): onKeyDown 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c00828e92b16b256044e0c38e70daf19dc2037ee822facc961e65d856b80ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectShake (cyclomatic 11, cognitive 11): detectShake 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"01529726475d498e1e00aeee0869cb38484a2ead1ff598d30ee55ef6ce572d56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPointerMove (cyclomatic 11, cognitive 10): onPointerMove 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6488240879a308b7e52381082e069f2809524be3f37b4397cf0826f00282e72"}},{"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":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"788470f0707e705ce367da83417ef158df6d0b5d4b12549ca09e624630989753"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/views/Graph.svelte: 1722 lines of code: frontend/src/components/views/Graph.svelte has 1722 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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fd737e3198370df8668e2faef8226345c48c339190edcb1ececaf943745564"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/panels/Layers.svelte: 1717 lines of code: frontend/src/components/panels/Layers.svelte has 1717 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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff17bf1d8399be801e15e9ab7803eced656d4ecc3268c1390de66a1a015e90d1"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/widgets/inputs/NumberInput.svelte: 1143 lines of code: frontend/src/components/widgets/inputs/NumberInput.svelte has 1143 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":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"890875b1356169b5db0d3abad2131060281adc7c41d2e28ea1db65d07a8d9a0d"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte: 1140 lines of code: frontend/src/components/widgets/inputs/MathExpressionInput.svelte has 1140 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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4c085efc2b14cd12034401c57a0424940734d24f2a9d182b8d6663c10a5fec"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/icons.ts: 1045 lines of code: frontend/src/icons.ts has 1045 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":"frontend/src/icons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"253fe69c8ec80d499561ed019486c09b731df50fe63cbb62ae619fc5ef216901"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/panels/Document.svelte: 938 lines of code: frontend/src/components/panels/Document.svelte has 938 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":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88f9046f60d4e4e962fac3f4051fab64fa90a92f36778f3571213984b3332d9"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/widgets/inputs/SliderInput.svelte: 858 lines of code: frontend/src/components/widgets/inputs/SliderInput.svelte has 858 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":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e7b9730d339d8514427d78233ef5c64b743d7e22ed378e4f5f260290a62e30"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/floating-menus/MenuList.svelte: 764 lines of code: frontend/src/components/floating-menus/MenuList.svelte has 764 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":"frontend/src/components/floating-menus/MenuList.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"132b81819feedda866641dfdcb6225c968670643099185a9208e13e5e60b2677"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/utility-functions/keyboard-entry.ts: 681 lines of code: frontend/src/utility-functions/keyboard-entry.ts has 681 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":"frontend/src/utility-functions/keyboard-entry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d22f7d624a6a1894e55212c208f58b8ee84a097e9c2eae79cb07cd9be98324c"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/layout/FloatingMenu.svelte: 662 lines of code: frontend/src/components/layout/FloatingMenu.svelte has 662 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":"frontend/src/components/layout/FloatingMenu.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23532f720ecb8c7305d3339be02061d869b0205bf0770345cfa4c9f7356c332"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/window/Panel.svelte: 651 lines of code: frontend/src/components/window/Panel.svelte 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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77803ada216f389cc5adc20b60a7a04c11c285976d964403e3969ec0201a602e"}},{"ruleId":"R3","level":"warning","message":{"text":"frontend/src/components/widgets/NodeSection.svelte: 499 lines of code: frontend/src/components/widgets/NodeSection.svelte has 499 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":"frontend/src/components/widgets/NodeSection.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18717dc2e93d497f31aaa751c97b7c5b92e65f54c7857364ea629dabb86bb070"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfa4ff7a40f6eb4c7b1477dfcc89de4dc7f868daa1a3168f00c4cfae39f5359"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/icons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b04a613b4765d5bd63e644ae2dce1e16782050e3147b72b117d9e4ec6fdf16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a93a8c02ec71e5a0d2876cae2b20df602ed9f067e03e66ffd4a5e7cee24c30"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54d9c9786b64c436943369a89e8c5f71824d847d1979048eb1d6703aaf52d45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/keyboard-entry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa03d3269b847cba6b4aaf4cf3ad2e3174ce8e18bcb5d4428dd6b6382927f67"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/floating-menus/MenuList.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"575498d462405cd7624e36e80e6bfe9692e484cd8f994cdecf2e499c2efacd07"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9abf22a7f9e43e5793dfdc716bb934169be5a7bf2b375999e07674bc9b927de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab670ea02b7b726a00984b7d6749ee8c76daeace15e71decdfaf13485fe3bfeb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/layout/FloatingMenu.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"759a7d74b1b9ef22a837182ef1467c0d88f0daea176948ccd05e11e0ab85d990"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/input.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de352ae82c26f1d80348e965a079165a6161780dee515cc09d06dbc12c65386d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e3483f4cf2a033a09ac0df9c6381191c775faee6826d28b21dfcdf5d98b009"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/node-graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e57a3780d110b0a457db2e58a409565f9fc8bfd72e08c42f961f31f217728a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/WidgetSpan.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"468fd604106a90e38ba176ad9d80db39b68c2dff634c4dd173bbafdd14450998"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b4002d4286db49f5db3f5fce81f6b07c23cd41206fb81b60505d7016073d73"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/TransferCurveInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b56b729ab8abebe041bd1df3dc5624a9ea5fbff013334fa593bcfb2ce41f2d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/persistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"786f5656884553ffc4119d46951e929a2021a9acce388915406ad5675f9084be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/colors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1416a41be88eb24682f242a618199e9ba8e81fdba4cb2382b374eaf6baa9fd45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/portfolio.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38b52507bf016b9ec03ccdf6adeb76ae548674bd017008701f2ba412d50dd57"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/ScrollbarInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e152be73609a49e066deca96cb069032b61de885d7321a8d91c5356d0748e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Inspector.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"847c34a278451e1da4730b97da9255d8dc4241577aa82263f392fbdac092c467"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/RulerInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba2a91e4e83ebcbec583bcfbdb3ec44409daabd839c8bd68244903e78ffdfb8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/VisualColorPickersInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9a6dab2e21ff82ba8718eb0e159a251fd6e983b7db364fbe8a4354275e0eee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/window/PanelSubdivision.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f7b5fbcecc37bbcd513f1479e1dbd57a2bbc6087890f494cf797b953ed09d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/DropdownInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7308d2b16cc1e7139ce6d73f18ce4a455241f906b082e6b7a409f094b64f96"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/decimal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ca5abfb2b98862240be8a70f6c4b7b91fad8775901f138b9671b23fb55d275"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/tooltip.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e907fd059903b88f99080e34c4fed64a837b8fcc17fa0856c5f4e254633208c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/drag-toggle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7f3a8f96bf261bed3ffb80b5de6208398df4bba31444489b45cb707f7daf0d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df27cce33d12681d32084a674cba55680c33efe35497846aa866790c34941ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/auto-scroll.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a4b1a54d5e1e9967dfddcd766c5f1c8fa4638bdcc16cfe967b1ba77a7238dc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/widgets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f85e9a4b3b55dbe5877f7285b23d7ec29863efadb92aa0f4084bb27202c024"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/WidgetTable.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d241b43cf64cd5edc7660a38554e663864f142314bc36c9befbdb64c5611970"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/color-picker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6575a1fc283805e0b081fc7866d73be9172ae9c95916cad9ad3fb91140374365"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/markdown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bbb8683983605f2977ff8bc28dec5e94be3e26d365ee9925456005d71b7718"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/document.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f137a0efbf5b1067609cecf641ea859ecd6e307a9ad3d346db93171acd82b0f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/FieldInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd6a1d3dcc5db7e36e510f373274e8aa2a5128825e424fe673ce5ce74ea54b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/labels/ShortcutLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae2243dd309209427633f10e62c6e3fffe57b852c6a703b8ccbd351abbe9a98"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/input.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db764ec86fc985065fb02fa2ede846f2521c1777ec4b6a5e106587f032e9b69"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/subscriptions-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52bd332e898dd37927985b5a4b8d5df56aa5bee729f1cb841ebb8c97fcd8a0f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/floating-menus/NodeCatalog.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d8425621c7adc98b63af28b99f49e0bcde0834626bc5891b63bc4488764f5a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/panel-drag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3eb0ce2cb3b332777e1ce972594d8b0b7ca6a910bc78da8b76ea6c3af785c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42595c5a49377d2601624c327bcd78243241680ef3ea785b27f7bc9cdf5cfdca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c524002805d36138abc4c731c46c432c965a29383b7feb81f755e0e47d95715"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/app-window.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b45f02db3d48dfcd035118263b4850f69539518d9332388fb88e37307749351"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/Editor.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af061e4ed78c6e75589d8226d9c5858e176a732d79cb3fedbc30191de261028f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/rasterization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c078e5578ff2710361d4338fbb8cd451854bac5444e97d4a7069fe66872eb45a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/labels/TextLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e78ef9324ba3000308763cbe808dfdfc8b4eb36c2ed62d90d39fb82f282b00e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/fullscreen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf455872d8437e0f9df6b04d296dfc201b463131507b0a5771dd1b92cd8b7b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/math-expression.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237c46db956cf3489367ac7b5fb9b9379b1612201ca0dfc1d3efb72d7b85c6be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/TextInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"655b3298bed855b845ff444c0bc0fc3fb207e3c786f13a21f1404123badc6508"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/network.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"312c23d1783c85b13bdd92e22bb5a5f4bb27cbfe93b619a6d7d4f13606060fbe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/floating-menus/ColorPicker.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5622419f7633e2902304744e2d87d74535c1594426c798f6e8c0cdada27182df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/viewports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1571bce73eaa84eb5e3128577e4af81ff6f98d104cd69a332bfd27e0c69e1b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/crash-report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a202f3f6ce92498dedf3025ccdb99d4599a442076c2a1b96314addd0a278d90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/math-expression.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d981a75a9b438dbdf173d54de42c35b78e8934168659c108f96c5dd6c8de19e0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/ColorPresetsInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d6f845a0c1e4c610bac96325a55f667900a1f89628b2db0741bdbacac06f19"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/History.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08088f401831f064fd31b817c0e368e0e3dfa7f83cbcdba1a591a6a4ac6396a9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/TextButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fe4b416d06ebadfd9cf935900fc06ec0db7563395e96cf70ef82f3e8c83848"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/persistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abe9c9c38dc7fa8f5f77d803b678324c9463d578481f2ec89f10b0bfa6ea056"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/IconButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d630781c7ef8d1c44b25b5fb70a433ba78452ef463593d597911b4cdafaf214"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/floating-menus/EyedropperPreview.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf43f10c80d3d2930038db4387b7c59350407cec449296ead867f30e4903d2a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/TextAreaInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ebc1b61fd125dcd07df723a2c447351a7fc07a5da83b1f659d6e99f42f0207"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/NodeSection.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be8c10ca05c29414f69727980f7b31b409914543c9c7220dafa41396951af45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/panic-proxy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f4a6cc082b776a6927b8374ebfc5070423e21fd8a09a97517db47c37e74016"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/CheckboxInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"accc5a0ebe5dd1548166498e77b9f0cf3726a204afdb70506c60b51b7c581db8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e134269233cc0095354513cbaea882372ce738d2eaf6d9ea36c688de169897c5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/window/TitleBar.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f26c411a6288589b4a91c33c01e5346bbaaf45b3cc12e0e8369a9e8090fa662"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/App.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3db0936c506479f69ce6422a8b315a274b91d4903c9f95433a73efe015f65b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/ColorInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab01dd46cc92abe579c8eddbbf0cdc8b1f6ca33962e23d4a860323604cf3573"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/panic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dc6e524f688e9612621463ba6df54685cace4b2b7e11298050141167cf55e0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/floating-menus/Tooltip.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"645e8346ab2af7299a64f0449b64b4798f39ffd13eefe55034149da3aa2e8f7f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/history.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c189c710db7e875dd0200a672fe0e1391a8bca5dc4501b5e26e2c51f7efeb653"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/WorkingColorsInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e59b5c7998ddde6aee2baf952509e4891d94585ef5f179b43524cf293b7768"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/labels/IconLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6c61d68175ddb173c784299ea5bf15d0efe7293c2c340f802c088f34dd202f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/platform.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"421b2f415c6c765683c92f26422eb52073731a6931ebc2c04b6b27d3d9c7d013"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/PopoverButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9750822abd2630b5bef357f0dcbd77412004c58615e56a69c39a0d6a90a38ee5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/images.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"128c4ef4316198bee0b1b9dbda3380357a03d49d74530b73f6f8decb6f824ccd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/service-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2448297d8d7c8f92f0e3a8ec43d8868eaf772fc0f86828b4e3f2a123f58274a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/localization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f40923972b9b34203aab280bba75ddc82c7eb018e5f84508060e890dba000e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/layout/LayoutRow.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2785a007f7c819b474764119fcb089bad2d5716e2f2461961c5f1583b21f7943"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/layout/LayoutCol.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cfd287aa13b5751abd98a5b9ebdfccbbfbc240c4b63de45b50455dada85f1c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/window/StatusBar.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16574724a9fefb8675cf5c7dd993d5a3064cb5fdceac843781352aeda10b1268"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/RadioInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a49e2837d9797ae163c25edcb4db7539f14815da5c3858316d4d59dc7bba271"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/managers/hyperlink.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48373135ae6dacf50c4d6e1242c60ffacb0606f17561b577cefe4ca0b58e819d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/wasm-loader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598fe4ff46a8edf435fbb388a4ed435c8032398374ab81325052839d9e9bd7f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/ColorComparisonInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8f389962ebb79e32c1e3a3fd1f51e7a37e70a0666bb5340e47740b8304a87e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/floating-menus/Dialog.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaf18d3012365f2e890f981c48d0f90ee8ab013af789ae5f62a050e13abf351"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/ImageButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e151c9806724475bb437f74bea6647a505acc6d7587e2b0d9c8dd5f94c0df39a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Welcome.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4799cb0b229c7c47ac8a92d23c39ddf2bcaa4bcf6dce1736b29077e6f418da9f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/views/RemoteCursor.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb31518498fadd0aaf6babde2251c438d32dbca78166482cc7725eb262098ce"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/labels/ImageLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0360f1d45ebed16fb4ce7b28e63b6104c643c1f950463866997394a923b9d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/window/MainWindow.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bccdb5483a8e0384ba43e6615b889a330c0844349b112391d3e9568e7ef8ba5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd22c9fb5acad30aaefa6fdd9184d65c807c78be518ede4c4a491b45bc8b3d90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/stores/dropdown-menus.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6e283e7118a791cc683816d4f27cb2ee85cab5c7fbc1ea4c342ce96fa5d7b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"126b871656299c33c586895d842f88ef9c63d12230fd7a0f5d3a52dea26fc207"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/views/ThumbnailCanvas.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be0d190f5dd6885aef0d0bcc6cd89632edcd433e8436f5df94eb34541bb4d0c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/WidgetLayout.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f33495e19af919615ec285839110c4a910c7ced1fea3ee415c80e2da1b36ca2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/numbers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"044c8ea0e3e62ce34d4939377eca24f9107b8d26d7b5dcc8e58ae3b72a6680f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/BreadcrumbTrailButtons.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b472a8798f745d223a3e80e691dcec90bbd2df11cc20632149fe1ca39bbf8a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/time.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25d6309d282b7e2ec5dd5a9d721abf72ffaf502c28ae06510b91ead784da55f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/ParameterChainToggle.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4fb9074ae41a4a3fc59e0a505c8bb23f2f2008ea54c0b5ec369cb9e8b54bc1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/buttons/ParameterExposeButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b88d2c267b944b54a0f94f50a83f0f0baddb256c7aeec274558255555986328"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/strip-indents.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8add045b14bab1a6e484c65e193eb0cdc969653cd1b7e501826a7005862e40"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/views/NodeGraphWire.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7d0f378d0eadb26a32da4fa0e919d6f2436ef31fbb29b545fbf606313520bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/views/ThumbnailImage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af7983cc706df2beb3f4e74a634929c19fcb8b2e0bac99bb0114797f84d0f1a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Data.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc77f4b94e7ce0b2d933567ec0fe09977e94f7d16df7f146436f556c99b3815e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/utility-functions/layout-state.svelte.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eab86f53fe3ace6392cb04c7cd785c6f9897b736b0c29517813b60dea4f9554"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/widgets/labels/Separator.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f8853cc29731c344635b4c3f49e4392806ed1f74d8b1c94c9d52c373e2257d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/layout/ConditionalWrapper.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"925971039c34c6e45f8c8de25b686867def849e3036b95a67ca3b46df261ccaf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontend/src/components/panels/Collaboration.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"127b919bbbd7155ca3630ccf6b911783eade229efba7ea0db3d27790237b8368"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1146 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/panels/Layers.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f900349dc5014aba84091114dd40a0cd5d31b771caaa7dab34c188851b643e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1059 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/icons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4242b494b1a9638edc71fd05c6d772e4116c6825e65437faf37cccb59de9ca3e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1056 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/MathExpressionInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb9053946a78985dc99fdc3aa9034b89ebaf7ce30accb29d97f1406691d0218"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~963 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/NumberInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e633a8f6d49da7fbb92d5978e251c51903138629b43e9a53746d71fc391c5f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~739 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/keyboard-entry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"669b6fd6013c7429afc4502bdf53b71ae34bdf37df7651ee2818a04307781a87"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~679 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/floating-menus/MenuList.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c44bfb99d34958304f2628c254ae36b07701d9bb86064481cd514fea37209"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~668 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/SliderInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a20690c971785b1935f16a36ebc8dbbcd9d310aa9a5d8ccfc67adaa861f2c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~602 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/panels/Document.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30b54b4291e03b06cab0c032034209b67e47a8462db2758a0e8f773537a9f88"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~533 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/layout/FloatingMenu.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cefa77f5a864ab72cc487c829de2724cac7cfb2cb7e97d237fda439121b89fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~465 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/input.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66718660a80f4ea9eb74c69774fc06f2379ed402f0af8d39b3e7f9d7e2d07045"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~392 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/window/Panel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba013757851f41aa491c72a6490218ee1e1f9d5b2e5293ce2db2621d556cf63"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~370 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/node-graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaa79396cb0be5d93b6bf73ea682b51025cde488ed8c3dea3d2d7d593c3fda7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~360 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/WidgetSpan.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d843fef1cd4328dde695770cc24dfe77ec1917b45e376128108b531d834973c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~336 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/views/Graph.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb30dd94c9474cd9c282221044c1f016244f35d5e6809c61a72053c9a31eeeed"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~299 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/TransferCurveInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2a07b7414d13345f1f175312e0425c5cfa8f0a7e24b12a71212cad3cfcd357"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~281 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/persistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"290a67e42cfc54247ade586c2254f012dca4d7c92f03ea1754a9c144bf165938"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~227 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/colors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0e45fc26c4255bfff46e08b2d78cfb41f2e0f16c0e0a1de07c2ee56d6c0aab"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~223 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/portfolio.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edc21c2ba671e2c2c57890c59ae492290629d38d30e9dadf8454b8642e53104"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~206 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/ScrollbarInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b5fa5d2daefd8445defa4a8912ecbee958b3ee64bff686e4d42455f3308d44"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~202 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/panels/Inspector.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f94ee15190327bfbadac386500806059132fa9f52de491f65abfdc9b2add5fd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~201 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/RulerInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c7e8d1bc00c620bd3b17659b46294879dd81bdbb271aaef5077f139560f750"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~189 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/VisualColorPickersInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"badbe09a07d1b26486ff0153820fadb91b8cf71ff90436035a82352ed8db0a36"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~187 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/window/PanelSubdivision.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78701fdc1dd010107eb3423146c86993dc6a95960d0b648531f1fa44fbffba14"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~173 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/DropdownInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"078c7fa1078b706187e0de48b412ec53a899cddb6c3b613a62df7d8aef41f37c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~165 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/decimal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"833ec7ed84b8491330f8f6d389ed5a141480ccb0e3876a9eda20ea41fb09b736"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~147 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/tooltip.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf76c5158f31700008e6ca96932182e7b48790b4e21311d697c15d810765f9d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~134 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/managers/drag-toggle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4709b4da84603c2aa2785951900eae55c5e0cf19ab9ae3784a9e95327851dd9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~132 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f135dc1d5513c86e8876e1f69432a4ca285ab37a7a33c69d0c3dbd77211028"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~126 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/auto-scroll.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc0478e3806b1c7678c26f0fd0bc658f71895f65cf7048ba0659f7ce7b8bf04"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~124 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/widgets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94179f59f0202b41af4bcd5dd57fde5feaf3cbfb4f7979d656a6dfef50dd9098"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~121 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/WidgetTable.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ed984ed19b0de852985ee15a2b8fa18be7f79b226cd19cad8959f091bfcfa8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~120 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/color-picker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b4a04b005e9a7d8fde91e58c0f549ccfbd5eced43dbf49a2b8b7abe981bb00"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/markdown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89e014ac18b4bf3f143f56ac0965d50f2abf35164d54ea1e59026958eaf2727"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~111 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/document.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd708c4559cb78c96fcecd8838b40337ba4cafe7b708b188f974c0ff0456eb3e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~107 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/FieldInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f0fa3f30dba0a6b241bf46c2d6af0ea34e184e0a99e680b028c50c79dc564"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~105 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/labels/ShortcutLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8de62ce3f3470a955f0ae4fc62bf236bcb9d41294071294214f8b80a29c884"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~102 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/managers/input.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ba713ff46e0f15d29710e13e6fc2dc14576a50a58e4b0084c77346fcdc3247"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~102 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/subscriptions-router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2752ef368481b065fc1964ab23d18912c46d2b0f3605e1bceb35959dd47ee4f8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~94 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/floating-menus/NodeCatalog.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f388ee1899aa025711ca3a683a2dac17bc1e959866e566ba457f368facaea0ff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~91 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/panel-drag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0507f7ef270d2138b9734c70fcc4c67bd170310e4db2608c8297d3f56fad19"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~91 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0590d61b82cab948252d6af7b55e2765666444b58efe324571b87ecdba25ead3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~85 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa54f5f959130c7e809f02bcab2fa96d36de50bcaa9e39b079c2377cae6443f5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~82 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/app-window.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b7403093510cfb62eb8b32ece793f590ddee9038fe6d2491bb3e5279006f6a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~79 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/Editor.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85727f1e367b6068c2469e84bb43f9a0859554c5252beab85399f17a1ed432ed"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~74 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/rasterization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f647b01c56b4de5cf42c91f1eba6415dcaa21457638a1d48560df9635b0f1f7e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~73 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/labels/TextLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb77e9110fee1d04975a28cd871c147b79f01c46be8c70dc4e9813ee8fb3284"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~73 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/fullscreen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e9f0ed200cafef7f5366bbdcdd5d09e196571892dbae7cdfc61ea587536567"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~73 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/math-expression.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f89c3edbccc31fa105f34e6db0707cdbb300dd5727d553b3a7e7cdb35d3e63"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~68 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/TextInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f4598f5233d3eb60326a98b1869b29838eb08db290edc6feeba6fa8f2a835f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~67 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/network.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7244963df631f05afd722bc8559b6391aa461edd441f5a2602f67e3810b55f5b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~65 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/floating-menus/ColorPicker.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea97c975e6399710673c121bb4a1df0e64ffbb099807d2052929cddb131e532"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~62 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/viewports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a8128398a062cccf84d81df1fa93c95f4785e16b96a49e62f4cc8fbeacb7d1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/crash-report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c143defb648081d2fced926e5a32e4afe1e72a33c3d751969de6f956d3c5042"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/math-expression.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf6385707a36aa7ff48befbadfd99be58b27ef938267ab5b2b3b00097716a42"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~60 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/ColorPresetsInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9509ff36a9a2e4d320e6b919063e9c4990dfddadff6e1c2b45dac707c08615b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~59 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/panels/History.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"553906beb608036f3326f14daa955caf32bc08bf225448c9f2560629bbd53189"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/buttons/TextButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61dc68ec89858bc24cb722381be0d6da903f434d8416ca0fc67bd17e30a73c6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/managers/persistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f1742b727e87d207e487c1d01803a27027d3395a604dd905548b12676d914"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~50 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/buttons/IconButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"625f9f9925ef4072c9ad9e08045077a1e55a8868a5526afb1830833198645f90"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/floating-menus/EyedropperPreview.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"803175ce6a1b82b36f2614cd66f23ef65fd7be0e532c11c8948e9526c661cd33"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~46 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/TextAreaInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d2940e8c973042e311413c996ace9586da3ecc23e5305c1bfe8fdfa6a0eb4e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/NodeSection.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f172c8874b0adc3ed23a4e39421c69e6836af85b73c3693d618590b10d0a9e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/panic-proxy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2ac6f6280c551a51dfac3951f6ff423c9cec88c7ac2044fa831934c466f53c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/CheckboxInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d6d92d9a343e7aa6c7a50f888db1a714cf46a4a560a4aad37e6a1d7c96191f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/managers/clipboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1924bc97702e895860b55e89ff31907fbcbb419732921498019886baaa1e79"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/window/TitleBar.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdb71b27934585c1577615978a359179f0007b0ea8c3816a7cca36295c5d41d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/ColorInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a0b38e2e67620888b28c1dfcdc9d57943564ded4157a7ea586a38cb08313bc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/managers/panic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"978a03ec8e36d7450667d73cf4b4f97bddbf4d0a55f597f75caadf7811a821f3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/floating-menus/Tooltip.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb88a311250d2e90a5bc86cf0c25b7d79b874a7ca92488f6e26760e801f28e5f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/history.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"845533344d87b4bc341785e39333e3cdcbbbc1279e0d757356f9f83c78a4748f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/WorkingColorsInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf5cdb698269e3deebba23c691d8bdd7cc6a22bd715052aea170930931938cd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/labels/IconLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1a65daf6c6a6090c33e4b4d7102a1a6eca42586bfc93d8c8aa319db9a0930c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~33 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/platform.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ee49fd2173e8b461eab6450d4534c2af9e0c3d350edc4c5a2896b35538b78e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/buttons/PopoverButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f617f4a7d88357c090fceccd9690584be82a24d7b68d771fa981212e1e89afec"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/images.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bec56654004ad8a43e8f71b85b818f158a4083e547b300c1f543d110ebada6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/service-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7481fdecdaf52d5dca819c5a43024ad218ca9e0e391b14fee660c830f9fe7f82"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/managers/localization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c0e5e59d65de425830149ebfad111f53f006a66b67865971c55038e56e00cd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/layout/LayoutRow.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdd5b1c838f0bedb90c101283fea73f4e14858a87e394f132ae4c98ba892d95"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/layout/LayoutCol.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcce1e28c6b573ee222468c203e6468be5f0db75873c0e84450bc698f171f64"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/window/StatusBar.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbad79b84cdda623e94e5e47094453f9ba5f37e4bd1e7e012b56c765a66e0e5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/RadioInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2171f1579c150697fc93e49c006d4bf37d87f287ede8e04ddcd4193632b9c599"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/managers/hyperlink.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe4e87718d3656b16380c35d778a906fdff2bd4b93ebc0987cf663ca68b3218"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/ColorComparisonInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1383d1a67e8ba9c87ae44f6a1c4fd37184db96e6f5da168ebf7a1b552e2609e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/floating-menus/Dialog.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5008e4acec711d2ee2cda82e05633f431906801fba1c8c2c05ab8df0b879b275"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/buttons/ImageButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbdc0c8f774bbd159f4a21df858614a6103b09338194bf26bb70592e3ca9ae5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/panels/Welcome.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e5d92b39f4af85570b32c884257d6226357daa6bb3913c4ff3b311895b007"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/views/RemoteCursor.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a5e0d103516bab873f9115d40f7e0fe8ec9182aef3e446716c1ce647ce4780"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/labels/ImageLabel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb1ca7fa26a25afe6cb59544898df913a6d54e325a7fc1e7d3163f39c8aa87a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/window/MainWindow.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7a1e8945de513b8d9e6498b026274e8a1425ce01e9d8c4ea5978f2937547d0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/stores/dropdown-menus.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"996faeda5f96cda339a697b9df5948760d5d6ef2b6a8c9df70ab353a2d103e9a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/inputs/ReferencePointInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5311a023e93019c5908a81193abd3ce6745822f084c29170fc07ad20644eebe8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/views/ThumbnailCanvas.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95af464b7fcb99e4a509f55f6006a839b1fa6d26375fff2f977f13ddc5606c41"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/WidgetLayout.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c736db0d21302f120dfa6894c2d2494dcc4975191e44e1dce866c4b0d6445f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/numbers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd0275d918553d2752dec5cf8398a9260203af84299e0bb8d062afcd799e153"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/buttons/BreadcrumbTrailButtons.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af571fce41d3e700c89fc38ab1af6826b4b4d1d888b2b76f7e2eff7bcd09e0c6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/time.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db80006ae4c765b0085cf97aabd40690242fe4f9ef81a91356db3c9f5deebd38"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/buttons/ParameterChainToggle.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c2b1d4ef38203fb9ff5a05953fad8ea5cb482a7f13a35d7242e868e7a21afd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/buttons/ParameterExposeButton.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55de3afae914e6598460063b66e7716f0ab42e7e23d0adfdd5938e8cefe5dafa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/strip-indents.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88521f9d1e5993d992c18f3657fb375e93fb57d47bbe6b5c23d75d991875dbf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/views/NodeGraphWire.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd3095c55669d3a3107c34f2699f79c175b4d3957f7d9e7fc47436a8a127d2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/views/ThumbnailImage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6561648d87ce3a7623b849293cfa8dec93bbcd97ff2ed75c3d3ca5bb7037c8e0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/panels/Data.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c4371a0947a2065fcde63cb5e66f3b736abb637bb3d21cb2b94ce83c736352"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/utility-functions/layout-state.svelte.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c12fb9ca25271d75b17b4188eff0ec52653b73954778cab8fe469aaedeccda7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/widgets/labels/Separator.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6361e2142616af91b0e0a6ae49bf289e39e6811e44489e072af6d335826f524"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/layout/ConditionalWrapper.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba38ef19875893642cf5a93bc7ca54f1aeacb8fa2581fe344199c1c246d5bb69"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (6 application, 7 tooling, 2 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":"frontend/src/components/panels/Collaboration.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4868aa32c7d434a601c5050572a237f8d41ed7e61cd72eb871e283d4891aac"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@fontsource/stix-two-math\u0027: Declared in frontend/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aed9a34fc59ca96fe5a1b16ed34453e196a41bf60c7e3f3f17333cdb6b771247"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027license-checker-rseidelsohn\u0027: Declared in frontend/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"421e5062d714c6f441284adef438342e7440f3e005f6795f68e18cf9db55534c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027source-code-pro\u0027: Declared in frontend/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c7d4ef960cc114f69e9eb85eb0349d96fecf78fcc75309df681df5d50a200eb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfa_pattern_width == 2 \u0026\u0026 cfa_pattern_height == 2\u0060 appears character-identically in 2 files \u2014 libraries/rawkit/src/decoder/arw2.rs, libraries/rawkit/src/decoder/uncompressed.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":"libraries/rawkit/src/decoder/arw2.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1d8a21ec02e98ae28b4ff0d4c117652336b0d2ac45e42f735d1626821e641d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060coded_size.width \u003C= 0 || coded_size.height \u003C= 0\u0060 appears character-identically in 3 files \u2014 desktop/ui/src/frames/plane/linux.rs, desktop/ui/src/frames/plane/mac.rs, desktop/ui/src/frames/plane/win.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":"desktop/ui/src/frames/plane/linux.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0449830b9d4f9b6249f52438351a09e8064531b444949f0cffc46865d4131b91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060in_gesture \u0026\u0026 self.fsm_state != previous_state\u0060 appears character-identically in 3 files \u2014 editor/src/messages/tool/tool_messages/artboard_tool.rs, editor/src/messages/tool/tool_messages/shape_tool.rs, editor/src/messages/tool/tool_messages/text_tool.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":"editor/src/messages/tool/tool_messages/artboard_tool.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a001831aa9a16bc83069bab3c31418fe145af79f3a6af4198f2fb3eeaa1855"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_dragged || (pos - mouse_position).length_squared() \u003C BOUNDS_SELECT_THRESHOLD.powi(2)\u0060 appears character-identically in 2 files \u2014 editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs, editor/src/messages/tool/common_functionality/shapes/line_shape.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":"editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dac26cb96ba9093f7f9b118ec9babc3cbbae8072a89a003f9c384e5b3cecd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min.distance(expected[0]) \u003C 1e-6 \u0026\u0026 max.distance(expected[1]) \u003C 1e-6\u0060 appears character-identically in 2 files \u2014 editor/src/messages/tool/tool_messages/select_tool.rs, editor/src/messages/tool/tool_messages/shape_tool.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":"editor/src/messages/tool/tool_messages/select_tool.rs"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb3a66082d5ea1016703427c0c825f56615575e0683275f5eb730955a8d1a79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min.distance(expected_min) \u003C 1e-6 \u0026\u0026 max.distance(expected_max) \u003C 1e-6\u0060 appears character-identically in 5 files \u2014 editor/src/messages/portfolio/document/document_message_handler.rs, editor/src/messages/tool/common_functionality/resize.rs, editor/src/messages/tool/tool_messages/artboard_tool.rs, editor/src/messages/tool/tool_messages/select_tool.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":"editor/src/messages/portfolio/document/document_message_handler.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaacbeed5c46a1a542d0fe4b85d49726ec63f04fce44f9364fdb857a95ca0563"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent_has_fill || item.attribute::\u003Cf64\u003E(ATTR_OPACITY_FILL).is_some()\u0060 appears character-identically in 2 files \u2014 node-graph/libraries/graphic-types/src/graphic.rs, node-graph/nodes/path-bool/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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e67f5aaa55c02d742df127aa8617a59988f112daf92b330df1f6eb1ce51f13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent_has_opacity || item.attribute::\u003Cf64\u003E(ATTR_OPACITY).is_some()\u0060 appears character-identically in 2 files \u2014 node-graph/libraries/graphic-types/src/graphic.rs, node-graph/nodes/path-bool/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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce7a0e26f5f6fd939957d8299637c40e384b9974bda329e7d9a8cb6e90b3f1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent_has_transform || item.attribute::\u003CDAffine2\u003E(ATTR_TRANSFORM).is_some()\u0060 appears character-identically in 2 files \u2014 node-graph/libraries/graphic-types/src/graphic.rs, node-graph/nodes/path-bool/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":"node-graph/libraries/graphic-types/src/graphic.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cff7481416edf9f2abbfc3e1892d0a1bcafa162e7a05debaa5fcba41c2fe68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060point.x \u003E= -1e-6 \u0026\u0026 point.x \u003C= 10. \u002B 1e-6\u0060 appears character-identically in 2 files \u2014 node-graph/nodes/vector/src/vector_nodes.rs, node-graph/nodes/vector/src/voronoi.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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":4244}}}],"partialFingerprints":{"codehealthFindingId/v1":"706dff41c72a619b3c693e32c7af6b83683e47955eda2e9ddf9042760315ee93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060point.y \u003E= -1e-6 \u0026\u0026 point.y \u003C= 10. \u002B 1e-6\u0060 appears character-identically in 2 files \u2014 node-graph/nodes/vector/src/vector_nodes.rs, node-graph/nodes/vector/src/voronoi.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":"node-graph/nodes/vector/src/vector_nodes.rs"},"region":{"startLine":4245}}}],"partialFingerprints":{"codehealthFindingId/v1":"12711757c599c58aa5c5e26f17fdf3f0764107a99c4be4a2f3575954635aa3b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.all \u0026\u0026 self.anchors \u0026\u0026 self.curvature_comb\u0060 appears character-identically in 2 files \u2014 editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96fc77cab1607ac906409c5435bc790b03a218e0f62da1b037929377cebe778"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.all \u0026\u0026 self.anchors \u0026\u0026 self.handles\u0060 appears character-identically in 2 files \u2014 editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3f439481aa03b3389b512be2491879cf5f78484caf1369548b5104aaa38e8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.all \u0026\u0026 self.anchors \u0026\u0026 self.path_direction\u0060 appears character-identically in 2 files \u2014 editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"902260227e704c579080c90bee6466a7ca31b8492ba11dcaf7cd45e272c66828"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.all \u0026\u0026 self.anchors \u0026\u0026 self.path_ends\u0060 appears character-identically in 2 files \u2014 editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9841baa1b148c61dea853dd0638d38c36d767f8268e3bdd39d5e775d29e3ee53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.all \u0026\u0026 self.anchors \u0026\u0026 self.path_index\u0060 appears character-identically in 2 files \u2014 editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb024ace23b8b458d1bc525fdb632c3748acface055cc88978d1209b54ffa6cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.all \u0026\u0026 self.anchors \u0026\u0026 self.point_index\u0060 appears character-identically in 2 files \u2014 editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a6d3632939be5302ee6534b31f5dec532655dd63e2807f26a6c17c64a7fea7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.number_of_points_dial.is_dragging() || self.number_of_points_dial.is_hovering()\u0060 appears character-identically in 2 files \u2014 editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs, editor/src/messages/tool/common_functionality/shapes/star_shape.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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc84ca957adcc70eb2581dfbefd5a807e62dfe39958e0e4d7ebd129049786a06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.number_of_points_dial.is_hovering() || self.point_radius_handle.hovered()\u0060 appears character-identically in 2 files \u2014 editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs, editor/src/messages/tool/common_functionality/shapes/star_shape.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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c4b6672491e554fe799ae2319c2513ee98aca26e2d04c87035d9eb211e9fc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.point_radius_handle.is_dragging_or_snapped() || self.point_radius_handle.hovered()\u0060 appears character-identically in 2 files \u2014 editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs, editor/src/messages/tool/common_functionality/shapes/star_shape.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":"editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cd287d18c3de3c8d18b6afc1ecbb52f753578df5e0d64d16083d3db766510d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.selection_mode.is_none() \u0026\u0026 above_threshold\u0060 appears character-identically in 2 files \u2014 editor/src/messages/tool/tool_messages/path_tool.rs, editor/src/messages/tool/tool_messages/select_tool.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":"editor/src/messages/tool/tool_messages/path_tool.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b10d54e1bd7bd02ae1bb0f75c4ebfbd7250e0345050dd61672b0b5ad2be0b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060staggered \u0026\u0026 topology.supports_staggered()\u0060 appears character-identically in 2 files \u2014 node-graph/nodes/vector/src/generator_nodes.rs, node-graph/nodes/vector/src/grid_topology.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":"node-graph/nodes/vector/src/generator_nodes.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"437f6b02f31284d19bbf84b5745a01d26e614b49c36f262ba1a4fc4ebf563f48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060translation.x.abs() \u003E 1e-3 \u0026\u0026 translation.y.abs() \u003E 1e-3\u0060 appears character-identically in 2 files \u2014 editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.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":"editor/src/messages/portfolio/document/overlays/utility_types_native.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f726616054b3ab28b44d31f1a99de5c8817f2c48fe8e7eff2e6483ddc9527b9"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/3 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: fetchJSON: \u0060fetchJSON\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":"website/static/js/page/contributor-guide/bisect-tool.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3b3e1211620ec8ad8e3ff5b4a6c2b0c881037c4cd50c6cd8820284a4c57081"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadDemoArtwork: \u0060loadDemoArtwork\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":"frontend/src/utility-functions/network.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c29626106ee4cdfa142b494e322efcde4172459e0995ac6520c81d0afcf702"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: initWasm: \u0060initWasm\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":"frontend/src/utility-functions/wasm-loader.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7e2381c8188b6d2ea593271a9ac74152f1e7b799a3a15c979ed7f6e2aed9b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 32 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/delegate.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6f4be3c9de9065e8d6cf29aab76ba48dee003ec597fa3f386591f79d25a939"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 13 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/dirs.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ea441a41b09c1af46d871cad7603cae696bd36659b736a2e6fdedcc34f9e6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 41 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/dirs.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62f133e0841d3c972505c3c34df3f213b15a9588716bcdb8ae0a040f6a1ede3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 73 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/ipc.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6d7601581c1dfd005512c0d317f6b54279d3f8e03e993b8f2931d4370724a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 29 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa414b53d0885de7d226dbb14bde31d04ed68bf523906f4bebffbc845ace1483"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 38 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/resources.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b8444f1f8f2bad4da49e84aadc6480f5a6556a0dddd3fe51b7d9f3d2d950a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 73 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/host.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46023cbc1dfe5b500df3264fda5f14772d2fed32039f400e261de9aad96b941"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 105 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/host.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f841fba16eae351ee7f94973cb5a6997cb7f045c9dc25ac484b634b9ba1997"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 41 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5741af73ee9ff629bfa2640b0431d4d95a6c40c18ee1516dee8437318ee9576d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 105 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5213d1056f4e9c30f4b4e33e3c0d74079ac6e0e1b6bee24e864a38c41623bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 122 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52397fc9e59bc20c6d23bb5a52c0a8d5636a4e87712a741ca378ac27b49a7a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 148 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d52724afdc60b6615eaff23cd0f5f6d702a88b4565e6bf251184f04e377b3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 206 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b38689def18a28b21746fbb9e7e4e56d339e57cabdafc5ef935f596ffcf83e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 279 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ee2a2b86ec56fc9ccafe224b64b93473717c9b2e8f7cca9092b4834787c59d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 299 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d72a38f47305796a5be172359bc2533cf2e6adf702f9bb993901ef72aae85b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 345 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/remote/spawn.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"121cc7c0a19bb52b94c3712a7b4d4dcc70a67d501607c9de1c7408dc856d3479"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 61 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/platform/mac.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce0398a1cd2f0f39f34934bb1b5771208697c9e33d738bb62599224b4f7eb1a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 117 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/display_handler.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad08c3b4711c3e0fcdb9e89df483077388d5d74d57c2784fa3eef5c0eb7dcc5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/display_handler.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87c6698984fda6b09cbf8cfb4883a4ac803cadb510050f788f839d55c0d452e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 119 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/display_handler.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c813e1c752d5ae4b7af5f36f4f0830d7ca225a72faeaf1703bd3ad3d88cb49"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 120 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/display_handler.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b97bb1be5e107a670b398c4b4b00ac79d46fdcc7bb447f87a8a588ea744a1a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/display_handler.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2089128e32568f3c44dc69b15a098bac40b40cbafeb7b5ff31824e4f3b04850"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 32 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/life_span_handler.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a9d51977e934c2cce6f4828b962630cc0563747a6c4c8a00ac1380a79c8ba1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 78 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/render_process_handler.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb243a54a8f1efd8473df8354e49ab975f8430a6ace83ab06a26a50f685c4b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 54 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/render_process_v8_handler.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02dd94e2f1fc06ae986c475a275ae57f888f0ca579146cf60e780dacf18f5f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 31 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/request_handler.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"375f67e09cc791f876d88f3ab3b3ef7c8a85f3a51b27eb416a251920bc10eac1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 64 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/request_handler.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf0e4e042907b2c914943034f26787a5a6d03190d21bee2c762cd40f13eec0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 29 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/internal/resource_request_handler.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3109275e14c910172566c0e53e6b87c9644893fc26f076f25448a7b84c51d9c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 31 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6784ef55ba84d686de6259f73e1b4cae4507fcf92d510a1a73ea5165ef21600"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 53 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/receive.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"08645b488b3ef4f130bc9b6db558819e4a1c6204d1a72b328114dedebb3e56ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 57 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/receive.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bdda39ecc629afe9c0212402d8ede53f9412ea7dfa5d7aef0d24f5874dc29f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 120 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/receive.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b89fa2dd03493c2194658ad6b7eb26ff1b1274db4573717d11619a5a1fbb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 31 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/sink.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e96d7fb18894e56c5d8dd7263fe80d46cceb0c7872e66c7d6f7df8a4326a122"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 40 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/sink.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbfe6fa95dc7201ef44d6cc990b27f35129fcf797562ef976d426a98a1ad527"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 123 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/streamer.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fc72d9e7917a22c558cfedbcdc3cd5fdaa8c595f334e5f015eb08ef07da478"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 127 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/streamer.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"96613567ac41e1361ebd9556e83c8e3228155f5bb2bb562f8f762dd633feb5e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 140 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/streamer.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da55927e4df8d4e9df32086cc45e9865448c14155695c56989a59f53654ddaf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 151 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/streamer.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"63079b02aa45dc360dcb1f79a38b469102007b599ba0e83ecf68aaaea177fba9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 85 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/surface.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d84ddb13cd078d77dcdc1aaa13edacf9a93e5e9a5ad4808b3e9d4c64f9223ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 57 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/linux.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddf1de79987a1fee88d6c17540b7458a15afe14df4390771fec0e8fcc3df2dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/linux.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e166fb3ec313800b9d3bd6e3bf2982aff5bfe36727dfc87632d3a89ad537a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 79 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/linux.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ee356eafd261cce7153356cf707934812cd2c9ae3fff06325876e577491d73"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 112 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/mac.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd98c1a3db6668081da91a15136e53f920689061871ac693c7a64c328aec6a93"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/mac.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b158d77287d5e2ceb6861e4b2645db281bb40856151a7870af65847e23342389"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 289 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/mac.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"017f0eb28dad689a5a04190af704b7123abf847bde130b8b85b201fcab2597cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 36 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/win.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"34071001a1e1ab20ec0db4fa15e7658373673bb478236c0ed5722afa07585e5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 64 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/win.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"843dc1e36f4169dc099d05195f67af49e50c302b1e5422b2038180f9d3b41830"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 73 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/win.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ed8a9be0e1d7cf0500f8709be703df864fb4fde10e2997321fd35557ddeae1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 80 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/win.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a8b32e245d4bcb24a59636e6075824c27a1af209513bb74e099163a5580b84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 172 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/ui/src/frames/plane/win.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"277dfe633590101fc89711fc911f0d4a00e099160dcbeff09bb8fe0730235078"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 172 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94d80788d9ed6527c74528d96723927f005a29f32d66f16cfa959838c30d7e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 292 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e8e39506ef46c4d298e634682b36d7d163360fea0e689db50de908aa3ee1a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 298 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3cfb239281fa10d9712b255d864607acada999bb09c5306c4701d78043b315"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 434 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b160c6cd3c74d069f39bab5368ab87708f4b6f1bdffc3276ea30fb2079651a9b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 502 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9979b4d1b7bbd21c60cc53e7187cf799b286544ac09b43a60e1fd7f78130e081"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 507 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad353832c38b80d884bf82056eed39ca83f298fa6a143fb0aa6a1c5d6023fc4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 540 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea203b9ec078cbb14b343fff2f290d30041e641be31a6ae014ee8149632af701"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 632 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5ed6e30dd0126200eeb12104188ec15864130110b88c507fcc49151c6dad0d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 654 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d2ce63952fd314e3ad02c5b15ce0fd1fc5ba1559b2a34f7feb46b085076d9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 659 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/app.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27c09bd4f134507ccd5f0e3bb001094bf228e7386d0a3cb4236faa10d1a561d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 52 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/data_transfer.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd356ac3cdd63af9536f0789395162f40eaef9cedb7c0bbc7cd29baf0c58bc05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 109 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/data_transfer.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc4d2a6e985ee5ca3495f93390bcb41e1909c06f0d8776de25eb1dd4f01b359"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 14 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/dirs.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"733f94555c4e07c82b01ed1bc9984c61554c7c3aaa7deed60a5278341f7e097d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 21 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/dirs.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdc94925e9c16459e7e54eb73dcf733446304f1f3442c6a2fcd5f560b10aaaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/dirs.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67d30db1d6c36a5955f8049d6d87d81cf6606041ac2637265b707e6e63c33b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 10 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/gpu_context.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ec38d96b012d93b5dda64171aad7ba405a3efacaa432c9197c8a49e31f0c5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 69 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb98f392814f1841ef6a3080f9417e20f016c4012e00da099bd0eeb31996d55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 104 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/lib.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b0a21732ced866801e846f77c4490af613c3a22a7690cbdffac73bbfb7ea21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f6fcc50f908f4992f456de1e739c586063e2bd3af6fa122547400ab1bc0ab8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 131 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/lib.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c97b3efe432bfa804944515f7dd69634b082fe39d940dece50c5d25f3345543"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 139 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/lib.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"96251a19e448574772e8271d7894c32b596308f7d94e2f987183a20a24f88a90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 5 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"717dc50d5fe932a63eda689597b75b02487933bb0654a14bffd9bf267ab68d4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 11 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"67507fb42f83f0b450cffd98d7cead9481ae8933f64b5858b29bf49396eb4cf7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 15 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"676ea05d4bb3b133a3fdd35e0fc74b94b4f888fe6bf42fcc8889b3357bdddada"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 22 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e98be3fe5c8f9505291c2a910e0370b200c3e9d8e724535f6b7aec6fe1eed0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 33 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc117c39d8971b11039524f91c45d90c8f4e5b47b07aa9b1ef34d5739a078eaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 38 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9d87c56a5d02b808495c05531e405478f344ecb6b249ea77f65d732e2c5f7b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 60 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0155e94337e0dab12374745585e31c2c8603c49da0db71c15cac5dc266cc7288"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/persist.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f423415217fc31af9475e0d134284589f42d12ddf73aedbe62804f2c27ab2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 36 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/preferences.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5887c493f712c38b206f49739a9512b22df5c4c307ad7b3cc86a1cbb85eb4a2e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 66 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db20f52c1b398bc453ca50297b5669726c218a0115e88ee8600b6d7c173af4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 97 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3249d9cd281b447603908de378db6b17f87171b5963857c701158640ce698a44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 103 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6965348e1d89fed3b42671cbb67287527748406fbbbe57ad42c9dafc814262"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"529bfbc643710b7472be4d9abb50464814dbb942fdda19b6a3c807617c84e0c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 112 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/socket.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f345928aa24d3f791d89a4d6463e3a639ef5c42c603bb5ecb6c0c12274a38e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/window/mac/app.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"526e0099fb68905169804d9915f67a73180a69ed485d3889379dcc485ca0ecd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 247 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/render/state.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"21501dae0a47e3e9ae7414a126afaf096cd065622418dc3563b10d748b11a636"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read\u0060 turns every \u0060Err\u0060 into \u0060Preferences::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/preferences.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b26e8327d259de30b82e4720fc9426c6226673a3adba02c853840ca75e16b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060output_description\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bcc2efdcb43cbd49a550fddd7d8bad6b292c5bb7093f30f19fb5c19a158c88"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-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-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.html"},{"id":"CWE-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-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.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-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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":"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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":112,"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."]}]}