{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"find.FindPage (cyclomatic 99): find.FindPage has cyclomatic complexity 99 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 82 belong to 29 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":"src/renderer/pages/find.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"273badccc3176f895dd951559448c24133ab3f0a9c3c6623f762b2711ef1adef"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportPreview.ImportPreview (cyclomatic 83): ImportPreview.ImportPreview has cyclomatic complexity 83 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 40 belong to 12 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":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4363d66df5b0f7e0492e1461d6efeacef5c6598080a8b06aabe5377d5d456c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.RightPanel (cyclomatic 60): index.RightPanel has cyclomatic complexity 60 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 31 belong to 13 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":"src/renderer/components/RightPanel/index.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d222be222d2be676546f596540de4012b3e3ad435b54c4730f952e7b13779a5a"}},{"ruleId":"D1","level":"warning","message":{"text":"switchhosts::run (cyclomatic 42): switchhosts::run 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":"src-tauri/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"912c4009aaeeeb2edbca3fce71ea4c5f71daad646cf816ca527f181aa87fdfbe"}},{"ruleId":"D1","level":"warning","message":{"text":"History.History (cyclomatic 42): History.History has cyclomatic complexity 42 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 17 belong to 10 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/History.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dac19a0bda3d8fd4aa7e6fe863d9fa145a9be9676790793851c6290f0b9a221"}},{"ruleId":"D1","level":"warning","message":{"text":"index.List (cyclomatic 42): index.List has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 3 of the 42 points are its own statements and the rest belongs to 15 function items inside it that branch (applyChangedRemoteHostsToSystem, a function literal at line 171, a function literal at line 301, \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":"src/renderer/components/List/index.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0d8961a5e8b0d0804923e7d4a78c54bc7d265e1abb3c4db0b5dbdd3e18b04b"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpApi.HttpApi (cyclomatic 35): HttpApi.HttpApi has cyclomatic complexity 35 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 14 belong to 7 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":"src/renderer/components/Pref/HttpApi.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fe6e618b597515cb2c8a8d9519db207be72978c97c15a51d5fb043f7139904"}},{"ruleId":"D1","level":"warning","message":{"text":"HostsEditor.HostsEditor (cyclomatic 34): HostsEditor.HostsEditor has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 3 of the 34 points are its own statements and the rest belongs to 15 function items inside it that branch (toggleComment, loadContent, onGutterClick, \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":"src/renderer/components/Editor/HostsEditor.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"638b5b718e9a4e8134ba5a6023fd9de9f3a0dd9f59f218071d4b93359b2002dc"}},{"ruleId":"D1","level":"warning","message":{"text":"notify.getFriendlyUpdateErrorMessage (cyclomatic 34): notify.getFriendlyUpdateErrorMessage has cyclomatic complexity 34 (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":"src/renderer/core/notify.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2b9cf4951e93eeb20aa085ebcf2b4eb2f81e98fab0b6f3b87dcc2578e8ba9b"}},{"ruleId":"D1","level":"warning","message":{"text":"switchhosts::storage::tree_format::legacy_node_to_v5 (cyclomatic 33): switchhosts::storage::tree_format::legacy_node_to_v5 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":"src-tauri/src/storage/tree_format.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b2140d0215f5e7a4f65c59cda4c9e133b40c41a800dd7c4d573fc0c9c69b22"}},{"ruleId":"D1","level":"warning","message":{"text":"General.General (cyclomatic 33): General.General has cyclomatic complexity 33 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 13 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc900e71a2cfac606a35b384b7073485094fb39e90078dae635c03ffef388ff2"}},{"ruleId":"D1","level":"warning","message":{"text":"Sessions::commit (cyclomatic 31): Sessions::commit has cyclomatic complexity 31 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a649466bb3e7a67d3ac8f2d66801712f886e43b5fa97b85a12add36e6ad083e5"}},{"ruleId":"D1","level":"warning","message":{"text":"switchhosts::import_export::preview::normalize (cyclomatic 31): switchhosts::import_export::preview::normalize 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":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"922b1f711396619aa4befefc2f82715b640106c29a7c92cfb56e526a1cfda18b"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.Node (cyclomatic 31): Node.Node 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 (Node.Node::onDragOver) 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":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7889097c60f62e59a11e929a557e2d6ec9ee7a4a17ccc2db98c9a1949ce6fc99"}},{"ruleId":"D1","level":"warning","message":{"text":"ListItem.ListItem (cyclomatic 28): ListItem.ListItem has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 97, a function literal at line 117, a function literal at line 62, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/ListItem.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d3bbd915d7926f0fa9fd32acbc81d61c08a5157a2fbb614686d7a5de31f1b8"}},{"ruleId":"D1","level":"warning","message":{"text":"switchhosts::storage::tree_format::v5_node_to_legacy (cyclomatic 27): switchhosts::storage::tree_format::v5_node_to_legacy 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":"src-tauri/src/storage/tree_format.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc64b58c51c52bb5cf2bfdee0a07b63a4b872256707d0a2061047ab732412b11"}},{"ruleId":"D1","level":"warning","message":{"text":"EditHostsInfo.EditHostsInfo::forRemote (cyclomatic 27): EditHostsInfo.EditHostsInfo::forRemote 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. This shape REPEATS in the file: 2 other methods here (EditHostsInfo.EditHostsInfo, EditHostsInfo.EditHostsInfo::onSave) 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0972c0bcf38c5127da1bd442a386932bd8f47f1fbcc3d68bf9e4950088b8d764"}},{"ruleId":"D1","level":"warning","message":{"text":"index.PreferencePanel (cyclomatic 25): index.PreferencePanel has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 9 function items inside it that branch (onSaveDraft, onSaveImmediate, a function literal at line 128, \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":"src/renderer/components/Pref/index.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef85312c7d9062c6f3f5b314e1146d4f898571fdd9b157750344bd6fe95762fc"}},{"ruleId":"D1","level":"warning","message":{"text":"EditHostsInfo.EditHostsInfo::onSave (cyclomatic 23): EditHostsInfo.EditHostsInfo::onSave 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. This shape REPEATS in the file: 2 other methods here (EditHostsInfo.EditHostsInfo, EditHostsInfo.EditHostsInfo::forRemote) 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d38a86ee9b2035c57671c7f16e718cb86acf3b6924a1d7ba78e252df9b0c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.MainPage (cyclomatic 23): index.MainPage has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/index.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5a12943b370a0681c9f6cbbd996b51604681cfa24042388a817d1328d77583"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateDialog.UpdateDialog (cyclomatic 20): UpdateDialog.UpdateDialog has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/UpdateDialog.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc44154ce1fc3d8bee0fcfe7663ece80ace136cdd0e3fce522c55d995fe1a9f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditHostsInfo.EditHostsInfo (cyclomatic 19): EditHostsInfo.EditHostsInfo has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (EditHostsInfo.EditHostsInfo::onSave, EditHostsInfo.EditHostsInfo::forRemote) 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b60c2349863e66c81dbae30ad6d669f1ed8d26d977d24f80146f94f8a64583"}},{"ruleId":"D1","level":"warning","message":{"text":"index.TopBar (cyclomatic 19): index.TopBar has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/index.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"618d9abc657a4b69ad65d56f571d762e18fe736580426633091452b843fe6713"}},{"ruleId":"D1","level":"warning","message":{"text":"Tree.Tree (cyclomatic 19): Tree.Tree has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 5 function items inside it that branch (onSelectOne, onDragEnd, a function literal at line 61, \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":"src/renderer/components/Tree/Tree.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cade71218cf0807e30ac361e5e283f2fed253f466b7728ef77b04f0a3db89d"}},{"ruleId":"D1","level":"warning","message":{"text":"switchhosts::storage::manifest::set_on_state_of_item (cyclomatic 18): switchhosts::storage::manifest::set_on_state_of_item 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":"src-tauri/src/storage/manifest.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d31e5cbf4655a91c8e569d0a5226d73a4c795a25ea5da6281919925d47cd9c"}},{"ruleId":"D1","level":"warning","message":{"text":"useHostsData.useHostsData.apply (cyclomatic 18): useHostsData.useHostsData.apply has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 153). 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":"src/renderer/models/useHostsData.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2febb05f61b3ef87a2701f6ac7a0cdaa16de8e05057aaed6cac79940c06ef7b4"}},{"ruleId":"D1","level":"warning","message":{"text":"switchhosts::dns::cached_domain_results (cyclomatic 17): switchhosts::dns::cached_domain_results 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":"src-tauri/src/dns.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a904fd0f4dbcb419eefa42b4ec3220fb3e4130aee84eed62a6e034bd4b5ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigMenu.ConfigMenu (cyclomatic 17): ConfigMenu.ConfigMenu has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 174, 139, 89). 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":"src/renderer/components/TopBar/ConfigMenu.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b17eb77c1fc5a0802fc74bf31a86c214386a73e043b45dc597c5d9b60714a0"}},{"ruleId":"D1","level":"warning","message":{"text":"switchhosts::dns::is_valid_domain (cyclomatic 16): switchhosts::dns::is_valid_domain 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":"src-tauri/src/dns.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"259f755df4a2fcabbc927121dedc7ba2f314d36754b99c567d319b371c701469"}},{"ruleId":"D1","level":"warning","message":{"text":"hosts_links.commentLinks (cyclomatic 16): hosts_links.commentLinks has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (modifierHeld, clickedUrl, a function literal at line 134). 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":"src/renderer/components/Editor/hosts_links.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dc072be862169503dcdf313cc0a10a22181a4390044df6a08ec0b0bdf242d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.Node::onDragOver (cyclomatic 16): Node.Node::onDragOver has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (Node.Node) 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":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966b49c1e7697955f4876f8db47a8766cd268b6df97593fbc0dfea0673e4cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"find.FindPage (cognitive 101): find.FindPage has cognitive complexity 101 (threshold 15). Drivers by points: if/else 49 (57 pts), boolean chains 25, ternaries 10 (14 pts), error handling 3, loops 2 (nesting depth added 12). Of this number, 17 points are the body\u0027s own statements and 84 belong to 29 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/find.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3aa9cbe4288d63a26a8c606d21b091d7e485d9a05063cbb588474521dececc"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportPreview.ImportPreview (cognitive 75): ImportPreview.ImportPreview has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 23 (32 pts), boolean chains 28, if/else 11 (13 pts), error handling 2 (nesting depth added 11). Of this number, 35 points are the body\u0027s own statements and 40 belong to 12 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b093ef99ad169e3b3265b0693a77e586937227e0979f1d92763d98052e2c2314"}},{"ruleId":"D2","level":"warning","message":{"text":"index.RightPanel (cognitive 70): index.RightPanel has cognitive complexity 70 (threshold 15). Drivers by points: ternaries 17 (29 pts), boolean chains 21, if/else 18 (19 pts), error handling 1 (nesting depth added 13). Of this number, 35 points are the body\u0027s own statements and 35 belong to 13 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":"src/renderer/components/RightPanel/index.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb821b171bf9b6cf6974272ff88c24940d8ddff517c3151357895c4a20b9fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::import_export::preview::normalize (cognitive 61): switchhosts::import_export::preview::normalize has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (47 pts), loops 4 (7 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc22f4b6c3308a5470aeb30ca65b06e36e111327e0ebb945a9a27868b42f33ff"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::storage::tree_format::v5_node_to_legacy (cognitive 50): switchhosts::storage::tree_format::v5_node_to_legacy has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/storage/tree_format.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2205ae13dde03cb75f9d3747d2f0b879e4fcc6243f854158ed387e2c56a67441"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::storage::tree_format::legacy_node_to_v5 (cognitive 48): switchhosts::storage::tree_format::legacy_node_to_v5 has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (36 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 2 (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":"src-tauri/src/storage/tree_format.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4659cde88ec5fc2b4194bb7717c7b78ec0c69a9080019038b6ade42fa6d9c384"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::run (cognitive 47): switchhosts::run has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (39 pts), match/switch 4 (5 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":"src-tauri/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf8bb4d6ae20124aea8c87d540ed7cb8b66b003e44610f81b0e1f7cbf878829"}},{"ruleId":"D2","level":"warning","message":{"text":"index.List (cognitive 47): index.List has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 9, ternaries 6 (7 pts), error handling 2, loops 2 (nesting depth added 5). Most of this is not in the body itself: 2 of the 47 points are its own statements and the rest belongs to 15 function items inside it that branch (applyChangedRemoteHostsToSystem, a function literal at line 171, a function literal at line 191, \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":"src/renderer/components/List/index.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad4f8d04405c24451c97ec8b073f1d70d0e96e4b2860fad8136b0f59990a213"}},{"ruleId":"D2","level":"warning","message":{"text":"Sessions::commit (cognitive 46): Sessions::commit has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (25 pts), loops 11 (17 pts), boolean chains 4 (nesting depth added 12). Of this number, 33 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"255667364013ead74c19873eab3711b1378270bb13cc178a83afcfc985bb82eb"}},{"ruleId":"D2","level":"warning","message":{"text":"History.History (cognitive 40): History.History has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 17, ternaries 10 (13 pts), if/else 8, error handling 2 (nesting depth added 3). Of this number, 23 points are the body\u0027s own statements and 17 belong to 10 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/History.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd0d67cb58c0a228db66d9b83c1822b5e90f21c4580a0f9bd8a1a9562a431fd"}},{"ruleId":"D2","level":"warning","message":{"text":"HostsEditor.HostsEditor (cognitive 34): HostsEditor.HostsEditor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25 (26 pts), boolean chains 7, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 2 of the 34 points are its own statements and the rest belongs to 15 function items inside it that branch (toggleComment, loadContent, onGutterClick, \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":"src/renderer/components/Editor/HostsEditor.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca3fb96977962cd25f0dde5a724e206ebfc08ba6b45fd9757087efddee6197a"}},{"ruleId":"D2","level":"warning","message":{"text":"General.General (cognitive 34): General.General has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (20 pts), boolean chains 9, error handling 2, if/else 2, match/switch 1 (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cd3e135fec162e5fa41843a299402682da14a5178c81fde55ea255ef3e7bca"}},{"ruleId":"D2","level":"warning","message":{"text":"index.PreferencePanel (cognitive 34): index.PreferencePanel has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 7 (11 pts), error handling 6 (8 pts), boolean chains 2 (nesting depth added 10). Most of this is not in the body itself: 9 of the 34 points are its own statements and the rest belongs to 9 function items inside it that branch (onSaveDraft, onSaveImmediate, a function literal at line 128, \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":"src/renderer/components/Pref/index.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"691385a45854c68ee57c5fec38661ee09c3949542ecd1a08a63f48a7f93ee96d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditHostsInfo.EditHostsInfo::forRemote (cognitive 33): EditHostsInfo.EditHostsInfo::forRemote has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 12 (23 pts), boolean chains 10 (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 (EditHostsInfo.EditHostsInfo::refreshHosts, EditHostsInfo.EditHostsInfo::onSave) 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcb0dc0d6c1956bdc0d2d6347ca4a38d1280adda5831dce2d38c0a492f74b97"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpApi.HttpApi (cognitive 33): HttpApi.HttpApi has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 11, ternaries 5 (11 pts), if/else 7 (8 pts), error handling 2, match/switch 1 (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 12 belong to 7 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":"src/renderer/components/Pref/HttpApi.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21533b43826346781716adfcba53c9d322dfb4717c354e28f8c9bb03318aab2"}},{"ruleId":"D2","level":"warning","message":{"text":"hostsFn.setOnStateOfItem (cognitive 32): hostsFn.setOnStateOfItem has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 2 (nesting depth added 17). Of this number, 16 points are the body\u0027s own statements and 16 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/hostsFn.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1400cf1ef331c166fab6014954386e5232ba97e6c12e56e51df6f357e7177e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::import_export::preview::parse (cognitive 30): switchhosts::import_export::preview::parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b124005fc2633cb5e81ee9c65f4d531402f4d76fef78cde09c01ca47e79c67"}},{"ruleId":"D2","level":"warning","message":{"text":"EditHostsInfo.EditHostsInfo::onSave (cognitive 29): EditHostsInfo.EditHostsInfo::onSave has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (EditHostsInfo.EditHostsInfo::refreshHosts, EditHostsInfo.EditHostsInfo::forRemote) 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f4221a3f7ad76a8f7c537e15100eac3c8f19b2a9f8292c3eed990d1c2b1b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::dns::cached_domain_results (cognitive 28): switchhosts::dns::cached_domain_results has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/dns.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98e51be00c74debba403a291f17ef64a6db1b2ef56ac47bf08d0c079b602355"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::storage::manifest::set_on_state_of_item (cognitive 27): switchhosts::storage::manifest::set_on_state_of_item has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (24 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":"src-tauri/src/storage/manifest.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"38967d769d357f89cbcd8036421dd4c9a6e7225c4d74011d651c62b49828ed4e"}},{"ruleId":"D2","level":"warning","message":{"text":"useHostsData.useHostsData.apply (cognitive 27): useHostsData.useHostsData.apply has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 6 (8 pts), error handling 4 (5 pts), boolean chains 2 (nesting depth added 10). None of this is in the body itself: all 27 points belong to one function literal inside it that branches (line 153). 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":"src/renderer/models/useHostsData.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a37a035b54c54096a77501df6706603dc9056d38590812f2128635741d29e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"ListItem.ListItem (cognitive 26): ListItem.ListItem has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11, boolean chains 8, ternaries 6 (7 pts) (nesting depth added 1). Most of this is not in the body itself: 7 of the 26 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 97, a function literal at line 117, a function literal at line 62, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/ListItem.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2c9568246ac050f28e23875db07b49027d4ed227b88329aa23bb85bc157146"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.Node (cognitive 25): Node.Node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 18, ternaries 9 (10 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (Node.Node::onDragOver) 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":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ae7dcf4498eb950cb9ba9778c84a1b816c2e6e4dc2ac5b75c4312dc0688e26"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree.Tree (cognitive 23): Tree.Tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 3 (nesting depth added 4). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 5 function items inside it that branch (onSelectOne, onDragEnd, a function literal at line 61, \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":"src/renderer/components/Tree/Tree.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"787bcf8f5a2d884f46e63e2f36bbaad30e21b69600032f977adce32de8113857"}},{"ruleId":"D2","level":"warning","message":{"text":"import.changeImportSelection (cognitive 22): import.changeImportSelection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/import.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd45dfc73a5b2a74259fe4689cfdfc8864184c9b2badc30372a0032f08ba491"}},{"ruleId":"D2","level":"warning","message":{"text":"hosts_cm.buildDecorations (cognitive 21): hosts_cm.buildDecorations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 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":"src/renderer/components/Editor/hosts_cm.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa28b87441648f3cd9ccaadba1ae04cd05dc3d4c0e1b680fe369f23652293d82"}},{"ruleId":"D2","level":"warning","message":{"text":"EditHostsInfo.EditHostsInfo::refreshHosts (cognitive 20): EditHostsInfo.EditHostsInfo::refreshHosts has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 6, if/else 3, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (EditHostsInfo.EditHostsInfo::onSave, EditHostsInfo.EditHostsInfo::forRemote) 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbeffdf3db62bc91c53a20d924f5ff1dc375f062b95bfea449a4007127c6a3f2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.MainPage (cognitive 20): index.MainPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7, ternaries 6 (7 pts), boolean chains 5, error handling 1 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 10 belong to 5 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":"src/renderer/pages/index.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4f7f88d3732281c81861f2736838ca7aa57940825308a8eaee04824eaf2c68"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::refresh::stamp_refresh (cognitive 19): switchhosts::refresh::stamp_refresh has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (18 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":"src-tauri/src/refresh.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9feeb272155fc57fcc4b499b9935f30910559cb9d8f8f0440ec5e92341f0027"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateDialog.UpdateDialog (cognitive 19): UpdateDialog.UpdateDialog has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, ternaries 7, if/else 3, error handling 2. Of this number, 14 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/UpdateDialog.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"015d4ce42df60b6a77b318289fbeafd56747b494ea9e80a9a10f1dac93ce5fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::import_export::preview::validate_v5_shape (cognitive 18): switchhosts::import_export::preview::validate_v5_shape has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aecb2e8eb746b18a9b040b2879e048bb0ef5d6c47e190029ba4140444d15e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.TopBar (cognitive 18): index.TopBar has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8, boolean chains 7, if/else 2 (3 pts) (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: 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":"src/renderer/components/TopBar/index.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e847396d442b895cc4050d1a9f81d6ccaf1757cb647bfc1ad63a974c2dbee0"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.Node::onDragOver (cognitive 18): Node.Node::onDragOver has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (Node.Node) 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":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc27b47f7819959ab81099eee949f074d44b7ccd67d849fa42b783b6db15093"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::hosts_apply::aggregate::remove_duplicate_records_pass (cognitive 17): switchhosts::hosts_apply::aggregate::remove_duplicate_records_pass has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/hosts_apply/aggregate.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4188c72f464509f1ae449df2aa334f86ea4ed509ba3fef5c276d917214206f"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::hosts_apply::elevation::elevate_copy (cognitive 17): switchhosts::hosts_apply::elevation::elevate_copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/hosts_apply/elevation.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"9438e09985f844b070fa4980fabdcc7b6635ecaa37680b99be0df43377b99790"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::hosts_text::decode_system (cognitive 17): switchhosts::hosts_text::decode_system has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/hosts_text.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92ea93f9d9fdf8d1738698acb8260222218323d8d741523bce656cc215e9299"}},{"ruleId":"D2","level":"warning","message":{"text":"hostsFn.isValidDomain (cognitive 17): hostsFn.isValidDomain has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/hostsFn.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0427a9af2d4ac8ba82b65f20da28e6b364bec55555847ef66297dd01753a3fab"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigMenu.ConfigMenu (cognitive 17): ConfigMenu.ConfigMenu has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, error handling 4 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 139, 174, 89). 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":"src/renderer/components/TopBar/ConfigMenu.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cf344a1289d931ae55ec6929d71a158bfb8e35286de7603f8ad3666df4b227"}},{"ruleId":"D2","level":"warning","message":{"text":"switchhosts::dns::is_valid_domain (cognitive 16): switchhosts::dns::is_valid_domain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 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":"src-tauri/src/dns.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6519ae45e9c4045fa6f2352769ee360da785a6a198efd7021916be321dad15f7"}},{"ruleId":"D2","level":"warning","message":{"text":"fn.selectTo (cognitive 16): fn.selectTo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 1 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"src/renderer/components/Tree/fn.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7996438fb478480e4b0b346d85c57125baf078c8e4a4cb83b0c4b92eaee78377"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.isEqual (cognitive 16): Node.isEqual has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb04b4fd1db788841d27e1339ab494a437c9655d26d0b59aaf6d051fcdbe96da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: find.FindPage: FunctionTooLong \u2014 FindPage runs 691 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 591 over it, 6.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":"src/renderer/pages/find.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7bf2abb5569ad4ce74b7e2f141814232862a1ac0426b2678a8612690e9ebac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MenuLabels.for_locale: MethodTooLong \u2014 for_locale runs 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 430 over it, 5.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/i18n.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"48147cdb033645a31625820773cbec8613352cec78d2009b35226b84fd7f9ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: EditHostsInfo.EditHostsInfo: FunctionTooLong \u2014 EditHostsInfo runs 464 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 364 over it, 4.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c546feb7b18a0430f114ddb882d16e1a4d6c39f718803ea24db51cab9f5027"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ImportPreview.ImportPreview: FunctionTooLong \u2014 ImportPreview runs 361 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 261 over it, 3.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":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"04628c926359645fe61f60f6b967a431a69669dc1f463e74298019fef48e8e7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 1411 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 99 free functions. The bar is 500 significant lines; this is 911 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fc318084f01ff9b841ea84aa7af8917c061e0ba51abd292156725ba27a02e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.RightPanel: FunctionTooLong \u2014 RightPanel runs 262 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/RightPanel/index.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"85999cafc4960199ed60248ca1badd5de90b5e6f680fe357c777876f0af374c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: History.History: FunctionTooLong \u2014 History runs 252 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/History.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ca8b8be41151af46dd579571f9f61f27b6354b167c49b05a375e24e5563467"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: switchhosts::run: FunctionTooLong \u2014 switchhosts::run runs 249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4c11e4e0811f1e3d96d55cc4531ce91a1a715d3343a40bde8028902760345a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: General.General: FunctionTooLong \u2014 General runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec738572f8830c753457e073cdc8d2a23307d37f7f00092167a1111a9a616bb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HostsEditor.HostsEditor: FunctionTooLong \u2014 HostsEditor runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Editor/HostsEditor.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99a44dd57c316e9051aa139280a2b6ac1afe811a94189cd59eaf0ee9d8ab4f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.List: FunctionTooLong \u2014 List runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/index.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7a25ba05c95d5c49acb28a607627329533f0cfa558cad7a72139f3bbf216a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Advanced.Advanced: FunctionTooLong \u2014 Advanced runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Advanced.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"be36dd74b6a90bce1dcf81bfa5576cf277b9f63c77e5bede1635865c3ab1d293"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/find.tsx: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: FindPage (243-1171). The bar is 500 significant lines; this is 365 over it, 1.73\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":"src/renderer/pages/find.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15062f85b79d11275750ac8c7eb0eade6c3e96398fdc538398cab57322958c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useHostsData.useHostsData: FunctionTooLong \u2014 useHostsData runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/renderer/models/useHostsData.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"33483059b5c0d18e8d07d1abc7d02f7aa25a54c86f8c86fde3a630dc11bc59f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.TopBar: FunctionTooLong \u2014 TopBar runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/index.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e29b37fe7c48ef087b5e3930ad280b953bb81476e691298edc38f0acee7b99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HttpApi.HttpApi: FunctionTooLong \u2014 HttpApi runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/HttpApi.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"858dfae8b3baa58f9447be72a8f97ab081dcdaa4cbc7a6103ea81c95610bc5f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.PreferencePanel: FunctionTooLong \u2014 PreferencePanel runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/index.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2b43365636b24540ca18a35fd851d6a70962b2a286ff7a0046adbb52416795"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.MainPage: FunctionTooLong \u2014 MainPage runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/index.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"57832195cab9f659faa44404102a35ac334a372ccf5d1d9aa7e9b71da52c705c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Node.Node: FunctionTooLong \u2014 Node runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4205721b03fdbf74099c43865a398036672bbd79be29f26ae9a1bcf7ac582034"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ConfigMenu.ConfigMenu: FunctionTooLong \u2014 ConfigMenu runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/renderer/components/TopBar/ConfigMenu.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21981bd9b6d824e53aa4cbe1538c914467b8af0d7c9a0fab3fe5cbd380a57c8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MenuLabels: ClassTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 2 blocks, lines 6-653. The bar is 400 significant lines; this is 164 over it, 1.41\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":"src-tauri/src/i18n.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cf78d06259ab149fda8d474fc137a148156b37733cfc56836c67dea510bbaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Sessions.commit: MethodTooLong \u2014 commit runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c96c15ad43bbdad1ff933b9a3bcf697ef5a4ab0283dc95f21b8ccb40a463da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/i18n.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 86% of them inside a single declaration: MenuLabels (2 blocks, 6-653). 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":"src-tauri/src/i18n.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18d8edc92920ee59820d7c4ed57f1c24bb8ab7d9c47b67f69b92194bd9a1cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ListItem.ListItem: FunctionTooLong \u2014 ListItem runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/renderer/components/List/ListItem.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"478360943bc960b4fe5340d5678bd1f267d77874b8bce6f914be3e64d25b92c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lifecycle.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 45 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":"src-tauri/src/lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8aa3eb747c8cf73972ce6ce6e1904fb6717217537d0115523a99f377015ba52"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AppConfig: TooManyFields \u2014 36 stored fields beside 7 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/storage/config.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d9c439bfbf28f1594b05faabf609d078b7ca180e0c854151b9c84710982e88"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditHostsInfo: ClassTooLong \u2014 464 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 64 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9a66dccfcd8c17af4da9312d574511d15e9cbfc5e2946dfc43c0002ab2dc7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: import_export/preview.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcac9c06e4b9749bbb5a48acf48f4e00f8e1505c8c40c322c7f2b0a83ce54339"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: UpdateDialog.UpdateDialog: FunctionTooLong \u2014 UpdateDialog runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/UpdateDialog.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd819a0afbb9397cca3438583fa499731cba77159d2faac98f71074099081bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Transfer.Transfer: FunctionTooLong \u2014 Transfer runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Transfer.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9447f9b231e753937c4f2e9a092ae8d281f3b3cad6e8bb9592b027e0ad7bfd2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MenuLabels: TooManyFields \u2014 32 stored fields beside 1 method. The bar is 30 stored fields; this is 2 over it, 1.07\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":"src-tauri/src/i18n.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"219a94b1af5f5719013fa4d1041ca45db63e066acf220bab5956fdad53fd3fab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: switchhosts::import_export::preview::normalize: FunctionTooLong \u2014 switchhosts::import_export::preview::normalize 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":"src-tauri/src/import_export/preview.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac59ce92f397914f1caf4a2a5c6a3be48764dfb0174fa9e7329e20f932bb1ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Tree.Tree: FunctionTooLong \u2014 Tree runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Tree.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbd0308433692d922bd443b908b5ae53707c08d4462b156bce464f96c0f5a87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/EditHostsInfo.tsx: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: EditHostsInfo (51-641). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72412cfaaab5d62bcc3c753f8105cfb71856bb0f3fa7ebc24118f8a431c1c849"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): src-tauri/src/find.rs:708-751 | src-tauri/src/lifecycle.rs:372-415 \u2014 These two members are variants of one another: 27 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":"src-tauri/src/find.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffc23b466398fd659662758854930cce33234315ca8a1c82db9db21c4558d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src-tauri/src/commands.rs:543-567 | src-tauri/src/commands.rs:577-598 \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":"src-tauri/src/commands.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bee9322e95e78053d96881ab9c427d8b7f4bbee001c9de7c3ec1baea11d576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src-tauri/src/hosts_apply/helper_admin.rs:273-297 | src-tauri/src/hosts_apply/helper_admin.rs:299-330 \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":"src-tauri/src/hosts_apply/helper_admin.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab1ca5911399b9321ea2d23ea5e20cfbe6468fb766a6b6c61cb817987b61a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src-tauri/src/storage/config.rs:203-215 | src-tauri/src/storage/state.rs:98-108 \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":"src-tauri/src/storage/config.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5fa2aa13af05a5cfaf70ed425ad116117994e71c438beb9259df0b0d154d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src-tauri/src/hosts_apply/history.rs:42-51 | src-tauri/src/storage/config.rs:186-196 \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":"src-tauri/src/hosts_apply/history.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df4c52cfb6ce7748f12594b625180871d496ede4eb12d76dae58e557ac29a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src-tauri/src/lifecycle.rs:644-660 | src-tauri/src/lifecycle.rs:975-996 \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":"src-tauri/src/lifecycle.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"345b29a9b7fbaeb39481908560c95f25250e8fe1e12986abe2282aaeb318900a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src-tauri/src/commands.rs:1294-1305 | src-tauri/src/commands.rs:1331-1342 \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":"src-tauri/src/commands.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"975db4fa68b463c1d61be13c27bedf0bb83bfbb49c54179a025ae7ec3f1617e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src-tauri/src/find.rs:506-519 | src-tauri/src/tray.rs:411-426 \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":"src-tauri/src/find.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe14bbe2aae100609c040a0434098924066134549cf5801cf5605aa5ee8c5367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src-tauri/src/migration/potdb.rs:93-101 | src-tauri/src/storage/trashcan.rs:51-59 \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":"src-tauri/src/migration/potdb.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"72887fa6dffd2c5dab3f5789e1b5a306c7d1562c31ea195d9d80e0a08a2a8d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src-tauri/src/commands.rs:1001-1010 | src-tauri/src/commands.rs:1013-1022 \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":"src-tauri/src/commands.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41ff50e1df028a6ceee24f67070bf696148abaced2e0bc4cb674a9a6c3b8cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): src-tauri/src/storage/data_dir_pointer.rs:216-224 | src-tauri/src/storage/entries.rs:77-84 | src-tauri/src/storage/transaction.rs:67-73 | src-tauri/src/storage/transaction.rs:75-81 \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":"src-tauri/src/storage/data_dir_pointer.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b78fa413b5aa83f9bd0de512161a6fbc288d75079ccebd3bee0a3abee9bd51e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src-tauri/src/commands.rs:1098-1105 | src-tauri/src/commands.rs:1154-1160 \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":"src-tauri/src/commands.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8190fe52e09971cfa229e02adac81906e6958d959c0c0c59353be5acde96946"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src-tauri/src/hosts_apply/cmd_runner.rs:110-119 | src-tauri/src/hosts_apply/cmd_runner.rs:122-133 \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":"src-tauri/src/hosts_apply/cmd_runner.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec344ab3be016f4601515b800b35cdd68593e5da9102a588b85b06688d5b537d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src-tauri/src/find.rs:551-560 | src-tauri/src/find.rs:570-579 \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":"src-tauri/src/find.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dccec6bb286936d86ba9da5a1c0c636e561a6e1dfaee27ca6fe2cb46f9351c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src-tauri/src/commands.rs:1111-1118 | src-tauri/src/commands.rs:1166-1172 \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":"src-tauri/src/commands.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f9963703bdb6a109905222ed2fb6ffe1e9dbd4fe47007617042c56d987af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src-tauri/src/find.rs:67-77 | src-tauri/src/lifecycle.rs:91-101 \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":"src-tauri/src/find.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ce73dcb1435def3f9b3f99ca4f24d60e3a91f251b843b89d2eaa3720797ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src-tauri/src/refresh.rs:453-460 | src-tauri/src/tray.rs:272-279 \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":"src-tauri/src/refresh.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb28d2749b4291df54308f84991ed5248d3bb5895c00d639e3a1dc9e2d280d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src-tauri/src/find.rs:728-742 | src-tauri/src/lifecycle.rs:392-406 \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 \u0060src-tauri/src/find.rs:728\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/find.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"381bb362c5e5966dca666316a90c1916041cb52c8fc47fb0a1e5fc641e96c655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src-tauri/src/http_api.rs:270-281 | src-tauri/src/refresh.rs:622-633 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/http_api.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e94705754f79906693f92030ab6a0a9536d3ed71f484a84decf898535b4575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src-tauri/src/hosts_apply/cmd_runner.rs:181-189 | src-tauri/src/hosts_apply/history.rs:175-183 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/hosts_apply/cmd_runner.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ba37e46f679c1e01a0836441d6236d2723ccda70c0bd356e41abd4b2c3cdf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src-tauri/src/commands.rs:1003-1010 | src-tauri/src/commands.rs:1015-1022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands.rs:1003\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f607a0bc7aaa8c6bc532ea21d1be78543dad4f4f781a02c75db4ce4f8e8273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src-tauri/src/find.rs:709-715 | src-tauri/src/lifecycle.rs:373-379 \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":"src-tauri/src/find.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1b35465a45282ea95e0328b69ef4debdc92ce7073a509f446c1b2bd6bf8dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src-tauri/src/find.rs:722-726 | src-tauri/src/lifecycle.rs:386-390 \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 \u0060src-tauri/src/find.rs:722\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/find.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"62201938896bcc78e5464c0d024e8b98c9f02b7856f6c7ae245416ace2ec3158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src-tauri/src/storage/tree_format.rs:140-145 | src-tauri/src/storage/tree_format.rs:297-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src-tauri/src/storage/tree_format.rs:139\u0060 calls \u0060insert\u0060, \u0060into\u0060, \u0060String\u0060 and \u0060src-tauri/src/storage/tree_format.rs:296\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":"src-tauri/src/storage/tree_format.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9070241edec2f5945eecd140efb636bfc4442b1dc17fd19c2ef99cb328e7a881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src-tauri/src/find.rs:595-599 | src-tauri/src/hosts_apply/cmd_runner.rs:164-168 | src-tauri/src/hosts_apply/history.rs:53-57 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060items\u0060 to \u0060\u0026[CommandRunResult]\u0060 in one and \u0060\u0026[ApplyHistoryItem]\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":"src-tauri/src/find.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf7de69f1e821f05bd3220eb3654417b78136bf5415881364e3212212f2cae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src-tauri/src/lifecycle.rs:471-476 | src-tauri/src/migration/archiver.rs:145-150 | src-tauri/src/tray.rs:99-104 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lifecycle.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfba6cf60198ba7375964cc95b4d5ffb541ec165436ad67056a72bed4fa31fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src-tauri/src/lifecycle.rs:646-654 | src-tauri/src/lifecycle.rs:979-989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/lifecycle.rs:646\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lifecycle.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4455ee479b1937be171db80296cd11a3f3853ce931d66d26ff3cb31e68a3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src-tauri/src/lifecycle.rs:647-654 | src-tauri/src/lifecycle.rs:961-968 | src-tauri/src/lifecycle.rs:980-989 \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 \u0060src-tauri/src/lifecycle.rs:647\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/lifecycle.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2f37f6a7543f1c1a9cfb127b1e802ea3176bc1788924ceaf4468fd9a4f07ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src-tauri/src/hosts_apply/cmd_runner.rs:112-119 | src-tauri/src/hosts_apply/cmd_runner.rs:126-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/hosts_apply/cmd_runner.rs:112\u0060 it begins part-way through the construct above it, so those exact 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, \u0060src-tauri/src/hosts_apply/cmd_runner.rs:124\u0060 calls \u0060arg\u0060 and \u0060src-tauri/src/hosts_apply/cmd_runner.rs:111\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":"src-tauri/src/hosts_apply/cmd_runner.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6552118163e47a2495690730909e8995214b51fbe1d2e999f1d6582756b0ed29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src-tauri/src/hosts_apply/elevation.rs:416-422 | src-tauri/src/hosts_apply/elevation.rs:431-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/hosts_apply/elevation.rs:416\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":"src-tauri/src/hosts_apply/elevation.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c9328fe6869ac6159a7e154c3269f1c01ec1adeff20d2b35c4bf19172887b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src-tauri/src/commands.rs:1208-1213 | src-tauri/src/commands.rs:1239-1244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/commands.rs:1208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/commands.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cb31d9566b87ab1fb02f466de7e31dd930bfe853baa84b4410e4e2733262e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src-tauri/src/migration/archiver.rs:110-114 | src-tauri/src/storage/fs_copy.rs:70-74 \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 \u0060src-tauri/src/migration/archiver.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/migration/archiver.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9023221b1f225a6268258e1ae76c8ea241434db7c2317c864661b0eb5fbf7da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src-tauri/src/storage/data_dir_pointer.rs:220-224 | src-tauri/src/storage/entries.rs:80-84 | src-tauri/src/storage/transaction.rs:77-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src-tauri/src/storage/data_dir_pointer.rs:220\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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 \u0060path\u0060 to \u0060\u0026Path\u0060 in one and \u0060\u0026std::path::Path\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":"src-tauri/src/storage/data_dir_pointer.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe3574da98bd00740f2d3ce78cb4da39810e5452dc74b1c31b898e00f2e1ca"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: e2e/support/tauri-mock.js: e2e/support/tauri-mock.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in invoke at line 507. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- e2e/support/tauri-mock.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/support/tauri-mock.js"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa52e6ca2781f9af9e3abf956c5c3a44c629eb27035d4fbb701cf69ea6fd665b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/EditHostsInfo.tsx: src/renderer/components/EditHostsInfo.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 131 in EditHostsInfo.EditHostsInfo at line 51. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/EditHostsInfo.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3387737ce673bb0c0d58f56476b6bc2663d8e1636dfeaea5dc59715232b9b9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src-tauri/src/lib.rs: src-tauri/src/lib.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in switchhosts::run at line 121. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/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":"src-tauri/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc01a92e9c28ff2741665d9c22411065b9cf3c3a5a084f03d419d809f2a5eb5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/List/index.tsx: src/renderer/components/List/index.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in index.List at line 29. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/List/index.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/index.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ffe839a099b2b1fb411435c680e69d68d908c7b39048128f01d72ac2413034"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/Pref/General.tsx: src/renderer/components/Pref/General.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in General.General at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/Pref/General.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73f311143b1e6aba56462e78313d130928dc6acf31da590f5e491784123cf3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/RightPanel/index.tsx: src/renderer/components/RightPanel/index.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in index.RightPanel at line 26. 1 of those changes was a fix/bug commit, and the other 1 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/RightPanel/index.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/RightPanel/index.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"31227fc139a0fc42238ff71c42c7882631f1a7415fc0fcd493c7611b3748bf29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/models/useHostsData.ts: src/renderer/models/useHostsData.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in useHostsData.useHostsData.apply at line 151. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/models/useHostsData.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":"src/renderer/models/useHostsData.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"683d9308edb2c5dc54d3a2170ca0bfb7b66e7b17c066d4092138327190eff008"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/Editor/HostsEditor.tsx: src/renderer/components/Editor/HostsEditor.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in HostsEditor.HostsEditor at line 33. 1 of those changes was a fix/bug commit, and the other 2 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/Editor/HostsEditor.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Editor/HostsEditor.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"506420646d4409debed2a7a8a8783a5135d24f1154bb391235741f45ea542aae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/History.tsx: src/renderer/components/History.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in History.History at line 146. 1 of those changes was a fix/bug commit, and the other 1 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/History.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/History.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f1ab96186c7de2d1d9c55d73db3f88e238ae4654c775035f92cb7b1b23567e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/pages/index.tsx: src/renderer/pages/index.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in index.MainPage at line 37. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/pages/index.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/index.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"903d1baf20fca84435cb47d3af90206ca97415b819cb62f9965e5b0477028753"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/TopBar/index.tsx: src/renderer/components/TopBar/index.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in index.TopBar at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/TopBar/index.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/index.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb777f5f8f1b418b6186fe9031ce1a815ad98fb11cc8e5344b389fcf105d986"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/List/ListItem.tsx: src/renderer/components/List/ListItem.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ListItem.ListItem at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/List/ListItem.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/ListItem.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"337521cab7ae735db359577c4a1b14a9a3e311de9f1d6403fbb2757f13121c3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/commands.rs: src-tauri/src/commands.rs changed 16 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is switchhosts::commands::apply_data_dir at line 1998), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(http): report actionable TLS and request failures\u201D; \u201Cfix(hosts): detect encoding-only changes before compensation\u201D; \u201Cfix: normalize hosts BOMs and preserve legacy Windows encodings\u201D; \u201Cfix(storage): track pending applies before pipeline execution\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/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":"src-tauri/src/commands.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"598553f7bcd006bde0f47745ba635125da4929d474e4b637280f2e9842b0e5d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/tray.rs: src-tauri/src/tray.rs changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is switchhosts::tray::handle_left_click at line 158), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tray): preserve popup level and test native lifecycle\u201D; \u201Cfix(tray): use typed macOS dismissal event masks\u201D; \u201Cfix(storage): route recovery requests across window lifecycles\u201D; \u201Cfix(storage): share and reconcile pending hosts applications\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/tray.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/tray.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cf10df473c014f36ba6de0f9a04134fd17c8a8d8ee57bc269ea944e457f1c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/refresh.rs: src-tauri/src/refresh.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is switchhosts::refresh::refresh_target at line 550), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(http): report actionable TLS and request failures\u201D; \u201Cfix(refresh): report invalid remote URLs clearly\u201D; \u201Cfix: protect DNS error details and bound batch refreshes\u201D; \u201Cfix(storage): recover multi-file mutations with undo journals\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/refresh.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/refresh.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"354acbb9a4b77282124eed43b1ec1b51e75ff1bba0fc4de6c0e68d7a8c6e28d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/hosts_apply/recovery.rs: src-tauri/src/hosts_apply/recovery.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ApplicationRecovery::inspect at line 121), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hosts): keep toggle state and applied content consistent\u201D; \u201Cfix(hosts): detect encoding-only changes before compensation\u201D; \u201Cfix(storage): track pending applies before pipeline execution\u201D; \u201Cfix(storage): route recovery requests across window lifecycles\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/hosts_apply/recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/hosts_apply/recovery.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebeeffdaf68a65b1e7b0784b31588d467ce212d6216fe66c5ad8f2080c5bcca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/hosts_apply/write.rs: src-tauri/src/hosts_apply/write.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is switchhosts::hosts_apply::write::apply_at at line 65), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hosts): detect encoding-only changes before compensation\u201D; \u201Cfix: preserve editor offsets and harden hosts encoding writes\u201D; \u201Cfix: normalize hosts BOMs and preserve legacy Windows encodings\u201D; \u201Cfix(storage): share and reconcile pending hosts applications\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/hosts_apply/write.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/hosts_apply/write.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd824fa9201dfea69894c3d89a50c26907d4b79cb1ab234957d21ca4a2ac89f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/http_api.rs: src-tauri/src/http_api.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is switchhosts::http_api::api_toggle at line 157), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hosts): keep toggle state and applied content consistent\u201D; \u201Cfix(storage): route recovery requests across window lifecycles\u201D; \u201Cfix(storage): recover multi-file mutations with undo journals\u201D; \u201Cfix(http-api): apply toggle in the backend when no renderer is alive\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/http_api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/http_api.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"864e76fb94ae5f9e5d4df033bba822fc0edea1f05232838d48c73bebf5da81bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/storage/mod.rs: src-tauri/src/storage/mod.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is AppState::bootstrap at line 86), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: preserve history settings across recovery failures\u201D; \u201Cfix(storage): share and reconcile pending hosts applications\u201D; \u201Cfix(storage): recover multi-file mutations with undo journals\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/storage/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/storage/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"472ca7cb0a6ba25acc497f66ef59fc2d3e5205de8088d64078a55ab56d845d6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src-tauri/src/find.rs: src-tauri/src/find.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is switchhosts::find::replace_all_in_manifest at line 390), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: preserve editor offsets and harden hosts encoding writes\u201D; \u201Cfix(storage): share and reconcile pending hosts applications\u201D; \u201Cfix(storage): recover multi-file mutations with undo journals\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 11:19:52 \u002B08:00\u0027 --until=\u00272026-11-11 11:19:52 \u002B08:00\u0027 --full-history --no-merges -- src-tauri/src/find.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/find.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46b0adc46fb529de6c27783dcbe62b312d4faead14e66c7226c86c45fc419d5"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060package.json\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (16898 LoC, 111 module-visible types across 23 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":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39d161245d9fe1f3bd6eb9853953498c4d9de7f2006e5517efb623508b725de6"},"properties":{"commitSha":"631f85c2dc1ffa84177c6bae8416f71af3bd1cbc"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5f067e943989fd039ad70411013bf082a8588b9f38464ef16f66d6f48246c7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42b4687f319cbbd5e282f3e7386731668adef9f2c699c947c413ebaafa818f0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0063c758847f616c2c3e785572b6a1fc100eeb5784b319de72c4dbd9d1efdce9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9acd6cb8ee7c5d6d969114332978ea7ffb897b108a096b4664bca14d3e0b79f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"270db641e9fceafea09e18419fc9685c2c679a8e165bbff2e97b6a6ea0a6c76d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bf66f5e7d68d560e31890595924148a2f29517a30395ef5653442821cb20e6d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bb5c99e93ae7c2b02bc365c4b4ff86cc4a6e7a7c9a01214bad13bd000893933"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"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":"c05d031df023c4a4ce1920ac436fd3d73fc711e7abd8d3b31b5514276771d9af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cb2d7311be19b8b8da6787e5ccf4caed03136e2244aaf5a23f3ccda1efcf75a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ad1a22149ef40c5fdfa70c13d3dfacc87e20b8be939dcb2f114d027ab10dc5f"},"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":"57d94ecf1e4e1b67a0a20e1126764020d74cc51d3a14b0d8b3faf921de4f9ffd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b452ba9ce8dfdd4850ee90dc3b4484307f03f92c9178f09025ccc36da74b24b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcaaa33c1cdd8121557e1f3c247aba138b46f5a51137ec028fd88eacf4a6eed9"},"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":"566dfd169c1a6b80729879bebe0b25c4ef054237f1e86e8f3b426af700005301"},"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":"69b6ed30af85b7d7054ad2216a66be964a11fd1214ab09706e194c3e7b532561"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1aa4eabaf484ff130aa56b93b897d61b35afc47bfda85c9d278b385aaeda18f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3697f1522e19a638b7ef88b7aaf49350d5b9b08b7c831fcbc85b3c68f84dd986"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3477512cbff35f134744fc73da1cd905e79182a4e0e37fce28f4a95f419c9a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48008ccf9bed491546b48dbcbb70ac9789518418783216ec6c709d8ed4908bfd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e28424fedc360265a4515c4fa929e6bf297e08d2621025a4f057e7095c665354"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ae8ee2e3c52420af4a422afeadc14067e536ca41d2bb4d223fd0d0af981e878"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"344b614542957bd85d3913b7f5a3be314c189d40f2ed01a87663497578e6baba"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d62b5105e9e422cd2b0ff7ce88b0c74212d6959f8740dbd276d72ce67057592f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cc074ca03002738cd3cc9ccc9f8b9a681176496735869b425d81b66d83a485b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e42ba3d84e3bde183a4fd2d72f5ca0c075fc1af571a674fa31b9ba3cb933813c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02721915754e4537dade433e8cb07437d130abb31a9f5b59de037a77f3594da2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5199b40473c2e6049b809781f3fbbdb6c92d1f89ad0ccdca0473657732f0567a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb09b1305160c02ecb0571b1c0ec4ebef7c0dc723f6181413d1cc4f02da79f53"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4b10f2ac003430c6e4aee676022dbfca0791c59b219b226de29b3f674f8d81d"},"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":"57d02223fef0e6164aee8103cc898fdea928c72f0144d261d1936e2ee451f1a9"},"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":"18f6f6ccb34df649441d8158299faa830dee34d809c7109a2bfbbd6e7b3833ed"},"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":"e71ce72d654610e84f663a79ec907bee6d7ccaaeaa214f930a617310f0401286"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"420927fdf9014a125091546116f49fca6fb941bc5d57b16bc4e3ce8f6c889b19"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70d5eacbb4ad16e8d7aaba7746ca21314fcdeb7f7efa337d0e89098c6520b19e"},"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":"7864b3f3a14621278c81e3e820e91663bb643439838adf65f66d6a71965b6449"},"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":"52c36bb0a1211fc41657f35c117d50d98f2513c390cd6d00f5b7af49dd537ea2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9182292a22bef6e72ce928d393f7e032df28f597b82e6c7cd4d77d3c33471a1a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70e535be7c5c91cca65827a8459056b36f40c38b52a7f90294fb5909f0aef6c4"},"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":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7728024d22a2bc9abfd49562e853d3c325716f25c3348b695c6f43836d8df4b"},"properties":{"dependency":{"package":"zip","version":"4.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87acedc051cb89a8ce4b5f36de7264e8d1c5c5fd3ed662cda178e80e0c31f9d8"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"178a00c6c350113153d2347e49d088d7521918be733d1e48af0c286948b18f0f"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"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":"a480367025272469acdc05c0efeea27e564b6d640cec55746a2ab403b6da8691"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","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":"be4a7edbfc020620bb9cdc132f5744189ee7ba2c9cc1cee23332c6e28219cbe4"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2d7c7401706180a51983228e8bb877bc2047df90e9411a3acfe0b4c40675196"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"46a9a2b1fca1f48d4cb1ae80513408cd7eb1e83ad54d0c7c248276e619e88bcd"},"properties":{"dependency":{"package":"tokio","version":"1.53.2","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":"db88ca3768c62a6a2bd1c939467e42a85ba6e3f284d3ea4ecc48c2d9b2f062dc"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","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":"9567bff849cf836b7115700e3a3dddea664a56c67cb0464f9f9ee20baf8e27a8"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","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":"1c973a2a1e2def2baa74c34b1214fa43f0b4c321572ef9d3ca9744c9c37554e7"},"properties":{"dependency":{"package":"zvariant","version":"5.15.0","advisory":"RUSTSEC-2026-0370","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":"7332388d8ca187d371348448c920981c6e045ed3bc3c84ab8d48300e4fab2d1e"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.0","advisory":"RUSTSEC-2026-0372","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":"b57bd94a9054ab1a78280337953ab23bcb5d2500ea7f4b4abe8dc82a1ef1d633"},"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":"254e159535de5a467ea5671a4a81fbc3bf399623b11dcd1fc4071f2230ac5cd0"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: hostsFn.ts \u2194 index.tsx: \u0060src/common/hostsFn.ts\u0060 (context common) and \u0060src/renderer/components/List/index.tsx\u0060 (context renderer) sit in DIFFERENT parts of the tree yet change together 50% of the time (10 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) \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 \u0060d84ffece\u0060 refactor: prefer-const auto-fixes from eslint --fix; \u00605be6c961\u0060 \u591A\u9009\u6587\u4EF6\u5939\u5F00\u5173\u63A7\u5236\u5B50\u9879\u76EE; \u0060618b6365\u0060 The list tree can be multi-selected. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/hostsFn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52382c72177a4cf3802bccfa755e3eeec679d6b6ed38deb39a4b53a5fd93cd12"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: Trashcan.tsx \u2192 EditHostsInfo.tsx, ListItem.tsx, index.tsx: \u0060src/renderer/components/LeftPanel/Trashcan.tsx\u0060 changes together with 3 other files \u2014 \u0060src/renderer/components/EditHostsInfo.tsx\u0060, \u0060src/renderer/components/List/ListItem.tsx\u0060, \u0060src/renderer/components/List/index.tsx\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":"src/renderer/components/LeftPanel/Trashcan.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821cee4b0dc62a401818a5811df253ecd64675a0ee7cc3de8c83e29bbaf2ae6a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: index.tsx \u2194 Tree.tsx: \u0060src/renderer/components/List/index.tsx\u0060 and \u0060src/renderer/components/Tree/Tree.tsx\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 \u0060d84ffece\u0060 refactor: prefer-const auto-fixes from eslint --fix; \u0060618b6365\u0060 The list tree can be multi-selected.; \u006080259ba5\u0060 add trashcan. (at that commit the files were still \u0060v4.0/src/renderer/components/LeftPanel/List.tsx\u0060 and \u0060v4.0/src/renderer/components/Tree/Tree.tsx\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a904e2dddb979e615141cb01ee29afa001ec401e11b0d40e33c3d45a2c81a9b8"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security 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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSegmentedControl\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b385b03015867e8ea85d5aab8c884cde10f8c41ad6580537993333b3c6aa6d1d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSegmentedControl\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcc1b89bec8a3f8c16fa46584700108939254a04c250771785e58d73022ec5b"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSegmentedControl\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8dfb700090d7473f64071144d676a985720ebbf17f07cb377b6205cef7820f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Advanced.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6036fa3075329bc942c80e6c63d4ba3e0dafc5aa29fd370a655d30c21a222c24"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Commands.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b150ddb2bcd935dad228ae1dcb39262a7f74a74f991c7dfba93e48af3c1084"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSegmentedControl\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"436429a250cb10c06f5a1ffc6521a99ac5b57db08098ea64d068af419167645c"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSegmentedControl\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0ce89565c17112b4af5bbb228c116de89788f0ba2f59efd2c2abc08d94e429"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSegmentedControl\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"51523eea3c45d86184b881d5d6f34c6f2e790f76d3b79feaa3a7547aabea7a50"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Proxy.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"43baed4a9ed0a7f8fcf4768acc2b696acf3f52e9129e4a4088a38618a010fa39"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ImportFromUrl.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9eb6ccda4402952d3cbfd85876046e073fad170a7de1413a9a5da4d18cbdf8"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/find.tsx"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43adfcd884816af2bd9984031a0f6a04e1284551e045e44a506482dfc62674d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/find.tsx"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ecc64a59e364b7482098cc3373eac986902f63dbfdf5f2a43dba65be812761"}},{"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. This document\u0027s body is only the mount point \u003Cdiv id=\u0022root\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c006f846c0cd3ada76a94c50c2276ca7911da6637dc6f9fb135de601ed2ced11"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/LeftPanel/SystemHostsItem.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a3fca083338c3f0f850e2cd906f3cfb7fbae3ebd66dd6b5a5bde42206f922b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/ListItem.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"020637fb68c541107ce69dd96218069778e5ac5738b9ef05eeea86efa8003344"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/ListItem.tsx"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad41b5a8c9de4c08506cb3f76d82ef94f665ace2b4db362b9e58b25a2042423c"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable role=\u0022separator\u0022 that no keyboard user can reach: This \u003Cdiv\u003E announces itself as a role=\u0022separator\u0022 and is operated by pointerdown, pointerup and pointermove, but nothing can put focus on it: no tabIndex={0}, no key handler, and nothing in its scripts moves focus. A keyboard cannot produce a pointer drag, so the control cannot be operated at all (WCAG 2.1.1). Give it tabIndex={0}=\u00220\u0022 and move it with the arrow keys in a key handler (with aria-valuenow for the position it holds)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ResizeHandle/index.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"548b06b327b99c60aa980ad81a2bd91bcd7e52f6180fda520e446190b565dd27"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70e7902c4bed5ebbe06461b037fa17c36300e2984ca8f3a7ca6b456d4c4c200"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf711051b8eff4716f3a4941d9f048624228998a9d54ba85e702bc12547c7888"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.result_column_resize_handle\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":"src/renderer/pages/find.module.scss"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a6a35f70e302692181f07b716fe948fdba5071d39706ae2ea10d9e791daa3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.domain_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":"src/renderer/components/EditHostsInfo.module.scss"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c450a96efc9aba7afa67fa3dc1d61ac3396ccab0f4853058d8748ed5539a1d0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.editor :global .cm-editor.cm-focused\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":"src/renderer/components/HostsViewer.module.scss"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"89900cb69be98c432d26cb69a6deef32796ec0a3d1e6c2f2f65c8d3bdb037d4d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.editor :global .cm-editor.cm-focused\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":"src/renderer/components/Editor/HostsEditor.module.scss"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ff2cf6165c53d3ef885f832300c66aa8d3f0385367d347612d9e0098da8e89"}},{"ruleId":"C2","level":"warning","message":{"text":"No authorization: This repository serves requests \u2014 a server (axum::serve) (src-tauri/src/http_api/server.rs:121) \u2014 and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/http_api/server.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f3eece71c3ac0b2185f71e8e4074420754e116fa6b60482fefa752e0e17799"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.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":"package.json"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"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 (22 matched lines \u00D7 2 locations): src/renderer/components/SetWriteMode.tsx:71 \u00B7 src/renderer/components/TopBar/ImportFromUrl.tsx:101 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/SetWriteMode.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc3f3233906f54ee5ed60c6de6989ff2bffd43ce42af541b0a2c979677a9514"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): src/renderer/components/List/ListItem.tsx:116 \u00B7 src/renderer/components/RightPanel/index.tsx:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/List/ListItem.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cae1cecc2b33fd39e2a95db43069efe3bafa078ecf71e496fe79129aeafe74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/renderer/components/Transfer.tsx:95 \u00B7 src/renderer/components/Transfer.tsx:139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Transfer.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6b4f90873f1e275ca9443d5622f9002be938a8a3f8c53a5f92bafa3b3dea7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): src/renderer/components/Pref/DataDirRecoveryModal.tsx:36 \u00B7 src/renderer/components/Pref/DataDirRecoveryModal.tsx:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"src/renderer/components/Pref/DataDirRecoveryModal.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f9f79521ecbb1d5943cdd4bb636682345e20174726afc3118e95c77ff84001"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/common/tree.ts:21 \u00B7 src/renderer/components/Tree/fn.ts:11 \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":"src/common/tree.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"947e63c039cc61dabb872128a01b1069816f91138c6c9b1477eb6b84a08a631e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/renderer/components/LeftPanel/Trashcan.tsx:96 \u00B7 src/renderer/components/LeftPanel/TrashcanItem.tsx:103 \u00B7 src/renderer/components/RightPanel/index.tsx:344 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/LeftPanel/Trashcan.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1771a72e8fa553335143791ab4f27a3d3502b5fd931ecc67311099a7a4d61b73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/renderer/components/LeftPanel/TrashcanItem.tsx:33 \u00B7 src/renderer/components/LeftPanel/TrashcanItem.tsx:52 \u00B7 src/renderer/components/RightPanel/index.tsx:122 \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":"src/renderer/components/LeftPanel/TrashcanItem.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fdddb1863a683027885eb1754e9cb610e99f8e8164000ad74dcc508c22a037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/components/TopBar/index.tsx:94 \u00B7 src/renderer/components/TopBar/index.tsx:185 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/index.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2705f1c12b54e89125f8c7089d9c771a3a593cda1d16ea32064a56ddd693c561"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/pages/find.tsx:771 \u00B7 src/renderer/pages/find.tsx:832 \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":"src/renderer/pages/find.tsx"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e438565030445ad7e671ba5cbeecf2abf154a6b7538cfc6c499f4c8e21f0d4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/renderer/pages/index.tsx:79 \u00B7 src/renderer/pages/tray.tsx:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/index.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae8e02468a68b3f1b4aa2ae304c8ecfa3d0a831954a3bf97c7222abc6e0849f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/renderer/components/Pref/Proxy.tsx:58 \u00B7 src/renderer/components/Pref/Proxy.tsx:74 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Proxy.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"525a74e656a4fb369e526a897f7f008c1416ae1fce47ae161252e7a5e43c6ca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): src/renderer/components/LeftPanel/Trashcan.tsx:51 \u00B7 src/renderer/components/LeftPanel/TrashcanItem.tsx:40 \u00B7 src/renderer/components/LeftPanel/TrashcanItem.tsx:59 \u00B7 src/renderer/components/RightPanel/index.tsx:109 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/LeftPanel/Trashcan.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9722436638f872fc4515b0ca98772141879767fc3b031934465edc043f472d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/renderer/components/LeftSidebar/index.tsx:46 \u00B7 src/renderer/components/LeftSidebar/index.tsx:57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/LeftSidebar/index.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"20167c3af1689808a32e68ba533e00d0da184d39900cc1c36d9dca597572e7ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/renderer/components/Pref/General.tsx:211 \u00B7 src/renderer/components/Pref/General.tsx:223 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa20bc00402690697a3da6ac0c930c9aeb7c8c08c3baf2ae8e69da5e4cd35531"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/renderer/components/RightPanel/index.tsx:96 \u00B7 src/renderer/components/RightPanel/index.tsx:117 \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":"src/renderer/components/RightPanel/index.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b218f6e48dec56b5e30a121afa5dbeaddd59b287c63a50324a17f2ba11e96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/components/Pref/General.tsx:192 \u00B7 src/renderer/components/Pref/General.tsx:236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"742f9c27d7fa1f908e18df73b599b985d91ab3656d8bd748ce227abf30ef163b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/renderer/components/Pref/Advanced.tsx:129 \u00B7 src/renderer/components/Pref/Advanced.tsx:139 \u00B7 src/renderer/components/Pref/Advanced.tsx:149 \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":"src/renderer/components/Pref/Advanced.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e712c71be02c34afa5cccea18b826390677753b246b14d9520b3f7f34415836"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/renderer/components/TopBar/ImportPreview.tsx:278 \u00B7 src/renderer/components/TopBar/ImportPreview.tsx:294 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d14fbd38cc3a09ac7afcca2c32d46b4c90606fa35f16076ea73da04aaffb164"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/renderer/pages/find.tsx:876 \u00B7 src/renderer/pages/find.tsx:899 \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":"src/renderer/pages/find.tsx"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab24bf3e6145b9b68fff6182aac1d23671644715f14c7d4c24d425ff3b1578fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/renderer/components/Editor/hosts_links.ts:89 \u00B7 src/renderer/components/Editor/hosts_links.ts:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"src/renderer/components/Editor/hosts_links.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c314eed3afccebc8e72ba41c3bdb9839aad036caf582fda29f56868bf18079"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/renderer/components/Pref/Advanced.tsx:60 \u00B7 src/renderer/pages/find.tsx:245 \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":"src/renderer/components/Pref/Advanced.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f686de60d67b7e90461e1b2b68130060bab21570f3b9f8cf08a3c97012ffcb11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/renderer/components/Pref/index.tsx:213 \u00B7 src/renderer/components/Pref/index.tsx:220 \u00B7 src/renderer/components/Pref/index.tsx:227 \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":"src/renderer/components/Pref/index.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbfcede9c0b920f03651e6a14ae4bec94b97c0a0939f83d34430ff069075fae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/renderer/components/EditHostsInfo.tsx:55 \u00B7 src/renderer/components/Pref/Advanced.tsx:61 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ace48686cd5520b0433a39e2d92240fe98097e60c226af41b25337c3b37c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/renderer/components/Pref/Advanced.tsx:176 \u00B7 src/renderer/components/Pref/Advanced.tsx:208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Advanced.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"648267008b03fd5e2c3fa2cf7ba73bf9ede4c871bb674d8854a1a9aab6f2fe49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/renderer/components/Pref/Advanced.tsx:208 \u00B7 src/renderer/components/Pref/Advanced.tsx:218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Advanced.tsx"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0605885ecbe1293110b14f92aabbab5cedee7b25ddbb3ed52a2665b59652d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/renderer/components/Pref/Advanced.tsx:219 \u00B7 src/renderer/components/Pref/Advanced.tsx:225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Pref/Advanced.tsx"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3c93c3c34c47daa35038a530d2c0b5e980858a1f559c3b6fc521dc53135b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invoke (cyclomatic 124, cognitive 134): invoke has cyclomatic complexity 124 and cognitive complexity 134; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/support/tauri-mock.js"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"143852d3a4f5f87efa35cac01f9486b82ede5fd9594496165025b173df215431"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImportPreview (cyclomatic 42, cognitive 34): ImportPreview has cyclomatic complexity 42 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"94228075c4816b6d3c60db49b444404fafa6e7c7d05e8a70f0e58c8edfcb92dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFriendlyUpdateErrorMessage (cyclomatic 34, cognitive 13): getFriendlyUpdateErrorMessage has cyclomatic complexity 34 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/core/notify.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"13946dbad57238d31433f3d73d19d40ec6bfb39acbda862b97dceebd9a8e2f66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Node (cyclomatic 31, cognitive 25): Node has cyclomatic complexity 31 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"863c179e91d079126e6a1ca41223c741d418c217e0c13b474214b0712e59412a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RightPanel (cyclomatic 29, cognitive 28): RightPanel has cyclomatic complexity 29 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/RightPanel/index.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b67292606412949fb56ca69c9d7efa700f649f6f0f95744dd1bdf87f0b386c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function History (cyclomatic 28, cognitive 23): History has cyclomatic complexity 28 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/History.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"03659af6b65e1c546f01f025198031a1d86148fc817ba088c083c1beb3fa63fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 24): (anonymous) has cyclomatic complexity 27 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b0536e95b171f66fb6f6d165d0ae08673fa1873e742bbafc2eb24fe1a831a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 38): (anonymous) has cyclomatic complexity 24 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/models/useHostsData.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbeef194cd415fee462d4ab0b188cd81a03b68e14b0d318156eec337677fea3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSave (cyclomatic 23, cognitive 29): onSave has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e068e2120f5fd5eafc2e6de138cc3aae977cc7efa4a74fc941264e9bc48ec1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HttpApi (cyclomatic 23, cognitive 17): HttpApi has cyclomatic complexity 23 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":"src/renderer/components/Pref/HttpApi.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d325abc6e437db1b973ffd4a972716d2c8a65e20da9335787a054506684966b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 16): (anonymous) has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce953874934539cbc9bec2f61bb7f499711efb877844c17b13e95771a21f57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function General (cyclomatic 20, cognitive 16): General has cyclomatic complexity 20 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":"src/renderer/components/Pref/General.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c10cfdbf1599211726664cdcae5bcdf900a5b855ef58fe90244009c0518dc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EditHostsInfo (cyclomatic 19, cognitive 15): EditHostsInfo has cyclomatic complexity 19 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61b8b91211ad123d7112e9f041db326838ae0664334ed0935852834c156fec7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FindPage (cyclomatic 17, cognitive 14): FindPage has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/find.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f135e9a04499a226934c8af9e51d2b7fcc2e5cd7f7228af71e278518a620b723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDragOver (cyclomatic 16, cognitive 18): onDragOver has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c39474771b0951e23a0761526e6ae0d9f3a0748e318b5c188320f73d4af07db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TopBar (cyclomatic 16, cognitive 14): TopBar 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":"src/renderer/components/TopBar/index.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d25e6a6a4b642b67b446e3869f0ce8aff695906b8cdb22b1521b766e41a6978"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortContentGroup (cyclomatic 15, cognitive 28): sortContentGroup has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sort-lang.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e1fa7e95772dd98ef4106e48b2c29193dd93aa1b787f7a6ff6e318a99bf0b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshHosts (cyclomatic 15, cognitive 20): refreshHosts has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"347de13a16d6bdf2e610053c4a90011ed2f074818c8cff96d97a392fa7d88d1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/hostsFn.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf3d050f4f6c1f855e3854418b4948304642170bffd9991279bcec3be353162"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdateDialog (cyclomatic 15, cognitive 14): UpdateDialog has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/UpdateDialog.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"486463b50da9aa15876d73b0cd56a2cd50aa1750b96baee79d63482e71b675fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceOne (cyclomatic 14, cognitive 16): replaceOne has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/find.tsx"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05b70dd7f01e85163b4a574e9ac3c30d456e8d9a74cd946083399d343c0bed6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceAll (cyclomatic 14, cognitive 15): replaceAll has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pages/find.tsx"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83233ffc5a5f7d9e80d38efffbbed4a3e11c1445198ef926659f3f7fadaf2aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/dns.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ca8ec9e00f4b13214883affbf097d86498da08e47707f8666056d5e32eef53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importErrorMessage (cyclomatic 13, cognitive 12): importErrorMessage has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7bd6ad180f709011ad4be00d2d4dbca9164b2cb4dc8a0b900f58d4babafd04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshRemote (cyclomatic 12, cognitive 18): refreshRemote has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/support/tauri-mock.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"76433a05dc7e087a4d0a09e81b9bc4390972fde644117b78f05fcb1366efebb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEqual (cyclomatic 12, cognitive 18): isEqual has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/Node.tsx"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a8e23dc9d8015d1dc167343763a1ca79472e30b28fffa89c78c89994ec36eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MainPage (cyclomatic 12, cognitive 11): MainPage 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":"src/renderer/pages/index.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c798e44f0dd9dcca9b508a9b6026a59b8d57c95e0c03eb68a13a28912f0c5688"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/hostsFn.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d96791a0fab70dfde6f3286f5eb08dbeba313238274e99315ed613a3aab6c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyChangedRemoteHostsToSystem (cyclomatic 11, cognitive 13): applyChangedRemoteHostsToSystem 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":"src/renderer/components/List/index.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef745dc46de49cf85c1ac779b3ad9b6038de2923f04c5b37c8c2c7019b95a76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findObjectRange (cyclomatic 11, cognitive 11): findObjectRange 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":"scripts/sort-lang.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1407e2e417442f6aad23966ba72aabccc881d2dc5ad28d1506997adfa87d5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isTitlebarDragPoint (cyclomatic 11, cognitive 9): isTitlebarDragPoint 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":"src/renderer/utils/overlayWindowDragging.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"892030506a11f83e3e26485e5483df0926f0d6c5ac206fa8c4872465ef4ac67d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/pages/find.tsx: 1051 lines of code: src/renderer/pages/find.tsx has 1051 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":"src/renderer/pages/find.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd88294d510f7df525aa562545dc31fbab038175afe42640b645a7ba0d0bcc8d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/EditHostsInfo.tsx: 609 lines of code: src/renderer/components/EditHostsInfo.tsx has 609 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":"src/renderer/components/EditHostsInfo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36852efdd06baf3b3abe0943155c6c3b306e661419a16254ffe5c758a283a095"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/TopBar/ImportPreview.tsx: 463 lines of code: src/renderer/components/TopBar/ImportPreview.tsx has 463 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ImportPreview.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8696931582f0fc2c0558ade5160fdc8e9b22f1397e8920259b1d0233d665e9c2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/History.tsx: 432 lines of code: src/renderer/components/History.tsx has 432 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":"src/renderer/components/History.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f2edc43060c376f21f9a34091d8a0e96357e4dc80422baff7ac5c35ea14053"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/LeftPanel/SystemHostsItem.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80230b59be863f5ba3ed7683c4dec11a08e18902df62cb47cae861905e5905e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Lang.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"429b90f1cec9994adec085118e202d7097d4610ad42fc8eee5739c67bfa779c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/utils/css-var.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af88c31548eb7b73ba573cae53d64b34c4d96f6aeaa430c308c9ed47fb56e1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/utils/wait.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ae8bf7c55e15a88ddcf741ae227a30e6d11568807ac7dc8b7dd2f10067de1d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (23 application, 11 tooling, 45 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":"src/renderer/components/LeftPanel/SystemHostsItem.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d60815b9c6e677bb0339a5ea8e58a8a485aa8588eddcd1d2c0f49f12f2166f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (23 application, 11 tooling, 45 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":"src/renderer/components/Lang.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa921941b6e2924ff402b3194fee0fac0036d378f1b4820539bac0c3a42b4ca"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (23 application, 11 tooling, 45 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":"src/renderer/utils/css-var.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7971fb364c450f0df86da69d49dc05208b67dc6ff2cba6103e525a1930778e5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (23 application, 11 tooling, 45 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":"src/common/utils/wait.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9d106aacde1d72675a008ecd1a4b3b6455112ddfd5ef3cde8337530b1021ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027downloadUrl\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/constants.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49f624f8fd2659ed43e8e3ee1361a55c5e474e740a4536f3abbc6bc97d80dd2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cleanHostsList\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/hostsFn.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef39b6c5c29f77d2dff2620209ab9084e489a56ec3f5ceee5b63b6421bff722"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateOneItem\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/hostsFn.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"164002c831a82fa38d7b12d2026ee8335c9afd36ebddcfd0cf78a5abcfefc3b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getNodeById\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/tree.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b65676e6dc4a47f2fe136264f5c67239d033d68a4365a37e3578b255ecabfc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isParent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/Tree/fn.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9efb30ba47d3350065c7111d0eb718cdc085c6729437c48fd4e36b2bed8926"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isHalfWidthAtom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/stores/i18n.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b222ff68f4fbc068ba7e550b7ed2ca726e7ae25534af2e16b1dbcfc20ee51b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tslib\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d8a3d0faa47fd18b071ac2ea263bb7395790d201b593acc4743b98814298e27d"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (src-tauri/src/http_api/server.rs:121)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (src-tauri/src/http_api/server.rs:121)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"S1","level":"note","message":{"text":"No inbound request validation detected: No handler of this repository\u0027s Rust server answers 400, 413 or 422 (\u0060StatusCode::BAD_REQUEST\u0060, \u0060HttpResponse::BadRequest()\u0060, \u0060Status::BadRequest\u0060, tonic \u0060Status::invalid_argument\u0060), and nothing declares validation \u2014 no \u0060validator\u0060/\u0060garde\u0060 derive, no body limit (\u0060DefaultBodyLimit::max\u0060, \u0060RequestBodyLimitLayer\u0060, \u0060JsonConfig::default().limit(\u2026)\u0060, Rocket \u0060Limits\u0060) \u2014 nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (src-tauri/src/http_api/server.rs:121)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ffa303f3c9cef4b4c2cf028a78ce2f3c83f6078f80716eea7362fad047265eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!data || typeof data !== \u0027object\u0027 || !Array.isArray(data.list)\u0060 appears character-identically in 2 files \u2014 src/renderer/components/TopBar/ConfigMenu.tsx, src/renderer/components/TopBar/ImportFromUrl.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/TopBar/ConfigMenu.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdec0cae779620ab38dc88a193df3ffd82c89376ffc2260ceac748d065dcc8c"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.7 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 13 assertion(s) across the 17834 source line(s) of the 108 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: src/renderer/components/Editor/hosts_links.ts (7), src/renderer/core/agent.ts (2), src/common/import.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060timestamp_label\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src-tauri/src/migration/archiver.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e819dbcabc4934e5fe124fc3fcc0c556366858b8dc8b521516d54e498cb63dc"}}],"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-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-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/"}]},{"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":59,"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."]}]}