{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"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":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"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":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.receive (cyclomatic 294): EngineRuntime.receive has cyclomatic complexity 294 (threshold 15). Of this number, 293 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7143630561271ccd1a66064dbe53c490c382fce0aa0358ee8fa528913658b0b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityState.consumeRecord (cyclomatic 252): ClaudeActivityState.consumeRecord has cyclomatic complexity 252 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe34f9ccbd4b9542b37444631e65dcbca003295060d6e96319496079f1f531d"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopWireProjection.consume (cyclomatic 184): DesktopWireProjection.consume has cyclomatic complexity 184 (threshold 15). Of this number, 182 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca5230e9444ee5abd441a387a59cebf9f4a4b828de83979cbf9f72121ea2fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"App.OnStartup (cyclomatic 172): App.OnStartup has cyclomatic complexity 172 (threshold 15). Of this number, 136 points are the body\u0027s own statements and 36 belong to 13 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c0e98cb2b94def54b195d20882eb07a14657755092d5627c16f09e9b3474cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.consumeLive (cyclomatic 157): SessionActivity.consumeLive has cyclomatic complexity 157 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6823820fd32f675668e531adf4a420f0192d4b5ea69d292737abc8f1b87593"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopWireProjection.projectedValue (cyclomatic 142): DesktopWireProjection.projectedValue has cyclomatic complexity 142 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f96137621d0b3c3a9c0a45958b83822e02e5ce19db016eef3692e03b71d3ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityRecord.transcript (cyclomatic 135): ClaudeActivityRecord.transcript has cyclomatic complexity 135 (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":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9c0113d2961b590b23e77fcbeb01660ac0484b386df6f9b30dce47d7bc2855"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeEventState.consume (cyclomatic 125): RuntimeEventState.consume has cyclomatic complexity 125 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RuntimeEventState.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f258387b3b39e4d38db25ffbd93dd365a8770389c6802d472d44871542edb10"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_hook.hook (cyclomatic 116): claude_hook.hook has cyclomatic complexity 116 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_hook.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a9363b142207e15da06cab28c54fa2f0ee643894eb7138238b8caa63f5bc91"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDesktopSession.receive (cyclomatic 111): NativeDesktopSession.receive has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/NativeDesktopSession.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cccafd3731feaf26156f1746f784ea841fc5672663425e6e2e224e7c097fe46"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactBarPresentation.project (cyclomatic 108): CompactBarPresentation.project has cyclomatic complexity 108 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (CompactBarPresentation.project::entry) 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":"native/Sources/PacerCore/CompactBarPresentation.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bd4c77721526f6d0a9b9d2e0facfb9141190a4030ed3ec40bb9fe3f6e7a04c"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekActivityState.consume (cyclomatic 106): DeepSeekActivityState.consume has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekActivityState.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca36693ffd1b372802ddc14b45fb1041d1281b851af4db80df9255683b0a2883"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.configure (cyclomatic 102): EngineRuntime.configure has cyclomatic complexity 102 (threshold 15). Of this number, 100 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"936a48f271462780461894ffe3877971d09dc530e73b6d708b29c40bdc4cc80e"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.consume (cyclomatic 99): SessionActivity.consume has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9adc64211027efb4d362decace87e8a76b4c994593693a7b256038acff72f5"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalActivityReader.read (cyclomatic 99): LocalActivityReader.read has cyclomatic complexity 99 (threshold 15). Of this number, 92 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalActivityReader.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a83cfe610db0fdd3eb9cee482028bc3d672ff858b859a9b1a8f52ee3e8ba990"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_activity.transcript_record (cyclomatic 90): claude_activity.transcript_record has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6aa0426bb27c11ba3ae8f1401d148e930be65faae1f7777b3d5e9b2c04c30e"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsPalette.Apply (cyclomatic 89): SettingsPalette.Apply has cyclomatic complexity 89 (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":"windows/Desktop/SettingsPalette.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e8e812768ca5a994ad05a256d23df636e7fa17c56479059d48813eda411fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.publish (cyclomatic 89): EngineRuntime.publish has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"37705e3c54aadeb30299f138b8ee9c01d76f33327c9f97270f076afbaab1e8fb"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityReader.read (cyclomatic 88): ClaudeActivityReader.read has cyclomatic complexity 88 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityReader.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5db059357b21a10d3ada3067d1724392683c805d653c15057f1758f56daf28"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalHarnessProgressSetup.apply (cyclomatic 82): LocalHarnessProgressSetup.apply has cyclomatic complexity 82 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 17 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalHarnessProgressSetup.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"99725348173b348a4e37274e15fd962494323578945751b83bb464fd55dbcafe"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeActivityMonitor.receiveDesktop (cyclomatic 79): RealtimeActivityMonitor.receiveDesktop has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc70a9824a182f931a8cfc500f8ee463f10a4912b1bfb70f2895867d7ab1434"}},{"ruleId":"D1","level":"warning","message":{"text":"PacerEngine.run (cyclomatic 77): PacerEngine.run has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ae8f38d48bb08794806491480a1a5ad6ed91ed00e1917de8cf36fcee2a2097"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessProgressGuide.init (cyclomatic 75): HarnessProgressGuide.init has cyclomatic complexity 75 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessProgressGuide.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"09437d5c8d434ab80f3f94b9b0e391a99b050d148ea6f00ed68750398ddfcf4f"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskProgressRing.Apply (cyclomatic 73): TaskProgressRing.Apply has cyclomatic complexity 73 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskProgressRing.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae701e375c6c516805125b10fce65ec4bac1692f74e6a74f1df56435187f43d"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskStatusIconNSView.apply (cyclomatic 68): TaskStatusIconNSView.apply has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a3a32f04e0d537db2e6b9c4609e515597e8e0b468324bbe180dadda928ae68"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityBadge.Update (cyclomatic 67): ActivityBadge.Update has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f586b7b20b03b4a507f24567813664b5b37400240bb3a332632c91113ad606"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshCollapsed (cyclomatic 67): SettingsWindow.RefreshCollapsed has cyclomatic complexity 67 (threshold 15). Of this number, 66 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCollapsed.cs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8a718cce3bfcebf7c4045fc511e007ba018683bdf51c6b4792a3a073cec73"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddyTranscript.consume (cyclomatic 65): WorkBuddyTranscript.consume has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyTranscript.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efb0ea0b1327b3201cf81cc3581263bee3867b24829a282decc902fd62100fb"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshDeepSeek (cyclomatic 62): SettingsWindow.RefreshDeepSeek has cyclomatic complexity 62 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a34e58c8655375f3ea348d9bd1c2b54c1eae8bdaaee89eb129dd138520265d"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeQuotaClient.fetchQuota (cyclomatic 62): ClaudeQuotaClient.fetchQuota has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c419c50dd7f727ccebcc956772ecc58d02274ee00baeebcab2578264711c98c0"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshConnections (cyclomatic 60): SettingsWindow.RefreshConnections has cyclomatic complexity 60 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsConnections.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a00116cfdef2c480a03b172dd331deb893b104ef6b65e2ee795036264ecdf7"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshHarnessProgressGuide (cyclomatic 60): SettingsWindow.RefreshHarnessProgressGuide has cyclomatic complexity 60 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"96415f7bc3362304ed7902d99987175489eb845fdb9c40df407658c25abd03d4"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsActivityNavigation.resolve (cyclomatic 60): WindowsActivityNavigation.resolve has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsActivityNavigation.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe2a2c62419004a0baec2e90b45e0cfc9e2f5a4513ebd4c80930266be58d29a"}},{"ruleId":"D1","level":"warning","message":{"text":"PanelController.layout (cyclomatic 60): PanelController.layout has cyclomatic complexity 60 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PanelController.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab54bfc10202f95f0014bd86e56be05039750344aa28aeed629b8941ac6c26a"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_remote_setup.install (cyclomatic 56): claude_remote_setup.install has cyclomatic complexity 56 (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":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e79aecd52f7629e6c113c5c270d87f1b76a097f33c8637a0cbd46dea329be3"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopFrameDecoder.field (cyclomatic 55): DesktopFrameDecoder.field has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1d4cddd52a16ce017b48ebd539190f5bc1528debe485ad29b7f7ec48419c8"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeActivityMonitor.reconcile (cyclomatic 54): RealtimeActivityMonitor.reconcile has cyclomatic complexity 54 (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":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f7a5e26884160e06594d8c1eee56ca8101a3453af87d2bb25ed2931b5b5ebf"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_activity.otlp_records (cyclomatic 53): claude_activity.otlp_records has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b82b41311d8dece597c144331ff7dcd194bd0aaecea8f5077bd9f71012c2925"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.UpdateCompactBar (cyclomatic 51): IslandWindow.UpdateCompactBar has cyclomatic complexity 51 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandCompactBar.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9230811d4af4621e71f79f4fbc8c06589a7176ea98025c0f34df0dcf997d7e"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekSessionLog.parse (cyclomatic 50): DeepSeekSessionLog.parse has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f124d9477e4642d3eb6f6d9231c210f08aab6f2222982e43020c59aaca023ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityTelemetry.request (cyclomatic 48): ClaudeActivityTelemetry.request has cyclomatic complexity 48 (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":"native/Sources/PacerCore/ClaudeActivityTelemetry.swift"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b994ceb84d57e08629b0092e4b9b481593f528091bdd8bc3a8da8c56308b0acb"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_activity.main (cyclomatic 48): claude_activity.main has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"d212977325e1c1988d2f4519de581dd2589df153fc31ac15cbb49adaf151a187"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsConversationApplication.TryDestination (cyclomatic 45): WindowsConversationApplication.TryDestination has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be1500ea94fdd8433452bf4b67b3727e557c45d1a98dd5201d55efa14d82585"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCloudProjectState.applyThread (cyclomatic 45): ClaudeCloudProjectState.applyThread has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectState.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26ada9b6ce00b4d75f493882dab310c6ee2e88c3b9a961873f305046ed94e96"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionPagePresentation.init (cyclomatic 45): ConnectionPagePresentation.init has cyclomatic complexity 45 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ConnectionPagePresentation.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"407d47f11886ef3daf943f1b0d94063ce1193eef09e86f786b0f6a6f38a0c1c1"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshUpdates (cyclomatic 44): SettingsWindow.RefreshUpdates has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsUpdates.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff90870ae22e03e3c3b95cc6765bd74a2f6c6a9c84b0ce301d35bfee90d61c2"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.mergeDisplayMetadata (cyclomatic 44): SessionActivity.mergeDisplayMetadata has cyclomatic complexity 44 (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":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"294e0d6974dc340da9cfbebd430c28167a8f6728f3c60a66111450818807fe82"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddyMonitor.project (cyclomatic 44): WorkBuddyMonitor.project has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7767701b86abc1c6af178327a43f7367d6d1f8425873432b13ae006ff00f58"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.CommitSourceAsync (cyclomatic 43): SettingsWindow.CommitSourceAsync has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb4f2c4f010646a8cf5f7cedeeaf03e222a4faa407fc8e8fb37cb9ed4952236"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshReminders (cyclomatic 43): SettingsWindow.RefreshReminders has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsReminders.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"989f05ceede45d8f7a09d96a0e1f9dc8124ce886c6bbac34519be00a9b82d64e"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.collect (cyclomatic 42): EngineRuntime.collect 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":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b4692e004d20a4293c85617debcbb9c4c222bdf2c12eddd6d439190e1a10f8"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskStatusIcon.ApplyFace (cyclomatic 41): TaskStatusIcon.ApplyFace has cyclomatic complexity 41 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskStatusIcon.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0313b5742c1ef8f5f241307d0ec3d895f4bc4e221625997dedca4050cc8a0307"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsHTTPProxy.forHTTPS (cyclomatic 41): WindowsHTTPProxy.forHTTPS has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPStream.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"281432827de63b5d6296d210e27e39aad2bd9a8f56733a357dda0382a456d0e2"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddyMonitor.refresh (cyclomatic 41): WorkBuddyMonitor.refresh has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f024e66a62e6d467d97f776f895f107ab1e5cc0e05f093a1a058bfde0024d49"}},{"ruleId":"D1","level":"warning","message":{"text":"GuideContent.Module (cyclomatic 40): GuideContent.Module has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 7 of the 40 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 473, 458, 460). 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":"windows/Desktop/GuideContent.cs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0542bb9b09cf26a8a8cd90f0ecdfefb93ab848f6738b0052cba302ae9e944e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineShellProjection.reply (cyclomatic 40): EngineShellProjection.reply has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineShellProjection.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4badd9feb060b5a46c5bc070608af95d4acb82385281efcb084257e2f2f3842c"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.consumeCodexReport (cyclomatic 40): SessionActivity.consumeCodexReport has cyclomatic complexity 40 (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":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"46484f7885a1bf079199e0a6b7479eefaf7a4e27e94213db0b2aa83064688b74"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeWebQuotaClient.fetchQuota (cyclomatic 40): ClaudeWebQuotaClient.fetchQuota has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeWebQuotaClient.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a000767ee90915edb561e4caafd9bf2fc51cbd0b4f843db488cbb2851d9ddd64"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalActivityReader.latestTurnAnchor (cyclomatic 40): LocalActivityReader.latestTurnAnchor has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalActivityReader.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c393da9346b1973cf97393cde5c98d3173c903303b1766bbf7cee0d3323d59f2"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskStatusIconNSView.applyFace (cyclomatic 39): TaskStatusIconNSView.applyFace has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62926e401eaec2bb1665d06c3c7776b93153bedbbb1c423b505742f59b2bd81"}},{"ruleId":"D1","level":"warning","message":{"text":"PreferencesCodec.Decode (cyclomatic 38): PreferencesCodec.Decode has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"02143684ca98c5e3f66e108945a8fa8c661a0cc3ef883cd290ed057a6c741939"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshClaude (cyclomatic 38): SettingsWindow.RefreshClaude has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsClaude.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1a8336be2beef2653539fdadb170b232d5659da71613d43ed244cdf11b19f6"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineClient.Receive (cyclomatic 37): EngineClient.Receive has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb124b125b09c629b58d69476debce12576f369d4d44fce6c3a7f5ac54ac13d"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshCodex (cyclomatic 37): SettingsWindow.RefreshCodex has cyclomatic complexity 37 (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":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"163fb5236f1fccff4f43f4fbdf66c19fa784f2943ef9890f8e9d6c94cab09564"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekProgressSetup.apply (cyclomatic 37): DeepSeekProgressSetup.apply has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekProgressSetup.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e738c0450d9eff3241fa9ed71c5138852d821ec92e945ee7e1e02e1ec1e2f02"}},{"ruleId":"D1","level":"warning","message":{"text":"JSONFieldView.protobufIntegerText (cyclomatic 37): JSONFieldView.protobufIntegerText has cyclomatic complexity 37 (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":"native/Sources/PacerCore/JSONFieldView.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba016037fe1356206287f553e62143cd3d644b17b01f1cfdf73dcee67cef0ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskStatusIconNSView.updateLoops (cyclomatic 37): TaskStatusIconNSView.updateLoops has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"687c14b6af765c46181e5178f6628b0aee641326c0fea2362c27b04078ada8c1"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshDeepSeekConnection (cyclomatic 36): SettingsWindow.RefreshDeepSeekConnection has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeekConnection.cs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdca73d854c8ddb995d3c695f320be5a5b3dc3a374366eddd295b4f0b63410c"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.PanelBlockButton (cyclomatic 36): SettingsWindow.PanelBlockButton has cyclomatic complexity 36 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 18 belong to 5 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff619df0a26c29a7372b399d2bb490d5046117a1663954708dad8ba1d9f074"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.projectCollected (cyclomatic 36): EngineRuntime.projectCollected has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f49adbcef05b6464209e69461adfe0243e5153d724e9d1aeb5b051b86ff626"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.RenderPanel (cyclomatic 35): IslandWindow.RenderPanel has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPanelSections.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"93794c1fc80b582358dd3492e40e1bc732a58ee60ef078bf91446bdf08d23b68"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.connectionPresentation (cyclomatic 35): EngineRuntime.connectionPresentation has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf83ddf2ec011a5a53d8a122b46cfb968e8139525f1dcfc46cee6dec6e67cbf"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCloudProjectMonitor.pollOnce (cyclomatic 35): ClaudeCloudProjectMonitor.pollOnce has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"102c463735c5b7094656d12ca948c82a32418b033ad33e1898360f186c0fbccd"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeHookInstaller.setPlugin (cyclomatic 35): ClaudeHookInstaller.setPlugin has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dce1f1bed64b8d6c6a5e437685309184e7412f2c3fc7a547f99223703b44ca"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionInbox.observe (cyclomatic 35): CompletionInbox.observe has cyclomatic complexity 35 (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":"native/Sources/PacerCore/CompletionInbox.swift"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5838940b1f5d87c9ec10ade21cfcc8684eb2e86d2d9044e5b16aea2d72d9af"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopFrameDecoder.sanitizedPatch (cyclomatic 35): DesktopFrameDecoder.sanitizedPatch has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c02916b00c10797d028a93e6e4a63b4f43d5073b138903fea14e132f2f959d"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_activity.sanitized (cyclomatic 35): claude_activity.sanitized has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8815eac38ddd5ef8667560b1df7028b4fb488c8b0845bab5651192c7f430499"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.BuildDeepSeekConnection (cyclomatic 34): SettingsWindow.BuildDeepSeekConnection 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 10 function literals inside it that branch (lines 50, 78, 99, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeekConnection.cs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc1f59e0f59994cc4950ea4d92897dc755a744c0e2daa63185f596f7e091864"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshExpandedPanel (cyclomatic 34): SettingsWindow.RefreshExpandedPanel has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0f9703930d693b4b477bc86c29fa8b8e48e977851c06a9e8370c606290850"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexLogAttention.consume (cyclomatic 34): CodexLogAttention.consume 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":"native/Sources/PacerCore/CodexLogAttention.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5b96157d087f8b6461f408fdc3702e093323856d04239f0a7b8450f1ef0d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessActivityStore.accept (cyclomatic 34): HarnessActivityStore.accept has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessActivityStore.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b085b70b6c864333579fcbd7f3a01db806508d5ea1e0543db9701395728ccd2d"}},{"ruleId":"D1","level":"warning","message":{"text":"Tailer.read (cyclomatic 34): Tailer.read has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"40316134b3e8321e5ca991a62e92fee584239ae708894d8ecdb6d70868d82bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_remote_setup.set_plugin (cyclomatic 34): claude_remote_setup.set_plugin has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f946fa604948b89d5b41f80b7f00c6ca88e2e82ab6a8061e3a242dd89c12824"}},{"ruleId":"D1","level":"warning","message":{"text":"AlternatingQuotaText.Update (cyclomatic 33): AlternatingQuotaText.Update has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AlternatingQuotaText.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c95ccefe6dd2256f2d1720dc9bf3ecb558db7c8e118923f3107d21626c1bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessAccountCard.Build (cyclomatic 33): HarnessAccountCard.Build has cyclomatic complexity 33 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HarnessAccountCard.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba57906a06c5ea55e19e53882889913006d59c0f83a29f939e40c7e6af0b96b8"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskProgressRing.UpdateSpin (cyclomatic 33): TaskProgressRing.UpdateSpin 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":"windows/Desktop/TaskProgressRing.cs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f4937cc3aca64ff29fc250652c47fd977bf66baef6c95deb7f083feb60b61b"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.consumeResponse (cyclomatic 33): SessionActivity.consumeResponse 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":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"af55fb84fb5dc9f83192931760240e994e91ec3c453308b142208e88fc22653a"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor.string (cyclomatic 33): Cursor.string has cyclomatic complexity 33 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5fec52fad495e979f5e3568611ba936ff6ec11cf2ef219aee695d122d1d214"}},{"ruleId":"D1","level":"warning","message":{"text":"ZstdFrameDecoder.decode (cyclomatic 33): ZstdFrameDecoder.decode 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":"native/Sources/PacerCore/ZstdFrameDecoder.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"425945a47e2b4160dc4e93fc9ba7f62b13d06e84fd5bb504de4a76f62273dd96"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshClaudeConnection (cyclomatic 32): SettingsWindow.RefreshClaudeConnection has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsClaudeConnection.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece0102eaef0d092f6081e087afe34a1c6705c22144adc4e1441f92bdbba833d"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateCatalog.Parse (cyclomatic 32): UpdateCatalog.Parse has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateCatalog.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"85628210aa6cb383ba164c7e2ff8c08a66da4170601c9eee8df08f9bd5004e73"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsWSLServices.discover (cyclomatic 32): WindowsWSLServices.discover has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsWSL.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e1e2a117853a2b13246ab9af4d143186da14c4a354c3542763933c3afea1cc"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.configureClaudeRemote (cyclomatic 32): IslandModel.configureClaudeRemote has cyclomatic complexity 32 (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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c2935584433dd0d37af942a577faba6dbe9a008257f8ff4879107d3eb69fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDesktopCollector.run (cyclomatic 32): NativeDesktopCollector.run has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/NativeDesktopCollector.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f8f39315a65dadcb7bf945af4403e7b921664495c7c3ecb03cd38f2714fe7c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_remote_progress_setup.install (cyclomatic 32): codex_remote_progress_setup.install has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_remote_progress_setup.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3494e312fa4278ea917a80f4ce2ea2c54dc520820e8d7330d2e925111999d7b4"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexQuotaCoordinator.read (cyclomatic 31): CodexQuotaCoordinator.read 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":"native/Sources/PacerCore/CodexQuotaCoordinator.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4faeefc0ea5f94b7acdacf33ccf9ece568cad052665f8e9fec421ba8bbbbd0"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityBadge.UpdateEstimate (cyclomatic 30): ActivityBadge.UpdateEstimate has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f99f95ac1e80d8b4651e9fefa40ee183d6c18f29f494265c30d38ef165a0ac"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshHarnessPage (cyclomatic 30): SettingsWindow.RefreshHarnessPage has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"678dd20b179cdb01243fd0e0a4636c5b2a2d7c8b23b674e8e79ef0d5af572d07"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.CommitProviderHome (cyclomatic 30): SettingsWindow.CommitProviderHome has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsProviderHome.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f066e13eaa248304a8dbc2e5d611753e4fd57189c76e9c2801adf5c30af19cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsInstallationOperations.UninstallAsync (cyclomatic 30): WindowsInstallationOperations.UninstallAsync has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"125b2b6b25f274dab96f7817cc3c598f3490048632dc5ea53439dd17549256b3"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.receiveWSLDiscovery (cyclomatic 30): EngineRuntime.receiveWSLDiscovery has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2353b20c922fc667c75a1a82fa2b039b69aa212682c939adc1e237d262a7688a"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityTelemetry.requestBody (cyclomatic 30): ClaudeActivityTelemetry.requestBody has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityTelemetry.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c63cb036e5335d739e6343d9b4b3348c4ad71513df6eafa4640556bae299b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionSummary.init (cyclomatic 30): ConnectionSummary.init has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ConnectionPresentation.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"448d9e0771ff570e7dda4e00e622bd280929d1e4793f0927a3b06a1179a31d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekSessionLog.progressResult (cyclomatic 30): DeepSeekSessionLog.progressResult has cyclomatic complexity 30 (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":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5431e833f5f051bb0e9700482801226e18e88a22679bd527b3b27c27d80820fd"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopFrameDecoder.object (cyclomatic 30): DesktopFrameDecoder.object has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b8d57898c3c7079df452427a7326c7174fa7e652039a9f116af1bbc09a5c62"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDesktopSession.observeDurableHistory (cyclomatic 30): NativeDesktopSession.observeDurableHistory has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/NativeDesktopSession.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14fe94b484d2bb519d7ce0d90328410c0a599ba7ba5fb9fbcf9800a71ba5722"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControlCatalogAuthorization.init (cyclomatic 30): RemoteControlCatalogAuthorization.init has cyclomatic complexity 30 (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":"native/Sources/PacerCore/RemoteControlCatalogAuthorization.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c3828b907f223ffb2994d954137ca30b3b85ae57f75128777af636847bf73a"}},{"ruleId":"D1","level":"warning","message":{"text":"readGroups (cyclomatic 30): readGroups has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 belong to 32 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/workbuddy-account-credits.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7a5f631c5946a692997a4b7cee04a744a1f581f17f9fa7bc4b0660eec486f4"}},{"ruleId":"D1","level":"warning","message":{"text":"PreferencesCodec.Normalize (cyclomatic 29): PreferencesCodec.Normalize has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6080e18daf9d2cdeab416afc4ebc6358d7b29a00d13b964ec7fc19664b8160"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshValues (cyclomatic 29): SettingsWindow.RefreshValues has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c87ae417e23fba7d36c3c68f2d0471e5ad2525f4c1ea2665a4c82c9fd670a7"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsClaudeRuntimeStore.ensure (cyclomatic 29): WindowsClaudeRuntimeStore.ensure has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeRuntimeStore.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0605da3dfce177686002934ebec004b64fea7cb4bd1697d8517b822f7dc53b28"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexProgressSetup.apply (cyclomatic 29): CodexProgressSetup.apply has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexProgressReporter.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72f1d7083ccd5b30a339e953fae5c9134cad4be2a93f3888177a55c380ae04f"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.Main (cyclomatic 28): Program.Main has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Maintenance/Program.cs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9214b0076dd840fda530f6a047ea4e4d94b29d6e0145d6937676d8adfe9914b"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineGuidePages.project (cyclomatic 28): EngineGuidePages.project has cyclomatic complexity 28 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineGuidePages.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"805800855c2a1352324759bef39a1e2ac61a7a38780961507758b3ccd884b9af"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineSnapshotEmission.equal (cyclomatic 28): EngineSnapshotEmission.equal has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineSnapshotEmission.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"560153eee85b92c8ef7799ef34d3e4d5df809d6f33a4ab5ac46e6894cd31a2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactBarContext.init (cyclomatic 28): CompactBarContext.init has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactBarContext.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d359b3698d3a3fdb1f43235882517af2f8553ec8c8633aa49f64cff75695f"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekDialPresentation.init (cyclomatic 28): DeepSeekDialPresentation.init has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekDialPresentation.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4958ef83b2065e8edf725e5b1eb6f1baab9d89bbe43e538fff0b3e3e9e05a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekProgressSetup.update (cyclomatic 28): DeepSeekProgressSetup.update has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekProgressSetup.swift"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"776c8759a425f58e97147a436776fb79669b3f44c5f32debe8506d63ea301f75"}},{"ruleId":"D1","level":"warning","message":{"text":"HostApplicationTrackingState.prepare (cyclomatic 28): HostApplicationTrackingState.prepare has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HostApplicationTrackingState.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c671db8bdb47e6fa18dc7d2d80b3720a7b9e710d04fc30d16d07ace6401f4857"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.performLifecycle (cyclomatic 28): IslandModel.performLifecycle has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d4a0f996426d9789a488734827aa7bca7e4b01dfb6a259e62891d79a855a5f"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskGlyphArt.svg (cyclomatic 28): TaskGlyphArt.svg has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskGlyphArt.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38f773075a23461d2cddd5a12c5fe75d55baba7d27de47adafda9c7109b184a"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshSidebar (cyclomatic 27): SettingsWindow.RefreshSidebar 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":"windows/Desktop/SettingsSidebar.cs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"57be582e436d7f821eebb8770d60b59220c7263f32d158a943b88ca458d13643"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsConversationApplication.OpenAsync (cyclomatic 27): WindowsConversationApplication.OpenAsync has cyclomatic complexity 27 (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":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c331d6cf0d4f98973039bdebfe42bbafef34f98c477cb86853e318e0c4b4d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeQuotaCoordinator.read (cyclomatic 27): ClaudeQuotaCoordinator.read 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":"native/Sources/PacerCore/ClaudeQuotaCoordinator.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1add5495f9129c5e0665b535193628c1d20ee80401d11ad269bb108d1f6eb2bd"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexClient.setDurableProgressPlugin (cyclomatic 27): CodexClient.setDurableProgressPlugin has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfd2a13b708457671c9bda742c7dae552fb1528bcd477e1fc56af5b785827d7"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.FillQuota (cyclomatic 26): IslandWindow.FillQuota has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPanelSections.cs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c22c9967cbc24af5bf35688ec04a3201b77b36f143fe3037e4788c9b759144"}},{"ruleId":"D1","level":"warning","message":{"text":"PreferencesCodec.Encode (cyclomatic 26): PreferencesCodec.Encode has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdff8ac238edb4c31ad347a74edd02b2c74bf0ddb24be5a849569528ce3ba7c"}},{"ruleId":"D1","level":"warning","message":{"text":"PreferencesStore.Save (cyclomatic 26): PreferencesStore.Save has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb07c61c62d4a1e9d4e8a035b755fdb8a3a3aee2f33389404d8cb352007f7ba"}},{"ruleId":"D1","level":"warning","message":{"text":"MotionBridge.swift.pacerLayoutFrame (cyclomatic 26): MotionBridge.swift.pacerLayoutFrame has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"windows/Bridge/MotionBridge.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606dd7c65ea59175d6583604ecf8b35c4b2d4780010832eb7fe547bfd9e7669"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 26): main.swift.top-level code has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerHooks/main.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fc6b4f74d121fbf982d82c3742a8401dae44c9e519e025afe00c1fcf149411"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.observeCodexGoal (cyclomatic 26): SessionActivity.observeCodexGoal has cyclomatic complexity 26 (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":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"4638d99220be12cdd09ce7830829c50f807464aa44d9f79136948e4fba0ed1bd"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeAgentNotification.init (cyclomatic 26): ClaudeAgentNotification.init has cyclomatic complexity 26 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeAgentNotification.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e175ad8507c6c08913aee129cc5c84ff7c26f6b1d99379520ecc49574e647bab"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRolloutMetadata.read (cyclomatic 26): CodexRolloutMetadata.read has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexSessionOrigin.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc1aff611bd9728c642e6041df97388e5df58512afda8ae1bd68d815a82c62"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekBalanceCoordinator.refreshIfDue (cyclomatic 26): DeepSeekBalanceCoordinator.refreshIfDue has cyclomatic complexity 26 (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":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9493b4ede99bd842153a8a3b00eefc1d20fee271e4b1a80f3da59f31290d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor.number (cyclomatic 26): Cursor.number has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcb216faf6120d039fb97097e545838dff0f12b165ced23d6c8e86dcfb60127"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopValue.patch (cyclomatic 26): DesktopValue.patch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"73404d81750e7c0fb9b59034ad565ac53c793af929f1bd6d238c6e2953057274"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor.skipString (cyclomatic 26): Cursor.skipString has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/JSONFieldView.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4bc6bda5ce0c987fa9acae7e1eb56f7769fbb3325f805ae0724affddd65e3f"}},{"ruleId":"D1","level":"warning","message":{"text":"PacerMain.main (cyclomatic 26): PacerMain.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7de18e79e7f641962216e38ae24efabdd19787727046574d165b96ca6ef303"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineClient.StartAsync (cyclomatic 25): EngineClient.StartAsync has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7627e7dd6b673fcc1739fd8e276839fc518af936dd6ee4c18dbb31e9bc73a47b"}},{"ruleId":"D1","level":"warning","message":{"text":"HighContrastScope.Discover (cyclomatic 25): HighContrastScope.Discover has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HighContrastScope.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"131441a1cb81f82e632db32d97f3f580c3882593b9a8886f7b999731d2ef3caf"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshHistory (cyclomatic 25): SettingsWindow.RefreshHistory has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ad8655c32b69e5c727475aa29b17768deb92563ca45dec426ae9d2d0a01709"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.SettingsWindow.ctor (cyclomatic 25): SettingsWindow.SettingsWindow.ctor has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 153, 166, 152, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1066b1084a0f60de999ed2493448259a351900c0d9fefe058bca68b872a9dd78"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsClaudeRuntimeStore.collect (cyclomatic 25): WindowsClaudeRuntimeStore.collect has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeRuntimeStore.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c8e7936134d093bd35a101b88d48774ec8d6991d3c5f81380fe414143debb6"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeDesktopCredentialStore.decodeCache (cyclomatic 25): ClaudeDesktopCredentialStore.decodeCache has cyclomatic complexity 25 (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":"native/Sources/PacerCore/ClaudeDesktopCredentialStore.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"796b334297a22f8b2e24c7a259c812d7048d208b29cedccbc78e217b23497992"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeSSHDiscovery.configurations (cyclomatic 25): ClaudeSSHDiscovery.configurations has cyclomatic complexity 25 (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":"native/Sources/PacerCore/ClaudeSSHDiscovery.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b8b082dcfe3f553b47d914da1fbe4e6496da56fa2c7d3a70c56593b9ae7000"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexClientError.errorDescription (cyclomatic 25): CodexClientError.errorDescription has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ea21ddbae2fa3c5ef6eea66f91aac3fa35a07b2bf47181258ccb68577f9341"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControlCatalog.refresh (cyclomatic 25): RemoteControlCatalog.refresh has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlCatalog.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb8f3109093cdd93bf7884a0bc753854db4ff4e60ea1bcc7c2a0a49a0286a5f"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskProgressRing.make (cyclomatic 25): TaskProgressRing.make has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/SelfReportedProgress.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3c48a7f28388b4ff56bde38fd831c5624307c11de49f565b3220c6399c2ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddyRunLog.time (cyclomatic 25): WorkBuddyRunLog.time has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyRunLog.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"335a7674e32f96170b9bcb64183401235493917c615f5cdfe30b28e2194d7623"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_progress_mcp.record_receipt (cyclomatic 25): codex_progress_mcp.record_receipt has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdef7822dbfd826823857865d4993f825798b8834f2ed9f83aa0ee779af7153"}},{"ruleId":"D1","level":"warning","message":{"text":"pacer-codex-progress.record_receipt (cyclomatic 25): pacer-codex-progress.record_receipt has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/Resources/pacer-codex-progress.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"893be75e99d70987b881e100a0e6379b4383a0bc85739697d5588118dc103722"}},{"ruleId":"D1","level":"warning","message":{"text":"GuideWindow.GuideWindow.ctor (cyclomatic 24): GuideWindow.GuideWindow.ctor has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideWindow.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b602b44f31d9925ee82aa3ca3e344511c80fba6246b397293b533ca8a11b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.recoverCodexEnding (cyclomatic 24): SessionActivity.recoverCodexEnding has cyclomatic complexity 24 (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":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d19b437f905e87966aab4dda88adf9e6a1d04dd3a2a4be8fa97ebaa2175d7ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeLiveSessionRegistry.holders (cyclomatic 24): ClaudeLiveSessionRegistry.holders has cyclomatic complexity 24 (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":"native/Sources/PacerCore/ClaudeLiveSessionRegistry.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4047498ff6c814744e7b91cac7d5241198fa5a6c4711f4f0978bcfd228950e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexClient.fetchQuota (cyclomatic 24): CodexClient.fetchQuota has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"debed13d040d0b53aad73975eda7b69bbf7f56d4d64d669df93dda1d684947ce"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeActivityMonitor.readControlDirectory (cyclomatic 24): RealtimeActivityMonitor.readControlDirectory has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a705830be52f06088733a82da909d43ef43dd106b1fdbe04b1ee038dbcbb87"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddySessionStore.rows (cyclomatic 24): WorkBuddySessionStore.rows has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cfaae24c87eed09cad1f435743f8bce277895914a031de993feceb730eb1ec"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.syncLocalHarnessProgress (cyclomatic 24): IslandModel.syncLocalHarnessProgress has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efe799be62c9b213dbbbfa5982478565800920b67d553468d4a0d9a65f3e194"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.refreshDeepSeekBalance (cyclomatic 24): IslandModel.refreshDeepSeekBalance has cyclomatic complexity 24 (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":"native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"05be2f0d825ea361bd7230bcdb67ccbf5461997b42807149cfbca35600d8bbb4"}},{"ruleId":"D1","level":"warning","message":{"text":"App.ShowGuideCoreAsync (cyclomatic 23): App.ShowGuideCoreAsync has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AppGuidePages.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de00d017523161e439bb97855ea933c6aa5292f575d9045affc909a99f53cec"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsInstanceActivation.Receive (cyclomatic 23): WindowsInstanceActivation.Receive has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstanceActivation.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51cc543870674abde36a9a5fd4ad291d856dd82e6412464484929d9f53fbc87"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.maintenanceRefresh (cyclomatic 23): EngineRuntime.maintenanceRefresh has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ab0408d39c915e708d5a5fcc141db9582c8ca5298d9d092fb46acae94d767b"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.performLifecycle (cyclomatic 23): EngineRuntime.performLifecycle has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fb437da37c077311e7e753fb88218350fd050381f3a69b6de894f9790e9690"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivitySourceMerger.merge (cyclomatic 23): ActivitySourceMerger.merge has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivitySourceMerger.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9080fdd486bdac8f2ccb9f80aea1da5ce49bf73ab670e99126c7a831a6f488d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeWebQuotaClient.request (cyclomatic 23): ClaudeWebQuotaClient.request has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeWebQuotaClient.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5ba527102a91511ee8c9058a904367427fe46031a2ce9dd75e72b62f3f694a"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskProgressReporter.response (cyclomatic 23): TaskProgressReporter.response has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexProgressReporter.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ab2b791a046d6cc6953b262cf91eed0a5bd9b075d8da067a7992c88220adbc"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactWarningPresentation.items (cyclomatic 23): CompactWarningPresentation.items has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactWarningPresentation.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7ac143492713ad5b87e6a21e13726958dd614fe80c94bf6d736d5b9aaf9992"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopFrameDecoder.array (cyclomatic 23): DesktopFrameDecoder.array has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"377aa5c673790bf6d3272b6f501a8f1b4b8d25c337d56cf9ca3b8e633bd55960"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessCreditsPresentation.init (cyclomatic 23): HarnessCreditsPresentation.init has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to 3 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessCreditsPresentation.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3145c71f96e31c559f4c08ebf5b46785df5108e648a950613617b2f80c146b7c"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteActivityTarget.configuration (cyclomatic 23): RemoteActivityTarget.configuration has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteActivityTarget.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a14a10610546429ba419e288c2aa111f64f83f28c2824f2f86b2ada3949b5"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddySessionStore.usage (cyclomatic 23): WorkBuddySessionStore.usage has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a5885d114d10d5532aeb441a402c19eb94c281c8db8c52c065ec1ef0c3cab3"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityBadge.body (cyclomatic 23): ActivityBadge.body has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f739635f5a48f3c8a46e42c029deb2adbb164f6752eb3a60c3658ea6949ebfc"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotaRingsView.rebuild (cyclomatic 23): QuotaRingsView.rebuild has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactQuotaViews.swift"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e623960ae9e624590af4dc9420987ff61d1fd0b7d91b050f33ffa064cc82f1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"MacDurableProgressSetup.reconcile (cyclomatic 23): MacDurableProgressSetup.reconcile has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableProgressSetup.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"56754d35ecaa568745d5410f3342655f25490047b959e143ce99c173c25f622c"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekQuotaCell.DeepSeekQuotaCell.ctor (cyclomatic 22): DeepSeekQuotaCell.DeepSeekQuotaCell.ctor has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekQuotaCell.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1126345a860c3f3ee39b6a68d2f5faee20366b86d7e3109c30cae1fbc690a20"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekBudgetDetails.DeepSeekBudgetDetails.ctor (cyclomatic 22): DeepSeekBudgetDetails.DeepSeekBudgetDetails.ctor has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekSoloView.cs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"324673433ad29f863fb7dd9f0e846198e00c4b19183ad281997b06f42c193c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandPlacementGeometry.Arrange (cyclomatic 22): IslandPlacementGeometry.Arrange has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPlacementGeometry.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc62ee91246b233d4b471adac3055d11e0538c100cd26c2b3b0e1cdf3dcb8363"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.Relayout (cyclomatic 22): IslandWindow.Relayout has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d968aaeade78d3184511e419f17f23616ecf4fcc2338602b4f4c4dd1ec48dd25"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.UpdateSourceStatus (cyclomatic 22): SettingsWindow.UpdateSourceStatus has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac834efdc206c335e931b16bc03c454a64383eef95f636d31bccf65a0e4a27d"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.CommitDeepSeekBudget (cyclomatic 22): SettingsWindow.CommitDeepSeekBudget has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e4b88d8a3d2201dd7ce3056d877cfd1aa9006485cf65bfb422b5641739302b"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.AttentionItems (cyclomatic 22): SettingsWindow.AttentionItems has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c78f5b9ed7f912ca5485ebc9200b47c13ee78bd4048eb16a0767dbe83518cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshBanner (cyclomatic 22): SettingsWindow.RefreshBanner has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fc3459408c7b4796a799537ee016311a50d2a48e8609cecc9a0101dc8fabbd"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskStatusIcon.RebuildGlyph (cyclomatic 22): TaskStatusIcon.RebuildGlyph has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskStatusIcon.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71bc6575c18b2566cb5c7470f49cfb40059046fc01da7bf932b4b053693e386"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsStartupRegistration.SetCore (cyclomatic 22): WindowsStartupRegistration.SetCore has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsStartupRegistration.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b590b327709b6f896fbdbb2d477f8c582152386f3cc6edc40a3f81398b9218a3"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateHandoff.Apply (cyclomatic 22): UpdateHandoff.Apply has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateHandoff.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"97788033a6cef2079c4d6d8e3e235ffde013f1501b11ffa9d69c583056e21b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekBalanceHistoryStore.decode (cyclomatic 22): DeepSeekBalanceHistoryStore.decode has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/DeepSeekBalanceHistoryStore.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6fb9b817f545386f35afb01544018da97578dfbf3c633bbabc3436501a7463"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsDurableProgressSetup.apply (cyclomatic 22): WindowsDurableProgressSetup.apply has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDurableProgress.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b023a0a067204070f825b0758e899930ca6ae14ebaf9c315eb3460a1916d20"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.mergeCodexRequestEvidence (cyclomatic 22): SessionActivity.mergeCodexRequestEvidence has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"12788fddc57590df47c88f66ecef5f2451ca58bf82d9aa49e2d187ffa23f7fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityNavigationTarget.resolve (cyclomatic 22): ActivityNavigationTarget.resolve has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityNavigationTarget.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0345b8b9c01950c59ef016236a00c867e66793c78d728e732e513bf49f321e48"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityTaskRowPresentation.init (cyclomatic 22): ActivityTaskRowPresentation.init has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3784a0a247883b39d18bff48ecfac5b247bb929830d841769126f65ec1879e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCloudProjectState.sessionsToRead (cyclomatic 22): ClaudeCloudProjectState.sessionsToRead has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectState.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66135eeaf4857f13d9c4eba97b3e34e6c8436577e08a8da93fd918d88a2056a"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexClient.setProgressReporter (cyclomatic 22): CodexClient.setProgressReporter has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a1de2366675acd594acf897c5785c3c6bc11dcb4660ccbdccf4417f491af6a"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekBalanceCoordinator.configure (cyclomatic 22): DeepSeekBalanceCoordinator.configure has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed609ba10193d03318866bba4f9ef0f65ac87ed26101d8243304883b006537cf"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopRouteHints.changed (cyclomatic 22): DesktopRouteHints.changed has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopRouteHints.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7da6795669af613721420300d38353640543ab3631ce00b94f6deb56e164dd"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelDisplay.name (cyclomatic 22): ModelDisplay.name has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ModelDisplay.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bd1936ff94e4573f7e9af74836a88883642c5e3fa250e9da11884eb16f3017"}},{"ruleId":"D1","level":"warning","message":{"text":"Reading.init (cyclomatic 22): Reading.init has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/QuotaDashboardPresentation.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e17a6c577c1cd17e75515c6704b86e0d1a3a514fbd3f1b3b996220ccd439bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsePerformanceMeter.observeRuntime (cyclomatic 22): ResponsePerformanceMeter.observeRuntime has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ResponsePerformance.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f492f5d706a98b6686216f831cccdbe29d83576142c33e59662a6ba91c6001"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionIndex.entries (cyclomatic 22): SessionIndex.entries has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/SessionIndex.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7c9c0554d9c50266ed6123e2d9547c8ee613aa7d54e7cf77c24a8860340c04"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddySessionStore.automationRuns (cyclomatic 22): WorkBuddySessionStore.automationRuns has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d47245f6b6f950d37f6a62f9fc7f8ce28fbabe5423b8cb64adc0ae45fdf5bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Turn.observeResponse (cyclomatic 22): Turn.observeResponse has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyTranscript.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e8eee95bfaa028bfdd2cfa35517af7e956e0a60746b39dc1c059e0befeef90"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.configureCodexRemoteProgress (cyclomatic 22): IslandModel.configureCodexRemoteProgress has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5ae4089e001a4aa09320814c32d42c7845ce8b2ae194c6df54da2edea21c96"}},{"ruleId":"D1","level":"warning","message":{"text":"PanelController.init (cyclomatic 22): PanelController.init has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PanelController.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac17c1a727beeeef5084b9dc2b71761d39932c93e273b605682d51fd5d1dd4dc"}},{"ruleId":"D1","level":"warning","message":{"text":"WhatsNewItemRow.body (cyclomatic 22): WhatsNewItemRow.body has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/WhatsNewView.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b047d38aa309ae57ff37f4316eb062dc493792abcd4f044cb23e875fd8aee976"}},{"ruleId":"D1","level":"warning","message":{"text":"MacDurableCatalog.observe (cyclomatic 22): MacDurableCatalog.observe has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableCatalog.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5967f71f6ceb0a4998310a5c0551eed7cc49b79351678e1526f6561d6e34d85"}},{"ruleId":"D1","level":"warning","message":{"text":"AlternatingQuotaText.Step (cyclomatic 21): AlternatingQuotaText.Step has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AlternatingQuotaText.cs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c40eccd30690f3a1b274b639c6370ca5d216b97f8e4354110380882a14fb073"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeWebCookies.ReadAsync (cyclomatic 21): ClaudeWebCookies.ReadAsync has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 30, 36). 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":"windows/Desktop/ClaudeWebCookies.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d2f7d5fb7720e324e9f1e0a6e5dca45b3422ce2b4824b01367618b80a66d88"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.OpenConversationTaskAsync (cyclomatic 21): IslandWindow.OpenConversationTaskAsync has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1e0caeaa41beb7df490d7ea6b0c97863d9b9f711108787c86ee592f21d6480"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderLoginWindow.ObserveAsync (cyclomatic 21): ProviderLoginWindow.ObserveAsync has cyclomatic complexity 21 (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":"windows/Desktop/ProviderLoginWindow.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f30c4924d3c872171d60b795336eaf7d54b0f4da2ed0e89e90e9db61ddc833"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseNotesMarkdown.Parse (cyclomatic 21): ReleaseNotesMarkdown.Parse has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ReleaseNotesMarkdown.cs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadaec1a21ea6f5cd4e4a078b410950b24dda4f4fb6891c073b7596f5b4916e4"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.BuildCompactInspector (cyclomatic 21): SettingsWindow.BuildCompactInspector has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 173, 256, 271, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCollapsed.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21532385fc053eaf072bfce55f26b3f98d5032df9303759b9198271598d45c1"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.BuildDeepSeek (cyclomatic 21): SettingsWindow.BuildDeepSeek has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 106, 79, 74, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4908aa3804e76dc5fc6e187fb54c5dc2fa3d01b360d97de55b7c6667731fa7e3"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RunDeepSeekConnection (cyclomatic 21): SettingsWindow.RunDeepSeekConnection has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeekConnection.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d333a813cfb5f641ebbe99fa98ee3c867b62371db96c7fef8b2bf3aa059f929f"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshHarnessCredits (cyclomatic 21): SettingsWindow.RefreshHarnessCredits has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ca93b701fd35648befe18e41c37bfac625d17b19c2c02e84a41d7aa0889e63"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshOverview (cyclomatic 21): SettingsWindow.RefreshOverview has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca26bab85ec23a168b4b6be68fb720f9eb0ddf9cc984e8510b33bb6be749e4e"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RebuildPane (cyclomatic 21): SettingsWindow.RebuildPane has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbca506ed9a2538d6fb05c35f9e0c6faf40e67fadce22791535d50475f8c6a8a"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsDesktopTransport.init (cyclomatic 21): WindowsDesktopTransport.init has cyclomatic complexity 21 (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":"windows/EngineSupport/WindowsDesktopTransport.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf86a887d6a6371b922f691532daeb0b748830cc2a0d84d8b6f5f3f02edd7d9"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsProcessHost.nearest (cyclomatic 21): WindowsProcessHost.nearest has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsProcessHost.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c0c9b7570a8bd2fc85b959844d66aebcf06a7550910ffdf51926b8e69f7f82"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityNavigationOperation.descendants (cyclomatic 21): ActivityNavigationOperation.descendants has cyclomatic complexity 21 (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":"native/Sources/PacerCore/ActivityNavigationState.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c623488c54717ad6f607b43a25c369162f4665c7327ac98c8a6353cf87bd2d"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskSymbol.symbol (cyclomatic 21): TaskSymbol.symbol has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6514c4750cc18b022ac22ddacfcfeec17623e7ffcee39423f3cfb9e9f999b8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeDesktopRecords.desktopSessionID (cyclomatic 21): ClaudeDesktopRecords.desktopSessionID has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeDesktopRecords.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f1a9877140e8cc5ccb0c8fd1eca233a8f26e41d0c5f8b08c94f645355c3037"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekBalanceCoordinator.finish (cyclomatic 21): DeepSeekBalanceCoordinator.finish has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"953577d4a9a99657f7b7b2140fd3216faffa5cefdd6ef0531ff3f881f0ac7703"}},{"ruleId":"D1","level":"warning","message":{"text":"DurableHistoryPoll.read (cyclomatic 21): DurableHistoryPoll.read has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableCatalogReader.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5823ea6f351c7aa018e8334db9871c8f4643a13c8de328898fbb9143932bf609"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessAccountCredits.reading (cyclomatic 21): HarnessAccountCredits.reading has cyclomatic complexity 21 (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":"native/Sources/PacerCore/HarnessAccountCredits.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e375251052ffbc4549342d9d05bb04647292a25ee231837370ce507b0ebb415"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeActivityMonitor.startAsync (cyclomatic 21): RealtimeActivityMonitor.startAsync has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e4eadf4c588bad6be8dadc8447a44bf394da4a1cc97e73827efc37436bac97"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControlCatalog.readTargets (cyclomatic 21): RemoteControlCatalog.readTargets has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlCatalog.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b814e904f1fb80d22993ea2aee6183be4e9e0b5898ca9ed0c7f17d4db87791a"}},{"ruleId":"D1","level":"warning","message":{"text":"Tailer.discover (cyclomatic 21): Tailer.discover has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1441438f24001d3cf123cb2712889e5fd661a25fce744f3e61f1d32f5a7e6238"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineClient.RequestAsync (cyclomatic 20): EngineClient.RequestAsync has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"468599915ad8dde04d02d9634bbec779da103c59aec160082b0cabc41d71dcd2"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.ApplyPreferences (cyclomatic 20): IslandWindow.ApplyPreferences has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3909de75f64a5897530d65ef8f3f1d001be61e1115848e53fbf03cf429a43a7e"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshSurfaceStatus (cyclomatic 20): SettingsWindow.RefreshSurfaceStatus has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsAppearance.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cbaad1c473cee45665f063d9d8368891d83d2e777edeb9e44e03fceb3e875e"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshModules (cyclomatic 20): SettingsWindow.RefreshModules has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsModules.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfab37647695aff639bf709cdf327e49583f7abc2ced47f5efd296eae5d6d297"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.BuildPanelInspector (cyclomatic 20): SettingsWindow.BuildPanelInspector has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b03efc19c0e984b2050e574aac8f1b1f038c5500a880ece8aac24513bc8fb50"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.InspectProviderHome (cyclomatic 20): SettingsWindow.InspectProviderHome has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsProviderHome.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1721cac2c462ea4fbb65673dad51253c7076ed77de2fad8d1f7fa4b42d323572"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.CommitReminderAmount (cyclomatic 20): SettingsWindow.CommitReminderAmount has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"windows/Desktop/SettingsReminders.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c0eb227235b39abd6a01ea82d141ae9b6924e97cf356616e83039e062151c7"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsUpdateService.CheckCore (cyclomatic 20): WindowsUpdateService.CheckCore has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8d83326c4ed89018061fdff7e4cb03d359924b3c2c12d559f450d6a1c85612"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.navigationIsCurrent (cyclomatic 20): EngineRuntime.navigationIsCurrent has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6018fe59953581561bf9072e86321e6a4777b52f9a5850488a3e31a4c66828"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityNavigationRegistry.update (cyclomatic 20): ActivityNavigationRegistry.update has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityNavigationRegistry.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"66996b255dc95b4ec37582d0749a2e57c09186fe9158ec89ea662fbd9b367ba2"}},{"ruleId":"D1","level":"warning","message":{"text":"AttentionPolicy.activityNotices (cyclomatic 20): AttentionPolicy.activityNotices has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Attention.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f221da20275a2d18d69ee66c19bb29d65c98d97260d3b7d714b3a052ace84001"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityState.consume (cyclomatic 20): ClaudeActivityState.consume has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a08928d8c746d42d2d1d16d98b6e5177974907d2f878f01b4c100c6c0c3d05"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeSSHRouteRules.parse (cyclomatic 20): ClaudeSSHRouteRules.parse has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeSSHRouteRules.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3489a13fce3e47cccb6168cf4e984a616f8b4936124d8aa3aa4e46d519f9610"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionSource.sources (cyclomatic 20): ConnectionSource.sources has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ConnectionPresentation.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ce7e5f2e421fc215ebe8babf48f6b024750d021f92a80e0631a74b81f62455"}},{"ruleId":"D1","level":"warning","message":{"text":"SSHHost.hosts (cyclomatic 20): SSHHost.hosts has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ConnectionPresentation.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a180f46cbddb03e61f63e1ad1d9c26be5cc945777bd9dfd95f10c6bfe336be6"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpandedPanelPresentation.sections (cyclomatic 20): ExpandedPanelPresentation.sections has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ExpandedPanelPresentation.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"edda9f6522e9b62dcd28b39ba08632cdd159a715ef3c87153ccdf44812374fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandGeometry.arrange (cyclomatic 20): IslandGeometry.arrange has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/IslandGeometry.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd841f52bada7ffbdbeff400f8d1dd6822b371fa53deeb60a7b6514744052c6"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.canOpen (cyclomatic 20): IslandModel.canOpen has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3088628929f1b78296ca81079e19e934e7f9ca9b8a4da6dcaf5ea10a429cf26"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.startClaudeActivity (cyclomatic 20): IslandModel.startClaudeActivity has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0db27a15bd92c166f40b2ac994ce6d70a45a04d2b426a94861968272583a26"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.syncClaudeCloudMonitor (cyclomatic 20): IslandModel.syncClaudeCloudMonitor has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"690646d918024f88ca4a7231efa6258389b8eedde632a77877c59ac2149f1668"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_activity.otlp_request_header (cyclomatic 20): claude_activity.otlp_request_header has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a76b16f9dd029c7faf3d67e79a5bb36f0ba4be84859cf25969a1f965fd878"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_hook.statusline (cyclomatic 20): claude_hook.statusline has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_hook.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3e9692e34c13d824d51fd50a9cc0dfb3db748a5979f780d34acdb5ba4c295b"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactLayoutEditorView.Update (cyclomatic 19): CompactLayoutEditorView.Update has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactLayoutEditorView.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5fb6b95fe950000004436ef244305f18143cd90fae134b66b4d34d5e5ab070"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekSoloView.DeepSeekSoloView.ctor (cyclomatic 19): DeepSeekSoloView.DeepSeekSoloView.ctor has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekSoloView.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d873181e82b8f9bf81034912a5aff680e049f0c992865f6952cd11b2e15f565c"}},{"ruleId":"D1","level":"warning","message":{"text":"GuideContent.ModuleHelp (cyclomatic 19): GuideContent.ModuleHelp has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5d9d1313d20f9e1f85e470b83032504f36406b12a14e8a8938fc2077d76850"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandScreenMemory.Load (cyclomatic 19): IslandScreenMemory.Load has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandScreenMemory.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c9cfb680fe8ee86c7c46c2ce440b788d42fc656f1d479d22871da74dbf770a"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.IslandWindow.ctor (cyclomatic 19): IslandWindow.IslandWindow.ctor has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 136, 144, 134, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9053a72f34230e2e0d761a11ab7cfdd681577c8efbd6f847bef05554356eb5eb"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.Render (cyclomatic 19): IslandWindow.Render has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d443f7be7e03cce54cf166da539efccc4e167496762fc7365d9b59791e0110"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.OpenFromWindowAsync (cyclomatic 19): IslandWindow.OpenFromWindowAsync has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bde1d97b216d2ab080142342579adb821ae61ae15beec8d36e18cf93b28e292"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationSession.Receive (cyclomatic 19): NotificationSession.Receive has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 100). 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":"windows/Desktop/NotificationSession.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"633df17357aa47eea19ff120db470500b77b1c6f3d25619020990b42857960c5"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.RefreshDisplayChoices (cyclomatic 19): SettingsWindow.RefreshDisplayChoices has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsAppearance.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0e1f0277be7375f6d64e765d1c319b818e3d328c7a4125e4bd3190f04e89c6"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.BuildClaude (cyclomatic 19): SettingsWindow.BuildClaude has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 52, 39, 31). 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":"windows/Desktop/SettingsClaude.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13d55da0824bfc3aeab77ab5987c0a63e8fd916016e91a0dff55563a8dd6334"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsClaudeCloudStream.read (cyclomatic 19): WindowsClaudeCloudStream.read has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsClaudeCloudStream.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e2b3ae41f27e8c541b06bde9d5da39b31428d82c49c83b82d639ca3ef2d697"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsClaudeRemoteCoordinator.finished (cyclomatic 19): WindowsClaudeRemoteCoordinator.finished has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsClaudeRemoteSetup.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb8ca084900d8636f3e76573b20b9cfe725689ea15c19c1ce0836d26b92ed48"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionActivity.setClaudeNavigation (cyclomatic 19): SessionActivity.setClaudeNavigation has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9629d1100dd6d6680cf8221337f53bcdf174818c20f1ad399774660522f53c7"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityLogWatcher.update (cyclomatic 19): ActivityLogWatcher.update has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityLogWatcher.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d6d3f209fe3290a5cd71e51d6193d4b4604492b8d2e172888e5d8d968bb5ec"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeHookInstaller.migrated (cyclomatic 19): ClaudeHookInstaller.migrated has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1966eec866f23313c1d097be723a852eb9f90bcebf4a08cd4fe05c408f3cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeQuotaDecoder.buckets (cyclomatic 19): ClaudeQuotaDecoder.buckets has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6422e1efbbd44b1c4899421667c694751b6929cfd6856155856cb61b75339d"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeQuotaCredentialCache.decode (cyclomatic 19): ClaudeQuotaCredentialCache.decode has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaCredentialCache.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8dd40221895e4b1e8b1317baa66b406b6303d1ebddcc37f512ff7ae0196d46"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopFrameDecoder.turns (cyclomatic 19): DesktopFrameDecoder.turns has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fd4e6cc2e2c87f395d7af72ad15ed8a4af27effaf1787392a2c2a471271819"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessCreditsNoticePolicy.notices (cyclomatic 19): HarnessCreditsNoticePolicy.notices has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessCreditsNoticePolicy.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a405abc1647b941031212ab77b32f587ef5e7bd25e4c23e5c7a83fda73e58f2"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddyRunLog.read (cyclomatic 19): WorkBuddyRunLog.read has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyRunLog.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2434648d43fd30c9cc1a72a0d82c0f6a57af0c2461dae1b0755ca6834243f40"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeConversationOpener.open (cyclomatic 19): ClaudeConversationOpener.open has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeConversationOpener.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"016314a7c3834bb2dba48717e604c157091a8337e8ef8eb7d76a8cded6c67c40"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsView.paneContent (cyclomatic 19): SettingsView.paneContent has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"380a239d5e07d4977632f3a0297be61dc75b3b995bf27103d41c9000324bd63b"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsView.commit (cyclomatic 19): SettingsView.commit has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"789bcaf1e6e0af7952d59ed3627d567b2e4c21f17f5bea19fd4bf3d6efb6842b"}},{"ruleId":"D1","level":"warning","message":{"text":"deepseek-progress.respond (cyclomatic 19): deepseek-progress.respond has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/deepseek-progress.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5614315983d4eb0006f83d7450dd58279deb3d9091427e7ce74be1b5eee10f6"}},{"ruleId":"D1","level":"warning","message":{"text":"App.StartWindowsUpdaterAsync (cyclomatic 18): App.StartWindowsUpdaterAsync has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AppWindowsUpdates.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf0836b8794801110ccf7c5aeb1cab9c87518924cfcce20f8adaf09ce686361"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactWarningsView.Update (cyclomatic 18): CompactWarningsView.Update has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactWarningsView.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312a798363955b8bdcde903b36b99db6e237c83e4bd81e9f0a9fb7ec4637239"}},{"ruleId":"D1","level":"warning","message":{"text":"FullscreenOcclusionObserver.Refresh (cyclomatic 18): FullscreenOcclusionObserver.Refresh has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 64). 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":"windows/Desktop/FullscreenOcclusionObserver.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fddf3a4e9989485d482bbebecc31a80ce9c75a033a1c09879c6deaf8055feac"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationActions.HandleReferenceAsync (cyclomatic 18): NotificationActions.HandleReferenceAsync has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/NotificationActions.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27e48f9a685b95906963c8597a14c8e1e0a0d76a88e57cccf13e469f046301f"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotaCell.QuotaCell.ctor (cyclomatic 18): QuotaCell.QuotaCell.ctor has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65d4b03a1c9c563e1b8eb0f304b78a75fe4808af3817531d22b676a1986262b"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.SourceField (cyclomatic 18): SettingsWindow.SourceField has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 133, 130, 129). 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":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c47b02a733ce72c933cf458c206bb883412b5acf2ab335c095a7639506969fc"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsSshTerminal.Launch (cyclomatic 18): WindowsSshTerminal.Launch has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSshTerminal.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"934919a8d6d7196319bc31110c2ea0796de606123364ce5da578cb8d5fe79250"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.notificationSource (cyclomatic 18): EngineRuntime.notificationSource 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":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"db876788d40d7136fdb3b87d841ffc460dc0d83894ab6a83c40e24466872dfc3"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsDesktopCollector.start (cyclomatic 18): WindowsDesktopCollector.start 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":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb150f49f8f32b94d76795b2e6669090c437ae66ea22d0b236152b6766816fe"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsDesktopCollector.receive (cyclomatic 18): WindowsDesktopCollector.receive 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":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"828b6db56dcc29dc30aac45ab681003cbfa263a2018af3787b803c658ce629d5"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsHTTPClient.data (cyclomatic 18): WindowsHTTPClient.data has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPClient.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca080613d153167db668c69f772e8458220b5957e1be2abc6e91b578e7b281c"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityNavigationOperation.complete (cyclomatic 18): ActivityNavigationOperation.complete 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":"native/Sources/PacerCore/ActivityNavigationState.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4d92a7c5d09b2d97631c19273ba313afcc8f8180e0a7f981c798afcbf52eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityMonitor.readLocal (cyclomatic 18): ClaudeActivityMonitor.readLocal has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c11f6eb246c3bc378ebe76b6129a0eb31317720d9c253b0d583b492f6d7604"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeDesktopRecords.desktopMetadata (cyclomatic 18): ClaudeDesktopRecords.desktopMetadata 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":"native/Sources/PacerCore/ClaudeDesktopRecords.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6f9176e76f23f0c7cd46a7ad2b894eb32e01ffdd5a1c7aabac18fe7046b9c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeObservedRequestMeter.settled (cyclomatic 18): ClaudeObservedRequestMeter.settled 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":"native/Sources/PacerCore/ClaudeObservedRequestMeter.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d284cbf9cf1dfc04c41de520d43ee807e8cbe926f75ea718324d8e4ab939a71"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexOriginLookup.lookup (cyclomatic 18): CodexOriginLookup.lookup has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexSessionOrigin.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf1093314e0c45df1949cadd48688c32895b412d9f4fd8fcbf13e46329cf065"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionInbox.retainingCloudEnding (cyclomatic 18): CompletionInbox.retainingCloudEnding has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompletionInbox.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba238ffd9230b1fd9946edf77ff2be15b55eb8c8499a6e08976b690f876cba6"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekConnectionPresentation.init (cyclomatic 18): DeepSeekConnectionPresentation.init has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekConnectionPresentation.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"210d61562a5f73baccdcd19af8314f247e5e2effff586f4b6a68e8abe511130b"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekSessionReader.readFrames (cyclomatic 18): DeepSeekSessionReader.readFrames 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":"native/Sources/PacerCore/DeepSeekSessionReader.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4372856245e3a71c62cb3ba31d5e92ae8a21f4445aad9535bc5f82301ef0a6c0"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopFrameDecoder.parse (cyclomatic 18): DesktopFrameDecoder.parse 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":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98f427e8dc2b9c5cc77e417b170cf6f868e408881ff44a8fea04a552890cd40"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControlActivityTarget.configured (cyclomatic 18): RemoteControlActivityTarget.configured has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlActivityTarget.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cdd480a5cd846efd5d2a90edf05808b355fa872993695ee6cc6019813c66c2"}},{"ruleId":"D1","level":"warning","message":{"text":"AppDelegate.applicationDidFinishLaunching (cyclomatic 18): AppDelegate.applicationDidFinishLaunching 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":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e85819fe13e2473782a540c5cf55863d9abca4bcb5e37040e756832857eef2"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryRoundButton.roundButton (cyclomatic 18): LibraryRoundButton.roundButton has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsLibraryTile.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c98a49865d85403d8cb9a3695e7d95cee78614ebf6e69b7489de7b340b2680"}},{"ruleId":"D1","level":"warning","message":{"text":"ProgressGuideBody.stepRow (cyclomatic 18): ProgressGuideBody.stepRow 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":"native/Sources/PacerIsland/SettingsProgressGuide.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e0bcc9e247ea42fadf8d54f65e544299c7b49c44ad333a72e662331fd79ccd"}},{"ruleId":"D1","level":"warning","message":{"text":"WheelView.viewDidMoveToWindow (cyclomatic 18): WheelView.viewDidMoveToWindow has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskPagerView.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf24787f809bdf8e3c882456fe0925b291ac92096208cae50001217b0dd1a3e"}},{"ruleId":"D1","level":"warning","message":{"text":"MacDurableExecutor.find (cyclomatic 18): MacDurableExecutor.find has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableExecutor.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f16efca54e36ae21a8d00c87a862f93d66c5a2e2d209de9a6b1eb94af6474c4"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_progress_mcp.respond (cyclomatic 18): codex_progress_mcp.respond 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":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a19c12d58a238ac02aa5a665c3686dc8f5582a1b6abcebd9ec4b51ddb651730"}},{"ruleId":"D1","level":"warning","message":{"text":"pacer-codex-progress.respond (cyclomatic 18): pacer-codex-progress.respond 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":"windows/InstallerSupport/Resources/pacer-codex-progress.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45bd95488b5bb0b4ded6ea6a62fc3d8a9d2043f1b89950dffdb4bfa7fc9b559"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineClient.ReadAsync (cyclomatic 17): EngineClient.ReadAsync 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":"windows/Desktop/EngineClient.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8588abd6f4de55d53f6c6102588e76be80be2bfb77cf26ca13be99c05fa4b7"}},{"ruleId":"D1","level":"warning","message":{"text":"GuideContent.WelcomeStep (cyclomatic 17): GuideContent.WelcomeStep has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 307, 313, 315, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb05152fbc403c030154a14b1fc71216bf1bc25f384c64968fde9a533d1ce72"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.UpdateDecoration (cyclomatic 17): IslandWindow.UpdateDecoration has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandSurface.cs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ba14412f6db3a1b1af8198cc26dbbaf31f498a4584e333b74ecba2a72b3998"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseNotesMarkdown.Spans (cyclomatic 17): ReleaseNotesMarkdown.Spans 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":"windows/Desktop/ReleaseNotesMarkdown.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b278e2fde17e6b097eb28f7f1eb76558d34e0fc86be020185fb7b847ad107e7"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsWindow.ApplySearch (cyclomatic 17): SettingsWindow.ApplySearch 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":"windows/Desktop/SettingsSidebar.cs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0e6e2eed9fb2565ceef7316ce828a3cd55075f684aaafc7ac773ecf992599"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsConversationApplication.Register (cyclomatic 17): WindowsConversationApplication.Register has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"858f6878d4e1faa5a18e34814c87e7e258c6291dea5f657a931660bd59c4d2d4"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsMaintenanceSignal.StopAsync (cyclomatic 17): WindowsMaintenanceSignal.StopAsync has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsMaintenanceSignal.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3b867d2775355caf990a893fe93173020f282db03ff41d7be8ad6ae6074274"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessAccountReply.FromPage (cyclomatic 17): HarnessAccountReply.FromPage has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WorkBuddyAccountCredits.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d24b1b0ff87e5af2d997021bce639fc81d78d5dd28837ba96936241f3f8e0d"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineRuntime.notificationProjection (cyclomatic 17): EngineRuntime.notificationProjection has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfcf9c7bb5262e3643fa7be3105264db5f0ff9c97c28722b07d550311dc14ce"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsDurableCatalog.observe (cyclomatic 17): WindowsDurableCatalog.observe 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":"windows/EngineSupport/WindowsDurableCatalog.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53188c431c98382f7564873dcc6ea33c72803ce45bb221ccbd5c9877c9d1960"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsHTTPClient.run (cyclomatic 17): WindowsHTTPClient.run has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPClient.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5762be104a6d85b221e9bcc943d0f00d5aa8428b02a8e28887e9cd41be670331"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsProviderInstallation.detect (cyclomatic 17): WindowsProviderInstallation.detect has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsProviderInstallation.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"077b09af00acdcb8298af8079e92510575a44cb7fade638506bb8c0eb358cd8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityApplicationState.reconcile (cyclomatic 17): ActivityApplicationState.reconcile has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityApplicationState.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ece048f583757928c03e1774aa54b438a045a795bd53bddd7c580d4025486e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCloudServices.reference (cyclomatic 17): ClaudeCloudServices.reference has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebReferenceServices.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"729065541d8fb43d8630f4a6bbd277a486589bdc13753a94e788d88e5ead1fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeHookInstaller.reconcileEnvironment (cyclomatic 17): ClaudeHookInstaller.reconcileEnvironment has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47f9f595e9157596669207d10583803469a7d0f012c00d59b428e176498e9b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeRemoteSetup.status (cyclomatic 17): ClaudeRemoteSetup.status has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeRemoteSetup.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9738a5a97971aacd8a313380f4cd8194cdb8eef13e48c052148c54a5aedc7c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexActivityInput.requests (cyclomatic 17): CodexActivityInput.requests has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexActivityInput.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df49ea2d43e02142c72a7aa985fe192540b8c7f80fffa528b82b6e1bc544b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionInbox.persistentDigestFields (cyclomatic 17): CompletionInbox.persistentDigestFields has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompletionInbox.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f01168b2dd3bc7cd1b7659eb1776250de343bc83629a4b5ff4292a4049050bd"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekBalanceHistory.record (cyclomatic 17): DeepSeekBalanceHistory.record has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceHistory.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eead101849e7a9896a1f237a09543d03f538f6187e3b9def20ecced28828422"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekProgressSetup.find (cyclomatic 17): DeepSeekProgressSetup.find has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekProgressSetup.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eaffe89d623f53dce7d1aeeb4e24edc11b8fa7309f8d96f4b2b290754804d0"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekSessionLog.response (cyclomatic 17): DeepSeekSessionLog.response 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":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"256283dd05818f74482d524376706433e2e56237131b7a6905220ddbb95d1b32"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopWireProjection.snapshot (cyclomatic 17): DesktopWireProjection.snapshot 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":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"137b4c8089180a41d84d602fcc5d8ff2d6e1e55f2f29ce7b6108e22d56942097"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpandedPanelPresentation.project (cyclomatic 17): ExpandedPanelPresentation.project 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":"native/Sources/PacerCore/ExpandedPanelPresentation.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c4f5ff175199cf720a144db644beb0702a1dcf2e91336618dde4589763f1f9"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalHarnessProgressSetup.inspect (cyclomatic 17): LocalHarnessProgressSetup.inspect 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":"native/Sources/PacerCore/LocalHarnessProgressSetup.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"30385130ec8a9ba563047667c44a5c89229141e89812615b82f3c575834eda2f"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekWebLogin.checkSession (cyclomatic 17): DeepSeekWebLogin.checkSession has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/DeepSeekWebBalance.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"525f70f637ceb0f2f948d8de409f3a13a68d14a3732de63297c81fed1b9be3a6"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessGuideFloat.update (cyclomatic 17): HarnessGuideFloat.update 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":"native/Sources/PacerIsland/HarnessGuideFloat.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f65adc78ed69341c00390edd79b5eeebf635f87fbee4a0519cd6865d4cc59c"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.ensureClaudeHooks (cyclomatic 17): IslandModel.ensureClaudeHooks 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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a598478701db71451c422c6925d1f10ac352912c9d34b611f59d1d12855d141b"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.discoverClaudeRemoteTargets (cyclomatic 17): IslandModel.discoverClaudeRemoteTargets has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f2eb29617ca0bcb353825332440cf555a5c15c6ed111db857d3242f08ccba7"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.refreshCodexQuota (cyclomatic 17): IslandModel.refreshCodexQuota has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dc70cfcfc328e1bece1304b125d1c7b9bf1238ead4541232159000d865ff1d"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.refreshActivity (cyclomatic 17): IslandModel.refreshActivity has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"067c02864a432e5a3050c24bff6435c2d885c1e7b6f91dfa5f527453ea9e1bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotaCycleChart.chart (cyclomatic 17): QuotaCycleChart.chart has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/QuotaCycleChart.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da65557c26fead198b0cdea434041fd987d52a3857d9df189e55ff0234554e4"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_remote_setup.reconcile_environment (cyclomatic 17): claude_remote_setup.reconcile_environment 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":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba6ac9d6257472d35458b11833e5bf82e04b629dff084cd9245be72ad493ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekBalanceStatusView.DeepSeekBalanceStatusView.ctor (cyclomatic 16): DeepSeekBalanceStatusView.DeepSeekBalanceStatusView.ctor has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekBalanceStatusView.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1090cc9b3cf068a7e0a3e04e959c5517bb90ebe9444ace5b58e502fbfa9b0dda"}},{"ruleId":"D1","level":"warning","message":{"text":"GuideContent.Releases (cyclomatic 16): GuideContent.Releases has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576d2d5d6d26f7589a877f2b2c71bf2aad1a4d4749e681b3a24d59e73347007"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.ApplyPresentationLayout (cyclomatic 16): IslandWindow.ApplyPresentationLayout 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":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac93d0faac58e5c1a555b3b4802a4983d2885a30f5bcd76645a943e5c5ffb42"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandWindow.ApplyMotion (cyclomatic 16): IslandWindow.ApplyMotion has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1136d00ae83e3675369a416297b29df1cd2e0438fd70eb3f065be350c7badee6"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationSession.SetEnabledAsync (cyclomatic 16): NotificationSession.SetEnabledAsync 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":"windows/Desktop/NotificationSession.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f57c2ecce2904d3d080159e95e3445099041aaf436f754b872e4ae01813729"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderLoginWindow.FinishAsync (cyclomatic 16): ProviderLoginWindow.FinishAsync 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":"windows/Desktop/ProviderLoginWindow.cs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce9606b25b87027d0c4ed91765d3b8b0cbd1687a1709b8e22691068066c57be"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotaConnectionView.QuotaConnectionView.ctor (cyclomatic 16): QuotaConnectionView.QuotaConnectionView.ctor has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaConnectionView.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a42475a407163acf5120862c37f2760e0fb2c6b58db4988b2478a6ce31619d"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotaHistoryView.Update (cyclomatic 16): QuotaHistoryView.Update 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":"windows/Desktop/QuotaHistoryView.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"556049bb250c84058184e23cca3d1c8b8122fc1066c2470c1326b0102ef67af2"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsStartupRegistration.Read (cyclomatic 16): WindowsStartupRegistration.Read has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsStartupRegistration.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa642e78071502e14f395330add833fae84d6fe2ea74667a780719c7f7ba90c4"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateFiles.Check (cyclomatic 16): UpdateFiles.Check has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateFiles.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7532d570b45c385851273550c6ae0e203f9357d6c4add9d585f455fd833c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsDesktopSourceGate.permit (cyclomatic 16): WindowsDesktopSourceGate.permit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"6661ff68785fca9bc535da86a8c03f3b0102409b710a192e66ea9b5852366cdb"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsHTTPStream.open (cyclomatic 16): WindowsHTTPStream.open has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPStream.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be19be97e6feae50cdf143f77cae8792421088b5f1af0fd67ab941b35a75b91"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowsClaudeHookCommands.owned (cyclomatic 16): WindowsClaudeHookCommands.owned has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeHookCommands.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd89e2cc17cc33b23117f6d2425c492b161b4a80219da51b0cc857b78877a97e"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityTaskPresentation.header (cyclomatic 16): ActivityTaskPresentation.header has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: 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":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea217ef723b64f15ff683d930d13f95853e9892128ff494a93fba6d326e3378"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeActivityTelemetry.project (cyclomatic 16): ClaudeActivityTelemetry.project 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":"native/Sources/PacerCore/ClaudeActivityTelemetry.swift"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f1a7a2dbaf548924f56ff99d569cad118d8dd81a1ca27b51488f3255dfa064"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCloudProjectState.applyPlainQuestion (cyclomatic 16): ClaudeCloudProjectState.applyPlainQuestion has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectState.swift"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a24190de276b3fd44021902ced53fd2304aad1fc86575b8c8d5b2ac3cb0ee8"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeHookInstaller.install (cyclomatic 16): ClaudeHookInstaller.install 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":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cfb2ecb79d6271109fe5feef7e2e08eecd88fa52e50a61c80d90cfaebb2365"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeQuotaServices.reference (cyclomatic 16): ClaudeQuotaServices.reference has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebReferenceServices.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9105854716602fed7d3effdbce70680c4026aa50faff8590f2929e97a1b548"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactBarPresentation.project::entry (cyclomatic 16): CompactBarPresentation.project::entry has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (CompactBarPresentation.project) 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":"native/Sources/PacerCore/CompactBarPresentation.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2713fb9ae99d5c4192d24ea6657445e4bafde47ebaf4f532d9455cedba4d3a"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepSeekActivityMonitor.read (cyclomatic 16): DeepSeekActivityMonitor.read has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekActivityMonitor.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59442e6f4b97e4515e988dbe1a4db46784c497fa870857ec8b44d1660317a4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor.skip (cyclomatic 16): Cursor.skip has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"47646c29c9dcc563d183b4ad9ed2ae2ddf87dde51a1e6fa83d117db08ae18a30"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopWireProjection.items (cyclomatic 16): DesktopWireProjection.items has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"019f41ccb3ddae0f7c0c74142f8a6951d1905a5edf8fd990b524634fb5a9eb9e"}},{"ruleId":"D1","level":"warning","message":{"text":"DurableActivityCatalog.page (cyclomatic 16): DurableActivityCatalog.page has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableActivityCatalog.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1671b46287397bc43b56dd93c5bbf83b941d9646f7df7fcbc26a3187c415158a"}},{"ruleId":"D1","level":"warning","message":{"text":"DurableTurnHistory.receiptPage (cyclomatic 16): DurableTurnHistory.receiptPage has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableTurnHistory.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b68219d1075bc41ca2976df681bb12b2170efee8824c7bb14dfb92ca09d5037"}},{"ruleId":"D1","level":"warning","message":{"text":"QuotaAccountPresentation.init (cyclomatic 16): QuotaAccountPresentation.init 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":"native/Sources/PacerCore/QuotaHistoryPresentation.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ccfb8d65bea99a9fb5d18abde0fd966c92600a937be3959c27f669576055d1"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeActivityMonitor.receive (cyclomatic 16): RealtimeActivityMonitor.receive has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a92c6d592bb1062f2624d61852c6dbad6e7048a222a49fb5a4bbb00011797"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsePerformanceMeter.observeRequest (cyclomatic 16): ResponsePerformanceMeter.observeRequest has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ResponsePerformance.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f6cc4ff1b7d5255014234818260637bd4111d4fd5f2a221c6e6bb7c707ea75"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddyHarness.progressConnection (cyclomatic 16): WorkBuddyHarness.progressConnection has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00d94ba9aadd43708cb619248e7e00611b2fbd39efce74c867a8ea60317c642"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkBuddySessionStore.dailyCredits (cyclomatic 16): WorkBuddySessionStore.dailyCredits has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a57a1ae6aac663d00614b9d5cd6e5e089f48dec8c349decb14dfaab3c167044"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityOrbitView.applyProgress (cyclomatic 16): ActivityOrbitView.applyProgress 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":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd9cf68972ac79125e890dd4570200a5e7f530e4b13aeaae77413c38f397875"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeWebSessionStore.session (cyclomatic 16): ClaudeWebSessionStore.session has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44c03a46379b369a1263bec38c621ad818c86bc8c852baa5c1becfadb4c00f3"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactIslandComponent.stripContent (cyclomatic 16): CompactIslandComponent.stripContent has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactIslandHeader.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d955c65324a4449e84c331faf6d7191f10801df22cd5fc36fde3f25a316244c"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.trackHostApplications (cyclomatic 16): IslandModel.trackHostApplications has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"59878e40506bc462b5e017226d62e0e1ac65cbc86ce93d69c42f40b848ff3f1b"}},{"ruleId":"D1","level":"warning","message":{"text":"IslandModel.refreshClaudeQuota (cyclomatic 16): IslandModel.refreshClaudeQuota 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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd1b2e77c4ac81f9b876b391a9a81f4ebcad191cb5742026c3ff3dc88cbb98e"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsView.providerPane (cyclomatic 16): SettingsView.providerPane has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa93d32c29ad2107e235e0cceceb1073a28f8d0e5ab86cf6017ce1ffc49a8170"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskStatusIconNSView.layout (cyclomatic 16): TaskStatusIconNSView.layout has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6659bda514f4665e405cf8febd3dae2b223dd53c13b55511cce67b075962bdfb"}},{"ruleId":"D1","level":"warning","message":{"text":"MacDurableExecutor.arguments (cyclomatic 16): MacDurableExecutor.arguments has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableExecutor.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd7094cf49fb662b5137fc925e2619158b6a4031d1b44539cd82dc2c9d0a15c"}},{"ruleId":"D1","level":"warning","message":{"text":"Tailer.drain (cyclomatic 16): Tailer.drain has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc05324fa31c0f3858208a87c61ebaf8ee122dab424318899eef8d31c923c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.receive (cognitive 423): EngineRuntime.receive has cognitive complexity 423 (threshold 15). Drivers by points: if/else 121 (247 pts), boolean chains 132, ternaries 10 (27 pts), error handling 5 (9 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 152). Of this number, 422 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d50b58ae4f583097260fc36cd21b2b54c7cdcf7b8f2e4736916200ad3ae98c"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopWireProjection.consume (cognitive 345): DesktopWireProjection.consume has cognitive complexity 345 (threshold 15). Drivers by points: if/else 63 (194 pts), boolean chains 113, ternaries 5 (24 pts), loops 4 (14 pts) (nesting depth added 160). Of this number, 343 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8485271641a87bca5800ee74f8cb65517853038af539013047012a1aef3cda"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityState.consumeRecord (cognitive 339): ClaudeActivityState.consumeRecord has cognitive complexity 339 (threshold 15). Drivers by points: if/else 100 (170 pts), boolean chains 131, ternaries 15 (34 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b40457435a729c3c932fae921c57d35fb7b96e6a945cda4d70df36193e741c"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopWireProjection.projectedValue (cognitive 278): DesktopWireProjection.projectedValue has cognitive complexity 278 (threshold 15). Drivers by points: if/else 69 (184 pts), boolean chains 60, ternaries 11 (30 pts), loops 1 (4 pts) (nesting depth added 137). 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":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1163f967540bdd09fece949025b9a9253a3c045fb5e4525743570f715d4d5325"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.consumeLive (cognitive 236): SessionActivity.consumeLive has cognitive complexity 236 (threshold 15). Drivers by points: if/else 73 (134 pts), boolean chains 70, ternaries 12 (30 pts), loops 1 (2 pts) (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3407155155717c4e1dbd412545d52e997aa3a94995195614e721866c3540cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeEventState.consume (cognitive 229): RuntimeEventState.consume has cognitive complexity 229 (threshold 15). Drivers by points: if/else 58 (136 pts), boolean chains 55, loops 9 (26 pts), ternaries 4 (12 pts) (nesting depth added 103). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RuntimeEventState.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a3fd97c704b8196e4244b1ce2f60134a97633d06a8684433a9da06705cdc53"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalActivityReader.read (cognitive 208): LocalActivityReader.read has cognitive complexity 208 (threshold 15). Drivers by points: if/else 51 (141 pts), boolean chains 30, loops 13 (26 pts), ternaries 5 (9 pts), error handling 1 (2 pts) (nesting depth added 108). Of this number, 201 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalActivityReader.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c843fcebfef2fcda8a546e49823b2e62da1593d5a728dd39a12581cef481bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityReader.read (cognitive 199): ClaudeActivityReader.read has cognitive complexity 199 (threshold 15). Drivers by points: if/else 44 (126 pts), boolean chains 29, loops 10 (25 pts), ternaries 7 (17 pts), error handling 1 (2 pts) (nesting depth added 108). Of this number, 194 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityReader.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed134d1699ecbb23cf4c27ea049d06438aa187af218e21fa63c159b0dd2ce550"}},{"ruleId":"D2","level":"warning","message":{"text":"App.OnStartup (cognitive 191): App.OnStartup has cognitive complexity 191 (threshold 15). Of this number, 149 points are the body\u0027s own statements and 42 belong to 13 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbacd5c07648e058d05fefa3cb450c7246f9af5a236bf6f5b5c52b6decd89253"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityRecord.transcript (cognitive 169): ClaudeActivityRecord.transcript has cognitive complexity 169 (threshold 15). Drivers by points: boolean chains 83, if/else 42 (64 pts), ternaries 7 (15 pts), loops 4 (7 pts) (nesting depth added 33). 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":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc543ab8020ded31e6d656b37aea887af6eb0d76fde8b2788595e6e16558b00f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDesktopSession.receive (cognitive 166): NativeDesktopSession.receive has cognitive complexity 166 (threshold 15). Drivers by points: if/else 49 (97 pts), boolean chains 58, loops 2 (5 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), error handling 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/NativeDesktopSession.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a1bfc25c2498e667a7a8418fd1ebe26ba325fb4f04889f644bb4b57bed114e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekActivityState.consume (cognitive 161): DeepSeekActivityState.consume has cognitive complexity 161 (threshold 15). Drivers by points: if/else 47 (98 pts), boolean chains 36, ternaries 8 (22 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 67). 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":"native/Sources/PacerCore/DeepSeekActivityState.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4128279eceeff296267fb6591ed57b00a0f55ce19e2bae6fb924a82558a158e"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_hook.hook (cognitive 150): claude_hook.hook has cognitive complexity 150 (threshold 15). Drivers by points: if/else 62 (83 pts), boolean chains 35, ternaries 15 (29 pts), error handling 1 (2 pts), loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_hook.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5813600b5c376a00c533eb547456a45171c4ecc4e9c801f0da0355f1563fba"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalHarnessProgressSetup.apply (cognitive 140): LocalHarnessProgressSetup.apply has cognitive complexity 140 (threshold 15). Drivers by points: if/else 38 (84 pts), boolean chains 35, ternaries 6 (16 pts), loops 2 (4 pts), error handling 1 (nesting depth added 58). Of this number, 111 points are the body\u0027s own statements and 29 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalHarnessProgressSetup.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"742680f572ad7f40187d6e6164bdd4d5fff74394fa4d4c6048db7e10e4da9265"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_activity.main (cognitive 138): claude_activity.main has cognitive complexity 138 (threshold 15). Drivers by points: if/else 32 (107 pts), error handling 5 (15 pts), loops 5 (10 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 92). 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":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"419b90a3c02d272c867c5a191e48f59f4a220e95fd616b9a59b31a741eddb4fa"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.configure (cognitive 132): EngineRuntime.configure has cognitive complexity 132 (threshold 15). Drivers by points: if/else 64 (88 pts), boolean chains 25, loops 7 (10 pts), ternaries 6 (9 pts) (nesting depth added 30). Of this number, 130 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77d20b4dbff115d91d0c7e5a78ce4cc2b9196536a46cdb7a2efb7236a8ada9"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactBarPresentation.project (cognitive 129): CompactBarPresentation.project has cognitive complexity 129 (threshold 15). Drivers by points: ternaries 40 (65 pts), boolean chains 53, if/else 36 (52 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CompactBarPresentation.project::entry) 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":"native/Sources/PacerCore/CompactBarPresentation.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8da6a1009f93d566e231e645ee99c6d75bc388418d0d74dae6a60324696943"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_activity.otlp_records (cognitive 127): claude_activity.otlp_records has cognitive complexity 127 (threshold 15). Drivers by points: if/else 26 (85 pts), loops 6 (15 pts), boolean chains 14, ternaries 3 (12 pts), error handling 1 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae25476918ea590790d055a90ce90a3b0ccbc231713fdc38e8c3212868ce0fad"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.consume (cognitive 126): SessionActivity.consume has cognitive complexity 126 (threshold 15). Drivers by points: if/else 39 (67 pts), boolean chains 56, ternaries 1 (2 pts), match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"666ad8223009544851e0e177a2240ee154528bd3b5435c496c4c2f7629e293d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPalette.Apply (cognitive 124): SettingsPalette.Apply has cognitive complexity 124 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"windows/Desktop/SettingsPalette.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bb3e61fceecf687472bcd9a4f628942e259181c68cb340be2d5f71b7a2c477"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_activity.transcript_record (cognitive 120): claude_activity.transcript_record has cognitive complexity 120 (threshold 15). Drivers by points: if/else 36 (51 pts), boolean chains 31, ternaries 17 (31 pts), loops 4 (7 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2223003a8c11141384421f9c5e1082fba671d68e13d9680eb502d3a9881fd80"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.publish (cognitive 115): EngineRuntime.publish has cognitive complexity 115 (threshold 15). Drivers by points: if/else 32 (53 pts), boolean chains 39, ternaries 16 (19 pts), loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5b8933ba2cdaf99808399194236b6159f997e905ec8765d21e974f1f36434d"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeActivityMonitor.receiveDesktop (cognitive 115): RealtimeActivityMonitor.receiveDesktop has cognitive complexity 115 (threshold 15). Drivers by points: if/else 28 (52 pts), boolean chains 43, ternaries 7 (18 pts), loops 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d81df6e0ef11bc61459df115659586de36ba8b9c00115622b8dcc672971e6e7"}},{"ruleId":"D2","level":"warning","message":{"text":"PacerEngine.run (cognitive 107): PacerEngine.run has cognitive complexity 107 (threshold 15). Drivers by points: if/else 31 (54 pts), boolean chains 26, ternaries 14, error handling 4 (8 pts), loops 2 (5 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5f31afbded17cbde612b9f3b5aed5211fb5f0c42105c05cdbc0e1959e7080f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeQuotaClient.fetchQuota (cognitive 102): ClaudeQuotaClient.fetchQuota has cognitive complexity 102 (threshold 15). Drivers by points: if/else 21 (54 pts), boolean chains 32, error handling 4 (8 pts), match/switch 1 (4 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"985f956716446dac397f241f34f4e03e2bce496c9cca67d32c96fa75ab519d30"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStatusIconNSView.apply (cognitive 90): TaskStatusIconNSView.apply has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 35, ternaries 9 (16 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"64372ad8bbf2a14932ca7c6171d19344f4496aafd664d714c7cc09461d169651"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshCollapsed (cognitive 87): SettingsWindow.RefreshCollapsed has cognitive complexity 87 (threshold 15). Of this number, 86 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCollapsed.cs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4af88e7c059a2e78ad261e73e13aff50502520329aa109156d75ee2def2de9"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskProgressRing.Apply (cognitive 86): TaskProgressRing.Apply has cognitive complexity 86 (threshold 15). Of this number, 84 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskProgressRing.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9130e6e746cd910fe3cf7db0804a363aa25fb0108d4b00afd9b1f3a4069e7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyTranscript.consume (cognitive 86): WorkBuddyTranscript.consume has cognitive complexity 86 (threshold 15). Drivers by points: if/else 28 (50 pts), boolean chains 35, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyTranscript.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe6b21c0a6d185d339f6aa6677eaa718295457c4e7e8af1abeaba4c007ab9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityBadge.Update (cognitive 79): ActivityBadge.Update has cognitive complexity 79 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfafb34152c9f9637196472ee9b6ad266703af9790302420e022434e567ea71e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDesktopCollector.run (cognitive 79): NativeDesktopCollector.run has cognitive complexity 79 (threshold 15). Drivers by points: if/else 22 (63 pts), loops 4 (11 pts), boolean chains 4, error handling 1 (nesting depth added 48). Of this number, 72 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/NativeDesktopCollector.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"53651a10346ed56807492f45e3b96c2e3f93cd52136fa62b63e9f01b7ede83b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ZstdFrameDecoder.decode (cognitive 77): ZstdFrameDecoder.decode has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (64 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ZstdFrameDecoder.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac118b838672b1b729d0e43260e6f4fef39a1647eda60581c0413dbb688a069"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessProgressGuide.init (cognitive 76): HarnessProgressGuide.init has cognitive complexity 76 (threshold 15). Drivers by points: ternaries 18 (40 pts), match/switch 10 (16 pts), if/else 11 (14 pts), boolean chains 6 (nesting depth added 31). Of this number, 74 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessProgressGuide.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf299c1c2d9afef3d3f4dd0c600df10d6b3807cf80c4154b45c7aef8daf99c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.RenderPanel (cognitive 75): IslandWindow.RenderPanel has cognitive complexity 75 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPanelSections.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"284c063946ffe79fda573dcf07becb2403d598f4bc4d08fcd899587e435ea573"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekProgressSetup.apply (cognitive 75): DeepSeekProgressSetup.apply has cognitive complexity 75 (threshold 15). Drivers by points: if/else 22 (52 pts), ternaries 5 (12 pts), boolean chains 8, loops 1 (2 pts), error handling 1 (nesting depth added 38). Of this number, 73 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekProgressSetup.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc08b7974916e902f7cd56a657d3598af8f994e4ffc81d83f251d3bdad0be1d"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelController.layout (cognitive 75): PanelController.layout has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (31 pts), ternaries 14 (23 pts), boolean chains 21 (nesting depth added 13). 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":"native/Sources/PacerIsland/PanelController.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bf76d5e106ef460135282d9c3c15ae890b17fab2aef6e487eeb015a08958da"}},{"ruleId":"D2","level":"warning","message":{"text":"Tailer.read (cognitive 72): Tailer.read has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (51 pts), boolean chains 8, error handling 2 (6 pts), ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"539d1489996042d94cf81c7e938269b98a3a57aaa4ae6de0c5ae3ffe6e325bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopValue.patch (cognitive 71): DesktopValue.patch has cognitive complexity 71 (threshold 15). Drivers by points: if/else 26 (58 pts), ternaries 2 (9 pts), boolean chains 3, match/switch 1 (nesting depth added 39). 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":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1798a0a23264a70e627f47b6f4020d03aae0747dfcfcd54f0edb7e99dc013f8"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopFrameDecoder.field (cognitive 70): DesktopFrameDecoder.field has cognitive complexity 70 (threshold 15). Drivers by points: ternaries 19 (39 pts), if/else 15 (28 pts), match/switch 2 (3 pts) (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d323baf23a9bcb32adc471c9216fcae5aa529a74bcc100add6052d4e1ce229"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalActivityReader.latestTurnAnchor (cognitive 69): LocalActivityReader.latestTurnAnchor has cognitive complexity 69 (threshold 15). Drivers by points: if/else 9 (35 pts), boolean chains 25, loops 2 (4 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalActivityReader.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f0b0f13716a626abcc906994a86fbd332f2fa6425146f2f0f4ec261215010"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsActivityNavigation.resolve (cognitive 67): WindowsActivityNavigation.resolve has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 36, if/else 21 (29 pts), ternaries 2 (nesting depth added 8). Of this number, 65 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsActivityNavigation.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be71066e5fe9268819a361f4f59b4a14aa6a0e38c53f05c42edeb6e95edfb8d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexQuotaCoordinator.read (cognitive 67): CodexQuotaCoordinator.read has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (56 pts), ternaries 3 (7 pts), boolean chains 3, error handling 1 (nesting depth added 34). 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":"native/Sources/PacerCore/CodexQuotaCoordinator.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"477eeaa07ce1365f7d9e99d2427f219c3ecd4f6a9f77dc72d1d0303891074d77"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_remote_setup.install (cognitive 66): claude_remote_setup.install has cognitive complexity 66 (threshold 15). Drivers by points: if/else 30 (37 pts), boolean chains 24, error handling 3 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6809b850b8dba111ba19388312938029251168f900a2ec14163513dc6ee94903"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.projectCollected (cognitive 62): EngineRuntime.projectCollected has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 15, ternaries 5 (13 pts), loops 3 (7 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"889e55f37664e1118c46fe5a623fef10391a50e91c2526dbf7b7b3c92f110805"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeActivityMonitor.reconcile (cognitive 62): RealtimeActivityMonitor.reconcile has cognitive complexity 62 (threshold 15). Drivers by points: boolean chains 25, if/else 18 (23 pts), ternaries 7 (8 pts), loops 5 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3d75e7d6e78cd73a070c0ab0050cdf59a761417d9f1192c3da796678647b63"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshUpdates (cognitive 59): SettingsWindow.RefreshUpdates has cognitive complexity 59 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsUpdates.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c382df62fbbff5e39613db080e9894ecf3f404f31ce43624bddaa96a52497907"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.connectionPresentation (cognitive 59): EngineRuntime.connectionPresentation has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 6 (12 pts), boolean chains 10, ternaries 4 (8 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"083c842c3cbbdfb5c47ccf74b0bb7f2a0a97a9c72fde7dc3b1ea5750053f19cd"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.collect (cognitive 59): EngineRuntime.collect has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 19, loops 3 (7 pts), ternaries 3 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"181bb0a2fbc80cc2ea8da327ec9d0fd317c94cb2c6f5df746a6180cb4c804e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeWebQuotaClient.fetchQuota (cognitive 59): ClaudeWebQuotaClient.fetchQuota has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 19, ternaries 1 (3 pts), error handling 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeWebQuotaClient.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ba1d8a23208ceab7adb7910c3a0bde45b9c90c9f08ef345420f5b2afdbc937"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekSessionLog.parse (cognitive 59): DeepSeekSessionLog.parse has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 10 (19 pts), boolean chains 13, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca930dcbf596d2ac1f708237ac8e5cf95c7bf22b53410c7b4a80bda4ec3c015"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyMonitor.project (cognitive 59): WorkBuddyMonitor.project has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 19, ternaries 5 (8 pts), loops 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":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a7c6b694b449d13eaf5cae0b3fae1a9ad0a5ee9fe0f505cccde884e270a339"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshHarnessProgressGuide (cognitive 58): SettingsWindow.RefreshHarnessProgressGuide has cognitive complexity 58 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4045314cc67e0cf58797d097d67a284d17f495140793af7b5d45be7fe340d2"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferencesCodec.Decode (cognitive 57): PreferencesCodec.Decode has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6661aea911ac3b5d0ffd9f326a3dc86b58e5c2160b5f76b561005470a100e899"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeHookInstaller.setPlugin (cognitive 57): ClaudeHookInstaller.setPlugin has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 15 (nesting depth added 19). Of this number, 55 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e5382eadde56795b2d7ba6d99584544ebea290f6dee07d28182c785ccacc0c"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_remote_setup.set_plugin (cognitive 57): claude_remote_setup.set_plugin has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 12, loops 1, ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f9b00903045376c17b864142dbd3b2083cb384b9c52aac566368443e780136"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.string (cognitive 56): Cursor.string has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (13 pts), boolean chains 9, match/switch 2 (4 pts), ternaries 2 (nesting depth added 25). Of this number, 52 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a691b663ae4ac49b4d34c9c05bc02394007cc5e06716b48abc314261d7fab593"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessAccountCard.Build (cognitive 55): HarnessAccountCard.Build has cognitive complexity 55 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HarnessAccountCard.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fa8d67f9bff8fee29d21782d5b41f730cafa4086886fe23e0b791aca4f9287"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityTelemetry.request (cognitive 55): ClaudeActivityTelemetry.request has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 29, if/else 17 (25 pts), loops 1 (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityTelemetry.swift"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbae1cb45abda9d6d4764336e6e23e91a139a2db8b49434cbe89410f4372c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyMonitor.refresh (cognitive 55): WorkBuddyMonitor.refresh has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 18, ternaries 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b588f8a79b42352fab3cb880154725409bd53d8a8de84441aa5ad13c5e64403"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeQuotaCoordinator.read (cognitive 53): ClaudeQuotaCoordinator.read has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (44 pts), ternaries 3 (6 pts), boolean chains 2, error handling 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaCoordinator.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d075537e53d5b5430e06cb0cfe97d05fc62ffe20c6491aed42ea583151c1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshDeepSeekConnection (cognitive 52): SettingsWindow.RefreshDeepSeekConnection has cognitive complexity 52 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeekConnection.cs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ceee5a155fa727daaa7b303922fa212dba68c4abbd66d77b6a05fa7cb00376"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCloudProjectState.applyThread (cognitive 52): ClaudeCloudProjectState.applyThread has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 23, ternaries 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectState.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"951a7576200be9bb47b5554fcf7cbf6e1d006e335f7467024a311f652a7969ec"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopFrameDecoder.object (cognitive 52): DesktopFrameDecoder.object has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 13, ternaries 3 (8 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff4d6a1f1e4a485b16349dc01cb5a3014d1d407fa6f468c139e4c3ff3e8a679"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsDesktopCollector.receive (cognitive 50): WindowsDesktopCollector.receive has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (41 pts), ternaries 1 (5 pts), boolean chains 3, error handling 1 (nesting depth added 32). 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":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e150c4a145ec2a30b38159018c9c820c325a4f14ad03dc2701fe19e3d8edff2"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsHTTPProxy.forHTTPS (cognitive 50): WindowsHTTPProxy.forHTTPS has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 17, ternaries 1 (2 pts), loops 1 (nesting depth added 10). Of this number, 47 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPStream.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fa6c93e6bbb8c7cff97df383ce972f1f8e094cf63621b59bd8c5e056377d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexProgressSetup.apply (cognitive 50): CodexProgressSetup.apply has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 11, ternaries 2 (5 pts), error handling 2 (3 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexProgressReporter.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f84d5b359634a161a6991a1c082bd4c76b92104e884ed6af69491c53eb7f47"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.mergeDisplayMetadata (cognitive 49): SessionActivity.mergeDisplayMetadata has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 23 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40d95691275335fa45d361fc4e5d1ecab08c5e92cc2f44070f97222e690576e"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.consumeResponse (cognitive 49): SessionActivity.consumeResponse has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 11, ternaries 1 (3 pts), match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a0498741ba639cf1b89777a98f2f8a5d4638dc8417b1854e3d65fabc763159"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshExpandedPanel (cognitive 48): SettingsWindow.RefreshExpandedPanel has cognitive complexity 48 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d27f4815651e83e83314d6b3253f86a5339b29cc2c7b26f3d60ab55877656b4"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONFieldView.protobufIntegerText (cognitive 48): JSONFieldView.protobufIntegerText has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 14, loops 3 (5 pts), ternaries 3 (4 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/JSONFieldView.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"876a90a2d34be8443004eca7d3407c727aac71bea9cb96e014c34347044b5ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.skipString (cognitive 48): Cursor.skipString has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 7, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/JSONFieldView.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bae5006d6f5d7b0b086f1b9efedd839c447c0ca147dfd32b8a199202b2374d"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStatusIconNSView.applyFace (cognitive 48): TaskStatusIconNSView.applyFace has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 17, ternaries 10 (16 pts), if/else 13 (15 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":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aebcda3bcb9dafd3a8fb4009d7ef856a0c607fdb90e88e4dd4de6527e0f69b"}},{"ruleId":"D2","level":"warning","message":{"text":"MacDurableCatalog.observe (cognitive 48): MacDurableCatalog.observe has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (29 pts), error handling 3 (8 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableCatalog.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1510af221261f7c8aa79d71e15c687ef48bb0c9dafd9ccfa8f5347411d530b00"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBudgetDetails.DeepSeekBudgetDetails.ctor (cognitive 47): DeepSeekBudgetDetails.DeepSeekBudgetDetails.ctor has cognitive complexity 47 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekSoloView.cs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e79bc1dba25e05c1d8ed3a9769b8ce4aa6124a2efc3b6f11c85ed32d439d73"}},{"ruleId":"D2","level":"warning","message":{"text":"HighContrastScope.Discover (cognitive 47): HighContrastScope.Discover has cognitive complexity 47 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HighContrastScope.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7806eca99d08178691b11588a4302957c77191c3feeaa8f3c8b9c172e6950afe"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshConnections (cognitive 47): SettingsWindow.RefreshConnections has cognitive complexity 47 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsConnections.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f620cc6a5a9772b257f11fa1a3f4250d82de709e26a50aabe3e05a6658a7cae"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskGlyphArt.svg (cognitive 47): TaskGlyphArt.svg has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 3 (10 pts), loops 4 (6 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 22). Of this number, 44 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskGlyphArt.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"355124a9d64be362e6beb5c922154bb68174967ba34d62c012ba5991c4c26987"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStatusIconNSView.updateLoops (cognitive 47): TaskStatusIconNSView.updateLoops has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 18, if/else 10 (16 pts), ternaries 6 (8 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d005798eb7ab1c7fb454b9c126f5860a1013c8d29d935bb7b27d8b7dc3b419fb"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.UpdateCompactBar (cognitive 46): IslandWindow.UpdateCompactBar has cognitive complexity 46 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: 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":"windows/Desktop/IslandCompactBar.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cbfbdffbb25ce0a70dde0020fb52e4dc525b9707008f5bc51b8bd09d0ef86b"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineClient.Receive (cognitive 45): EngineClient.Receive has cognitive complexity 45 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9384dd408b5209598d6532f65d255f49b3a0c6b8018e93bbf8634ac7ad4740"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionIndex.entries (cognitive 45): SessionIndex.entries has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 3 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/SessionIndex.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"12590474e020774f8d1c1a86d1c535124647f5a4bdd6adc285c03cf5592bf02e"}},{"ruleId":"D2","level":"warning","message":{"text":"PacerMain.main (cognitive 45): PacerMain.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 4 (14 pts), ternaries 3 (5 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"699976e6b01ab7e9f631368b98f4a0f384307914ad016f114836ca6a25de0778"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshDeepSeek (cognitive 44): SettingsWindow.RefreshDeepSeek has cognitive complexity 44 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ddf463e1c38c953eda6bf5c33fb933adbc505ba79402a0be1775aa009bbe71"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsConversationApplication.TryDestination (cognitive 44): WindowsConversationApplication.TryDestination has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d0f673d74800b123beb1f22dfb832b416cf06cd83dcc3442aecad0079a227e"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.consumeCodexReport (cognitive 44): SessionActivity.consumeCodexReport has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 27, if/else 9 (12 pts), ternaries 3 (5 pts) (nesting depth added 5). 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":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e5dd2d33e3b5619544754491b4c14d4b38c187fdc924e22e4be6910642ec93"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_activity.sanitized (cognitive 44): claude_activity.sanitized has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 14, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d5eb177be57288f52f8d8b1eca55da20eea048e4df92aaaa2b18f4a9cbf675"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStatusIcon.ApplyFace (cognitive 43): TaskStatusIcon.ApplyFace has cognitive complexity 43 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskStatusIcon.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea080b18692dbb7e6afae294f8971fd6b4c19dd0900ff6fe326cfd4b498505ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCloudProjectMonitor.pollOnce (cognitive 43): ClaudeCloudProjectMonitor.pollOnce has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 14, error handling 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc542ad417e4d1dc237c445c7c7a77859c55fe265d77ecd96b0e1867d5ff9e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionInbox.observe (cognitive 43): CompletionInbox.observe has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 21, if/else 13 (21 pts), loops 1 (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompletionInbox.swift"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdaba2ab713e2fc6dcf146f88939b240812e72075d85275c609c21207e43764"}},{"ruleId":"D2","level":"warning","message":{"text":"SSHHost.hosts (cognitive 43): SSHHost.hosts has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 10 (30 pts), if/else 4 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ConnectionPresentation.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"618f1268909e35fbf97dbb05637f7b6128a328c4f286aa111f7df6d8df7f5f30"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopFrameDecoder.sanitizedPatch (cognitive 43): DesktopFrameDecoder.sanitizedPatch has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 10 (18 pts), if/else 16 (17 pts), boolean chains 8 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd23d80d6cf83cb2008382e719f911c829fa05ea5f962abff3dec6df8bc931f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDesktopSession.observeDurableHistory (cognitive 43): NativeDesktopSession.observeDurableHistory has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 16, ternaries 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/NativeDesktopSession.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b502b6f3efc6347830f8509c674d67e25fe7d7c86ae4bd9bc42e480dac1db4"}},{"ruleId":"D2","level":"warning","message":{"text":"MacDurableProgressSetup.reconcile (cognitive 43): MacDurableProgressSetup.reconcile has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 5 (13 pts), ternaries 3 (6 pts), error handling 3 (5 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":"native/Sources/PacerMacSupport/MacDurableProgressSetup.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced12983c1cee90d81f8909b5efb4fbb58c214b167ebb1f6aaf4fbd7a559adf2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_remote_progress_setup.install (cognitive 43): codex_remote_progress_setup.install has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 6, error handling 2 (3 pts), loops 3, ternaries 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":"native/Sources/PacerCore/Resources/codex_remote_progress_setup.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28733aeef83e7c422e2283161fa7b356fa371d3c4b8c3ff885bbc5de928ddcc"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshHistory (cognitive 42): SettingsWindow.RefreshHistory has cognitive complexity 42 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"da572b90bf0d9509bca5f4fbdb29ca5ab7dedfdeb44ca64e2e793c97558d59c6"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsDurableCatalog.observe (cognitive 42): WindowsDurableCatalog.observe has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (28 pts), error handling 3 (8 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDurableCatalog.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"48856682b30a677ff43c2e9c031868ca548bf3f5c0ed60b334068d2a65dcb1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"GuideContent.Module (cognitive 41): GuideContent.Module has cognitive complexity 41 (threshold 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 473, 460, 458). 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":"windows/Desktop/GuideContent.cs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0900d084789a01b3e5cd6641aa1e997d8dece3bb5604885deca709c02f796773"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineShellProjection.reply (cognitive 41): EngineShellProjection.reply has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 27, if/else 8 (13 pts), match/switch 1 (nesting depth added 5). Of this number, 39 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineShellProjection.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac4efde1e6df1576ac92de499e24f962f7f224a7dad388e30e622627d09e17f"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsDurableProgressSetup.apply (cognitive 41): WindowsDurableProgressSetup.apply has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (11 pts), error handling 3 (7 pts), boolean chains 5 (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":"windows/EngineSupport/WindowsDurableProgress.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"07818df8acf4ae911fbc0982e4a39d29b160e0a4aea8fcd528e73da5d9f3b4c3"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 41): main.swift.top-level code has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 5 (11 pts), boolean chains 9, error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerHooks/main.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20d84d844906c037d7955f68217b96e46ba9c1a8db473f58ae8c746775b1e70"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionPagePresentation.init (cognitive 41): ConnectionPagePresentation.init has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 18 (25 pts), boolean chains 7, if/else 5 (6 pts), match/switch 2, loops 1 (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 17 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":"native/Sources/PacerCore/ConnectionPagePresentation.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3eb3fd67c9c2e28ce7e20b841dea5dca03880c52eecdf8703dca5326884644"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessActivityStore.accept (cognitive 41): HarnessActivityStore.accept has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 12, loops 1 (2 pts), match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessActivityStore.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0968d404698d535c9f5083c6f474fb214e896325e2358f9f29c6e1543d9d24"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferencesCodec.Encode (cognitive 40): PreferencesCodec.Encode has cognitive complexity 40 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb1d69e628e877374a05ad6eb872ab81d145e7d21e14f9a737caae92ee6c806"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsWSLServices.discover (cognitive 40): WindowsWSLServices.discover has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 10, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsWSL.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"196c215f87771a8806733aaef39ec20044322d3ea1b4bac847b88c241c9d74e4"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsClaudeRuntimeStore.collect (cognitive 40): WindowsClaudeRuntimeStore.collect has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeRuntimeStore.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5f273c8f34b8546a625bd966cfc6ffab0b9ba9ff5733f42f1f72d6d15bf612"}},{"ruleId":"D2","level":"warning","message":{"text":"Tailer.discover (cognitive 40): Tailer.discover has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 7 (11 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":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cea16c20a24724c5d07b62bbb4650d1bd00d514d9a8f11392a3bd2ef1059ff"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshReminders (cognitive 39): SettingsWindow.RefreshReminders has cognitive complexity 39 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsReminders.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54c75a099b638f98c47b2d95a57efa91c3a594a00a32ed10e4e7047a6d588ce"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexClient.fetchQuota (cognitive 39): CodexClient.fetchQuota has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 8, error handling 3 (5 pts), match/switch 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"29929c0cb3a7299440c9914e1f0263f4448f966812ea05364f0ff55b501b20eb"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.configureClaudeRemote (cognitive 39): IslandModel.configureClaudeRemote has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 20, if/else 11 (16 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 6). 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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac93ddc4acb0a03a451c8ca51deb418ebc1c8aa5f4e35696aba1bce8d8b8abc"}},{"ruleId":"D2","level":"warning","message":{"text":"readGroups (cognitive 39): readGroups has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 6 (8 pts), boolean chains 7, loops 4, other 4 (nesting depth added 9). Of this number, 33 points are the body\u0027s own statements and 6 belong to 32 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/workbuddy-account-credits.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1116b81e321834d3b3393eb81aa3bccdb2624c5f0d32e8836e65661f64fc5d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactLayoutEditorView.Update (cognitive 38): CompactLayoutEditorView.Update has cognitive complexity 38 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactLayoutEditorView.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d27e6ca2f167dd0def5b4950ed9868074748328299128f84b8beba47c16cfd9"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshSidebar (cognitive 38): SettingsWindow.RefreshSidebar has cognitive complexity 38 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsSidebar.cs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d58a22f17feb07ed81f10ce98d5a6ccf2c394bb41aa7b19fee2f2a9e091da0d"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekProgressSetup.update (cognitive 38): DeepSeekProgressSetup.update has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 13, ternaries 4 (10 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekProgressSetup.swift"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce77ab52028a3f05f335d9276bd6480cfc0edeb7eae8f400489cbdfe87cf7afb"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskProgressRing.UpdateSpin (cognitive 37): TaskProgressRing.UpdateSpin has cognitive complexity 37 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskProgressRing.cs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a795e2f93b0f369e2c75e0b3acfdee0e6065bfa93d85f25b53c8883e9e6b50a6"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineSnapshotEmission.equal (cognitive 37): EngineSnapshotEmission.equal has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 13, ternaries 2 (4 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineSnapshotEmission.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d041edbab0b0d229e13d539b84e0ae9b844218db36566f5dd16f41e732b0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsClaudeRuntimeStore.ensure (cognitive 37): WindowsClaudeRuntimeStore.ensure has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 11, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeRuntimeStore.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6260b02eb5d06f93137a7cf023cb367f720279093bedbcf27d51f0058b111d55"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexClient.setDurableProgressPlugin (cognitive 37): CodexClient.setDurableProgressPlugin has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 8, loops 1 (nesting depth added 11). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d0558387bbdfec4e687891aada5c52284b400cfcdd222f992744cc04261169"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopFrameDecoder.turns (cognitive 37): DesktopFrameDecoder.turns has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), ternaries 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8bf8baafe9cb1f7600b11bbd409b0dedd639346dfb602ab4afb3d8f6be45d8"}},{"ruleId":"D2","level":"warning","message":{"text":"HostApplicationTrackingState.prepare (cognitive 37): HostApplicationTrackingState.prepare has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 11, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HostApplicationTrackingState.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc491687fbf68544faa5e279bb2e8e28967ed7424b7c5e2e49720c5556e74667"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddySessionStore.automationRuns (cognitive 37): WorkBuddySessionStore.automationRuns has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 9, ternaries 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8797e6f6823515ebc32a3459ded69447c033f18631314990939bd77d0c907c62"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaRingsView.rebuild (cognitive 37): QuotaRingsView.rebuild has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 9 (23 pts), if/else 4 (7 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactQuotaViews.swift"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb6ea94486448972faab721c9f378d95ae2fd6dbbc7953da24fe239faa3588f"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.PanelBlockButton (cognitive 36): SettingsWindow.PanelBlockButton has cognitive complexity 36 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 16 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"036ef8d4e51e8328efda043526a25bb3a9b304df20703c6381d7a0b09e3975fa"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshValues (cognitive 36): SettingsWindow.RefreshValues has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e7148b33732b7a40e5972dea7c288e27ec477459415c69d01e88565be358b5"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexLogAttention.consume (cognitive 36): CodexLogAttention.consume has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 21, if/else 12 (15 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexLogAttention.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d09ce70c12fab978a0ac899a2d2cf52b4569d97da4f0e7b5eaf11cf555133"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactBarContext.init (cognitive 36): CompactBarContext.init has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 14 (21 pts), boolean chains 8, if/else 7 (nesting depth added 7). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactBarContext.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7d0cd43bc71145ec918af0205cba23df6a13d2d16f62d4b3ff3971f2906698"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopFrameDecoder.array (cognitive 36): DesktopFrameDecoder.array has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 8 (10 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebe90b8a25d400cd34ab0a82a1259f8b45c11cc29869a76aa2aa8ff3bf1b353"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_hook.statusline (cognitive 36): claude_hook.statusline has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 2 (6 pts), boolean chains 5, loops 2 (5 pts), error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_hook.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf594ff9bf906bad5319ac53ab1eb07d15d81d9c694a72b1047da16aeba1bb65"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshCodex (cognitive 35): SettingsWindow.RefreshCodex has cognitive complexity 35 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eab09e0a0056712f2d714e30e18af88f86c93252e566e9727fe71c3b69aeda"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.maintenanceRefresh (cognitive 35): EngineRuntime.maintenanceRefresh has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (12 pts), boolean chains 8 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77340ec2deb24415f4ae0db0c5ffb2c75c359f71c780ff24f0f873fde9b1f79"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.receiveWSLDiscovery (cognitive 35): EngineRuntime.receiveWSLDiscovery has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 11, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf2297592e2e02bbe0b99cb2a20e94cb1b6cd406fd7661ac4e627db66537fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddySessionStore.usage (cognitive 35): WorkBuddySessionStore.usage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 9, ternaries 2 (8 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a58984b02d863df436910fbeb0232360895c1c25f3e8cbd254c2675258b2d69"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityBadge.UpdateEstimate (cognitive 34): ActivityBadge.UpdateEstimate has cognitive complexity 34 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"be37ff0f060c9ed709092d47d1329ac95066b27358c6d61d888af540fddf9223"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.AttentionItems (cognitive 34): SettingsWindow.AttentionItems has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36f05022bd801936397e3ce19e7e7839fe318617bc8c6fb25feae995f2e6b96"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsInstallationOperations.UninstallAsync (cognitive 34): WindowsInstallationOperations.UninstallAsync has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e3e0e7d62425716de97ecc1d0291601ce9d853416fffdbe1c846ce7e88d6a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityNavigationTarget.resolve (cognitive 34): ActivityNavigationTarget.resolve has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 10, ternaries 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityNavigationTarget.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b786167e02170d1f20dba1575aa5ca5e041c739a0d68cb52a607d10bd03c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityTelemetry.requestBody (cognitive 34): ClaudeActivityTelemetry.requestBody has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 9, loops 3, error handling 1 (nesting depth added 5). Of this number, 30 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityTelemetry.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac73ddf0ffec41c671a01381fc5d4cefd8626b2835371bbba2fb524772ecbc"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactWarningPresentation.items (cognitive 34): CompactWarningPresentation.items has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 3 (6 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 13). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactWarningPresentation.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3462705f1c2fad3d8c64a7fff4380354cdac7087abacb2bfc587f4e3332ff13e"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.number (cognitive 34): Cursor.number has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 11, loops 3 (6 pts), ternaries 1 (nesting depth added 8). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24dd568c9fcf7790e8f9cc8fa99ef0ec748a8eb8439cfa021f2a4062f0c96e1"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableHistoryPoll.read (cognitive 34): DurableHistoryPoll.read has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 8, ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableCatalogReader.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009e51b1f4d270e8f3ce0cd92ab3af98866f13a87dd765f821b09bd4a94b125"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlCatalog.readTargets (cognitive 34): RemoteControlCatalog.readTargets has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 14). Of this number, 31 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlCatalog.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24ee831d63a622dc14c108f7d5cfe6560a6f1085c4bcb66b2e3695e9c796a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsView.providerPane (cognitive 34): SettingsView.providerPane has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (27 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"15eb7beb9bd01cf0394e60a0a42e5efb31a17121a4f2a2a9cb9d0de00bbe6100"}},{"ruleId":"D2","level":"warning","message":{"text":"Tailer.drain (cognitive 34): Tailer.drain has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (22 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5c8b049cc293bba941527b95e3527e34673b4a129374f923516bca6023d0c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.CommitSourceAsync (cognitive 33): SettingsWindow.CommitSourceAsync has cognitive complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1d5c3714c3ccdef1a52f12643f97336eac338988b2461ab15782f7ccd6952f"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStatusIcon.RebuildGlyph (cognitive 33): TaskStatusIcon.RebuildGlyph has cognitive complexity 33 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskStatusIcon.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96687103cedac0d205e57a6855de77a3bc868b3d4188abe486851382f48a85f"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.notificationSource (cognitive 33): EngineRuntime.notificationSource has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 3, ternaries 1 (3 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"adac96f70491f167ab0359b668c6ecd0333d67e55981bf6d9a1cfcc9658c2ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsDesktopCollector.start (cognitive 33): WindowsDesktopCollector.start has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62fe02addcc9ddceb46a8368062463f0c2c4b74ebadc1ea74a13d042c23e5d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionSource.sources (cognitive 33): ConnectionSource.sources has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 9 (11 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ConnectionPresentation.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57390d7663907613b3cffc559f6c09811389c5bd82360021c759016d238d3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.syncLocalHarnessProgress (cognitive 33): IslandModel.syncLocalHarnessProgress has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 12, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1e167b779e694f3eee1a43de3db4f7e93aee675117a050e43c9c2e456ba394"}},{"ruleId":"D2","level":"warning","message":{"text":"AlternatingQuotaText.Update (cognitive 32): AlternatingQuotaText.Update has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AlternatingQuotaText.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de2a321882a80cf2fb74cf646db38220c5368c5fcf333ab0612bd34086f717a"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCatalog.Parse (cognitive 32): UpdateCatalog.Parse has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateCatalog.cs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd58c9ca32c73abd1d4e68e8b6bb7c64dbfd1fc8d801026c65e240d9bd03dcd9"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivitySourceMerger.merge (cognitive 32): ActivitySourceMerger.merge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 11, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivitySourceMerger.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"69edbe0e8f1b0c69cc0434fb96ae08ba7844b16a41c43dab2d1f57202cf1e756"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeObservedRequestMeter.settled (cognitive 32): ClaudeObservedRequestMeter.settled has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeObservedRequestMeter.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9354a2e31577869316edcba7a8124e174c67ef59fa34919910b4dc88eb657d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRolloutMetadata.read (cognitive 32): CodexRolloutMetadata.read has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 13, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexSessionOrigin.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"435d35063d47dc1f50b691467aebf6748e0676a9c5c5acf78dfc8f800e4f1856"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopRouteHints.changed (cognitive 32): DesktopRouteHints.changed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 10, loops 1 (3 pts), error handling 1, ternaries 1 (nesting depth added 11). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopRouteHints.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"78da799a8656af011886a780fd04214b9ab41a9150f72dbf86d9138382c858fc"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsProcessHost.nearest (cognitive 31): WindowsProcessHost.nearest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 11, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsProcessHost.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b959f55aec7fa89705e7c85e205ee2b6d063045749c68bff40605d596b772057"}},{"ruleId":"D2","level":"warning","message":{"text":"Turn.observeResponse (cognitive 31): Turn.observeResponse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 11, ternaries 2 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyTranscript.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d8e4c5bbc7ca017a82df7de1ea8429203676e933ad109d1611ed0ec8d5a8d1"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_progress_mcp.record_receipt (cognitive 31): codex_progress_mcp.record_receipt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, error handling 4 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79828d441dcf1651b5482bf2b98def202166e8ca94e7df33bf45de5b6b1580a"}},{"ruleId":"D2","level":"warning","message":{"text":"pacer-codex-progress.record_receipt (cognitive 31): pacer-codex-progress.record_receipt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, error handling 4 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/Resources/pacer-codex-progress.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59ec1a5e736577b430f81f8c105cbdbc2079b14420280616d5d14796ab147a0"}},{"ruleId":"D2","level":"warning","message":{"text":"AlternatingQuotaText.Step (cognitive 30): AlternatingQuotaText.Step has cognitive complexity 30 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AlternatingQuotaText.cs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc191b42ae597d716fdc23b4cbef7a81d5be26b63938f5e56b02a7f72b86a922"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsStartupRegistration.SetCore (cognitive 30): WindowsStartupRegistration.SetCore has cognitive complexity 30 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsStartupRegistration.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a862dcc27c2a6a9d853971e73e1d24ca627f899649b7f66643ccdede02207388"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsCodexProcess.init (cognitive 30): WindowsCodexProcess.init has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (9 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsCodexProcess.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"47af1b1cd6996ce9b4a343b274a92a2dce148bbb5b1a9bcfa4e6089b6c7145f6"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekSessionLog.progressResult (cognitive 30): DeepSeekSessionLog.progressResult has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 25, if/else 4 (5 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"330b94fad4a459c839d0bc834b7d7f0f6b813b0ef1659adf107bff95871ca2a3"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessCreditsNoticePolicy.notices (cognitive 30): HarnessCreditsNoticePolicy.notices has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, ternaries 3 (6 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessCreditsNoticePolicy.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b4a6f7f3c0a91bd5b59336efe755b9c7118f2a6d138c9c8d640b776cfb9139"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlActivityTarget.configured (cognitive 30): RemoteControlActivityTarget.configured has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 2 (6 pts), error handling 1 (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlActivityTarget.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1250cef0f9b75919c53654939443ce25328eedce925c5b730e790f53b9eea062"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlCatalog.refresh (cognitive 30): RemoteControlCatalog.refresh has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, error handling 4, ternaries 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlCatalog.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ad64449b07ca3579f68cbe74a047adb59abd7a8961243ce48b58897882ee64"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekSoloView.DeepSeekSoloView.ctor (cognitive 29): DeepSeekSoloView.DeepSeekSoloView.ctor has cognitive complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekSoloView.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a08477cbdb6ea88b5edaae73018140404e0a3463ab07d10d4911ad39878c404"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineClient.RequestAsync (cognitive 29): EngineClient.RequestAsync has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae6daa234118a87bdbc7b44623977042917b1a857905d84d599a6e907db9d52"}},{"ruleId":"D2","level":"warning","message":{"text":"GuideContent.Releases (cognitive 29): GuideContent.Releases has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e2768ba605718f71492c3463f20b538f2fba88531194ea068e1d4f7069fbc1"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseNotesMarkdown.Spans (cognitive 29): ReleaseNotesMarkdown.Spans has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ReleaseNotesMarkdown.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"587f470b82ed72db96277673156e2f386aec976f76cfdb39433fbacc0f214674"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsClaudeCloudStream.read (cognitive 29): WindowsClaudeCloudStream.read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (8 pts), loops 3 (6 pts), error handling 1 (3 pts), ternaries 1 (nesting depth added 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsClaudeCloudStream.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4495b3a49c4e2692c7b6b0c5207e1b606774ee012c7ad307fa277b383000021d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeDesktopCredentialStore.decodeCache (cognitive 29): ClaudeDesktopCredentialStore.decodeCache has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (13 pts), loops 1, ternaries 1 (nesting depth added 5). 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":"native/Sources/PacerCore/ClaudeDesktopCredentialStore.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22309b7ae2172b6eb73665c31e0cf06bdebb7f1ec7e313cf55d9e01af85801c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBalanceCoordinator.finish (cognitive 29): DeepSeekBalanceCoordinator.finish has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, ternaries 2 (4 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"36071f6dcc30afb4c9a5151a817cf49f2793bcf0a79d35277788b84a0b12571e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekDialPresentation.init (cognitive 29): DeepSeekDialPresentation.init has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 10 (14 pts), if/else 10, boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekDialPresentation.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb6a6db197ebd8888bd8d34630480ab50132291189624ca6dd90258bf794ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpandedPanelPresentation.sections (cognitive 29): ExpandedPanelPresentation.sections has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (8 pts), ternaries 2 (6 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ExpandedPanelPresentation.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeba7a621f3fede87601c67fd7be60203c4aa7b2a483544c60e873d14c046ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteActivityTarget.configuration (cognitive 29): RemoteActivityTarget.configuration has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 12, error handling 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteActivityTarget.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a9c62c63defac43493454e8ea9dfe927e21781aa6f7a2b58f98d96c6ce56d7"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlCatalogAuthorization.init (cognitive 29): RemoteControlCatalogAuthorization.init has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 21, if/else 7, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlCatalogAuthorization.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b5324be0a26b3eceb259f080002ed1c42319cb754cf524335b73e29b30906e"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddySessionStore.rows (cognitive 29): WorkBuddySessionStore.rows has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 5 (8 pts), boolean chains 6, loops 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":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc081cd0ca10b2d357d8b481cfe5939f08a765bb03378db798b72fb7d59c687"}},{"ruleId":"D2","level":"warning","message":{"text":"HighContrastScope.Update (cognitive 28): HighContrastScope.Update has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HighContrastScope.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9fd9b2d1418474de11026b15426a98e43d25cb075c804b26890098b8b4e682"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshHarnessCredits (cognitive 28): SettingsWindow.RefreshHarnessCredits has cognitive complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dfe0c2252e51ac14699b950aedf08b23d8712e549e83e69c6df51b53bcb22f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCloudProjectState.sessionsToRead (cognitive 28): ClaudeCloudProjectState.sessionsToRead has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectState.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd93631b18b20e907431176296c6758ab1889d0a655cd801bdd495d0fa5e013"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeSSHDiscovery.configurations (cognitive 28): ClaudeSSHDiscovery.configurations has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (11 pts), ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeSSHDiscovery.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a0e760afcf70627f6c18a95bf448e22008065fd37715a3f619533ddc0952b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionSummary.init (cognitive 28): ConnectionSummary.init has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (7 pts), ternaries 7, loops 5 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ConnectionPresentation.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"396d6c744af8037f9e11a06199ae2a70802ad98e257c0f2d96319a9042b20999"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBalanceCoordinator.configure (cognitive 28): DeepSeekBalanceCoordinator.configure has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 8, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba9d7292f72553358c0ba715ce6d2f17445d51329e6376ff7d443f68369c44d"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekSessionReader.readFrames (cognitive 28): DeepSeekSessionReader.readFrames has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionReader.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"622974ca508e977dbab9d14be2a08c36bc3147b5399c8b3a4fdf00a6fbd7aaa9"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandPlacementGeometry.Arrange (cognitive 27): IslandPlacementGeometry.Arrange has cognitive complexity 27 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPlacementGeometry.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"155d6f0f6a79972c5a33c325b464458991b0f914cedb96d2785591ca0dc367ad"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferencesCodec.Normalize (cognitive 27): PreferencesCodec.Normalize has cognitive complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68df838d1937b705f2947d5fb332bcb72ca6a25f336cf020ae567661bfa0e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshModules (cognitive 27): SettingsWindow.RefreshModules has cognitive complexity 27 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsModules.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ba7275f31d308f87a75823ab1bdabe60be675a5b519ffdbf573a0602d6185c"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsClaudeRemoteCoordinator.finished (cognitive 27): WindowsClaudeRemoteCoordinator.finished has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 2 (6 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsClaudeRemoteSetup.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6cf29166f7a4069cce8e8d524493a26cea4658366096486c44696ccf05e0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityTaskRowPresentation.init (cognitive 27): ActivityTaskRowPresentation.init has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 6 (7 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50c0b38158fdd81ac0f8e7f30ce64dc679599ed150b1de0c8c777fe67954d27"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeAgentNotification.init (cognitive 27): ClaudeAgentNotification.init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 13 (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeAgentNotification.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b2e50770ea0e1827c55e21fe40e27aaf66172c61a00e349d221a5f09b4764d"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBalanceCoordinator.refreshIfDue (cognitive 27): DeepSeekBalanceCoordinator.refreshIfDue has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (9 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ac860c1be1fc4f62d7d078fbc862424c550b9abc94260636ac2766423d745a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpandedPanelPresentation.project (cognitive 27): ExpandedPanelPresentation.project has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ExpandedPanelPresentation.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af89d9c14040f9b3ac03084b3ebb8d8a4c3994c392ca857c65ad0eb948fbed3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelDisplay.name (cognitive 27): ModelDisplay.name has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, ternaries 4 (8 pts), if/else 5 (7 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ModelDisplay.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"570bbf165ba0662bd3482751d8adf7025ea405dcd18f3fd2dca6f432bb84a05c"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeActivityMonitor.startAsync (cognitive 27): RealtimeActivityMonitor.startAsync has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec78022839317d536027472c257cfa78bf4277a96c524239c857bf10249b8edb"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyHarness.progressConnection (cognitive 27): WorkBuddyHarness.progressConnection has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20b749ab9d5a53fd9ead3bcdf2f95f2b4f9cd532f276f1258222c91573a2a38"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyRunLog.time (cognitive 27): WorkBuddyRunLog.time has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 9, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyRunLog.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceaa48a375f7d53b5930122ad89cd9aa8b9e25081f2663c853e4d193d27c141"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekQuotaCell.DeepSeekQuotaCell.ctor (cognitive 26): DeepSeekQuotaCell.DeepSeekQuotaCell.ctor has cognitive complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekQuotaCell.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"366763fa0f869e2ffcb6d32a7dbc36c580740c35d20b27341a58bcd46643f066"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshDisplayChoices (cognitive 26): SettingsWindow.RefreshDisplayChoices has cognitive complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsAppearance.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf387a6eac530e166d6a4dd09dd83a6cbe7ad233837a45c31ddbd707a6e90a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.observeCodexGoal (cognitive 26): SessionActivity.observeCodexGoal has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 20, if/else 5 (6 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"68830212b4e7da2db9b8b09199f3c764e77477a1c8e9d65a722fba2599db25ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityNavigationRegistry.update (cognitive 26): ActivityNavigationRegistry.update has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 9, if/else 3 (5 pts), loops 1 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityNavigationRegistry.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"26429473918589ff40a905349558a67bf043d3e242977a10732e555e4237c91b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityState.consume (cognitive 26): ClaudeActivityState.consume has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e60e1aa906d5db992bd203ea0ed9458a3e2ddcdeef1e4e15c589b471c1720b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeSSHRouteRules.parse (cognitive 26): ClaudeSSHRouteRules.parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeSSHRouteRules.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b691a8307de1d9cb4f92f4a7e5ef3ad79ae7050c6dac44347ec070d20ee7014"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskProgressReporter.response (cognitive 26): TaskProgressReporter.response has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, ternaries 4 (8 pts), if/else 4 (6 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexProgressReporter.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8f936194706fee6ca81938dfb26b3d65182d3b75e9cf32e3a2cead8bd9a3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekSessionLog.response (cognitive 26): DeepSeekSessionLog.response has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7290bb49e602d2facec49e8223140cbce03d4df7e7d96145680ef17f2a699716"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskProgressRing.make (cognitive 26): TaskProgressRing.make has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (10 pts), ternaries 2 (3 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/SelfReportedProgress.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8620b63026de66680c15b470dd2778745aae60f9bfe1bbe8153fb9009b74608c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyRunLog.read (cognitive 26): WorkBuddyRunLog.read has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, 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":"native/Sources/PacerCore/WorkBuddyRunLog.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dcaa8f4f96aee431f7f8cef00150fbe277be3ef655561afa6755b858a91795"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.Relayout (cognitive 25): IslandWindow.Relayout has cognitive complexity 25 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a34345c65fd6eca04f7610fbc48e32da92a89e6e249fa0b9b9e280ca3e590f"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.BuildCompactInspector (cognitive 25): SettingsWindow.BuildCompactInspector has cognitive complexity 25 (threshold 15). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 173, 256, 271, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCollapsed.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53ac9ade34e6e7e0f1d9516196a013530f243a0906c36b367bb985ccf623302"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.BuildDeepSeekConnection (cognitive 25): SettingsWindow.BuildDeepSeekConnection has cognitive complexity 25 (threshold 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 50, 78, 94, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeekConnection.cs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9da82f6aa29e1441774c3cab5cfe460630dbd1afef22ce2b4fb9f776e1e8fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshHarnessPage (cognitive 25): SettingsWindow.RefreshHarnessPage has cognitive complexity 25 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"311485f0dac0605f8ef52e8ed411e13c3ef26075aab38fc9388d22f7ba6e62c2"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshBanner (cognitive 25): SettingsWindow.RefreshBanner has cognitive complexity 25 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0962d3b82136312741a1e8adde792f58d9bdbeb7fb469c859893df0212f8e86"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateFiles.Check (cognitive 25): UpdateFiles.Check has cognitive complexity 25 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateFiles.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c2603d584b52fb83ce15deb57debf3c3378b48f8200b9d411d0e6a8861e22f"}},{"ruleId":"D2","level":"warning","message":{"text":"MotionBridge.swift.pacerLayoutFrame (cognitive 25): MotionBridge.swift.pacerLayoutFrame has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 17, if/else 4, ternaries 3, loops 1. Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"windows/Bridge/MotionBridge.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b66630472dd80aaf1b148a8c5d049241c54266bc6c060fafd544903a4fda51"}},{"ruleId":"D2","level":"warning","message":{"text":"AttentionPolicy.activityNotices (cognitive 25): AttentionPolicy.activityNotices has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, ternaries 3 (4 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Attention.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66866dc26844b99e31a712d7b71461234db920978f9bfc56b1b046d83a1354"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeHookInstaller.migrated (cognitive 25): ClaudeHookInstaller.migrated has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab5555e9543bad8b8be1623af5ee4238415f1a75c75fea896cac284080c5b28"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeLiveSessionRegistry.holders (cognitive 25): ClaudeLiveSessionRegistry.holders has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 19, if/else 3 (5 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeLiveSessionRegistry.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a39520c2b866db4e70547e9659488b676369f493bbd1f56482a4d6b81716b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexClient.setProgressReporter (cognitive 25): CodexClient.setProgressReporter has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (11 pts), ternaries 1 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5659628d72977b52ec1f77c7200954120bf6b50c50852037528ccfbeb333134d"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalHarnessProgressSetup.inspect (cognitive 25): LocalHarnessProgressSetup.inspect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalHarnessProgressSetup.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a17db2ab33e370667fd844bdfd5c6f2ed90303727e7793bc88aac5fb3c2270"}},{"ruleId":"D2","level":"warning","message":{"text":"Reading.init (cognitive 25): Reading.init has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11, ternaries 8 (9 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/QuotaDashboardPresentation.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eb7a8b5997a3e5c132d238500152206b0f322c6a41321b38a096d5f67af247"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeActivityMonitor.readControlDirectory (cognitive 25): RealtimeActivityMonitor.readControlDirectory has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 6 (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":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70cd99ec5feafff302f8a6a54fec57301b05dd01dc5ddc7494686de57302836"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineClient.ReadAsync (cognitive 24): EngineClient.ReadAsync has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e332e26f1dbeb29d87430220b4537cd654b4f7b7893f2082f00164ba410386"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityLogWatcher.update (cognitive 24): ActivityLogWatcher.update has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, ternaries 2 (4 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityLogWatcher.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0e5b1a12c97f85dd42615238d5f992c1b571a6a73282690a863a64a359cb1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeDesktopRecords.desktopMetadata (cognitive 24): ClaudeDesktopRecords.desktopMetadata has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeDesktopRecords.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06f1be38c5ce16022f76e1576ee0290a5fe663b4d6e9d12b9f8ca8e567c38a1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionInbox.persistentDigestFields (cognitive 24): CompletionInbox.persistentDigestFields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, ternaries 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompletionInbox.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de4e17ddaca59e67a985f125e0e4c4192e40b2449e94e16231aa31374e4d730"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsePerformanceMeter.observeRuntime (cognitive 24): ResponsePerformanceMeter.observeRuntime has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (12 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ResponsePerformance.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ca9aa32c0b3bbe1fd9a2a5802fba78175c25d468c7f7a9ca2e74b9a96e1d88"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityBadge.body (cognitive 24): ActivityBadge.body has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (10 pts), ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0f1cafbd3045b4296449b592f99278dd0320772b8d5f107aba4c5080e653c8"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessGuideFloat.update (cognitive 24): HarnessGuideFloat.update has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5 (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":"native/Sources/PacerIsland/HarnessGuideFloat.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aad36173dd65668f82bff5e60f4376d75957a14f4395bd920a88a8d6081d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.refreshDeepSeekBalance (cognitive 24): IslandModel.refreshDeepSeekBalance has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 11, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bac6860593330873931de3514ce7fa6a5303e66f7b3269e5bc7f1d9fa3b02ab"}},{"ruleId":"D2","level":"warning","message":{"text":"WhatsNewItemRow.body (cognitive 24): WhatsNewItemRow.body has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 13 (16 pts), boolean chains 5, if/else 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/WhatsNewView.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"204ff4386c6a7304a175a05aabfcc82ee0001cda569ee3ea1621009703b2a587"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_progress_mcp.respond (cognitive 24): codex_progress_mcp.respond has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (10 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe48c9679805d83ddb3e1a62100744aadaef8a3d3c0945d0b5c8f8de8bf0751"}},{"ruleId":"D2","level":"warning","message":{"text":"pacer-codex-progress.respond (cognitive 24): pacer-codex-progress.respond has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (10 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/Resources/pacer-codex-progress.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e3bccb6de2226c90fc6fa2375d6a31a9785f5e6136cc4d8c2a031426aaf85"}},{"ruleId":"D2","level":"warning","message":{"text":"App.ShowGuideCoreAsync (cognitive 23): App.ShowGuideCoreAsync has cognitive complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AppGuidePages.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f79dd1ffb7dc3943e638411b8608b13c1e627c94b97e32a6d7778d5299dc7e"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactWarningsView.Update (cognitive 23): CompactWarningsView.Update has cognitive complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactWarningsView.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"947c8af4ce037b04c7c2f8ca64fe6f07d70a769e0a1d25cca978d7d7add88ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"GuideWindow.GuideWindow.ctor (cognitive 23): GuideWindow.GuideWindow.ctor has cognitive complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 4 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":"windows/Desktop/GuideWindow.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5dcf1a2d0ca5ecb7c2335e58c768ad030718d12009a3b3b7cb1b56b6d1a222"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.OpenConversationTaskAsync (cognitive 23): IslandWindow.OpenConversationTaskAsync has cognitive complexity 23 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e71408f0bb95f9b930788ceeb7938831d6126994a79ea03c3825c9292264482"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferencesStore.Save (cognitive 23): PreferencesStore.Save has cognitive complexity 23 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb9058f4b0a860f63e04b96239e67b8cd4691665e7ac8cdfcd3de7abfc4b864"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaConnectionView.QuotaConnectionView.ctor (cognitive 23): QuotaConnectionView.QuotaConnectionView.ctor has cognitive complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaConnectionView.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dee9a357af28915f9481428762044d90878fd46253b4cb153ac1b2d51ec0035"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RunDeepSeekConnection (cognitive 23): SettingsWindow.RunDeepSeekConnection has cognitive complexity 23 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeekConnection.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2436b04d6f7f81bea38205de0da42a4ec32639706462b9221fab232fde1afc"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.SettingsWindow.ctor (cognitive 23): SettingsWindow.SettingsWindow.ctor has cognitive complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 153, 129, 152, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7720d3d3fcf71886f9eeb6448fa8a7eabd7b862218f4f97f0a56fdcb8a0e63"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.Main (cognitive 23): Program.Main has cognitive complexity 23 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Maintenance/Program.cs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e79a5a352af5e2fb8ea06231e87fe3a3b3b40db7daa6327bd8a9b220a55e969"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.recoverCodexEnding (cognitive 23): SessionActivity.recoverCodexEnding has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 20, if/else 2, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6b300df5dc99783c23898833b8ef7a97dec113897a72fab01fd1a3b54dc8df"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeDesktopRecords.desktopSessionID (cognitive 23): ClaudeDesktopRecords.desktopSessionID has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9, ternaries 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeDesktopRecords.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cddbe37d84ec4553f165d51b69a5da007b40e4b41948d1d5106d1f5476fd326"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeWebQuotaClient.request (cognitive 23): ClaudeWebQuotaClient.request has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeWebQuotaClient.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a5ceb6f00d87abb27ac3f02df5bdef9f826f9b293e4d011e078337151f31f6"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopWireProjection.snapshot (cognitive 23): DesktopWireProjection.snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, match/switch 1 (2 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e1128e4878e1422e0aaab4bafffaaa55e6f660e9c97a723f8346dbb3ff97fb"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyTranscript.read (cognitive 23): WorkBuddyTranscript.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyTranscript.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4f8ed6858cca57be49f4811b5138ad5fff15d0ba1e6856a008b2c4abd51874"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessAccountCard.body (cognitive 23): HarnessAccountCard.body has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/HarnessAccountCard.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"716e7925d496fbdbcf5ff96a0e1bef4eadcd3ac62fd5352c5a05ea323402a5b2"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.configureCodexRemoteProgress (cognitive 23): IslandModel.configureCodexRemoteProgress has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 15, if/else 5 (7 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"205728f2d9829fc6a118aa42c9139f16133f79806ab6e5dfdbd286f82456e5dc"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsView.commit (cognitive 23): SettingsView.commit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, match/switch 1 (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9a191083b3fac51a282d1e2f676580d153ba1b7375f15e71fc974ffc66e89b"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_activity.otlp_request_header (cognitive 23): claude_activity.otlp_request_header has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"16381cca18686411feeb7f7c9dff9516903baf407ff98e2cfc6618abfcf266fb"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBalanceStatusView.DeepSeekBalanceStatusView.ctor (cognitive 22): DeepSeekBalanceStatusView.DeepSeekBalanceStatusView.ctor has cognitive complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 29, 28). 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":"windows/Desktop/DeepSeekBalanceStatusView.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"496f5bdcdbefedd8c6de777582a896369321bd02470d808ece8e3cf120558f17"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineClient.StartAsync (cognitive 22): EngineClient.StartAsync has cognitive complexity 22 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ab8338e5a606085fffbd2017e775a06fe0f48e430692c998ab463443b3cbf7"}},{"ruleId":"D2","level":"warning","message":{"text":"EstimatePaint.OnRender (cognitive 22): EstimatePaint.OnRender has cognitive complexity 22 (threshold 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EstimatePaint.cs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b827e81f765f179182b8e7db180493b10637eb26407a4576afbaf092792045db"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandScreenMemory.Load (cognitive 22): IslandScreenMemory.Load has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandScreenMemory.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d52548ea25707ebc0bd22a093d3b3525712ed0bec2bfcd6756963bc441019e"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.Render (cognitive 22): IslandWindow.Render has cognitive complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36babe1877b352b5c0f15fd94ca08d73f08ce5c916e61ca390349ff5efdcdfe"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationSession.Receive (cognitive 22): NotificationSession.Receive has cognitive complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 100). 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":"windows/Desktop/NotificationSession.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7794c42acb22436851c3ba92108a4505d49d9e22d51b6ed4cb50949b45db427"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferencesSession.ChangeAsync (cognitive 22): PreferencesSession.ChangeAsync has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesSession.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8141517f4da843691374d6ea4e04665a44edf6342936fd8b5ddf8e9e7ac528"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseNotesMarkdown.Parse (cognitive 22): ReleaseNotesMarkdown.Parse has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ReleaseNotesMarkdown.cs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bd7316b827f233b57c4f366d1589b38b7fedb75238d39ca81a8158693fe21c"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshClaudeConnection (cognitive 22): SettingsWindow.RefreshClaudeConnection has cognitive complexity 22 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"windows/Desktop/SettingsClaudeConnection.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e46b046446add4445881ed9bcfe02bbfab12a4902269975af39eaadfdcb490c"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.UpdateSourceStatus (cognitive 22): SettingsWindow.UpdateSourceStatus has cognitive complexity 22 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"01452c070af47a512083e2af6323ef031fa38ce750ff8980c8764956a49146c1"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsInstallationOperations.RemoveOwnedRegistrations (cognitive 22): WindowsInstallationOperations.RemoveOwnedRegistrations has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b4005640f009c05b15546ec98326643f726589742f58fc2b2d25c3a178b74d"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateFeedClient.Open (cognitive 22): UpdateFeedClient.Open has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateFeedClient.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2967e3ca6958639d5bb26b980645c109cb9b2fdc7908cd971061ef72aad53286"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsDesktopTransport.init (cognitive 22): WindowsDesktopTransport.init has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 5, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDesktopTransport.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adc67bb84be4b7aef6a77d2a70f0eae49d9f0f480e0274c5e63285b9d30092a"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.mergeCodexRequestEvidence (cognitive 22): SessionActivity.mergeCodexRequestEvidence has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 16, if/else 5 (6 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de2797b24ce3b7221c095cfe2733358325d00dd06892dc2524d6ffce27f57aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityNavigationOperation.descendants (cognitive 22): ActivityNavigationOperation.descendants has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 15, if/else 4 (6 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityNavigationState.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"308ec81dacba6d2566791082f19e0bac734820b24bf844365408284c22898b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeDesktopCredentialReader.read (cognitive 22): ClaudeDesktopCredentialReader.read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeDesktopCredentialStore.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"934cd96de8f202117a4b9a215f2fabe0a8d34046a32160822ef746f8b411be89"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopFrameDecoder.parse (cognitive 22): DesktopFrameDecoder.parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (10 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f202dd6f418a27266756b7eeb81600591814d108969111f0d64d0438c40383"}},{"ruleId":"D2","level":"warning","message":{"text":"AppDelegate.applicationDidFinishLaunching (cognitive 22): AppDelegate.applicationDidFinishLaunching has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b605c64f7f25b8b17dd25a698bbdb8ed86b419ca4295f6864daefc06fe99174"}},{"ruleId":"D2","level":"warning","message":{"text":"PanelController.init (cognitive 22): PanelController.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, boolean chains 9. 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":"native/Sources/PacerIsland/PanelController.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65ff755a6794cfdfdef26fb298f59c0b616fe7518f2caa1504bc6ae150c9ff"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyQuotaView.LegacyQuotaView.ctor (cognitive 21): LegacyQuotaView.LegacyQuotaView.ctor has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/LegacyQuotaView.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9391cc8f8df38048e7187ea9a869dfc524399a923dff7b7e63207e7efdf6e69b"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaHistoryView.Update (cognitive 21): QuotaHistoryView.Update has cognitive complexity 21 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"windows/Desktop/QuotaHistoryView.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2761128e35ccbb110074696cd3c91117db6986527b639894cd987045fa61641e"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.CommitDeepSeekBudget (cognitive 21): SettingsWindow.CommitDeepSeekBudget has cognitive complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cee2edd35b65d4eff22b7e58b9de30408f5a4a99ff9fa676f7344258af70997"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.BuildPanelInspector (cognitive 21): SettingsWindow.BuildPanelInspector has cognitive complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"abddc9d4d5502f57bfd231120c295eb44c949c290b1b3b34f1b57fbe8a0092a5"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.ApplySearch (cognitive 21): SettingsWindow.ApplySearch has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsSidebar.cs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf533ac46ef1e7d3612ea9a63fef288c9a61b24d636a15c3e5a020b7b32ac58"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBalanceHistoryStore.decode (cognitive 21): DeepSeekBalanceHistoryStore.decode has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 19, if/else 1, ternaries 1. Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, 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":"windows/EngineSupport/DeepSeekBalanceHistoryStore.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7af50d56820c3e10be6f6db966c1612e4e4dfa3ba7fefbdf9b34363f65f0ac"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.navigationIsCurrent (cognitive 21): EngineRuntime.navigationIsCurrent has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 14, if/else 5, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f26b235641df1335472802e01e335405e95dbc939752e3c6d06470ac181576"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsDesktopSourceGate.permit (cognitive 21): WindowsDesktopSourceGate.permit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5 (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":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"babf17fe5696dff4e205c936acb79d61f8ab9511d43043ec5fe5f54024902779"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityNavigationOperation.complete (cognitive 21): ActivityNavigationOperation.complete has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityNavigationState.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3b3bde7603ffe241f25c5b6cb2323964bafc90a05fe2ddca71027b84caf799"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeQuotaDecoder.buckets (cognitive 21): ClaudeQuotaDecoder.buckets has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), loops 2, ternaries 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b3d5f1ac5e340f9a0f0765fa7f77495eeffc461903c2cba33b9ff28d97825c"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeSSHDiscovery.configured (cognitive 21): ClaudeSSHDiscovery.configured has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeSSHDiscovery.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdd712318e13ea1a5e5ca4b4be71aea8aa228c4d3f13539c3ff30b941fc4c29"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactBarPresentation.project::entry (cognitive 21): CompactBarPresentation.project::entry has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 5, if/else 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CompactBarPresentation.project) 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":"native/Sources/PacerCore/CompactBarPresentation.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbebb3ab76271451b560b935ba1737280dabd20684751faaa8cb9212b211caf3"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekNoticePolicy.spendNotices (cognitive 21): DeepSeekNoticePolicy.spendNotices has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 5, if/else 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekNoticePolicy.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d7779dab5a55fc47ba0220574589ab97a58a5c4142fbf95dcd12db25ede8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"DemoScenario.deepseekUsage (cognitive 21): DemoScenario.deepseekUsage has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DemoScenario.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a25161de81bd14777ba0d3b0f1b8f3b4195bd9f41b4feac021080fde9b9a08a"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopWireProjection.items (cognitive 21): DesktopWireProjection.items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5 (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":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d406fb749ba26fed806425dc9d2255ddeb039493ff81721ec3a39265aad09fab"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeActivityMonitor.receive (cognitive 21): RealtimeActivityMonitor.receive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33d9dfcbd1f468f78cf2e44ef9c93680e3843a29ecd1fd17ddff4e835ed22c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassicQuotaDashboardView.rings (cognitive 21): ClassicQuotaDashboardView.rings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClassicQuotaDashboardView.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf0f37eaedfaa07ea27ccc65f203effdd9df04fbed4b2f0f4205e8f691aa5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.canOpen (cognitive 21): IslandModel.canOpen has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (9 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69c2eb5270abf3e05826047dd66dbcdceac7e2bda0a867c9efc0ed44b7e83cf"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.syncClaudeCloudMonitor (cognitive 21): IslandModel.syncClaudeCloudMonitor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"347bdf5e4f51bfcb383505bf62ab11e8e94e2190c845c4d9a14b53b487a8c698"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryPane.quotaCard (cognitive 21): HistoryPane.quotaCard has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 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":"native/Sources/PacerIsland/MainWindowPanes.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c6c207368e235cbde416ba7a125e14c14761398e2bbecf8bcaa0a46a664f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_remote_setup.managed_telemetry (cognitive 21): claude_remote_setup.managed_telemetry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (5 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1055108d6db86be18aa4f87172db2c355f38ca7c54b9c8bf5e9896a6319b80"}},{"ruleId":"D2","level":"warning","message":{"text":"FullscreenOcclusionObserver.Refresh (cognitive 20): FullscreenOcclusionObserver.Refresh has cognitive complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 64). 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":"windows/Desktop/FullscreenOcclusionObserver.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca296cd50853d6b5f27c22ff745e581b2d16fb4c2d8d6aaf9b7ae05bb6e093f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderLoginWindow.ObserveAsync (cognitive 20): ProviderLoginWindow.ObserveAsync has cognitive complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ProviderLoginWindow.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7e9d431ca4e3ffefb2ad1015de1b1a04895e8e02327211ec16a0dbe6cb90cf"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshOverview (cognitive 20): SettingsWindow.RefreshOverview has cognitive complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2293f8d1a46ae5fc1c990d6b198c403878035c2410484d7765e32e5b8841842"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.CommitProviderHome (cognitive 20): SettingsWindow.CommitProviderHome has cognitive complexity 20 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsProviderHome.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d949a658b9d663563e0d96a757236b6d37841cc59c5ae4db32d2fbcd223ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsMaintenanceSignal.StopAsync (cognitive 20): WindowsMaintenanceSignal.StopAsync has cognitive complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsMaintenanceSignal.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"50044b4a5f7d1e9ff623c6c50533053b76506dc07d9684d9797474b20d70164f"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateFeedClient.DownloadAsync (cognitive 20): UpdateFeedClient.DownloadAsync has cognitive complexity 20 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateFeedClient.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b4884933af23159c10dd963af97f83bdd40ff819333fbbfc66ba9fd1271a37"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineGuidePages.project (cognitive 20): EngineGuidePages.project has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, ternaries 5, if/else 1, match/switch 1. Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"windows/EngineSupport/EngineGuidePages.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3376257628eaa3370f1468f01ded260e319be126a43427f6d136ff217b262c48"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsDesktopCollector.deliver (cognitive 20): WindowsDesktopCollector.deliver has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5, 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":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a764c44fb0533ed42005af8017302c7dc163f432f5d387494d2795d784d0e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsHTTPStream.open (cognitive 20): WindowsHTTPStream.open has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 8, if/else 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPStream.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a6d43d18b63af9c9d4e7f696d9f931ec35474002b25abb7c1e6c85bd1cdf47"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsClaudeHookCommands.owned (cognitive 20): WindowsClaudeHookCommands.owned has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (8 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeHookCommands.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d2c627371663c94da3fe4c0846931de7203a5772c6c0a8b09f96f980e4e71b"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsClaudeRuntimeStore.references (cognitive 20): WindowsClaudeRuntimeStore.references has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeRuntimeStore.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"57287d1359b8ed76d763a547d7327ae344a06f6ef59f27b05ffdbc56a88a3a60"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCloudReplyStreams.connect (cognitive 20): ClaudeCloudReplyStreams.connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudReplyStreams.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd97a63cd429cfcbbec91de5de1deb3845b232344873381d2b9fd068e5e5c4f6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeHookInstaller.reconcileEnvironment (cognitive 20): ClaudeHookInstaller.reconcileEnvironment has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (8 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc5b74ef62185bc54f6a0395d86c7adea0c240ec927b9841eabbeed57228644"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeTranscriptContext.resolve (cognitive 20): ClaudeTranscriptContext.resolve has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeTranscriptContext.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b323844f179672bc7a19f6acccbf042eb2243a973fd7f5a241f5d2158d69a6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexClientError.errorDescription (cognitive 20): CodexClientError.errorDescription has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 5, if/else 3 (4 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"add7e6f0859979702f9bad95d952f26917df71c794c7daaf5a87a525d9917c01"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexOriginLookup.lookup (cognitive 20): CodexOriginLookup.lookup has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 6, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexSessionOrigin.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b67c22e857f8726de1a4452196e8bb783caf097a6279a0f07af9144d3be523"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekConnectionPresentation.init (cognitive 20): DeepSeekConnectionPresentation.init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7, ternaries 6 (7 pts), boolean chains 6 (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":"native/Sources/PacerCore/DeepSeekConnectionPresentation.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5d76c51ea4e4a1bb312dd94bafcfbdc2efee5205aef46c69da6faff1d08208"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekWallet.init (cognitive 20): DeepSeekWallet.init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, 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":"native/Sources/PacerCore/DeepSeekWallet.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"601934092b9290041a46397f7cae2cb2a601f9f5b9ed0c39b16041505d0a267e"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableActivityCatalog.page (cognitive 20): DurableActivityCatalog.page has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableActivityCatalog.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3a2948b78659f3a87a3b319ab4e1a53251431909c59a0d04fc8f76c018f942"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessAccountCredits.reading (cognitive 20): HarnessAccountCredits.reading has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 5, ternaries 5. 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":"native/Sources/PacerCore/HarnessAccountCredits.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c663291f5fd33b25613ffb707e7bd33770e1c44119fde41cb631635418b75b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassicQuotaDashboardRingView.body (cognitive 20): ClassicQuotaDashboardRingView.body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (6 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClassicQuotaDashboardView.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c587f869393632153489813f650f552348f02bac6b23cc7c4395ffa68ffef70e"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactIslandComponent.stripContent (cognitive 20): CompactIslandComponent.stripContent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactIslandHeader.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"466d956e901906ffe0c0d45b611f61648be356fabd818aa344bfb60380877163"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressGuideBody.stepRow (cognitive 20): ProgressGuideBody.stepRow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5, boolean chains 4, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsProgressGuide.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9c4d2b827b2ebcb588916a6b81547575ca61a7a350bf90de2ab573e26ad6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_remote_setup.reconcile_environment (cognitive 20): claude_remote_setup.reconcile_environment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbfcfaf0de504c5a8c21660c360c81a28743eef9b33e1a3216e0829cedf9748"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.FillQuota (cognitive 19): IslandWindow.FillQuota has cognitive complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"windows/Desktop/IslandPanelSections.cs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0234cfd4b0dbdeb2deee1260e99968a71cb4d784713d48099b0954117f1a3db4"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.ApplyMotion (cognitive 19): IslandWindow.ApplyMotion has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cee217bc9a39ca0e68f784a340589810dd1c24eb5d9c02bfe050778ba5a62e5"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.OpenFromWindowAsync (cognitive 19): IslandWindow.OpenFromWindowAsync has cognitive complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"0549831a1d7ea593d8ce6f5cc7e71e8002f45e38ac4c8d1c718ca8452a7fdb33"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationSession.SetEnabledAsync (cognitive 19): NotificationSession.SetEnabledAsync has cognitive complexity 19 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"windows/Desktop/NotificationSession.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"be50e5b8fd35d46d3a43596cd3a146a9dbfa34be975e734290ebabab2e2d323a"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshClaude (cognitive 19): SettingsWindow.RefreshClaude has cognitive complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"windows/Desktop/SettingsClaude.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1c72a527b3df6817382ec8f95038ba12bc935ce30c31f4b1f814315fb34d04"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.SourceField (cognitive 19): SettingsWindow.SourceField has cognitive complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 133, 129, 130). 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":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"31782a1b3d322c8c8fc91310aa28fc31ecfd20539b74e7538b80311eb234708a"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.DrawPanelEditor (cognitive 19): SettingsWindow.DrawPanelEditor has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df11525268773d2887091424929a4096ae94acf8623cb6a18b68043bf297452"}},{"ruleId":"D2","level":"warning","message":{"text":"MotionBridge.swift.pacerMotionCanvas (cognitive 19): MotionBridge.swift.pacerMotionCanvas has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 3 (6 pts), boolean chains 3, ternaries 3 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Bridge/MotionBridge.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea76ddb66f92cd845b83c154ba72b4734a0f0f362fd237c3b431c3affd7e4658"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.setClaudeNavigation (cognitive 19): SessionActivity.setClaudeNavigation has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (5 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7532b9d3821fd2602321b5d0d213c4c20ba45a0270dc366d20bfe4af7468fcd3"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityMonitor.readLocal (cognitive 19): ClaudeActivityMonitor.readLocal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b38933425ecd40d46c59e54d95bd03be758b14dc35d0d6053ad90a356ea32b6"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexClient.receive (cognitive 19): CodexClient.receive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"06343e9260b47a195456b4e5b905022b2e40314c4416dabc6ad465b59443525f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekSessionReader.read (cognitive 19): DeepSeekSessionReader.read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionReader.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c60d80b143d819ffb6a198b19c05b889de98c2de18bc152948bde65327a14a"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandGeometry.arrange (cognitive 19): IslandGeometry.arrange has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10, boolean chains 7, if/else 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/IslandGeometry.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"023489279eada8281d322459f2faa80db946d34cd0a000bf9adab20ea036d2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaHistoryPresentation.init (cognitive 19): QuotaHistoryPresentation.init has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 7, if/else 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/QuotaHistoryPresentation.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"330f56f22a1efa7590533b2b48873a71e03790735bdaffde3df88f878a8bb31c"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaAccountPresentation.init (cognitive 19): QuotaAccountPresentation.init has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 6, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"native/Sources/PacerCore/QuotaHistoryPresentation.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a13bdb5281008cab736543a8e90fbff3046a9733b2eb53377e3961f987447e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeConversationOpener.open (cognitive 19): ClaudeConversationOpener.open has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeConversationOpener.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cf5d04f850267877f4ca132afeff493169a1fc6fe6a99870e5164a57b651e0"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.trackHostApplications (cognitive 19): IslandModel.trackHostApplications has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"924e51d4496f67b517f13fbc2984e5e2c6f78966bf09b93903723ed961d85b38"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.startClaudeActivity (cognitive 19): IslandModel.startClaudeActivity has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 7, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"07235006a0796d253863bf003b0c25634d4e5bcb2eb3cc7468df0c7e1104d6eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStatusIconNSView.makeGlyph (cognitive 19): TaskStatusIconNSView.makeGlyph has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 3 (5 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14fe15e084bf71a101f44912f50a0faa4b01a2d21fa3a861e0320993a7d6ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassicQuotaView.ClassicQuotaView.ctor (cognitive 18): ClassicQuotaView.ClassicQuotaView.ctor has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClassicQuotaView.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"33be7d142b33c4d601ad1fc1bb7bcf928ed4ea105a18cd308da1eff21b9cdd33"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactLayoutEditorView.Chip (cognitive 18): CompactLayoutEditorView.Chip has cognitive complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 138, 134, 159, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactLayoutEditorView.cs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3802d9d41f98da95b39afe7590be1f8357acf467b259c9333827d0fd2235e6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaDial.OnRender (cognitive 18): QuotaDial.OnRender has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"772ac510d8c59a1cd22d4c38d0edc964048af7d6cc931b4dc6305128321e7d64"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.RefreshProviderQuotaRow (cognitive 18): SettingsWindow.RefreshProviderQuotaRow has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCardKit.cs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f703553b99f49ad605b8714346a3fe1c8ff4c9818a1a0fbd8aa77525c5a45aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsUpdateService.CheckCore (cognitive 18): WindowsUpdateService.CheckCore has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcdf1c4181c6fa68f747272c83bf0ceae5275fc42048218b910e948ebb65e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.trackActivityHosts (cognitive 18): EngineRuntime.trackActivityHosts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), error handling 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":3040}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8986a5c234e19855e07825261e5efc17d69e528134aab550472d5f05f9bdb2b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCloudServices.reference (cognitive 18): ClaudeCloudServices.reference has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 5, if/else 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebReferenceServices.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23bc6ccf2eeea9d467cb301479b3323e73357493872783116216842249e73bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeHookInstaller.uninstall (cognitive 18): ClaudeHookInstaller.uninstall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"27db0085943937357d02a2df696adfc8609f95206b49aa06e51e1c81542b0feb"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeQuotaServices.reference (cognitive 18): ClaudeQuotaServices.reference has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (8 pts), boolean chains 5, if/else 3 (4 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebReferenceServices.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8f483e7ab0f3b75d040b05b50a449c0c9bfff302992bb64fc78a2115e1c9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeQuotaCredentialCache.decode (cognitive 18): ClaudeQuotaCredentialCache.decode has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 2, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaCredentialCache.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad7e0d0f295de5a3d104c58d18d94e312bd9434e718eddd0e0924a8cad670bb"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexActivityInput.requests (cognitive 18): CodexActivityInput.requests has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexActivityInput.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8806a29d454bd6572949d354c4606c4b43d8ce5412a92a089c541a870ea1c768"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionInbox.retainingCloudEnding (cognitive 18): CompletionInbox.retainingCloudEnding has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, if/else 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompletionInbox.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"94117554878b33f652f80e31c6a2449ae85b698f766497f54a3c181ab884388b"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekActivityMonitor.read (cognitive 18): DeepSeekActivityMonitor.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekActivityMonitor.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec6a9b5dbfbc66d785597a12ea0831e8bdc88ddd1ae3d52458f39569b7066d5"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBalanceHistory.record (cognitive 18): DeepSeekBalanceHistory.record has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7 (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":"native/Sources/PacerCore/DeepSeekBalanceHistory.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d6fea212fc67dfdb8548748b5d0e8e684ee396bf7e4efb829504f772b7e8f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.skip (cognitive 18): Cursor.skip has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aa022fe4e75162f8673ed5d2cf451fc463148618c9e69e90b076b0e4dbb150"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableTurnHistory.receiptPage (cognitive 18): DurableTurnHistory.receiptPage has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (7 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableTurnHistory.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3241c4c734c3b3944e7a3e0ea1acf89b6d4b232ad2bcb53523a0fbff05fcdccd"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.skipValue (cognitive 18): Cursor.skipValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/JSONFieldView.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3f2a2dfd9b3e508bfce528e855649fbb737d6a91292f130a2538d73562fc5c"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaCycleHistory.record (cognitive 18): QuotaCycleHistory.record has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/QuotaCycle.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434a30983fcb8b70207b364f2ebbfffe973911c20ec2cf9bd2ba69d5f19c09a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddySessionStore.dailyCredits (cognitive 18): WorkBuddySessionStore.dailyCredits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"429a82090c98ca953917a2463a0cca27225e2821b2af3b13e636031456ebcfa2"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityOrbitView.refreshEstimateLoops (cognitive 18): ActivityOrbitView.refreshEstimateLoops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, loops 1 (3 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e3b24a39babda438d157a6fc24f7de0c321bac3e9f7ec966cf9961c249c63e"}},{"ruleId":"D2","level":"warning","message":{"text":"WarningMark.body (cognitive 18): WarningMark.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactQuotaViews.swift"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"9794c0e3e40f5ccb553b5de417e32a06ba5a58708683400f0f0d6deda5cf5443"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekBudgetDetails.body (cognitive 18): DeepSeekBudgetDetails.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/DeepSeekDashboardView.swift"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6bf363e959bbbd60dd04636de31f22326dabbeb5aa4853b89748790fc1a0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaCycleChart.chart (cognitive 18): QuotaCycleChart.chart has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/QuotaCycleChart.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"75870a4405f8b7dc486cc88041a0820a26ac47930ce41056641eeb81673b6873"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryRoundButton.roundButton (cognitive 18): LibraryRoundButton.roundButton has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 15, if/else 2, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsLibraryTile.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"922eb5f2fa422dda74d4d68bad72a469c0326ca1decd0c3f155b0b386c9de790"}},{"ruleId":"D2","level":"warning","message":{"text":"WheelView.viewDidMoveToWindow (cognitive 18): WheelView.viewDidMoveToWindow has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 7, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskPagerView.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71e807334cec798fe8ada0b285b4fe6107477f16b7f02fc4479c3d21e7c9278"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskStatusIconNSView.layout (cognitive 18): TaskStatusIconNSView.layout has cognitive complexity 18 (threshold 15). Drivers by points: loops 7, ternaries 4 (6 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c4e8a2b183a7403bfab062f4ce04aa2212f407206d0f43031600b61a00a840"}},{"ruleId":"D2","level":"warning","message":{"text":"App.Restart (cognitive 17): App.Restart has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59445f4f46fa940d445606dfcb6927642eb4e06759ab09371df31e13360ce50"}},{"ruleId":"D2","level":"warning","message":{"text":"GuideContent.WelcomeStep (cognitive 17): GuideContent.WelcomeStep has cognitive complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 315, 306, 307, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa81b6b0143477d128bc2e47328d2146cb33124307aa6d107a25cfad9f8725b"}},{"ruleId":"D2","level":"warning","message":{"text":"GuideContent.SettingsReleases (cognitive 17): GuideContent.SettingsReleases has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e93fe4473202d8881be398ea86b0c72fe5d924bc644c776e865d9871af6bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"GuideContent.Support (cognitive 17): GuideContent.Support has cognitive complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c6eeb078c0f0b9c6f5a8073af9ce0e5f795fa09eaaead542ffbb29ed278d95"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.ApplyPresentationLayout (cognitive 17): IslandWindow.ApplyPresentationLayout has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44a95517717acf4a8bb8caebe8d780c23c3682491780fd68c7cb7e825d12a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaDial.DrawCredits (cognitive 17): QuotaDial.DrawCredits has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2b9bce362444c7e82d0f38fffb7174af39a432b9d3fc27172c9fa47eb36490"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.ServiceCard (cognitive 17): SettingsWindow.ServiceCard has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"07753ddc29af249c5ab4d646926964595d544c0986626f2939d812b2c42f33c2"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.CommitReminderAmount (cognitive 17): SettingsWindow.CommitReminderAmount has cognitive complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"windows/Desktop/SettingsReminders.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6c601ad517c3ed3ee044034cc7a604d3e1f33d2f1dfa50494aa09e4da9500"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskRowState.StatusInk.get (cognitive 17): TaskRowState.StatusInk.get has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskRow.xaml.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bb399e4dc23352cdac963127e568129d7b35eb8796f3d3c1154215a23b888f"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.configureCodexReporter (cognitive 17): EngineRuntime.configureCodexReporter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0957489406b1bbe29987dc8b20183610ed7c3c41e58eb6ef31dc62584ed01f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.receiveDesktop (cognitive 17): EngineRuntime.receiveDesktop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5251f28b397643ae2ac34f2205cc2f097964060c5cfc5d26e60196fd201659e2"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsLocalProfileStorage.validate (cognitive 17): WindowsLocalProfileStorage.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsLocalProfileStorage.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeab4cdb2ef99b634ea74f799c07f206f8d43377e88330db6e94a2f16b45af8"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsClaudeHookRuntime.uninstall (cognitive 17): WindowsClaudeHookRuntime.uninstall has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (7 pts), if/else 5 (6 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeHookRuntime.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b820517b0b97e0c903941bdb5949c535148a96ab095834ec7a639de2aa074d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsLocalHarnessProgressCleanup.unregister (cognitive 17): WindowsLocalHarnessProgressCleanup.unregister has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsLocalHarnessProgressCleanup.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58439493ec8a690189b36eb169b703d598b06dc975b0b619337a8613d440bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityApplicationState.reconcile (cognitive 17): ActivityApplicationState.reconcile has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (5 pts), loops 2, ternaries 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityApplicationState.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f33f231f955aa55ab5bed8aadc93a31736618526fe8d8b7e9872c8893c69f70"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityTaskPresentation.header (cognitive 17): ActivityTaskPresentation.header has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 4, if/else 3, loops 1 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: 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":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e6c762be88f7740d78dab186b21a83444e67f794bed9c464462181d3a59131"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeHookInstaller.install (cognitive 17): ClaudeHookInstaller.install has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f277fbe3b1eb8c00c4da88961fc06cdaebc091ba139dbb50182be6baa6ad3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeTelemetryRules.claims (cognitive 17): ClaudeTelemetryRules.claims has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeTelemetryCompatibility.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f77e579ee0cd44c1e1dbb54113b2f4a5d81ce935483e2071942aa56a5e9864f"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandScreenMemory.load (cognitive 17): IslandScreenMemory.load has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), ternaries 2 (5 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/IslandScreenMemory.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d96806fd9ecf95ae7dce77be24112fef1b2c3732e7a356befe198c0752b3d44"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.skipNumber (cognitive 17): Cursor.skipNumber has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/JSONFieldView.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3e3f92f98a0b5e743d727ededa97a30e9675cd49216ddd2da8d65f14a72de8"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddySessionStore.credits (cognitive 17): WorkBuddySessionStore.credits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2cb399bb0141618dfd705fc6fe693b8ecf6d5c5fb3e088f517b67582e11960"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityOrbitView.applyProgress (cognitive 17): ActivityOrbitView.applyProgress has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 3, if/else 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4b5f08297ac43fab98c6adc8fc2393f7bdfc56d845299ad622d7cd58bf23a3"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandRimShape.path (cognitive 17): IslandRimShape.path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandAppearance.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4564ed94b9a076e8e183bec94b18652a79f31353896e388e66c3f766a96bb285"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.refreshCodexQuota (cognitive 17): IslandModel.refreshCodexQuota has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6 (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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd793f55ad96f8170a11a156827d60d4de5810c298f5494ab157f1e83f2aa776"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.refreshActivity (cognitive 17): IslandModel.refreshActivity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"feff0199b94f60a01985a72c464af0a029244d64217cc16d8e7b117c1bd494c7"}},{"ruleId":"D2","level":"warning","message":{"text":"AppDelegate.openActivity (cognitive 17): AppDelegate.openActivity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed668683731575806fb5f14dd44eb34c69f7ac30531426cf4db1f0d9b4585f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaDashboardRingView.body (cognitive 17): QuotaDashboardRingView.body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/QuotaDashboardView.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9753c5b90e6473131cdbf885cc399c0624e20da6063dde18b92d8a1b4d57a3"}},{"ruleId":"D2","level":"warning","message":{"text":"MacDurableExecutor.find (cognitive 17): MacDurableExecutor.find has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 5, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableExecutor.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f1020e3f3af22da9cc38bc89be199a3ff815f90a5e2ac8f26ab289982a08ab"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_remote_setup.safe (cognitive 17): claude_remote_setup.safe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32355903d02750af340432113c5a1588cbb48c9629e4a22f5b9ac30c2786d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_remote_setup.merge_managed (cognitive 17): claude_remote_setup.merge_managed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ce38691a535a74986eed2a7b01ba07fa33e4592e58b5c79ee4ffe334c3003c"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_remote_progress_setup.safe (cognitive 17): codex_remote_progress_setup.safe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_remote_progress_setup.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2257b19409fe4ff1b8ee1465eb2dbad5123479095bc449fcd13009841f2d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassicQuotaCell.ClassicQuotaCell.ctor (cognitive 16): ClassicQuotaCell.ClassicQuotaCell.ctor has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClassicQuotaCell.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc485be9f72b315aa730d3a7dfdcc3054600ea5d91fbd5db135e78d93166687"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.FinishMoveAsync (cognitive 16): IslandWindow.FinishMoveAsync has cognitive complexity 16 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandMove.cs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb480489cdf3768284069b2156716bf5e35c4855eb939c8ae3ab99b417e628ed"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandWindow.IslandWindow.ctor (cognitive 16): IslandWindow.IslandWindow.ctor has cognitive 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 4 function literals inside it that branch (lines 144, 134, 136, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fec3de4a094a1059cb1f4a9e7aa17250f6d279a108b8928fccde63ab4ff5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferencesStore.Load (cognitive 16): PreferencesStore.Load has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2696a5924ef1b9a55196fcb24f3c79c5f2b59c51782a8f7a9e9b57b835407940"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaDial.AccessibleName.get (cognitive 16): QuotaDial.AccessibleName.get has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0886dc29b390f072b0ff648c4cc3bf71ae681229875f13c4b9029154cc47ad72"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaCell.QuotaCell.ctor (cognitive 16): QuotaCell.QuotaCell.ctor has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34589db13acd3c6a6e691669d64a43b6af55bf452ab29611466cdbe34824593"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.BuildDeepSeek (cognitive 16): SettingsWindow.BuildDeepSeek has cognitive complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 106, 79, 74, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb985c17c28b35d28dc1da1aca8efcf914b2e53362dc311cdaec388db271cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.BuildHarnessPage (cognitive 16): SettingsWindow.BuildHarnessPage has cognitive complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5c41d0742e00bbdcde5ff6cd9f270d38107e664e08846023e3046c7348aaff"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.PaintLibraryTile (cognitive 16): SettingsWindow.PaintLibraryTile has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsLibraryTile.cs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3805f43756b9f754abec243ef99c43754ec5d4baaef70acc1344119da3d0825c"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.InspectProviderHome (cognitive 16): SettingsWindow.InspectProviderHome has cognitive complexity 16 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsProviderHome.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0c2045e23ef276d07ad788f092647b3118c09e6943897904c49023276bfaa6"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsWindow.CapturePreview (cognitive 16): SettingsWindow.CapturePreview has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c187f8f4638609e339bac49064710cc63996a2c353d5bc704e0a0340ac328c0"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateWindow.NotesView (cognitive 16): UpdateWindow.NotesView has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/UpdateWindow.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11c008d471d2de75a105a06b9e693df72e8a2744f48ed2112bc38f8fadf80e0"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsConversationApplication.OpenAsync (cognitive 16): WindowsConversationApplication.OpenAsync has cognitive complexity 16 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ed8538947894da5c0d28a14a7e9a6e263031056e718c6dc2140fae281bc16b"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsInstanceActivation.Receive (cognitive 16): WindowsInstanceActivation.Receive has cognitive complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstanceActivation.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2043a3f2668d7c89a7d497fe64ee51a438ce044030bc2463b58993cb542ea85"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.scheduleLocalHarnessProgress (cognitive 16): EngineRuntime.scheduleLocalHarnessProgress has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"567e2a14307069d2b8ba6fee202956526c1daf31e61ab10fa09536e63c713597"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineRuntime.notificationProjection (cognitive 16): EngineRuntime.notificationProjection has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 9, boolean chains 4, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce20c5da1c26a2e715486ba7d4b248172aa4fc6ee10e4ab75c00c834466a71a"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsHTTPClient.data (cognitive 16): WindowsHTTPClient.data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPClient.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9a2660ca6dbfd311f85f387a0e5bdeeec54a82ecebae8b15125e051625bcea"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsHTTPClient.run (cognitive 16): WindowsHTTPClient.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (4 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPClient.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"767a0fd92a0aa5ead3e3f619229cfcc74f14df8a338f809e63a14cbc5977c6c0"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsProviderInstallation.detect (cognitive 16): WindowsProviderInstallation.detect has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsProviderInstallation.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"28beb279f732672be776213fcc73761c7401656221f42f60e050261049734a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsWSLHelperLauncher.launch (cognitive 16): WindowsWSLHelperLauncher.launch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsWSL.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e2c0477f4544a06563523472a8a5bb09beaa83d283e2ab1fd4305d6d55e314"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.threadURL (cognitive 16): SessionActivity.threadURL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"049e2064356c430712f3746d66c273e78636856fe106c5e9ff761753a61fcb62"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionActivity.applySubagentEvidence (cognitive 16): SessionActivity.applySubagentEvidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"53107539835c85c7812cf237511dca4b303de4a058e6525424d73da975f03c40"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskSymbol.symbol (cognitive 16): TaskSymbol.symbol has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 4 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d4aaaa1648feb86bc35cf953e1528678be3452b8c559952f7e1e92a6d66f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeActivityTelemetry.project (cognitive 16): ClaudeActivityTelemetry.project has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15 (16 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityTelemetry.swift"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"720f469efed80d0e5647dfa5c7c54896a1c8c492847877c68c16af02aef5b84d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCloudProjectMonitor.checkBinding (cognitive 16): ClaudeCloudProjectMonitor.checkBinding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"51da81c34e5ced4d373f458b7d303fd50ec1eceeff5c20f688fa9715db22066b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCloudStreamParser.consume (cognitive 16): ClaudeCloudStreamParser.consume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudReplyMeter.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab8ab683e62ae38bf234b3bec432bc44c5c9b5dbc9f5ae16aea873b6067e312"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeRemoteSetup.status (cognitive 16): ClaudeRemoteSetup.status has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 6, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeRemoteSetup.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"488aefe6dc431d6db106fdb227a5b8be3b1000507933ed127cfe27d6e0660159"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekProgressSetup.find (cognitive 16): DeepSeekProgressSetup.find has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 2, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekProgressSetup.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc36e490e8b6df81f45e81f78b9dde545bff507f370ba7c33f3c5feafbd4824"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopWireProjection.refreshRequests (cognitive 16): DesktopWireProjection.refreshRequests has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2e8da5c5b7233a928eb667b6b6ef5eb5e3351323eb73cc48bd1f31c9d23aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableCatalogReader.read (cognitive 16): DurableCatalogReader.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableCatalogReader.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bccc33d32f71e1e43880e80e1f64c7826ebdc0002e6a324defd869c9ad271e"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessCreditsPresentation.init (cognitive 16): HarnessCreditsPresentation.init has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 4, match/switch 3, boolean chains 2. Of this number, 9 points are the body\u0027s own statements and 7 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":"native/Sources/PacerCore/HarnessCreditsPresentation.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fb16da44f84bb0318f4b086e0399c5ff64f9a3385f270762962e2a217066d3"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDesktopSession.setDurableCatalog (cognitive 16): NativeDesktopSession.setDurableCatalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/NativeDesktopSession.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc576bef905c38d71284da8bd8b7dfc70f2b17c5274ccc742f2d3c70c2e36a08"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessOwnership.isDescendant (cognitive 16): ProcessOwnership.isDescendant has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ProcessOwnership.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f2a557989622e72010ee8bf45d045ed4d3343e4e350debd088921f4fa2f8d4"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaCycleChartPresentation.markers (cognitive 16): QuotaCycleChartPresentation.markers has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 4, if/else 3 (4 pts), loops 3 (4 pts), ternaries 4 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: 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":"native/Sources/PacerCore/QuotaCycleChartPresentation.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0cd1e8b220458fb4ec55629d4f999b465a42ed70e89e45cd8c44ace0933623"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddySessionStore.automationSession (cognitive 16): WorkBuddySessionStore.automationSession has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7ca2a2e6079d55bb8da21367392c7db955de8ffb763b27574b9ae3e4d5a263"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkBuddyRunLog.stage (cognitive 16): WorkBuddyRunLog.stage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyRunLog.swift"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d174a54ee615eaeddf18f04d6fdf0c36317fb306c54cffbb61fe84f142f8af"}},{"ruleId":"D2","level":"warning","message":{"text":"AlternatingQuotaView.refreshAnimation (cognitive 16): AlternatingQuotaView.refreshAnimation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, ternaries 2 (3 pts), loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactQuotaViews.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4955e6d517e8d20acbc31648cacd303cf82df0ba42a47e6dc622e05b5d567f0"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepSeekWebLogin.checkSession (cognitive 16): DeepSeekWebLogin.checkSession has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 4, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/DeepSeekWebBalance.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d45edbfc2339421730623330aed03eb6a8ad6fc41cb21f324d93050ef63d7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.ensureClaudeHooks (cognitive 16): IslandModel.ensureClaudeHooks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d241029d96f60317306a7208a5b727ae42bd3da6f6898687eaad3ffe9626f8"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.discoverClaudeRemoteTargets (cognitive 16): IslandModel.discoverClaudeRemoteTargets has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c90ec8583fb66945a5e3e8452c255b4e2cf1a94e9f6bc0d9931b9632bbca4c"}},{"ruleId":"D2","level":"warning","message":{"text":"IslandModel.refreshClaudeQuota (cognitive 16): IslandModel.refreshClaudeQuota has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b66041ef4ed4123bf4e956eb4c8dbcd116d27098d66c132703109edfcbf670f"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsView.paneContent (cognitive 16): SettingsView.paneContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca35d67792d7a5b6f8855d3f831e4b7e8160493146e2671eec022b3ee9ecf36"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateBanner.body (cognitive 16): UpdateBanner.body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/UpdateSettingsView.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b08a776a7a35d3c9f5e5e5cce1bd070576e39cc05ae0bff85e381e980615be"}},{"ruleId":"D2","level":"warning","message":{"text":"MacClaudeRemoteSetupOperation.result (cognitive 16): MacClaudeRemoteSetupOperation.result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacClaudeRemoteSetup.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fd62369bea727438aade2a3afba1c76800433bcec4656b380d33908834c7f5"}},{"ruleId":"D2","level":"warning","message":{"text":"MacDurableExecutor.arguments (cognitive 16): MacDurableExecutor.arguments has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), loops 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableExecutor.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a27b89f40a44062ec8d7c91c1b9fabd79418e63e7e9aef6fb9b09eaff19865"}},{"ruleId":"D2","level":"warning","message":{"text":"MacDurableProgressMailbox.withLock (cognitive 16): MacDurableProgressMailbox.withLock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableProgressMailbox.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c540d2772e3f0f6af7e4ee5bcf97917bd6d99f194f7bea03db67d34cbbdce961"}},{"ruleId":"D2","level":"warning","message":{"text":"Tailer.resolve_owner (cognitive 16): Tailer.resolve_owner has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"83644e5d678e5be9c307d5e40016a7f81198388204242a34994f70dd1a48a4ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SettingsWindow: TooManyMethods \u2014 4474 significant lines (blank, comment-only and punctuation-only lines excluded), 294 methods, declared across 23 files: Desktop/SettingsPanel.cs (31), Desktop/SettingsWindow.cs (31), Desktop/SettingsHarness.cs (29), Desktop/SettingsSidebar.cs (22), \u002B19 more file(s). The bar is 30 methods; this is 264 over it, 9.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c286923ba025f348de8fb658804f4bdeecdb012e4bd18b5da41297c394f72ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IslandModel: TooManyMethods \u2014 229 methods, declared across 3 files: PacerIsland/IslandModel.swift (192), PacerIsland/IslandModel\u002BDeepSeek.swift (29), PacerIsland/IslandModel\u002BPresentation.swift (8). The bar is 30 methods; this is 199 over it, 7.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"374753a14997213028832ab6c65a0c3b9f162eb993bae59c39706a904375cde2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IslandWindow: TooManyMethods \u2014 1642 significant lines (blank, comment-only and punctuation-only lines excluded), 163 methods, declared across 9 files: Desktop/IslandWindow.xaml.cs (84), Desktop/IslandPanelSections.cs (17), Desktop/IslandMove.cs (12), Desktop/IslandAccessibility.cs (10), \u002B5 more file(s). The bar is 30 methods; this is 133 over it, 5.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf2c424ed8d1f75f15b253137f2384bb5576b2b5a1778c42b1feebd1d174e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IslandModel: ClassTooLong \u2014 2071 significant lines (blank, comment-only and punctuation-only lines excluded), 229 methods. The bar is 400 significant lines; this is 1671 over it, 5.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1c66e3213faa87c87d0df54fd36cb8004ed1ca2bab4abc1e36f3403679bdf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: EngineSupport/PacerEngine.swift: FileTooLong \u2014 2572 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2072 over it, 5.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"073a4efb56dedc8102be628d324ac388b1743d18e03ee31c1e2270484827e35c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EngineRuntime: TooManyMethods \u2014 132 methods. The bar is 30 methods; this is 102 over it, 4.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5808645c3c1253724ea553c31f2aee6590b7b473971749fdc1ee6f85b294c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerIsland/IslandModel.swift: FileTooLong \u2014 2088 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: IslandModel (25-2770). The bar is 500 significant lines; this is 1588 over it, 4.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c3386e3fe476b1d6dbe5217d9571950f97bef98b46807b08f9368f6f17dc17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EngineRuntime.receive: MethodTooLong \u2014 receive runs 413 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 313 over it, 4.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"d103302b1157c09cbcb2dd057c5f4ecdf4e4b3acb6df0cd98455e60c9d8adec2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.OnStartup: MethodTooLong \u2014 OnStartup runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"87983bce83fad92719ccb5d9b37c9ebe60c861a8bef9bccd885af119853fad89"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionActivity: ClassTooLong \u2014 967 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 400 significant lines; this is 567 over it, 2.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ca2fa6062c60da0a56564cc27ff7e5cf4302d09d500a66c6f4ae099ee3f27b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeActivityState.consumeRecord: MethodTooLong \u2014 consumeRecord runs 241 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 141 over it, 2.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dbd9df17494533c62f45db979531dc6d75082d201c2e0b7faeb92b34aecfac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GuideContent: TooManyMethods \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 30 methods; this is 35 over it, 2.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af8460f4f4c3e4150c7b55b74ec36450e98bbf069880ccbfc4199dda6a7efeb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionActivity: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f422eaaada9259ef41393b863b6feba93ea2e85027f667b0f649f1108799b371"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactBarPresentation.project: MethodTooLong \u2014 project 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":"native/Sources/PacerCore/CompactBarPresentation.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b702567f70630a5198019bc23db3b44af9b9bee830de7fdc5d7a891833c960"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskStatusIconNSView: ClassTooLong \u2014 799 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 400 significant lines; this is 399 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a375c10764f01a68516ae482f6c2f4e3d5f1e5cf57239c6412d2762a3504866b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerCore/Activity.swift: FileTooLong \u2014 987 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: SessionActivity (31-1292). The bar is 500 significant lines; this is 487 over it, 1.97\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6b5d9edda05b2e75a8ba0fa1a63fd7e6918d1d793de668b336a7fa59a44a7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopWireProjection.consume: MethodTooLong \u2014 consume runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d5b4f8b7b5a3ba739554cbf828885f11d6273acdaed4eaa71613b6a8443459"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskStatusIconNSView: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\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":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa4535888168d480bbc27727122f42d540483374d4a17ff5f9e26e6f914b5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalActivityReader.read: MethodTooLong \u2014 read 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":"native/Sources/PacerCore/LocalActivityReader.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"962b9481bf5332d61382683f2cea62ab67868c907cc9e85ecf0278245cdd35c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionActivity.consumeLive: MethodTooLong \u2014 consumeLive 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":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14293c68519852a45b42c4a92f342dd3b96760bcf4bd637d03e1f741bd6a001"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerIsland/TaskStatusIconView.swift: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TaskStatusIconNSView (39-1109). The bar is 500 significant lines; this is 314 over it, 1.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca4d9a409866126840d6502a050d9768998fd016176d940268d2183fbc89172"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Desktop/IslandWindow.xaml.cs: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 302 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c077ada84123181d693a5bc1a41022099bd1fd90f887c23c10431db25e3756"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EngineRuntime.publish: MethodTooLong \u2014 publish runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"faea078eebb7550cc6b61cff4d1ed6a29b8f442927f3e4054ff8bc476676daef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Desktop/GuideContent.cs: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 271 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8495764540210ad019c6ebd5485c5582023b00cf047db13df023bf9406926568"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeEventState.consume: MethodTooLong \u2014 consume runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RuntimeEventState.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f11c882f1ddd20a90a28869ad0a1e879460b3d40a04ebc739444ce113fca999"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EngineRuntime.configure: MethodTooLong \u2014 configure runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"116de503683b1017311524fef277ded5d7e5c9fa496eb419f7267acc781839b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeepSeekActivityState.consume: MethodTooLong \u2014 consume runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekActivityState.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4cfcc14534720d0390711ac3d53c4f0f26270c3faee7e0df7228ea755608c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsWindow.BuildCompactInspector: MethodTooLong \u2014 BuildCompactInspector runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCollapsed.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9c4531d15f90d0233e68f59d49a1a504647d0dd9f3a6dbe7eaf3ef54f4367d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeActivityReader.read: MethodTooLong \u2014 read runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityReader.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51fc5433c4b2792ca5d94ee5a8821675e81b64d2ace87c9f651d0763a0c5e5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerCore/WorkBuddyHarness.swift: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81694520a2aea7f897a6bd0d7af5f317eaf22cce053bbfd353d72ec7d3a023f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DesktopWireProjection: ClassTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 155 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ef3621243b2d4e14d284b0715f1800c4301344b3f362a54ca1d63539e4ff76"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RealtimeActivityMonitor: TooManyMethods \u2014 40 methods, declared across 2 files: PacerCore/RealtimeActivityMonitor.swift (36), PacerMacSupport/MacCollectorDependencies.swift (4). The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5360e14c0ef329939e53b7e5cb87f1e81c6a2f0f1846eedc6cd248204bf61235"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SettingsView: ClassTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 132 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d5a15bc85acb59ddadef72da2da076d6915f1ff78acc31f00dbb3c968490c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resources/claude_activity.py: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"112db130f4b94b4e627ef886d71cb7c982f167ab8d3ca514ba69797ddfb52a1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerCore/RealtimeActivityMonitor.swift: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 146 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f57f6238fe82db7a8ea01dbd1e8780e5f9b256e55313495649b8bdba2f8c7ed"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods, declared across 3 files: Desktop/App.xaml.cs (12), Desktop/AppWindowsUpdates.cs (7), Desktop/AppGuidePages.cs (3). The bar is 400 significant lines; this is 103 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f923125edb72f0e3a7c4e1507d9bf863e35816f058a48e7a6eeca4b451224da6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerCore/DesktopWireProjection.swift: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: DesktopWireProjection (95-799). The bar is 500 significant lines; this is 128 over it, 1.26\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":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62a763cc177d478e487addded1595370f0c5af598e63cedc8bd74d161241b8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PacerEngine.run: MethodTooLong \u2014 run runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"791b0b5f6c7affe80b966c78b89571c9fb71bf8fa1b59fc646c478f91b1e5d52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionActivity.consume: MethodTooLong \u2014 consume runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c5f8f624e5105359645ad5efb8bb07d464e8c5f0a245cf77d07b6a0198536b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeActivityRecord.transcript: MethodTooLong \u2014 transcript runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ba06ed495705051c1c1f7b1b82a8a5763e727828c6d978dd05b511a723d1e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeDesktopSession.receive: MethodTooLong \u2014 receive runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/NativeDesktopSession.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3084248881bef5e32d552b5cf89e43a3a50b588bf5e29fcff4df23939d073fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerIsland/SettingsView.swift: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: SettingsView (6-705). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bb2a2906f257c73323c6d7214f20993e81dfc8d97d4c87b2dc75439d2d2ea9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerCore/ClaudeActivityRecord.swift: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: ClaudeActivityState (230-831). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f672ec44f8302237a708df7340d2d7f20e233f21f5e6122e451676ea44d515"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClaudeActivityMonitor: TooManyMethods \u2014 34 methods, declared across 3 files: PacerCore/ClaudeActivityMonitor.swift (32), PacerMacSupport/MacCollectorDependencies.swift (1), EngineSupport/WindowsActivityDependencies.swift (1). The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"236c659cf4c7753b0a4f7259b599a6435719a5370d7f46d2e51ee631dc31948f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClaudeHookInstaller: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f3861e9f4a0086f642c8347f008b9d1200c79209f0c2590cb89062ab7b38d2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClaudeCloudProjectMonitor: TooManyMethods \u2014 32 methods, declared across 2 files: PacerCore/ClaudeCloudProjectMonitor.swift (31), EngineSupport/WindowsClaudeHTTP.swift (1). The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98ebc8fada7fd009dd168b16d853c3cab442d5a162b31b7f6c9c0dca42370dd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClaudeActivityState: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d172e3e7a845afdb160699df2189733390809e1a1c38c7dde320e82823394a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerIsland/SettingsExpandedPanelPane.swift: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: SettingsExpandedPanelPane (16-483). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsExpandedPanelPane.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4237106345a9fc8ae4d91d0f5234d7333eb49b4890bb5ac8f5391e41d9f8f48e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resources/claude_remote_setup.py: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3811241ec21132504bda5a72eb01667c9b3a76e43e437c0e5ae90295a1b19f92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Desktop/SettingsHarness.cs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3c84889530f92a519c1113da9cd273c8dbd32aa799c181eab81892e880ff2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopWireProjection.projectedValue: MethodTooLong \u2014 projectedValue 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":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4167a24dc16dfb78e889085f044b8c9e26b301e704d313850f231ea1a95158bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskStatusIconNSView.apply: MethodTooLong \u2014 apply 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":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e753da7f0343a07f1e4a002f66274f53d246d2570b92040648bb1c7f7d78192"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerIsland/WelcomeView.swift: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/WelcomeView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c1f0fc71ac8fbf53aa8d6ac1ccdffbb9fc4f5f17a62dc27eb1f0cd5668e189"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PacerIsland/PacerMain.swift: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f858cf736e50f6bdaebfb62b9e0b924df6b71bac075be9f0b1cade294f1a6a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DesktopFrameDecoder: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"07626c5a64d7856567a9919034f1951121ea957d6af8c453d1a268d8db75ea68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeQuotaClient.fetchQuota: MethodTooLong \u2014 fetchQuota runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f5261029efacf3329cb989ee45bf6aa12ac9d729d957f988194e3bff6fd61d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PanelController.layout: MethodTooLong \u2014 layout runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PanelController.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8974d075730a50bb75217115a012f6e2887227a0448ba02e95b84fc5af2c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 5 shared lines): windows/Desktop/CompactLayoutEditorView.cs:291-300 | windows/Desktop/GuideArt.cs:52-62 | windows/Desktop/SettingsAppearance.cs:243-252 \u2014 These 3 members are variants of one another: a block of 5 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactLayoutEditorView.cs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c78dc3dc903712964a522c52a877a700dc87d8f8874d5265aab3e4b94a1eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): native/Sources/PacerIsland/ActivityBadge.swift:323-333 | native/Sources/PacerIsland/ActivityBadge.swift:569-579 | native/Sources/PacerIsland/CompactQuotaViews.swift:179-190 | native/Sources/PacerIsland/CompactQuotaViews.swift:341-351 | native/Sources/PacerIsland/TaskStatusIconView.swift:313-323 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"188ba220c366292a9fadf6bec3958a401f17dfce1a785e7f6cef93cf8d4ffe54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): native/Sources/PacerCore/ClaudeQuotaCoordinator.swift:109-160 | native/Sources/PacerCore/CodexQuotaCoordinator.swift:145-214 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaCoordinator.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c1982699817a0532a324caa8559b63e054ddb274aaa0dfde51671a569fb9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): native/Sources/PacerIsland/CompactQuotaViews.swift:602-621 | native/Sources/PacerIsland/DeepSeekDashboardView.swift:109-132 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactQuotaViews.swift"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e668a5370d7978a18aeabc12d1f17f8e26a27dab0aea68efd4a78cadc10716c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): native/Sources/PacerIsland/IslandModel.swift:77-105 | windows/EngineSupport/PacerEngine.swift:345-370 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0602b62f25f42198cc2b9e3f037e633ab83828dd4487d0acd9c7f9e41136da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): native/Sources/PacerIsland/ClaudeWebLogin.swift:127-160 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:124-158 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e606660143dd2e48c2e53a0b87c1d26a7bb0535e128fd3942fa1229d450c552"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift:74-97 | windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift:101-128 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe245fcf4dd8500e0dedb14fd96f98d11ac22cedf0f2d5a379d7f090ca5f7e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): windows/Desktop/IslandWindow.xaml.cs:978-1009 | windows/Desktop/IslandWindow.xaml.cs:1016-1050 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"c673350aea52d6d4c09388979b2caca8dbfefb64a2a4a72be7d8daba7114d1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): windows/Desktop/WindowsSshTerminal.cs:15-34 | windows/Desktop/WindowsWslTerminal.cs:14-33 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSshTerminal.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d600917d6170dd3a91f6cf38b9e1ccd727f6f7ebe4601af70c2c09eda897439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): windows/Desktop/SettingsDeepSeek.cs:169-190 | windows/Desktop/SettingsReminders.cs:238-262 \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":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86989e87bd711cdf1913c08f1543cced811e345ad842e486351e278221e8bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): native/Sources/PacerIsland/CompactIslandHeader.swift:52-75 | native/Sources/PacerIsland/CompactIslandHeader.swift:107-129 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactIslandHeader.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc634ffd8ade74f5e0d0ccce65c2ba856cc493948307ffc9369761740ace22d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): native/Sources/PacerCore/CompactComponentOptions.swift:93-112 | native/Sources/PacerCore/ExpandedPanelLayout.swift:285-302 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactComponentOptions.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ae2cabd44ab59aca38255bb420cbc73c02190ba66c682897158b279fbe3d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): native/Sources/PacerIsland/ClaudeWebLogin.swift:366-388 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:283-297 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0757b05fb915dc75578073a36c4d152c2fd0057e600384cefef8a4941b60a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): windows/Desktop/DeepSeekBalanceStatusView.cs:13-39 | windows/Desktop/QuotaConnectionView.cs:13-45 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekBalanceStatusView.cs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc6c30a5d423e8c019e6ec2a6941d7226a62dbfe4057901d9735931c6f1fb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): windows/Desktop/SettingsCollapsed.cs:337-353 | windows/Desktop/SettingsPanel.cs:299-315 \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":"windows/Desktop/SettingsCollapsed.cs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef4a36e05cd3fd889dc4be69675c99be1bcdbb316eac8e76a0982b7b9a142f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): windows/Desktop/ClaudeConnectionCoordinator.cs:72-86 | windows/Desktop/DeepSeekConnectionCoordinator.cs:58-73 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f2a25cde596e959b9b30994697a0fa402a6b8a9ecf321f956e866c668915a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): windows/Desktop/GuideContent.cs:978-987 | windows/Desktop/SettingsCardKit.cs:112-127 \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":"windows/Desktop/GuideContent.cs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"019fbed23492da00b3357bc873236bb91a739ff1676ad47f98fef31f1a2348ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): windows/EngineSupport/ClaudeWebBridge.swift:55-70 | windows/EngineSupport/DeepSeekWebBridge.swift:78-93 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebBridge.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe32ff0eab9b673e6ba7c89fb8431a19c42e930eb636c6d082bf5e067fe606b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): windows/Desktop/QuotaHistoryChart.cs:183-195 | windows/Desktop/QuotaHistoryView.cs:195-201 \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":"windows/Desktop/QuotaHistoryChart.cs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baf2c66d1d45f726ceff70b7de8ccd6bb57cd9f1c78928fb9c6f82f357a7616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): native/Sources/PacerCore/ClaudeRemoteSetup.swift:122-136 | native/Sources/PacerCore/CodexRemoteProgressSetup.swift:23-31 \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":"native/Sources/PacerCore/ClaudeRemoteSetup.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4fb2f59716aa3a62f25aeabb3bde06976d568d532f647be0ca372fc8f07194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): windows/InstallerSupport/WindowsClaudeHookCommands.swift:21-32 | windows/InstallerSupport/WindowsClaudeHookCommands.swift:33-43 \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":"windows/InstallerSupport/WindowsClaudeHookCommands.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c40804ea548c6bbc79d7dca9b52e6d3dab8dbcad77f861f9dabec4ac752af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): native/Sources/PacerIsland/DeepSeekWebBalance.swift:164-172 | native/Sources/PacerIsland/HarnessAccountConnection.swift:315-323 \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":"native/Sources/PacerIsland/DeepSeekWebBalance.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f0ed1b528b182a124e84b7dba88a11a8f5ac92ac799d942b3ce1faae7ed0a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): windows/EngineSupport/WindowsProcessOwnership.swift:16-23 | windows/EngineSupport/WindowsProcessOwnership.swift:31-37 \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":"windows/EngineSupport/WindowsProcessOwnership.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"db12628f9456d615eb1ff431ff63c7ff14575dec05cad9756072f3ac3e110552"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): native/Sources/PacerIsland/ClaudeWebLogin.swift:220-239 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:221-239 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"17abe6d743149317621a72e967b8a973c5404d7dfb2a8a19e87f7a4de2d12bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): native/Sources/PacerIsland/MainWindowPanes.swift:303-316 | native/Sources/PacerIsland/MainWindowPanes.swift:319-332 \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":"native/Sources/PacerIsland/MainWindowPanes.swift"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7600cd87973f9e11a1f672c8b3e3321af244c19b1e1baf748d73e3b624261487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): windows/Desktop/QuotaDial.cs:420-428 | windows/Desktop/QuotaDial.cs:430-438 \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":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"579307f4ae857402329651533ce740c4efe26609ab5031a9203942c49cc1367e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): native/Sources/PacerIsland/MainWindowKit.swift:185-202 | native/Sources/PacerIsland/WelcomeView.swift:406-425 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/MainWindowKit.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"607047364d46a9cd84b346c0acb00c3daeda774e1c9a2250577a5dd77414a84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): native/Sources/PacerCore/ClaudeQuotaClient.swift:42-51 | native/Sources/PacerCore/ClaudeQuotaClient.swift:53-63 \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":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbd696363f280180511098c82633d4ecfd2559444fd9fe3cbe57c35a312faa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): native/Sources/PacerCore/Resources/claude_remote_setup.py:607-618 | native/Sources/PacerCore/Resources/codex_remote_progress_setup.py:262-273 \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":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2d4ce669ff4716a7c8aed22afaed104fe1d189907065d7c41d86886da6cf27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerMacSupport/MacDurableProgressMailbox.swift:57-63 | windows/EngineSupport/WindowsDurableProgress.swift:31-39 \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":"native/Sources/PacerMacSupport/MacDurableProgressMailbox.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe056eed9791c571bda9004eb0ad6a9c852aee61069a104d9a4204137dc9b238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): native/Sources/PacerIsland/MainWindowKit.swift:334-345 | native/Sources/PacerIsland/SettingsExpandedPanelPane.swift:614-627 \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":"native/Sources/PacerIsland/MainWindowKit.swift"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4933179b7dfecc98a7a21569431e1e922daeadb501604e305fd75ecf789d5d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): windows/Desktop/ClaudeConnectionCoordinator.cs:88-103 | windows/Desktop/DeepSeekConnectionCoordinator.cs:75-89 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"99874afa96e0ffbcbc8627c364f7defa7e9d0fe1c21dad6fa956ac628ca10cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): windows/Desktop/GuideContent.cs:110-119 | windows/Desktop/SettingsConnections.cs:184-193 \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":"windows/Desktop/GuideContent.cs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5294d50b4ef98602df6567617d94dc7813bd8a7364635a8f2c3bb7aa44529e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): windows/EngineSupport/PacerEngine.swift:1373-1385 | windows/EngineSupport/PacerEngine.swift:1387-1398 \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":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16800ca394cde7ea41ce972c362e7e6c3a331822c7da912bbc93ce0c8dae374"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): native/Sources/PacerCore/CodexExecutableResolver.swift:38-46 | windows/EngineSupport/WindowsCodexExecutableDiscovery.swift:28-36 \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":"native/Sources/PacerCore/CodexExecutableResolver.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"366966060b099a799526f256ee7542884bbcff57086e962ada5a44a6c54d0666"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): native/Sources/PacerMacSupport/MacCollectorDependencies.swift:37-48 | native/Sources/PacerMacSupport/MacCollectorDependencies.swift:49-59 \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":"native/Sources/PacerMacSupport/MacCollectorDependencies.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8521cd373b4f257b107338c998b8de21c4e4b33cd9eb32cae41e38d8f182677e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): native/Sources/PacerMacSupport/NativeDesktopCollector.swift:173-181 | windows/EngineSupport/WindowsDesktopTransport.swift:94-105 \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":"native/Sources/PacerMacSupport/NativeDesktopCollector.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a808e192200174ddb22d77e17260ead42af4006f80b5803aaabcfe1a056adf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerCore/ClaudeRemoteSetup.swift:154-160 | native/Sources/PacerCore/CodexRemoteProgressSetup.swift:69-75 \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":"native/Sources/PacerCore/ClaudeRemoteSetup.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6563630c4ac7ec28c792ea53bc2a20f2fd235c967c39291b995217ee7ea2c7d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): native/Sources/PacerCore/ActivityTaskPresentation.swift:112-118 | native/Sources/PacerCore/ActivityTaskPresentation.swift:121-127 | native/Sources/PacerCore/DeepSeekSoloPresentation.swift:183-189 | native/Sources/PacerCore/QuotaDashboardPresentation.swift:263-269 \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":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2383b104f2aced261d78b0ae96dac03332ab83951fac8175e530c387bea6ffa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): native/Sources/PacerMacSupport/MacClaudeHookInstaller.swift:68-75 | windows/InstallerSupport/WindowsClaudeHookCleanup.swift:8-15 \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":"native/Sources/PacerMacSupport/MacClaudeHookInstaller.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f33b4974488fea57768fff0145b7ef218f661b3140b90c9732d4dc0fc896741"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): native/Sources/PacerMacSupport/NativeDesktopCollector.swift:36-44 | native/Sources/PacerMacSupport/NativeDesktopCollector.swift:45-54 | native/Sources/PacerMacSupport/NativeDesktopCollector.swift:59-68 | native/Sources/PacerMacSupport/NativeDesktopCollector.swift:69-77 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/NativeDesktopCollector.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae30bd0eb798cbb7475fce7e356f79182acc10a32a07fb6fb58afca852b00935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerIsland/TaskStatusIconView.swift:1017-1025 | native/Sources/PacerIsland/TaskStatusIconView.swift:1026-1032 \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":"native/Sources/PacerIsland/TaskStatusIconView.swift"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cfd3b5f580d52223b0d26a70d95b1797f082d4cbc8a0bd7083e9e121ed3fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): windows/Desktop/PreferencesCodec.cs:109-118 | windows/Desktop/PreferencesCodec.cs:122-131 | windows/Desktop/PreferencesCodec.cs:134-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c13af781fb27bc4b60b932fd0b6740bc8c5a888c73834a4b2189b6611a687ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): native/Sources/PacerIsland/ClaudeWebLogin.swift:252-262 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:248-255 \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":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"059a7af641f36601674457d1d2a06b049ae1bcf90063b5662f83849e31fd6057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): windows/Desktop/ActivityBadge.cs:287-296 | windows/Desktop/ActivityBadge.cs:309-318 \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":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"45685a8015fdef71db70f644efbfcf8082b487c52d1af286d2ce7c628d6b5d8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): windows/Desktop/CompactChoices.cs:75-86 | windows/Desktop/PanelChoices.cs:20-32 \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":"windows/Desktop/CompactChoices.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb48a8def3f6b7e5c110b88701b75e9ee4609aec2364d9c64e3e6623b02b26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): windows/Desktop/PreferencesStore.cs:35-52 | windows/Desktop/WindowsInstallationIdentity.cs: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":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87b8e4e86a10128dde5300767ebeb58b5da8816e044d27022f5777244c5561a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): windows/Desktop/WindowsInstallationIdentity.cs:91-101 | windows/Desktop/PreferencesStore.cs:35-52 \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":"windows/Desktop/WindowsInstallationIdentity.cs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b43fc35b0753be29ad92f9062c681f018230a90a233c47b2162300850e8e98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): native/Sources/PacerIsland/IslandView.swift:219-233 | native/Sources/PacerIsland/IslandView.swift:235-247 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandView.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"079a11bbf0ee2648103b3b3ae66c1106f61944dc555a628c20b93c597bb804b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): native/Sources/PacerCore/ClaudeDesktopRecords.swift:169-176 | native/Sources/PacerCore/FileSignatureCache.swift:22-29 \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":"native/Sources/PacerCore/ClaudeDesktopRecords.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ebef1445760efff5a5e2389907f83902b632b72e3a0abbb3568683e001ae46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift:148-155 | native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift:156-163 | native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift:180-186 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"69481351454834bdd3907d3fb441c6fc282a68e586e625a3b974467f093ad091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): windows/EngineSupport/ClaudeWebBridge.swift:71-77 | windows/EngineSupport/DeepSeekWebBridge.swift:94-100 \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":"windows/EngineSupport/ClaudeWebBridge.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a9be7b7540486259f4171eff955188006e267f8e713f758bc5d5957a7f4f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerCore/ClaudeRemoteSetup.swift:141-146 | native/Sources/PacerCore/CodexRemoteProgressSetup.swift:34-39 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeRemoteSetup.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1472c4c1d38806a0ba406c577466f907e8a5495d379ec31b024e27151323eb0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): native/Sources/PacerIsland/MainWindowKit.swift:350-357 | native/Sources/PacerIsland/SettingsLibraryTile.swift:149-157 \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":"native/Sources/PacerIsland/MainWindowKit.swift"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"158797e4881a70a27a6d05285c75b62f8f44ab2dc6c051702fdd30ab1d5f7179"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): windows/Desktop/ClaudeConnectionCoordinator.cs:118-124 | windows/Desktop/DeepSeekConnectionCoordinator.cs:98-104 \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":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce4aba20cb8337beaf049c8cafbe32e17ca88a4dbaed9cff22304728256040e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): windows/Desktop/QuotaDial.cs:213-218 | windows/Desktop/QuotaDial.cs:312-317 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"23446202161e3f44b86a22ae0031ba52a192901e1a870b112e2919c629f9c06d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): windows/Desktop/TaskProgressRing.cs:267-273 | windows/Desktop/TaskStatusIcon.cs:250-255 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskProgressRing.cs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a13eacf80fcbe2aafadccff590a96fb16c9b0fd811879b7e0b26a61e65437d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): windows/InstallerSupport/WindowsClaudeHookCleanup.swift:16-24 | windows/InstallerSupport/WindowsClaudeHookRuntime.swift:97-104 \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":"windows/InstallerSupport/WindowsClaudeHookCleanup.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"166d83bccc6c38eecab7eefd62323b6c8330f190ed0a2b68fcafc9839a9b42a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): native/Sources/PacerCore/CodexProgressEvidence.swift:92-96 | native/Sources/PacerCore/WorkBuddyTranscript.swift:314-319 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexProgressEvidence.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d01197695f6a7b50436ad2191a1b9d0cee73107f647c0068844e039bbddf06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerCore/DeepSeekSessionLog.swift:79-85 | native/Sources/PacerCore/DeepSeekSessionLog.swift:205-210 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"02791cc91823a78d4d4ad345b2284b94f307a97debf49b90d16f3ed5a1652b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerCore/ClaudeQuotaCoordinator.swift:54-59 | native/Sources/PacerCore/CodexQuotaCoordinator.swift:94-99 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaCoordinator.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9796d99d8787758a704a4497809841f0204b6e64d3b347faa07890e3942a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/Desktop/SettingsCodex.cs:212-215 | windows/Desktop/SettingsCodex.cs:217-227 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07df64acabd4c9933d5364b7ef9d983b897d19b5e966fcd837568f0af2abc9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerIsland/DeepSeekDashboardView.swift:498-504 | native/Sources/PacerIsland/QuotaDashboardView.swift:416-422 \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":"native/Sources/PacerIsland/DeepSeekDashboardView.swift"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebc02a8cd68ac4a18091f72058860794b98c088eada904dc7d27f4e8f6e1ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerIsland/SettingsView.swift:562-568 | native/Sources/PacerIsland/SettingsView.swift:569-575 \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":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bf771c1888a3a0aed498e27daafde38a2f3183ccc5c600a0854cda9d4b26cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerCore/CompactIslandLayout.swift:232-238 | native/Sources/PacerCore/ExpandedPanelLayout.swift:146-151 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactIslandLayout.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2992a8489ef7efc2808297f52e10b9a569a992fa90853522bb055f568a93c8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): native/Sources/PacerCore/RealtimeActivityMonitor.swift:112-114 | native/Sources/PacerCore/RealtimeActivityMonitor.swift:115-119 | native/Sources/PacerCore/RealtimeActivityMonitor.swift:120-125 | native/Sources/PacerCore/RealtimeActivityMonitor.swift:126-132 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb13afbb0c7fb58f5224f9aa51855a8d55e3919af9108370c0a1e3932d3302a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): native/Sources/PacerIsland/IslandModel.swift:2356-2363 | windows/EngineSupport/PacerEngine.swift:1289-1297 \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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"395c3a450c9f1ac7c9fa4609c47adb541fa6a341e4b91239a7d928f188540d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerIsland/SettingsView.swift:755-762 | native/Sources/PacerIsland/WhatsNewView.swift:218-224 \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":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6d2ca9b48cf22ed788372396ca13b8c3a7969b0aef6fad3fa3ae5b21c4d7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): windows/Desktop/CompactChoices.cs:89-94 | windows/Desktop/PanelChoices.cs:35-40 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactChoices.cs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565d6add774e2a7eacbbc17acb9a0e14fb8ac860a952ee9f673ee7a04372cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): windows/Desktop/EstimatePaint.cs:25-32 | windows/Desktop/EstimatePaint.cs:35-49 \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":"windows/Desktop/EstimatePaint.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def6a83bc0197a0c2a07f8235f58124a93ed3d7e2070b23f2626069e69bd53a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): windows/Desktop/DeepSeekSoloView.cs:101-105 | windows/Desktop/SettingsAppearance.cs:42-46 | windows/Desktop/SingleQuotaView.cs:75-80 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekSoloView.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"186cc22fd7c8ebc263abf6ea9c1fd5bede23dc21369065b075c52f1cdfd3b8aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift:112-116 | native/Sources/PacerCore/ProviderQuotaRefreshPolicy.swift:13-17 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"74304f162d4ff7324777277c3b4dc6f0ae5bdfed6877e927bf35f699ce6ac149"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerIsland/ClassicQuotaDashboardView.swift:56-62 | native/Sources/PacerIsland/QuotaDashboardView.swift:122-128 \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":"native/Sources/PacerIsland/ClassicQuotaDashboardView.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06920478255161934bc80a71c45ea4f90b249bfc85d23030fd8f64cbd96043f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerIsland/CompactQuotaViews.swift:622-624 | native/Sources/PacerIsland/DeepSeekDashboardView.swift:133-135 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactQuotaViews.swift"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae07cd9162d6307617a4b2b5a8bc006a06e9824fbee809ae3701a89f0e7b9e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerIsland/IslandModel.swift:431-437 | native/Sources/PacerIsland/IslandModel.swift:943-951 \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":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7b01e1576c3b33245e7bd9d54f2d75a7ac58c651b7d8484c8d25f989673692"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerMacSupport/MacFileSystem.swift:20-25 | windows/EngineSupport/WindowsFiles.swift:65-70 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacFileSystem.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cc4268c653ef799fe4b205fffe6735d1fe4d2a4e51b1f285c9ee8f6296e319"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): windows/EngineSupport/DeepSeekBalanceHistoryStore.swift:21-25 | windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift:44-49 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/DeepSeekBalanceHistoryStore.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"483ceb5138d7e099c6664666b29b342b31f581779020d8e10bafb37780421138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/ClaudeActivityMonitor.swift:279-285 | native/Sources/PacerCore/ClaudeActivityMonitor.swift:290-293 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e80ae21c363de78bb931e0990b9a64666b172cfa99bf30d1b7e4cd39451cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): native/Sources/PacerIsland/SettingsSupportPane.swift:106-116 | native/Sources/PacerIsland/SettingsSupportPane.swift:168-178 | native/Sources/PacerIsland/UpdateSettingsView.swift:300-312 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsSupportPane.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d069a79b68c8e3e35f71562f28fa0853522b6deb13a66bcf087e290279279fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): windows/EngineSupport/WindowsCodexProgressPaths.swift:11-16 | windows/InstallerSupport/WindowsClaudeRuntimeStore.swift:44-50 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsCodexProgressPaths.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"500711efaae144b547f6f427c939f30a5f27ecdbf5069d81b9509874c50634e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): native/Sources/PacerCore/ApplicationLifecycleCoordinator.swift:115-119 | native/Sources/PacerCore/ApplicationLifecycleCoordinator.swift:126-130 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ApplicationLifecycleCoordinator.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d44574727ddf42f1c7b1c3c8ba7c759dd539a71d8e26bb4300cfdf2177d8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/RuntimeDiagnostics.swift:56-60 | native/Sources/PacerMacSupport/MacRuntimeDiagnostics.swift:11-14 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RuntimeDiagnostics.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"25798e9b3721eff30cf4b29513bae852082fa34079d82490ceb8c90b2a072806"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): native/Sources/PacerCore/ClaudeObservedRequestMeter.swift:30-34 | native/Sources/PacerCore/ClaudeObservedRequestMeter.swift:35-40 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeObservedRequestMeter.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfb35fc5dc640cab2b015a9cd7eb29ed318a67ef659acc91cb7107c37942302"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): native/Sources/PacerCore/CompactIslandLayout.swift:139-143 | native/Sources/PacerCore/DeepSeekBalanceHistory.swift:100-104 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactIslandLayout.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8df98cb5567f85fe9fd66b6ae1cad74ae819770fc2b757385521d759420634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerCore/ClaudeActivityMonitor.swift:165-170 | native/Sources/PacerCore/DeepSeekActivityMonitor.swift:57-62 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f522e2429721ad191894c2a5384b0e7bdaaf4a917b12febc2588283190f3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift:19-27 | windows/EngineSupport/WindowsStorageRecovery.swift:39-47 \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":"windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2841231a68fe20bece496f47889a2b84d5a81cbfaec2597e0c929461457629f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerMacSupport/MacClaudeLiveSessionRegistry.swift:6-10 | native/Sources/PacerMacSupport/MacClaudeLiveSessionRegistry.swift:11-14 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacClaudeLiveSessionRegistry.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f987ce2741fba25adee7c793c22239847acf30aef779a6796ac91ce5888b0319"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): windows/Desktop/ClaudeConnectionCoordinator.cs:167-171 | windows/Desktop/DeepSeekConnectionCoordinator.cs:136-140 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf5cd82125c128734af087242be56598d727aed9324d6cca99fde090375f0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): windows/Desktop/DeepSeekWebSession.cs:26-30 | windows/Desktop/DeepSeekWebSession.cs:32-36 | windows/Desktop/WorkBuddyAccountCredits.cs:144-148 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekWebSession.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a699395bbb1d4c30ab5c2a32ab7246fca33d898e50950351cb45cb2d1321c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): windows/Desktop/IslandWindow.xaml.cs:1070-1075 | windows/Desktop/TaskStatusIcon.cs:311-316 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff401716c25cb4dd80e9975d43c378b8bc22233db43c55123232ac3622db8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): native/Sources/PacerCore/WorkBuddyHarness.swift:873-883 | windows/EngineSupport/PacerEngine.swift:1794-1803 \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":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"997cd19408057b4b8a90a8d03199e99c54d9603ddcbc7fbb83a6a245f55a06da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): native/Sources/PacerIsland/HarnessGuideFloat.swift:128-135 | native/Sources/PacerIsland/PanelController.swift:424-430 | native/Sources/PacerIsland/PanelController.swift:460-465 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/HarnessGuideFloat.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"70026e1e1d57e45723a4e5f33dc9330a545badc32bcc985e21fd70039b2e55e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/EngineSupport/WindowsDeepSeekApplication.swift:48-51 | windows/EngineSupport/WindowsProviderInstallation.swift:34-37 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDeepSeekApplication.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc0243a2405c72f01d8bafb95b528b9691d7410742a7de242d96f1e16f36ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerCore/Activity.swift:412-418 | native/Sources/PacerCore/Activity.swift:419-424 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3198af00a0b7171835a578208464cab9fddfe6aad9a6319d62b84af60c284250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): native/Sources/PacerCore/ClaudeActivityMonitor.swift:253-257 | native/Sources/PacerCore/RealtimeActivityMonitor.swift:65-69 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91dc4cfbc6bfc20a6049e4882a423f4ad469451d8ce5bd1e444fefce2ad49f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): native/Sources/PacerIsland/IslandModel.swift:376-380 | native/Sources/PacerIsland/IslandModel.swift:1474-1478 | native/Sources/PacerIsland/SettingsView.swift:556-561 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"705eaf040f11b0e9dbc2abb19201532de94194f82866369487d94353eca32d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/DeepSeekHome.swift:47-51 | native/Sources/PacerCore/CodexApplicationResolver.swift:7-10 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekHome.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b388043def021db8f2c17f571d3da9b59813ffb9c50e9c7e5651a372395fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): native/Sources/PacerCore/DeepSeekWebScripts.swift:9-15 | native/Sources/PacerCore/HarnessAccountCredits.swift:298-304 \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":"native/Sources/PacerCore/DeepSeekWebScripts.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca021b124c4683ae560599700b262fe9b5a740e0c4f1f249a81c3a14b9a9d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerCore/CompactBarPresentation.swift:74-76 | native/Sources/PacerCore/ExpandedPanelPresentation.swift:130-132 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactBarPresentation.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d26ba2518fa387671f62b9448877fcbae215b922769a30d5c0f8fac65349c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): native/Sources/PacerCore/ClaudeActivityRecord.swift:20-24 | native/Sources/PacerCore/DeepSeekSessionLog.swift:68-72 | native/Sources/PacerCore/ModelDisplay.swift:16-20 | native/Sources/PacerIsland/ClaudeWebLogin.swift:63-68 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"31652bf66c2be3d643519429f80cc003a6a145853424804973a305835ed4d3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/CompactComponentOptions.swift:122-125 | native/Sources/PacerCore/ExpandedPanelLayout.swift:160-163 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactComponentOptions.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd623918ea50ed182f635ed987e4148b539f06805428b294978aad03b176b25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerMacSupport/MacHelperProcess.swift:7-10 | windows/EngineSupport/WindowsHelperProcess.swift:5-8 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacHelperProcess.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa14ac8e503b3ef8a77d4ebaf61019b97223564a24910a6d650d57582f844adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/EngineSupport/ClaudeWebBridge.swift:81-84 | windows/EngineSupport/DeepSeekWebBridge.swift:101-104 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebBridge.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6918a9c7aed5d20b54115fa6a836551b27a519418dcdfa76b74583012575057f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): native/Sources/PacerCore/ClaudeQuotaClient.swift:223-229 | native/Sources/PacerCore/ClaudeWebQuotaClient.swift:123-128 | native/Sources/PacerCore/CodexClient.swift:110-117 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8ce2507734a22fb73410dc3d1bb0175f72e0d9bdbe752ca6d54f8d24a90e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): native/Sources/PacerCore/CompletionDismissalStore.swift:83-85 | native/Sources/PacerCore/DeepSeekHistoryCredential.swift:47-49 | windows/EngineSupport/EngineNotificationRegistry.swift:25-27 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompletionDismissalStore.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81d3244852efad872e46b542d23107f0077a515cb3d04786d2416e5a59b6853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): native/Sources/PacerIsland/PacerDesign.swift:32-32 | native/Sources/PacerIsland/QuotaCycleChart.swift:14-16 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerDesign.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a479c9c82cc37e1daac9b46face904fc9315306f5ed189854259c06cbc2e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerMacSupport/MacChildProcess.swift:34-37 | windows/EngineSupport/WindowsChildProcess.swift:6-9 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacChildProcess.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f01733aeb7c661e2a31c5b51ef1d523197d9900266f8f30ae44c4b5eecedce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/ClaudeCloudProject.swift:167-170 | native/Sources/PacerCore/ClaudeQuotaClient.swift:100-106 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProject.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e55b14ba599a86792e3b143fb75dfd9d6f84d79ff7316aaa29ce9714142010"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/ClaudeActivityRecord.swift:223-226 | native/Sources/PacerCore/LogDateParser.swift:9-12 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d71e752e415368b0c66a44d195a0ea075b398e5a42eaa88060290fc0c3abc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerMacSupport/MacApplicationCatalog.swift:31-34 | native/Sources/PacerMacSupport/MacDeepSeekApplication.swift:17-20 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacApplicationCatalog.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fa22b18c850697927480bc4d2d217ad8d5fd4b08707b5e0d0533a443f630a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/Desktop/App.xaml.cs:418-421 | windows/Desktop/WindowsStartupRegistration.cs:197-200 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad4026eff8d6f6ccb98f6f02710f39b70c771a28ee428e807eba0a7baad6c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift:109-111 | native/Sources/PacerCore/ProviderQuotaRefreshPolicy.swift:10-12 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0db594f9a9773a655928d1a7314ab33de9a195f0f46394d38e4b50efa6cbe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerCore/CompactIslandLayout.swift:144-146 | native/Sources/PacerCore/DeepSeekBalanceHistory.swift:105-107 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactIslandLayout.swift"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99cea8973395b8126d4ee493f065a4e8aa9cd301c1afba118cadd7cee5e3286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerIsland/ClaudeWebLogin.swift:295-298 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:280-282 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cfa52c2306437b15fb759792ab8e3576a829743b0f3a5687661348d00d1577"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): windows/Desktop/WindowsSshTerminal.cs:11-12 | windows/Desktop/WindowsWslTerminal.cs:11-12 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSshTerminal.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a67c94a37f087d3060aaa4822b2522772394ba60239d85d8d93615fbabf9742"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): windows/Desktop/FileQuarantine.cs:12-19 | windows/Desktop/WindowsInstallationIdentity.cs:81-89 \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":"windows/Desktop/FileQuarantine.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b45ded166dd20835468da165813071ccd6f8bf8bc059f0376b4f28418c7e8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): windows/Desktop/WindowsInstallationIdentity.cs:81-89 | windows/Desktop/FileQuarantine.cs:12-19 \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":"windows/Desktop/WindowsInstallationIdentity.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2831a296050d9ae8851a68f9039a9beb138038393a163123dcc7b2749b08a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerCore/ClaudeRemoteAutoSetup.swift:21-23 | native/Sources/PacerCore/CodexRemoteProgressSetup.swift:77-79 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeRemoteAutoSetup.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c094910bb46eb97e0cd2b13665d75e4fb079abb95b3f4252901c66f0f7a84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): native/Sources/PacerMacSupport/MacClaudeQuotaClient.swift:61-65 | native/Sources/PacerMacSupport/MacClaudeWebClients.swift:56-59 | windows/EngineSupport/WindowsURLSessionCloudStream.swift:80-83 | windows/EngineSupport/WindowsURLSessionRead.swift:50-51 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 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":"native/Sources/PacerMacSupport/MacClaudeQuotaClient.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad695cc6ff59e01789d2c60128a7da6d4f5bd2587fcc92002a0abd10b9e95df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerMacSupport/MacClaudeQuotaClient.swift:61-65 | native/Sources/PacerMacSupport/MacClaudeWebClients.swift:63-66 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacClaudeQuotaClient.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1138b6ca6d966f6e9190d67e93a28df0c0da92740605bfae5510853b97cce1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): windows/Desktop/AccentPalette.cs:71-71 | windows/Desktop/SettingsPalette.cs:148-148 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AccentPalette.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fc37757882624ae2463b578d1ff8da774176cad77699407844bee58f9520f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/EngineSupport/ClaudeWebBridge.swift:51-54 | windows/EngineSupport/DeepSeekWebBridge.swift:71-74 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebBridge.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7024b27b2a2133b8de266b963eb302d0cd942d30a21ac6917939f0b903b6c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerCore/CompactComponentOptions.swift:167-169 | native/Sources/PacerCore/Localization.swift:19-21 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactComponentOptions.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f59e882f8cc30563cefe505c6952d446b48b892cc021a7f54278186f520267"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerMacSupport/MacFileSystem.swift:17-19 | windows/EngineSupport/WindowsFiles.swift:62-64 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacFileSystem.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0922cf8af4c05d0603c0afbd69e3e5ee68f4e8073384ecdbafdedf74e99b5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/HarnessActivity.swift:131-134 | native/Sources/PacerMacSupport/MacClaudeHookInstaller.swift:14-17 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessActivity.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca93898fd39de1953fbca200dc256332f6ad5a31862392412d1bccfc46dc3319"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/EngineSupport/WindowsHTTPStream.swift:131-134 | windows/EngineSupport/WindowsTelemetryTransport.swift:15-18 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPStream.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486c68c712295d9afea8a3f3c3465d28e48fd4796b305bb39cd7e19ff294489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): native/Sources/PacerCore/ClaudeQuotaClient.swift:131-131 | native/Sources/PacerCore/ClaudeSSHDiscovery.swift:115-117 | windows/InstallerSupport/WindowsClaudeRuntimeStore.swift:52-52 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeQuotaClient.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e6f26116498eae3385b3b20fff4203f3bed51f41f84618bbd7ccf6cfdada72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): native/Sources/PacerIsland/MainWindowKit.swift:167-173 | native/Sources/PacerIsland/SettingsExpandedPanelPane.swift:754-759 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/MainWindowKit.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca819f4f74bfa1372de5a2d38ff5dd435cda448d516cdb84dbd087fc5c6e74ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerIsland/ClaudeWebLogin.swift:116-119 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:118-121 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f470c9f361fb7a4c0707204ee1ae591648b4f70adee42c0ddb408b715ee1fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerIsland/StatusSymbols.swift:30-32 | windows/EngineSupport/EnginePresentation.swift:80-82 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/StatusSymbols.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3c21eca68af8517f9c3cd446fd06c31c771623aa2d7a81e4a9dfc39ee6e95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/Desktop/GuideContent.cs:121-124 | windows/Desktop/UpdateRecoveryView.cs:172-175 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1cbe0e02dc2dd20a92ef586a9fd110608c4f9d9d0bc621639829889f1e60e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): windows/EngineSupport/WindowsActivityLogWatcher.swift:15-18 | windows/EngineSupport/WindowsWSLRegistrationWatch.swift:24-27 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsActivityLogWatcher.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bdb8eca6e6b370bb1020713f254612420ba8baa172aa1bda92970c27500ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): native/Sources/PacerCore/ClaudeActivityMonitor.swift:294-298 | native/Sources/PacerCore/RealtimeActivityMonitor.swift:708-711 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc4ed75b0100c00c55bb8edffaa2d54fc5a9279c7c4671588985c1a099fca78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerIsland/ActivityBadge.swift:9-11 | native/Sources/PacerIsland/PacerDesign.swift:85-87 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745590016c7d85492ccb9d30f287b4d731029a16910815410174cdec9e61b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerIsland/ActivityBadge.swift:9-11 | native/Sources/PacerIsland/PacerDesign.swift:143-145 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4548f4cb4256690fd0cd829d82f13ddaa1649a13bd58f2e0cfa4228778b727a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): windows/Desktop/GuideContent.cs:583-587 | windows/Desktop/SettingsWindow.cs:205-224 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4d8b6abfc772cc12d08bce18571cebe726917e2e74e9dbf1cfb1a717a4fd6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): native/Sources/PacerCore/ClaudeActivityReader.swift:259-259 | native/Sources/PacerCore/DeepSeekSessionReader.swift:146-148 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityReader.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"53350ebc13f6961a800035413e7729baedf629eb0189dff08b352206464eece7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): native/Sources/PacerCore/CodexClient.swift:361-364 | windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift:28-30 | windows/InstallerSupport/WindowsClaudeHookCommands.swift:18-20 | windows/InstallerSupport/WindowsClaudeRuntimeStore.swift:53-55 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"72aeb3aec22c933b9ef0525fb02ef38b365fc14022eca76f42926b2e5abf32ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): native/Sources/PacerCore/CompactComponentOptions.swift:134-136 | native/Sources/PacerCore/ExpandedPanelLayout.swift:170-172 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactComponentOptions.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"763c6664c54cc9103bd970aa3a0656e103b4c427caf2ef33e55679c1653f3235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): windows/Desktop/ComposedBadgeOrbit.cs:41-41 | windows/Desktop/NativeCompositionBackdrop.cs:29-29 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ComposedBadgeOrbit.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f780aa568a7f22daccd9f0650177329e1cda9997e9b4848dd0826f149410d50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): windows/EngineSupport/WindowsDesktopTransport.swift:117-117 | windows/EngineSupport/WindowsHTTPStream.swift:138-138 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDesktopTransport.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4cc13609418bf803f3bb3d939cf058946017df6081efb7780964a8793bdf8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:226-239 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:228-239 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift:226\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fde4d981d24d3dbaa8568e7cdaa2b7f95b9a5a1649f3819bd51b5a1765d1c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): windows/Desktop/IslandWindow.xaml.cs:995-1007 | windows/Desktop/IslandWindow.xaml.cs:1035-1047 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060windows/Desktop/IslandWindow.xaml.cs:995\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d67b2a10f9e3318ac6097b7db1ac5c9943739b1d6b164cdcf8ad692f380e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): windows/Desktop/ClaudeConnectionCoordinator.cs:73-81 | windows/Desktop/DeepSeekConnectionCoordinator.cs:59-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0630615f9e8c072e860814a07fb6901f18bf6fb450da7f8e5fd6b8f599613e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:280-293 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:268-279 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f183e88f2dc4777ff0f5660d523f3c99257a319551ba933c22543fbd4db866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): native/Sources/PacerIsland/WelcomeView.swift:590-600 | native/Sources/PacerIsland/WelcomeView.swift:667-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/WelcomeView.swift"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f772675007165e8e116954b337ca459fa906fa41fd4af35e97e069e6cf5cb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): native/Sources/PacerCore/ClaudeActivityMonitor.swift:321-330 | native/Sources/PacerCore/DeepSeekActivityMonitor.swift:133-142 \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":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1812efea52e1b5deb92fd2aacc4dee60e47275185cb4709c80e2fa9776bd7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift:298-306 | native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift:392-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift:298\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"db74d1085a4d91ace0b4eeaa66993909a2870e0cd03907496fb3e0c730530cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): windows/Desktop/ActivityBadge.cs:287-293 | windows/Desktop/TaskProgressRing.cs:384-391 \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 \u0060windows/Desktop/ActivityBadge.cs:287\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce276f8a8cfedcb7abfe48fbf40709affa79e0a167baad0072c2596baba07a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): windows/Desktop/CompactChoices.cs:76-82 | windows/Desktop/PanelChoices.cs:21-27 \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 \u0060windows/Desktop/CompactChoices.cs:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060windows/Desktop/PanelChoices.cs:28\u0060 calls \u0060JsonArray\u0060, \u0060Select\u0060, \u0060Create\u0060 and \u0060windows/Desktop/CompactChoices.cs:83\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactChoices.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0621cc3ef60b147d8b95dd00d3d1007039e92395666009e2f7f65c1131874b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): windows/Desktop/WindowsInstanceActivation.cs:101-111 | windows/Desktop/WindowsInstanceActivation.cs:128-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060windows/Desktop/WindowsInstanceActivation.cs:101\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstanceActivation.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ac9e5abbc0d1e848d8c1d69d2c8e86c32588e8e1fbde9c5b144336595f3986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:207-215 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:208-216 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift:207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef00f025b2bd4a87e4222f80d83fa113a679ef2fb2fe486aa169fbd7ddfbb50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): native/Sources/PacerIsland/PacerMain.swift:406-413 | native/Sources/PacerIsland/PacerMain.swift:443-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/PacerMain.swift:406\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"830f0477862b6589b7e5fdfa9d9bec0672ccf48b7b148dc128492402e0120231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/Desktop/ClaudeConnectionCoordinator.cs:19-23 | windows/Desktop/DeepSeekConnectionCoordinator.cs:18-22 \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":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb71f99f2a398b230924c325de8c53a6ef904859d4411d6bba590b8fa384fa13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): windows/Desktop/GuidePages.cs:59-65 | windows/Desktop/SettingsPagePolicy.cs:31-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060windows/Desktop/GuidePages.cs:59\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuidePages.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e9412f0dfe4b2883847ef985437e63b22727c04ff438baad5135e17b72dd8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/Desktop/QuotaDial.cs:481-485 | windows/Desktop/QuotaDial.cs:498-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060windows/Desktop/QuotaDial.cs:481\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0898866a19be067e8c5f2466bccaa909588c913a5ea75a7c4be329da476e160f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:252-258 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:248-253 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6ca18a58fba18047a10474f895212239b5598e869702fd8346900d222179ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): native/Sources/PacerIsland/CompactIslandHeader.swift:67-75 | native/Sources/PacerIsland/CompactIslandHeader.swift:121-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/CompactIslandHeader.swift:67\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactIslandHeader.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b16524da823b4ead798911a5bdde724a1c37d453bbd21980ebaa755ddc8750b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): native/Sources/PacerIsland/IslandModel.swift:1828-1834 | windows/EngineSupport/PacerEngine.swift:3044-3050 \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 \u0060native/Sources/PacerIsland/IslandModel.swift:1828\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cc118de5585a05bddaa97d5a192c202057b5795997136606fefd30b8025413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): windows/EngineSupport/ClaudeWebBridge.swift:57-63 | windows/EngineSupport/DeepSeekWebBridge.swift:80-86 \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 \u0060windows/EngineSupport/ClaudeWebBridge.swift:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060timeout\u0060 to \u0060UInt64 = 20_000_000_000\u0060 in one and \u0060UInt64 = UInt64(ProviderQuotaRefreshPolicy.replyTimeout * 1_000_000_000)\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":"windows/EngineSupport/ClaudeWebBridge.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36fafc18f4299f9e2b1663fe519abaac9747949213c606b9278dda47e244f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): native/Sources/PacerCore/JSONFieldView.swift:81-87 | native/Sources/PacerCore/JSONFieldView.swift:103-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerCore/JSONFieldView.swift:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/JSONFieldView.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ade4507be408b4d010178be16d3ae9d7f720f3f4e019d618e87362946d88f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): native/Sources/PacerIsland/ActivityBadge.swift:571-577 | native/Sources/PacerIsland/CompactQuotaViews.swift:181-187 \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":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6336d5cf9f5a24880208112040d9e160ef32e948d9194b80269c78e789a2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:270-278 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:261-267 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e008e3d9e85ab5e54533b54a200993b3f6fcb41d1e2508643b18a3c15944b1de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): native/Sources/PacerIsland/ActivityBadge.swift:323-328 | native/Sources/PacerIsland/ActivityBadge.swift:569-574 | native/Sources/PacerIsland/CompactQuotaViews.swift:179-184 | native/Sources/PacerIsland/CompactQuotaViews.swift:341-346 | native/Sources/PacerIsland/TaskStatusIconView.swift:313-317 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/ActivityBadge.swift:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c2cc6c642c93e40f060eb0aa6ea777e320b2a4470b92952fe0b66607a776b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): windows/Desktop/CompactLayoutEditorView.cs:295-299 | windows/Desktop/GuideArt.cs:53-59 | windows/Desktop/SettingsAppearance.cs:247-251 \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 \u0060windows/Desktop/GuideArt.cs:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060windows/Desktop/GuideArt.cs:59\u0060 calls \u0060Add\u0060, \u0060GeometryDrawing\u0060, \u0060RadialGradientBrush\u0060 and \u0060windows/Desktop/CompactLayoutEditorView.cs:299\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactLayoutEditorView.cs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90a09168412c169f26558602203c88544409353f8aa602af127ba8b803ee2e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/Desktop/GuideContent.cs:634-638 | windows/Desktop/SettingsPanel.cs:364-368 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"886973dc6ecc5903fa15f13a7e47d59714eca29b343b8ad56aebacab76e66a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/Desktop/GuideWindow.cs:33-38 | windows/Desktop/UpdateWindow.cs:38-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideWindow.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1053b44c7f63b21196cec62a4b13928ca70e720bb47f9d91e80da71c1271b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): windows/Desktop/WindowsConversationApplication.cs:95-101 | windows/Desktop/WindowsConversationApplication.cs:114-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060windows/Desktop/WindowsConversationApplication.cs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"730cde4a53f43da6d05c64364c80ab4304439fe0ef8ab52516b0de7980ff7ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerIsland/MainWindowKit.swift:367-371 | native/Sources/PacerIsland/SettingsWhatsNewPane.swift:71-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/MainWindowKit.swift:367\u0060 it does not close everything it opens, so those exact 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, \u0060native/Sources/PacerIsland/SettingsWhatsNewPane.swift:70\u0060 calls \u0060VStack\u0060 and \u0060native/Sources/PacerIsland/MainWindowKit.swift:366\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/MainWindowKit.swift"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f720745ba90889d2ab9612673c113a2f3ee96de1bd530e2fe5ad072eb9326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/Desktop/GuideWindow.cs:102-107 | windows/Desktop/UpdateWindow.cs:166-170 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideWindow.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"af630d7b22eeb6d57ca66679c3d787186e6cde5937af1f12d1ea13f2c6b0ac36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): windows/Desktop/WindowsSshTerminal.cs:19-24 | windows/Desktop/WindowsWslTerminal.cs:19-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSshTerminal.cs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b546ec0b444138b370a01e6c55f924a2b81ff8e410f4dac3449195707fbf98f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:185-190 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:174-179 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2968fe25035d46156b8e68c5cd1d2a9d534e9eb4e57d24ede75f9319449641f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:241-246 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:241-246 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift:248\u0060 calls \u0060cookiesDidChange\u0060, \u0060checkSession\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift:248\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"419367c9c1c53a626f428d566b5a0a5b8b346e8575dc099724e82621a27fd1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:264-268 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:256-260 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd3b41833fac8d39118927cc82c8a52e37ec3b0ae75296a960201b7a2ff58f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerIsland/MainWindowKit.swift:10-14 | native/Sources/PacerIsland/SettingsLibraryTile.swift:7-11 \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":"native/Sources/PacerIsland/MainWindowKit.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d6f3cd09a35ff05257baeccbb65905a16f97d180667872ac014740524e62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/Desktop/ActivityBadge.cs:312-316 | windows/Desktop/TaskProgressRing.cs:407-411 \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 \u0060windows/Desktop/ActivityBadge.cs:312\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0982a9d5c9264ccf669f6b7ce0eef76c6c400af298e5a5f20fb0184181ae5a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/Desktop/GuideContent.cs:110-114 | windows/Desktop/GuideContent.cs:369-373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060windows/Desktop/GuideContent.cs: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":"windows/Desktop/GuideContent.cs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0c09b526897865cd07ab5d79e7d463ca6f06be36b7a86c41e78458c6a001d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerCore/ClaudeRemoteAutoSetup.swift:27-31 | native/Sources/PacerCore/CodexRemoteProgressSetup.swift:82-86 \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":"native/Sources/PacerCore/ClaudeRemoteAutoSetup.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c91b71c87d62c43020e292907a046233965402aadef9198eb87f7fab243add5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerCore/CompactComponentOptions.swift:68-72 | native/Sources/PacerCore/ExpandedPanelLayout.swift:257-261 \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 \u0060native/Sources/PacerCore/CompactComponentOptions.swift:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactComponentOptions.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"211b0fa72ce7924fc9cc39551da93f65a6da18847ffa84fa7b4c80159beb5a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerCore/CompactComponentOptions.swift:115-119 | native/Sources/PacerCore/ExpandedPanelLayout.swift:305-309 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060native/Sources/PacerCore/ExpandedPanelLayout.swift:301\u0060 calls \u0060encode\u0060, \u0060filter\u0060 and \u0060native/Sources/PacerCore/CompactComponentOptions.swift: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":"native/Sources/PacerCore/CompactComponentOptions.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f44a6872c2428a1dfcb2e0bc1798699e2986659d32019db5d1b73616570383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerCore/CompactComponentOptions.swift:128-132 | native/Sources/PacerCore/ExpandedPanelLayout.swift:318-322 \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":"native/Sources/PacerCore/CompactComponentOptions.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e80e48d60440ca2965fdcd747153761dd12d71c0bab2f048a267394fffefcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): native/Sources/PacerIsland/ClaudeWebLogin.swift:147-152 | native/Sources/PacerIsland/DeepSeekWebBalance.swift:138-143 \u2014 before extracting anything, compare \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift\u0060 and \u0060native/Sources/PacerIsland/DeepSeekWebBalance.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/ClaudeWebLogin.swift:147\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeWebLogin.swift"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc4b1b95bc948cb3dd3774d9263d35da22d6e8ba085e306e358ac021cde4f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): native/Sources/PacerIsland/SettingsCollapsedBarPane.swift:51-55 | native/Sources/PacerIsland/SettingsExpandedPanelPane.swift:307-311 | native/Sources/PacerIsland/SettingsExpandedPanelPane.swift:514-518 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060native/Sources/PacerIsland/SettingsCollapsedBarPane.swift:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsCollapsedBarPane.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bacee6a0b79ee143608336985e31318979248cb95e7ceb337fa94574aa63f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerIsland/SettingsHelpPane.swift:67-71 | native/Sources/PacerIsland/WelcomeView.swift:503-507 \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":"native/Sources/PacerIsland/SettingsHelpPane.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcef6c9f6a5d9889dd35379de5df592e764fa16e0165d3737319fe5b9e613fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): native/Sources/PacerIsland/SettingsSupportPane.swift:65-70 | native/Sources/PacerIsland/UpdateSettingsView.swift:58-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060spacing\u0060 to \u00605\u0060 in one and \u00602\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060native/Sources/PacerIsland/UpdateSettingsView.swift:64\u0060 calls \u0060Button\u0060, \u0060text\u0060, \u0060buttonStyle\u0060 and \u0060native/Sources/PacerIsland/SettingsSupportPane.swift:71\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsSupportPane.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"54187720ff296b041566dafe6fa914be0707ac9766cc620e7af0432e46e3fe9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): native/Sources/PacerMacSupport/MacClaudeApplication.swift:15-19 | native/Sources/PacerMacSupport/MacDeepSeekApplication.swift:12-16 \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":"native/Sources/PacerMacSupport/MacClaudeApplication.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ae60c613553a1eb63fb6661b5c5a156af03ea418856624799961f63c14617b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): native/Sources/PacerMacSupport/MacDurableProgressSetup.swift:41-46 | windows/EngineSupport/WindowsDurableProgress.swift:80-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableProgressSetup.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d402ecad5756f16c1a941f02f75a54fec0dfd910ab9b018cb16f39779b9b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/EngineSupport/ClaudeWebBridge.swift:85-89 | windows/EngineSupport/DeepSeekWebBridge.swift:105-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/ClaudeWebBridge.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f475113a959c4151ef3ea7ac50dd6564d175ee82d670edadfbd8ae2de48459b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): windows/EngineSupport/WindowsSSHResume.swift:30-34 | windows/EngineSupport/WindowsWSLResume.swift:20-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsSSHResume.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf70a73e8d9368f9f74f5d3d181178b57b27b7d501048539d949987c27489de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 2): native/Sources/PacerCore/Resources/codex_progress_mcp.py:57-117 | windows/InstallerSupport/Resources/pacer-codex-progress.py:57-117 \u2014 before extracting anything, compare \u0060native/Sources/PacerCore/Resources/codex_progress_mcp.py\u0060 and \u0060windows/InstallerSupport/Resources/pacer-codex-progress.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77f57c286660be82a71fb19e6a240d833c88aa2b3ee71ea07c6b640ecd9ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): native/Sources/PacerCore/Resources/codex_progress_mcp.py:132-167 | windows/InstallerSupport/Resources/pacer-codex-progress.py:132-167 \u2014 before extracting anything, compare \u0060native/Sources/PacerCore/Resources/codex_progress_mcp.py\u0060 and \u0060windows/InstallerSupport/Resources/pacer-codex-progress.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd21c50ef5c3415a388ea3c6d034ac01f5a2b6f5db8f0c68bb6b77ae66d2b3ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): native/Sources/PacerCore/Resources/claude_remote_setup.py:57-72 | native/Sources/PacerCore/Resources/codex_remote_progress_setup.py:38-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a555d60d6a2ce6b267abacd71331a8743ee85e3eb2b7b5dfaa6ff7f8f06245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): native/Sources/PacerCore/Resources/claude_remote_setup.py:117-132 | native/Sources/PacerCore/Resources/codex_remote_progress_setup.py:73-88 \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":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0121d655873e6dbbaf49dd888e4f7cbbfaac9648c0f249b844674bfec1b30e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): native/Sources/PacerCore/Resources/claude_remote_setup.py:76-88 | native/Sources/PacerCore/Resources/codex_remote_progress_setup.py:57-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bbbd2dae20f24809d35acef2ef6605deb2986f78426e6c9ce6d9b1aac9bab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): native/Sources/PacerCore/Resources/codex_progress_mcp.py:171-180 | windows/InstallerSupport/Resources/pacer-codex-progress.py:171-180 \u2014 before extracting anything, compare \u0060native/Sources/PacerCore/Resources/codex_progress_mcp.py\u0060 and \u0060windows/InstallerSupport/Resources/pacer-codex-progress.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25146c38f9449c10332d611a7fe913ed08c3e56b1187fe474e345621d2bd9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): native/Sources/PacerCore/Resources/codex_progress_mcp.py:42-53 | windows/InstallerSupport/Resources/pacer-codex-progress.py:42-53 \u2014 before extracting anything, compare \u0060native/Sources/PacerCore/Resources/codex_progress_mcp.py\u0060 and \u0060windows/InstallerSupport/Resources/pacer-codex-progress.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3ea9b22253932eb2cda8cd92a4c092a62102d37ac92a1948b8c0064c8e2809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): native/Sources/PacerCore/Resources/codex_progress_mcp.py:121-128 | windows/InstallerSupport/Resources/pacer-codex-progress.py:121-128 \u2014 before extracting anything, compare \u0060native/Sources/PacerCore/Resources/codex_progress_mcp.py\u0060 and \u0060windows/InstallerSupport/Resources/pacer-codex-progress.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/codex_progress_mcp.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"120868c8219c7384285ebfa5c2c52b2de7b5a761fe576d2f3399bdc1c161d43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): native/Sources/PacerCore/Resources/claude_remote_setup.py:607-612 | native/Sources/PacerCore/Resources/codex_remote_progress_setup.py:262-267 \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":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf964802df170d643ea3c22b2384a3e8bc132a4a3997f7c02aa019e45ba4cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): windows/EngineSupport/Resources/WSL/bootstrap.py:5-11 | windows/EngineSupport/Resources/WSL/setup.py:9-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \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":"windows/EngineSupport/Resources/WSL/bootstrap.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4199f2c1a6caad5762a2d48585799ad707a1b830b5ecd06f4b88845d40d7c36b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testInstalledDesktopExecutorAndPluginInADisposableProfile: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Tests/EngineTests/WindowsDurableTests.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cc3a179981000044d2b9faa731f17e8d3d5358cf204a17a8658834de0c3217"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testLiveCatalogReadOnly: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Tests/EngineTests/WindowsDurableTests.swift"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1cbb26c1b00641b6c746c95b3559b326cdc19b4611394bb5f1725aebe34ceb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPercentagesKeepWholeNumbersOverTheirSign: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerCoreTests/CompactStripFigureTests.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c978f63f32113baabb7f11cc3201fb0f44ec5a4c3187b65f30a3af4cd47e44b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCreditsShowOneDecimalUpToThreeDigitsAndMoveTheMagnitudeUnder: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerCoreTests/CompactStripFigureTests.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b75fb1c77d4d48c9721e2fdab49c49d7ad972994e7b2a99dd7a68f915796bf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMoneyRoundsDownAndCarriesItsSymbolAfterTheMagnitude: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerCoreTests/CompactStripFigureTests.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6521a6e59eaa073d2827cccca80be1392f1c24eaae9803baa0a3242b4d48420c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAMinusSignLeavesNoRoomForADecimal: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerCoreTests/CompactStripFigureTests.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9ed899009a889ca33c71e9af9441160b3137b7892f9e77624c71ee2b0a6549"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRatesPadThreeDigitsAndPutTheirMagnitudeBesideTheUnit: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerCoreTests/CompactStripFigureTests.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbacebc3d9ada30f2133cb6d3de4cc5192158882cd8116aa19210cc8290fe46"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEveryCaseKeepsItsOriginalJSONStringAndRejectsUnknownStrings: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerCoreTests/PresentationEnumCodableTests.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"64440ad2362f4f73e95f82f0aebdf50f1df221dd070d60c547947fba95f46ca3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLocalAndRemoteSetupAgreeOnEveryConflictRow: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/ClaudeTelemetryConflictTests.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c1606efbf0968ddd89642ca66b758afc77894e3ac001d1d44dba647da5f649"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoteHelperExitsInsteadOfSpinningWhenOutputReaderDisappears: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/HelperLifecycleTests.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f69a638e8f7b083c7563ef9785e2903c1e0f51d5547527acdd21d3237236b2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDesktopHelperExitsInsteadOfSpinningWhenOutputReaderDisappears: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/HelperLifecycleTests.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5dedc216544e9b71a99bafdb44726d0e0670332006a663eca4767afec193e9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoteHelperOutputFailureAlsoExitsWithExistingHealthySocket: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/HelperLifecycleTests.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaa12e48e1af551a8f16a7da7d1fe393e4457cbbeebd753e45a69772b69b613"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMonitorDeliversFinalEndingBeforeSocketEOF: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/NativeDesktopSocketTests.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd3e8038a75631d450e97f26e6dd04b126330d879028526b7b779ae3830bbd4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRemoteControlMonitorDiscoversRoutingAndDeliversCompletionBeforeEOF: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/NativeDesktopSocketTests.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5d9196042ca4d50894fdf243114a9d11c2dcc4b432d02aad33ec28b4483ba5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLargeSnapshotOnAnotherHostCannotBreakRemoteControlCompletion: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/NativeDesktopSocketTests.swift"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d69843502fd313f1dc13407f3a63f9b75f1aac1b127fa2a4ea15e67cadacd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStdinDiscoveryObservesQuietActiveTaskAndExplicitEndingWithoutItemReplay: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Tests/PacerMacSupportTests/RealtimeTransportTests.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"065502aaa4feb651ea34504f0eafd6e6ee26c84b86a454afab27b590b452c620"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFolderWatchSeesOwnEntriesAndFileWatchSeesAppendsWithoutPolling: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Tests/EngineTests/WindowsActivityLogWatcherTests.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b05c20e79dda8f508ca9e418e6d862483849919abcc0074e72ff3f6567f84d6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExpansionFlushesPendingChangesAndStopCancelsLaterDelivery: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Tests/EngineTests/WindowsActivityLogWatcherTests.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b884d928fffcd80e8ddcfe3eef7becf0a578a46a64a4e4b9b03acbad35dd69b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testReplacingSourcesDropsOldNotificationsAndIdleHasNoCallbacks: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Tests/EngineTests/WindowsActivityLogWatcherTests.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d392827323a17789355b11a1b874adec3069872a2f57d4113953bcd0ac2cc1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNonexistentDirectoryIsNotRetainedAndRepeatedCloseReleasesHandles: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Tests/EngineTests/WindowsActivityLogWatcherTests.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8d32c26fd92a257d517c1f8cb7d49a66240524eeb4531bb8fe659f5364029d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOneQuietClaudeAppendDrainsAcrossReadBudgetsWithoutAnotherNotification: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Tests/EngineTests/WindowsLiveSourceTests.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b647ef57f6491f5396854b3e1685a9d595ea57a36be533d241aeb3c4225d4de9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/PacerEngine.swift: windows/EngineSupport/PacerEngine.swift changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 294 in EngineRuntime.receive at line 610. 11 of those changes were fix/bug commits, and the other 65 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/PacerEngine.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df12d83bae2c70324452a13ae0c9ca4e6091627a08dcb0e24f759bddceed503"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/Activity.swift: native/Sources/PacerCore/Activity.swift changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 157 in SessionActivity.consumeLive at line 1037. 9 of those changes were fix/bug commits, and the other 37 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/Activity.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"effe6ada4fd89218547dfb67834b20d10f2f6f3203dcabf0e88c8cabd47f5e93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeActivityRecord.swift: native/Sources/PacerCore/ClaudeActivityRecord.swift changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 252 in ClaudeActivityState.consumeRecord at line 381. 3 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeActivityRecord.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityRecord.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c609579abcad7e4a9c68bca4e1429dfab0638f3483224451401b9277d91a61ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/App.xaml.cs: windows/Desktop/App.xaml.cs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 172 in App.OnStartup at line 45. 1 of those changes was a fix/bug commit, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/App.xaml.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ab983e885202def35c8e88af20a30ff9ad6d0c5409bb5ff32d0ea2060bbc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/IslandModel.swift: native/Sources/PacerIsland/IslandModel.swift changed 126 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in IslandModel.configureClaudeRemote at line 1266. 16 of those changes were fix/bug commits, and the other 110 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/IslandModel.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ed6291fe715240350c26520c09019ab60be1db3f887c215827abf84fd2f29e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/DesktopWireProjection.swift: native/Sources/PacerCore/DesktopWireProjection.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 184 in DesktopWireProjection.consume at line 562. 3 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/DesktopWireProjection.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopWireProjection.swift"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8696194aca21a36b01fb240e2794e53d2db329e3332d5e2417edec8a45864bc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/RealtimeActivityMonitor.swift: native/Sources/PacerCore/RealtimeActivityMonitor.swift changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in RealtimeActivityMonitor.receiveDesktop at line 501. 3 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/RealtimeActivityMonitor.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RealtimeActivityMonitor.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d97eab478168020909391cd352db826c9c2928a41554fe4af50330e0a26abe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/NativeDesktopSession.swift: native/Sources/PacerCore/NativeDesktopSession.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in NativeDesktopSession.receive at line 295. 2 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/NativeDesktopSession.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/NativeDesktopSession.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a2451aeec06b9b384bc5764ddd5206ab91368e9211941990f7688a020b7c81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/SettingsView.swift: native/Sources/PacerIsland/SettingsView.swift changed 92 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SettingsView.paneContent at line 285. 6 of those changes were fix/bug commits, and the other 86 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/SettingsView.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e855c6ba9ef4a2bef050df5ebe1dc8b4a4a612b39d5b8a580c278bab9790f4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/CompactBarPresentation.swift: native/Sources/PacerCore/CompactBarPresentation.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 145 in CompactBarPresentation.project at line 208. 3 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/CompactBarPresentation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactBarPresentation.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c69d6a6a391d61eda9d7aaa58cf2460a7e98f7fe0aa7caab37dac911a060410"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/RuntimeEventState.swift: native/Sources/PacerCore/RuntimeEventState.swift changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in RuntimeEventState.consume at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/RuntimeEventState.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RuntimeEventState.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b518333b5400936d3cd4bd98284ceeb956d549ac250c01c17d73419f9df45af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/Resources/claude_activity.py: native/Sources/PacerCore/Resources/claude_activity.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in claude_activity.transcript_record at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/Resources/claude_activity.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e28c4810e881973e9fec1b6871042027656c3f3adebe0de886a6dacef4dfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/Resources/claude_hook.py: native/Sources/PacerCore/Resources/claude_hook.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in claude_hook.hook at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/Resources/claude_hook.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_hook.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c24709f2da8f03166092706dea78a6ae226b06a5abb5f9e347a0da48c236af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/PanelController.swift: native/Sources/PacerIsland/PanelController.swift changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in PanelController.layout at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/PanelController.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PanelController.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5112c1c08aa1438d739afa53e856d7f85f405d517ecfa21d2e50920bbf3fe746"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/PacerMain.swift: native/Sources/PacerIsland/PacerMain.swift changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in PacerMain.main at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/PacerMain.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/PacerMain.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c863d7bf54f75aa3ebd64d7ab14a81f068620dc9fa0d6e11dcf4ef5df61cc70d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsHarness.cs: windows/Desktop/SettingsHarness.cs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in SettingsWindow.RefreshHarnessProgressGuide at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsHarness.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"988c1023ecc0d3550447d5239d67d464c9fe12e625cb9c636c69a3b9862903fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/GuideContent.cs: windows/Desktop/GuideContent.cs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in GuideContent.Module at line 445. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/GuideContent.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"690a91f26b39a7e601ac2e49e51eb7ee91298e3c5142ef399871e46a3efbe4db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsCollapsed.cs: windows/Desktop/SettingsCollapsed.cs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in SettingsWindow.RefreshCollapsed at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsCollapsed.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCollapsed.cs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f02bfd42aae40b3482e19249e7de823208750f0029d38f353e647885174066"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsWindow.cs: windows/Desktop/SettingsWindow.cs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in SettingsWindow.RefreshValues at line 490. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsWindow.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad88f7f6688cb01f398adb314f94de211df3207d84dec3bf46d5e78231ef0b72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsPalette.cs: windows/Desktop/SettingsPalette.cs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in SettingsPalette.Apply at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsPalette.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPalette.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ed2cf01609b474253bfdbfca6e9f919325e199d20f9a9f3ef84f3a004f1cc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/IslandWindow.xaml.cs: windows/Desktop/IslandWindow.xaml.cs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in IslandWindow.Relayout at line 472. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/IslandWindow.xaml.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"852833b6420f79e8eaa1f352bba879e0186d77f6c5c85b95fac36c7a734ebc2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/IslandCompactBar.cs: windows/Desktop/IslandCompactBar.cs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in IslandWindow.UpdateCompactBar at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/IslandCompactBar.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandCompactBar.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e915bc2761215e901d6fd770467c717cc616d48f36db3402ba61a242c72cf5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/TaskProgressRing.cs: windows/Desktop/TaskProgressRing.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in TaskProgressRing.Apply at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/TaskProgressRing.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskProgressRing.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a57c9eaa24dafc7af914f64ce8d93116c854b6d0f4650736e706fb8c4630e90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/HarnessProgressGuide.swift: native/Sources/PacerCore/HarnessProgressGuide.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in HarnessProgressGuide.init at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/HarnessProgressGuide.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessProgressGuide.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f969e33c7bfbb8f33609c898f5cece379f501d00c796e271ecc38a545bc6b8d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/LocalHarnessProgressSetup.swift: native/Sources/PacerCore/LocalHarnessProgressSetup.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in LocalHarnessProgressSetup.apply at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/LocalHarnessProgressSetup.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalHarnessProgressSetup.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c056ee75d5f9449d18fa961cd6c4916f28a8edfeea262760eb2ff865e0a48510"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/WorkBuddyHarness.swift: native/Sources/PacerCore/WorkBuddyHarness.swift changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in WorkBuddyMonitor.project at line 666. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/WorkBuddyHarness.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyHarness.swift"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca16aaa090c92eae63739018868147969beaa55771ecf6b937070bd7bb40dab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/PreferencesCodec.cs: windows/Desktop/PreferencesCodec.cs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in PreferencesCodec.Decode 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/PreferencesCodec.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesCodec.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e08ce2c1baf3678398cb63488d1163c0b9205243a4ac97309fc76b4d04c52b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsReminders.cs: windows/Desktop/SettingsReminders.cs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in SettingsWindow.RefreshReminders at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsReminders.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsReminders.cs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef99cea4b6abbea9902efc8d5408d60986a47e8f787f89302188c6502cfba0c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsDeepSeek.cs: windows/Desktop/SettingsDeepSeek.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in SettingsWindow.RefreshDeepSeek at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsDeepSeek.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeek.cs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"750726c8fce2b0f4870a16f9dfa949f2265e2425ad9c4b4a72cccd7d6deeadf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/WindowsConversationApplication.cs: windows/Desktop/WindowsConversationApplication.cs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in WindowsConversationApplication.TryDestination at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/WindowsConversationApplication.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0afbcda45f91327c548026165b46ddcf2d65951951d33d30c2afa67950b09f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/LocalActivityReader.swift: native/Sources/PacerCore/LocalActivityReader.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in LocalActivityReader.read 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/LocalActivityReader.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/LocalActivityReader.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2185ec8ba506f30fabbfc8d40b2d121d95141f7b0d04f4f44eb033d4b9b612cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/CodexClient.swift: native/Sources/PacerCore/CodexClient.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CodexClient.setDurableProgressPlugin at line 252. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/CodexClient.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexClient.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3c2ced0d80d6383d5afa0a37510b356006aba29baf7333560bc8e22f0ea95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsActivityNavigation.swift: windows/EngineSupport/WindowsActivityNavigation.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in WindowsActivityNavigation.resolve at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsActivityNavigation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsActivityNavigation.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"779010101a45937f8890de83aa999ca460803c8f677f0ffbb63fd4f6f7bb2767"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift: native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in IslandModel.refreshDeepSeekBalance at line 283. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel\u002BDeepSeek.swift"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dcaae77e1d67ba0242a66e701e2f59d25834a60fc9f2166057ce2c1f405fc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/CompactIslandHeader.swift: native/Sources/PacerIsland/CompactIslandHeader.swift changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CompactIslandComponent.stripContent at line 323. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/CompactIslandHeader.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/CompactIslandHeader.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40cebe939b6996eb592577a274ee3c24e59e830fa87bb02d23e3f0015406177"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/Resources/claude_remote_setup.py: native/Sources/PacerCore/Resources/claude_remote_setup.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in claude_remote_setup.install at line 471. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/Resources/claude_remote_setup.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aeb18f0613e0c5133ae61e4e63ce531606ba7799e684354065c852755f48ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsConnections.cs: windows/Desktop/SettingsConnections.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in SettingsWindow.RefreshConnections at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsConnections.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsConnections.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9012a7f9e33bf1ed149e9fff062be598414b9a13af21155c33f255af62d4248b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/EngineClient.cs: windows/Desktop/EngineClient.cs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in EngineClient.Receive at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/EngineClient.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"820138a952ae9210d812d5028b38211c858be28bfbbce95676daffd9e01ef94d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeCloudProjectState.swift: native/Sources/PacerCore/ClaudeCloudProjectState.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ClaudeCloudProjectState.applyThread at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeCloudProjectState.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectState.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f35df9af71f2249e42281f5cf42362fd03ca97bb437cc3d21c7fdec56560ede"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/ActivityBadge.cs: windows/Desktop/ActivityBadge.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in ActivityBadge.Update at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/ActivityBadge.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ActivityBadge.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3f1fa23caa5f4999e6c0457f17fc5d6ea35e531d09428bec57b0bdd5e7e046"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/CompletionInbox.swift: native/Sources/PacerCore/CompletionInbox.swift changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in CompletionInbox.observe at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/CompletionInbox.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompletionInbox.swift"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"996b4059df85084431c85631c33062069a96097ea49a00de5f8368262148eaa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeActivityReader.swift: native/Sources/PacerCore/ClaudeActivityReader.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in ClaudeActivityReader.read at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeActivityReader.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityReader.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d117609b36368887cd1e55c642b9b34f1135500be8e43a2c9f454100eceb3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeHookInstaller.swift: native/Sources/PacerCore/ClaudeHookInstaller.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ClaudeHookInstaller.setPlugin at line 273. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeHookInstaller.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeHookInstaller.swift"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d51028785e76dddcfbc94cda824ec68964466a4d1801707cecf1cbeac21c76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsOverview.cs: windows/Desktop/SettingsOverview.cs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in SettingsWindow.RefreshBanner at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsOverview.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4593481915f5f19cb0ab7dbfbdd659c9e9626b2ccc30ee0850b6b20a50edb259"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeActivityMonitor.swift: native/Sources/PacerCore/ClaudeActivityMonitor.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ClaudeActivityMonitor.readLocal at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeActivityMonitor.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26e3be97aa226b58f13ed10af94443f5472ef4759b5cbecd94e995b31f04bc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/DeepSeekActivityState.swift: native/Sources/PacerCore/DeepSeekActivityState.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in DeepSeekActivityState.consume at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/DeepSeekActivityState.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekActivityState.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4def4074e4a910872a8c9cceb11199c3c8008727c7784b02747ab9a413658f2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsUpdates.cs: windows/Desktop/SettingsUpdates.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in SettingsWindow.RefreshUpdates at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsUpdates.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsUpdates.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af9bc18eef1fa6b002c0473bca20b71e2d18123296b03733b4c53b4298ee586"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsClaude.cs: windows/Desktop/SettingsClaude.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in SettingsWindow.RefreshClaude at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsClaude.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsClaude.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ef09525c8b021fec5faffaa32b97689d8de158025c7bab81926ec3ad1c344d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsSidebar.cs: windows/Desktop/SettingsSidebar.cs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SettingsWindow.RefreshSidebar at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsSidebar.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsSidebar.cs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53cd9987c55f5357a2c3129fec497c750790a14a27c0a000fe1719ac7da8a7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/AlternatingQuotaText.cs: windows/Desktop/AlternatingQuotaText.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in AlternatingQuotaText.Update at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/AlternatingQuotaText.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AlternatingQuotaText.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d516d9d896ada5d2b3631b21d6033b2067762312cc8deef41c17b99aae9e3d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsCodex.cs: windows/Desktop/SettingsCodex.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in SettingsWindow.RefreshCodex at line 172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsCodex.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ecc45b1ddf33ad47cde02ab9e80f3da3399a7e47fb35f4122d38c4fb6bfc9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsAppearance.cs: windows/Desktop/SettingsAppearance.cs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SettingsWindow.RefreshSurfaceStatus at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsAppearance.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsAppearance.cs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad4b3835ef3c35526753ba53547b4857f50fd6533728e424ede26d0144812bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ActivityTaskPresentation.swift: native/Sources/PacerCore/ActivityTaskPresentation.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ActivityTaskRowPresentation.init at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ActivityTaskPresentation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityTaskPresentation.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"781185f30f9d68f8c61e99fd3257df061c788b8db75df65acbd01429d74d47fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/WorkBuddyTranscript.swift: native/Sources/PacerCore/WorkBuddyTranscript.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in WorkBuddyTranscript.consume at line 198. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/WorkBuddyTranscript.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/WorkBuddyTranscript.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef2b32a93aa3586f12ad066e8d54287a8f7c3d8cf23c4807487196b923c6834"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/ActivityBadge.swift: native/Sources/PacerIsland/ActivityBadge.swift changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ActivityBadge.body at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/ActivityBadge.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d1556b9be8d4c4633e730005effd218743bcbfcc769039e277605254837915"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Maintenance/Program.cs: windows/Maintenance/Program.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Program.Main at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Maintenance/Program.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Maintenance/Program.cs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bf45ad76830e05abe7a94c96ed3da6245a6e24f8fa6fccf84a67645e14e132"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/IslandPanelSections.cs: windows/Desktop/IslandPanelSections.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in IslandWindow.RenderPanel at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/IslandPanelSections.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPanelSections.cs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"deca478d847ae4ebf87cc4f93d30cd66b28a750c0779965f9ca8a6fde54afa75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/Attention.swift: native/Sources/PacerCore/Attention.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AttentionPolicy.activityNotices at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/Attention.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Attention.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d992800b6e2bd1f92ce879e82882359d844889e1ecb4ff9085ef3bd46f559b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/WindowsInstallationOperations.cs: windows/Desktop/WindowsInstallationOperations.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in WindowsInstallationOperations.UninstallAsync at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/WindowsInstallationOperations.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0766d9c1c30116abd303492fbb89e33e16af09b71fbc182582199a37d3390ad9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/IslandGeometry.swift: native/Sources/PacerCore/IslandGeometry.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in IslandGeometry.arrange at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/IslandGeometry.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/IslandGeometry.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b4ad0561a941cbdefa76802845a48b818c1a377f05b474ebce7e2ab2655f74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeRemoteSetup.swift: native/Sources/PacerCore/ClaudeRemoteSetup.swift changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ClaudeRemoteSetup.status at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeRemoteSetup.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeRemoteSetup.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a201f286e2ae0d31fc9fab230952b5c1ca7791fbd3a481344e4f5bd7a7aea8b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/InstallerSupport/WindowsClaudeRuntimeStore.swift: windows/InstallerSupport/WindowsClaudeRuntimeStore.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in WindowsClaudeRuntimeStore.ensure at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/InstallerSupport/WindowsClaudeRuntimeStore.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeRuntimeStore.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c7643ccc82d1e3ed9b0c4d91efd223d5b45f7b7110598980fd987fc847e65f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/CodexProgressReporter.swift: native/Sources/PacerCore/CodexProgressReporter.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CodexProgressSetup.apply at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/CodexProgressReporter.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexProgressReporter.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"764df93d7ca3460b48fcc636ed6636e8668a30c1cf43297d02d09031175420cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/EngineGuidePages.swift: windows/EngineSupport/EngineGuidePages.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in EngineGuidePages.project at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/EngineGuidePages.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineGuidePages.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddff71235af35993420254ee8c45298749db8a587579d9703e37245157216a26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/WhatsNewView.swift: native/Sources/PacerIsland/WhatsNewView.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in WhatsNewItemRow.body at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/WhatsNewView.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/WhatsNewView.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"986f5440f379072a8afc4abea60f08a06539fd38d3ded3f7aafc5185a439d0d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsPanel.cs: windows/Desktop/SettingsPanel.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in SettingsWindow.PanelBlockButton at line 589. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsPanel.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPanel.cs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a39a7f8b40d05ee9c0396b67edf1c90d151f8206416f734c6cb94dd9eadbe2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/DeepSeekSessionLog.swift: native/Sources/PacerCore/DeepSeekSessionLog.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in DeepSeekSessionLog.parse at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/DeepSeekSessionLog.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionLog.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4198fc4760c5cdab4e8a5e975bf81b7bb1d4fe7e054d6c2d57ceb428d58e2a63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsWSL.swift: windows/EngineSupport/WindowsWSL.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in WindowsWSLServices.discover at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsWSL.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsWSL.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8d11b1084b8107ebeedfbb581ff0963fe96d056cf2d02bb00cdc514da0bfe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeActivityTelemetry.swift: native/Sources/PacerCore/ClaudeActivityTelemetry.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in ClaudeActivityTelemetry.request at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeActivityTelemetry.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityTelemetry.swift"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a5ba1d71c29fb06b78f0715146d3dec4e8e3d0c7f35d08352cd20883cab69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/windows/check-contract.py: scripts/windows/check-contract.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in check-contract.source_contract at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/windows/check-contract.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/windows/check-contract.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfefd4846342a313ed0bac976719c88fe48e9833dd4d62d70e12bc51626143b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/WindowsUpdateService.cs: windows/Desktop/WindowsUpdateService.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in WindowsUpdateService.CheckCore at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/WindowsUpdateService.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"908bf4f3c4f1e004678da04d1c30746ce2900c92a9c8c3ff08c89eed4359dbe3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerMacSupport/MacDurableCatalog.swift: native/Sources/PacerMacSupport/MacDurableCatalog.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MacDurableCatalog.observe at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerMacSupport/MacDurableCatalog.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableCatalog.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed121d67a42fd1ea03cd64eb508dc03140aadcbd2ba539663fa924026cbfbe6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift: native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ClaudeCloudProjectMonitor.pollOnce at line 132. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fd388f2539da6fb6abe7286e723790e8e4abd64fba5b75a6f109456b6d4b42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/HarnessAccountCard.cs: windows/Desktop/HarnessAccountCard.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in HarnessAccountCard.Build at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/HarnessAccountCard.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HarnessAccountCard.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"905876a1706dc7bcf20db07efd59e2cb50b6af045e278a726342c21702e17184"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/RemoteActivityTarget.swift: native/Sources/PacerCore/RemoteActivityTarget.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in RemoteActivityTarget.configuration at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/RemoteActivityTarget.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteActivityTarget.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"148f411cda4b9f0cbc7e7caeefaf6c8d117a187b86ed0c7a2ccffead87269d53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerMacSupport/NativeDesktopCollector.swift: native/Sources/PacerMacSupport/NativeDesktopCollector.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in NativeDesktopCollector.run at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerMacSupport/NativeDesktopCollector.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/NativeDesktopCollector.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ebea1d4346ed1e15ea8e955c039cec6ef0018b16adad3118410131a03603de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/EngineShellProjection.swift: windows/EngineSupport/EngineShellProjection.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in EngineShellProjection.reply at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/EngineShellProjection.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineShellProjection.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5f33d18a78e87dc92c506aded6e90376167a81f2808a20976636c99d181916"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/InstallerHooks/main.swift: windows/InstallerHooks/main.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in main.swift.top-level code at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/InstallerHooks/main.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerHooks/main.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"86982e69ca2d92d7e0b4b0cb198e834006f3dea9ad1284d693b1cc3b3ba92f56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/CodexSessionOrigin.swift: native/Sources/PacerCore/CodexSessionOrigin.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in CodexRolloutMetadata.read at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/CodexSessionOrigin.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CodexSessionOrigin.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce0ac56614f24debdd1e97f690f690b2dff2c1089ea6e5f1405631b9b86bf1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/diagnostics/test-codex-progress.py: scripts/diagnostics/test-codex-progress.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in test-codex-progress.run at line 571. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/diagnostics/test-codex-progress.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/diagnostics/test-codex-progress.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ff11ac8ab46932a67b14b39f945831dd4588fe9dc3d46457529acd8b40c767"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/QuotaCycleChart.swift: native/Sources/PacerIsland/QuotaCycleChart.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in QuotaCycleChart.chart at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/QuotaCycleChart.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/QuotaCycleChart.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ab1eb9732eaaafe110bc5da2475ddc81a7874f68673870aec0b91a0d5fa5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/SelfReportedProgress.swift: native/Sources/PacerCore/SelfReportedProgress.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in TaskProgressRing.make at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/SelfReportedProgress.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/SelfReportedProgress.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15ee4f89b456daa6f091fe08d36d9a6538b9ea410e4844e2ac251d0d1d61401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/RemoteControlCatalog.swift: native/Sources/PacerCore/RemoteControlCatalog.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in RemoteControlCatalog.refresh at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/RemoteControlCatalog.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlCatalog.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f318154f0e11cd2eeb2e20df34274292acec5291d72b0f2830a125654658d585"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/QuotaDial.cs: windows/Desktop/QuotaDial.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in QuotaCell.QuotaCell.ctor at line 329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/QuotaDial.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bd4a0d693f9f5d42253c7c3eb7d0891426533d71da3d0719dfa913fb8e4f00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/RemoteControlActivityTarget.swift: native/Sources/PacerCore/RemoteControlActivityTarget.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RemoteControlActivityTarget.configured at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/RemoteControlActivityTarget.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlActivityTarget.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c0f9a87f52ffa8fa8862aff2c762c5814ac40c192efa824573a0a4977f834b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/GuideWindow.cs: windows/Desktop/GuideWindow.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in GuideWindow.GuideWindow.ctor at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/GuideWindow.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideWindow.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"626e96785e81c96c6e386e3e11e93496885c9346b126e7a9ccb265394946b3b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/CompactBarContext.swift: native/Sources/PacerCore/CompactBarContext.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in CompactBarContext.init at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/CompactBarContext.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactBarContext.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de561e8447a42fb9ef840f81f7a0889294f91ee420a60530e0d02525c1e61c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/CompactWarningPresentation.swift: native/Sources/PacerCore/CompactWarningPresentation.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in CompactWarningPresentation.items at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/CompactWarningPresentation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/CompactWarningPresentation.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4153fb4568277d68efa8cc0bc1a55064086284d95f569092513a57ec9b880e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ActivitySourceMerger.swift: native/Sources/PacerCore/ActivitySourceMerger.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ActivitySourceMerger.merge at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ActivitySourceMerger.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivitySourceMerger.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd717092c7af9403116e2581c1b62cc81df5d72ea5cbf76f05f94bb047836aa9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ActivityApplicationState.swift: native/Sources/PacerCore/ActivityApplicationState.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ActivityApplicationState.reconcile at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ActivityApplicationState.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityApplicationState.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd559229cc9d5166b1e192f17c9a3a25c268253715b29228363c499f5e9916fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsDeepSeekConnection.cs: windows/Desktop/SettingsDeepSeekConnection.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in SettingsWindow.BuildDeepSeekConnection at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsDeepSeekConnection.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsDeepSeekConnection.cs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"361a859aa4f08fe3045b64bf1d69af8dd8a9bbb4d8720d4f8bbeaed65ffb38cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/QuotaDashboardPresentation.swift: native/Sources/PacerCore/QuotaDashboardPresentation.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Reading.init at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/QuotaDashboardPresentation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/QuotaDashboardPresentation.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"07efa1be737984fd66c1e9b0d706c09a7854da5fdee5c49a9ff4bb56c8cb61c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/UpdateSupport/UpdateHandoff.cs: windows/UpdateSupport/UpdateHandoff.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in UpdateHandoff.Apply at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/UpdateSupport/UpdateHandoff.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateHandoff.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"669b57f915b794a5b7205170b473d3a958672a301e9e0422041fbaa0a81607e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift: native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in DeepSeekBalanceCoordinator.refreshIfDue at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekBalanceCoordinator.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"08899b81838bc476b811e2df96ff0d2b4405db9ca86e67dd220e0eeabbd5d770"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsHTTPStream.swift: windows/EngineSupport/WindowsHTTPStream.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in WindowsHTTPProxy.forHTTPS at line 170. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsHTTPStream.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPStream.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e6ecc9ec9f531be05c47037654db1fa154fa398c56dceceee9b7012575ce3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/windows/check-engine-idle.py: scripts/windows/check-engine-idle.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in check-engine-idle.check at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/windows/check-engine-idle.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/windows/check-engine-idle.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baa710c5bdcef45461cdc8d1f9d3dbb36930153a478375909fab98ce879a526"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/DeepSeekQuotaCell.cs: windows/Desktop/DeepSeekQuotaCell.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DeepSeekQuotaCell.DeepSeekQuotaCell.ctor at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/DeepSeekQuotaCell.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekQuotaCell.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05c2b93f6bf962d963a7d9d928e2444c40732a3ae7306df206f58e78c1364e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ResponsePerformance.swift: native/Sources/PacerCore/ResponsePerformance.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ResponsePerformanceMeter.observeRuntime at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ResponsePerformance.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ResponsePerformance.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c170c0b74b4b3264fcae929dc7e67700754ec319247f2eaf9a46c24b80faab98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/SettingsProgressGuide.swift: native/Sources/PacerIsland/SettingsProgressGuide.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ProgressGuideBody.stepRow at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/SettingsProgressGuide.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsProgressGuide.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0a2e38b9247022e34ad50370469391c1fdb3fbab3791d6ebd00620791a07f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsDesktopCollector.swift: windows/EngineSupport/WindowsDesktopCollector.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WindowsDesktopCollector.start at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsDesktopCollector.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDesktopCollector.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ce0a075d1b72138a07bdbb64fd985fec10bdf98bab15d7afc3af5ce286059e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/AppWindowsUpdates.cs: windows/Desktop/AppWindowsUpdates.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in App.StartWindowsUpdaterAsync at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/AppWindowsUpdates.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AppWindowsUpdates.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0557ca4f32fd595dfadc02504ee383e2eec60be72eb314d884d91c20a56d4077"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/ProviderLoginWindow.cs: windows/Desktop/ProviderLoginWindow.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ProviderLoginWindow.ObserveAsync at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/ProviderLoginWindow.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ProviderLoginWindow.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4461061b3cfc9576a887d2647aaba6d4f12a4bed952b9f5da064e837fde1bcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsClaudeConnection.cs: windows/Desktop/SettingsClaudeConnection.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in SettingsWindow.RefreshClaudeConnection at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsClaudeConnection.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsClaudeConnection.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e79f78376967f382c2b14b310e22d340024c5c97bf9373c5be6b4b76e737ce0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/DeepSeekActivityMonitor.swift: native/Sources/PacerCore/DeepSeekActivityMonitor.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DeepSeekActivityMonitor.read at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/DeepSeekActivityMonitor.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekActivityMonitor.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b85ca9e53a18b538064bcaa533885159fdc634ad99fb5c3675721e285ba93d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ActivityLogWatcher.swift: native/Sources/PacerCore/ActivityLogWatcher.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ActivityLogWatcher.update at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ActivityLogWatcher.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityLogWatcher.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"de798dd93e672333cfbf5f29b9be35a425c2b62bc8a730186a7cdd3312339f31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/ClaudeConversationOpener.swift: native/Sources/PacerIsland/ClaudeConversationOpener.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ClaudeConversationOpener.open at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/ClaudeConversationOpener.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ClaudeConversationOpener.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf3dbdba1bd9f22d884bbdea032b083c711ff86a3fef68260ccae6deed2e0c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerMacSupport/MacDurableProgressSetup.swift: native/Sources/PacerMacSupport/MacDurableProgressSetup.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MacDurableProgressSetup.reconcile at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerMacSupport/MacDurableProgressSetup.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableProgressSetup.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9a2c0bd5b984166e92932a3bcf37fd4eec2bbf6f48c3d53b398f01ecde698e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/InstallerSupport/Resources/pacer-codex-progress.py: windows/InstallerSupport/Resources/pacer-codex-progress.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in pacer-codex-progress.respond at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/InstallerSupport/Resources/pacer-codex-progress.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/Resources/pacer-codex-progress.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd7e5c777a60f421ab8bc670ac82047609fa405915f608869b5f235147974fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/SettingsProviderHome.cs: windows/Desktop/SettingsProviderHome.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SettingsWindow.InspectProviderHome at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/SettingsProviderHome.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsProviderHome.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2083107e36c87439ac4f2f42244c54d936b354dc3055adbc6c364972c9902f89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/PreferencesStore.cs: windows/Desktop/PreferencesStore.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in PreferencesStore.Save at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/PreferencesStore.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9eaf9574524f45ed793e0c4afc703a1df0186c51b547f436ca8d2f38072f61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsClaudeRemoteSetup.swift: windows/EngineSupport/WindowsClaudeRemoteSetup.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WindowsClaudeRemoteCoordinator.finished at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsClaudeRemoteSetup.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsClaudeRemoteSetup.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"516f0b72812a1436a77b8b16a0f356a7ba27fe8b7b3c31f50da75a9bb5a3462c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeLiveSessionRegistry.swift: native/Sources/PacerCore/ClaudeLiveSessionRegistry.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ClaudeLiveSessionRegistry.holders 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeLiveSessionRegistry.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeLiveSessionRegistry.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f9503655c9140de6cf4373fbd848add04fcca1859ffe16826df095a38ac12f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsProviderInstallation.swift: windows/EngineSupport/WindowsProviderInstallation.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in WindowsProviderInstallation.detect at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsProviderInstallation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsProviderInstallation.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bea3d7e9d07b658fbb525e94fcc3f1c06ffffc9fd565aaf48e0c01b1bacbeb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerIsland/HarnessGuideFloat.swift: native/Sources/PacerIsland/HarnessGuideFloat.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in HarnessGuideFloat.update at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerIsland/HarnessGuideFloat.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/HarnessGuideFloat.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aed7adbb8a1215ab54db97c24b22894563f4c3917dd9a8d01ea3c8b9e92a55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ModelDisplay.swift: native/Sources/PacerCore/ModelDisplay.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ModelDisplay.name at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ModelDisplay.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ModelDisplay.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d935005e9c69e042fcd3c1793044fdd86aececc973a5432a1cd1608e58988b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/IslandPlacementGeometry.cs: windows/Desktop/IslandPlacementGeometry.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in IslandPlacementGeometry.Arrange at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/IslandPlacementGeometry.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPlacementGeometry.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade6d1e783906020e838e1cf02f2e7444f96bd563f77c724796aa90610039350"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/DeepSeekSoloView.cs: windows/Desktop/DeepSeekSoloView.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DeepSeekSoloView.DeepSeekSoloView.ctor at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/DeepSeekSoloView.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekSoloView.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb9f9461fabd9dc8b43ea76f5f1553ca457d37471c9fe631628d69fa8fe387c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/EngineSnapshotEmission.swift: windows/EngineSupport/EngineSnapshotEmission.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in EngineSnapshotEmission.equal at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/EngineSnapshotEmission.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineSnapshotEmission.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"873ee9a18eb9d84ec2d4b61976dc35f470b68227c265eee6f3c79b7c4b79771b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsHTTPClient.swift: windows/EngineSupport/WindowsHTTPClient.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WindowsHTTPClient.data at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsHTTPClient.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsHTTPClient.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"408b59b4347cb856b70e6f0b94f95987655852bcbea2849dfbfaed4b1c0f8c6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/DeepSeekSessionReader.swift: native/Sources/PacerCore/DeepSeekSessionReader.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DeepSeekSessionReader.readFrames at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/DeepSeekSessionReader.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DeepSeekSessionReader.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2348cbcd591b7334832cf95dc40e03938b0236fc2a13f6a91789b5335ae93a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/Resources/workbuddy-account-credits.js: native/Sources/PacerCore/Resources/workbuddy-account-credits.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in workbuddy-account-credits.readGroups at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/Resources/workbuddy-account-credits.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":"native/Sources/PacerCore/Resources/workbuddy-account-credits.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ee5f577caa34f57265a9e5bb5931e8318f5e6cf36caed56e9c913ecec163f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ExpandedPanelPresentation.swift: native/Sources/PacerCore/ExpandedPanelPresentation.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ExpandedPanelPresentation.project at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ExpandedPanelPresentation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ExpandedPanelPresentation.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a265339b7a4ea10bd8b63ed98556f97131baf4990bcd2b2feea6bf5b728ce85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/EngineSupport/WindowsDurableCatalog.swift: windows/EngineSupport/WindowsDurableCatalog.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in WindowsDurableCatalog.observe at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/EngineSupport/WindowsDurableCatalog.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/WindowsDurableCatalog.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f65214151eb534f9fb207197a1d6d4948f58e660e505eceff98e2919063ebf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/ClaudeSSHDiscovery.swift: native/Sources/PacerCore/ClaudeSSHDiscovery.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ClaudeSSHDiscovery.configurations at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/ClaudeSSHDiscovery.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeSSHDiscovery.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd644eee663a86a1be1b2654da40e14e8b92cd3b38c25e39dcf5e0735543c50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/InstallerSupport/WindowsClaudeHookCommands.swift: windows/InstallerSupport/WindowsClaudeHookCommands.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WindowsClaudeHookCommands.owned at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/InstallerSupport/WindowsClaudeHookCommands.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/WindowsClaudeHookCommands.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b3f9706d4de4d44f3f14d91ce2edb4fe7de0a4cb3facd2f45800611bdee528"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/WindowsInstanceActivation.cs: windows/Desktop/WindowsInstanceActivation.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in WindowsInstanceActivation.Receive at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/WindowsInstanceActivation.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstanceActivation.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2781f672abfd5b4ca2da646201d5dc2e090f71f65c62f82ab1f0f1fd1769a74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/SessionIndex.swift: native/Sources/PacerCore/SessionIndex.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in SessionIndex.entries at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/SessionIndex.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/SessionIndex.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d740dd9e1ca5668506187893a2fa1984026e5b8ea33a2e81a9def9cf3799ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/HarnessCreditsNoticePolicy.swift: native/Sources/PacerCore/HarnessCreditsNoticePolicy.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in HarnessCreditsNoticePolicy.notices at line 23. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/HarnessCreditsNoticePolicy.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/HarnessCreditsNoticePolicy.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d1b3b6eac34e2ec2cb1bb01d8ce935a665cb3504b0e1fd14fd45c9cfcb632d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/CompactWarningsView.cs: windows/Desktop/CompactWarningsView.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CompactWarningsView.Update at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/CompactWarningsView.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactWarningsView.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e79ec2db8c954bfda6b79477e0a93d2ea8e832db5232e3434452d39d26712f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/DeepSeekBalanceStatusView.cs: windows/Desktop/DeepSeekBalanceStatusView.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DeepSeekBalanceStatusView.DeepSeekBalanceStatusView.ctor at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/DeepSeekBalanceStatusView.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekBalanceStatusView.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1f93c55c113bc90e04b692d43bcd0318182405a06b11381a8bcf8f7cb8892e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: windows/Desktop/QuotaConnectionView.cs: windows/Desktop/QuotaConnectionView.cs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in QuotaConnectionView.QuotaConnectionView.ctor at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/Desktop/QuotaConnectionView.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaConnectionView.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc7e406fe7bc68bd5c48192f27b2fd4b81e0697d9a834a40516a7947ee4d8a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: native/Sources/PacerCore/DurableActivityCatalog.swift: native/Sources/PacerCore/DurableActivityCatalog.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DurableActivityCatalog.page at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/DurableActivityCatalog.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DurableActivityCatalog.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2728efa828b0b934f22ce004dc66e3cf0005ba4c81f77a2005c1e2c45d16ad44"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/windows/test-claude-runtime.py: scripts/windows/test-claude-runtime.py changed 7 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 5 (its worst body is test-claude-runtime.select_slow_form at line 66), 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 Codex progress lifecycle and Windows maintenance\u201D; \u201Cfix(windows): forward Claude renderers through their shell\u201D; \u201Cfix(windows): tier Claude launchers without MSYS switches\u201D; \u201Cfix(windows): retain long-path safety in Claude runtime cleanup\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/windows/test-claude-runtime.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/windows/test-claude-runtime.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2167fba50a0914cf29753e93ab9606d1dd9a8b40c158cd740fd96421101f333"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: native/Sources/PacerCore/IslandMotion.swift: native/Sources/PacerCore/IslandMotion.swift changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is IslandMotion.sample at line 56), 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: restore Mac geometry imports and isolate Windows hashing\u201D; \u201CAdd Custom screen positions and fix Claude next-step box endings for 3.2.0\u201D; \u201Cfix: smooth island transitions and prevent duplicate instances\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- native/Sources/PacerCore/IslandMotion.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/IslandMotion.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7c0ff657134a7a2dd789a27bfe03e0ebf811ffdb05bad3927d0238598fffe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: windows/InstallerSupport/Resources/windows_claude_bootstrap.py: windows/InstallerSupport/Resources/windows_claude_bootstrap.py 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 11 (its worst body is windows_claude_bootstrap.private_open at line 131), 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(windows): bound Claude file ownership to token privileges\u201D; \u201Cfix(windows): forward Claude renderers through their shell\u201D; \u201Cfix(windows): request metadata access for Claude helper writes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:52:52 \u002B08:00\u0027 --until=\u00272026-11-16 15:52:52 \u002B08:00\u0027 --full-history --no-merges -- windows/InstallerSupport/Resources/windows_claude_bootstrap.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/InstallerSupport/Resources/windows_claude_bootstrap.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e125a654a39f93673b5436d6bdec26bdd45feb669d84a0e014fcb37a4b913edc"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/AccentPalette.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d63123134038ecf83fa17b8af94f43129ec6ba273ae63e1aff5028be3877d8d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ea4e0c92cb2aa0468ced75d15b91f6eeff5c3d3d38c703f86df85d6fa1db05"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d2df5e82d016537a963500bf20db92344a8bdf293f2c4bbbfdd42fc498fb36"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"384df1bb0d080ffc41a6070b41728d1fd9bfda966ae5d299b28eb772426fb780"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/BackdropController.cs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc406054cdaa6e996046248933b0bee8b77cff0ae848e5877612c4a40bd349b"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/BackdropSystemSource.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"63478ca573606ef01b25150d98d8d5b061e20434a7422b675bc93822d5100624"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/BackdropSystemSource.cs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1b892d99c35e6b209fd0b77560d2727ffe81d4f5e8a320037588b43a8b4f1f"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/BackdropSystemSource.cs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa51a63b9b02eb45b4fceb1ad7610e5295df8753d7fb5dcc4009fcea736cd4d7"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a860b1950ba761732eaa64d278affc2df7b1e48c2a1f4f1263b16f22ff4e8c1d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekConnectionCoordinator.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d18d00ca1fa47ef4b714cc499e10f617d98758697a99967a5aa15c3e6da877"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1f1fab9090fc026ee9f8b23f3e7efef87a18b12fe1c18b97a9455f6dcf554e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a3a786c681110789fd3db511baa6566c9478bc5436ed0a00111b6ecee225b5"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf85d64270be3cbbc2c9b5772a1b6ee8f23a9296d28a4ff5e14cf497efcfe104"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6283f54fabece39429cda9bf2bc85383451989b7aeb5a559d3e61a165a97667c"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineClient.cs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5e8e22a9721d2e7d602bc0f8734fca3b2aad9b38897193eced22228bc9bfef"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineCrashLog.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6502bcc4aab8168f004a1a5a3133dfd123eb1be2eb04dea9dfbd10b23c3ab0"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineCrashLog.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc3b832c21a5da47eaf7bea6cb44197542a0f6a9866fcdba39922d95fc62c32"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/FileQuarantine.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7e5d54fede35ecacab6a6cc9b84461763394553551af8d8e49db2899058337"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/FileQuarantine.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"155b5a6f4034ade86abb5013eaaddb4fbefc55c98aeeb7f787c638af51610734"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HarnessGuideFloat.cs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff43a1cca8d701a5e1a8bce101d1bee5685fbc735562b2abef660943154b7d4"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96cc87ef0929ee8a0ac5830aa61815348e503cbf4e1c13f1a70bb8e7f5f1530"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed853e3fc0d11d4b23a3bda2508ccf09f34550d1f7f37f336e5107b23dd456e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandWindow.xaml.cs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fc018910f2e78f7c1196cd32a8ea17b52e5a0e443aedb18b98b49a2173a632"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f194032a5342b1a119219aea563a5f794cf0f261e64c52bd371db214124428"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8dfe1b64fca5ad39dee00135eb5730d8c269bbc62c1e26975e09612f7e6a25"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ProviderLoginWindow.cs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"889db03a44e257fe7ad9b8c71784d7b7fc05c5870fb58d8a83e1e048fc486e91"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38eb3f50a13ea6832806c6758ec220dea39c2bf2318e6c98227e7d70d7e594a"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"572f7e8512156658ee35eb629b1785f80fe980a2c750244b259347de165d09c1"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/UpdateWindow.cs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f6d5cacbb056c64608ac4c68795a2c28bfa7dc72c71db774de51e5180ad4b8"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39bff093482b613531d3c53cd41ec7081f47b00f96a550cef90e92a09cda45e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8af2baef998d7775c6f34cbec559251b9fd28d3e8745e5243a2c29ec80c2db"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationIdentity.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74efaea4376c3d62e28e330d39eeb8603e444d5e9cc694690196d67bad15af9"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationIdentity.cs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c1bc1b94374c22573346e222bec0965276eed5814cf615386f0a4b6eb02e1d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dea0dfe1d556ad22cde9a62c22af65968ce94abc05704d6fc2579a51aac57d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d919674a3b63172e24fa135d6e88126afc4c23316551dca05e0a22c336e75c"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"608d6d4c962e554ae12849fa97c7ce6aae127c35db7d825ab703cda7cb17b529"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsInstallationOperations.cs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c5ca1ea13e0886d9d58e4fa5af51ae4944f18c660783d6551248b6e0823bb5"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSshTerminal.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f50632de0e4ba5cf31a4f10d331a1d60b32273f1a10b6781241f2cdc77458b"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSystemNotifications.cs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f75aaf4a372807960abd35ee3fee431276bb68ae93dcb9a4da4bbccf9235a9"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSystemNotifications.cs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"313537513bacc89bd3bc1cb195184bfae4ed5c250c846b77612d7c11b6443e8d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"771a207322baa804eef309b2dbce7d873b4b3c825de4792226bfe4d036c23ff9"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"684c11d618dccd77cb350d772d4dbe16bedeb2ae0371c3d5c7862dd350ee61b8"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c6b39925eb4644a047fd592749a24d6c170ade85ca9b4357d8979003963d43"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"46280fd7a00e1ffee9939b6cebfc9757728cc1e88cebb4c95a9f87494d505fa5"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc93e9f599fbbfe96f482daf1260e41171863cc0d2aef6a0756eb85a000dbf59"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsWslTerminal.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca4164297f68486a79d440ac6ed760590767915401b48757c33f4729a9d71f5"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateFeedClient.cs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b960f3f492cf9b0bc5b153297c8117fd72417cc12a14fff03908d19d47522"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateHandoff.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eedd3e274dfcb54bf5ee41c400c5f587edd5896b46d189c46d1aba5d4ae468c"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateHandoff.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec9db5917a351c3926232c6286d78e6e393e9a3b0d3e43201b3514f0a2d27ac"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateHandoff.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc42d29b4990234fd945c5a210bf226b8cf99aceaa71e329c4102c42911ebb69"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateHandoff.cs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"81af0b46150211e0e2fb4975d6374017775fa5f6e69625a671f172a10ceee8f9"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private bool attached \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactLayoutEditorView.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"46445dbe8d382b4f27a0d16f31356877b407cf9d3109bf3e2e8bc8d51f4ab68e"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private GuideCatalog catalog \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideWindow.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fb150de8d764f9077f8623c5f5490ea6ba8b22438fbf1dd2aa7a206bba0816"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private System.Windows.Threading.DispatcherTimer? poll \u2014 assigned 2 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HarnessGuideFloat.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"35723dbbca2ef8449cf304927a41d302cb0bc0c1887e114507592f419113816b"}},{"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 \u0060windows/Desktop/Pacer.Windows.csproj\u0060 makes this repository a deployable product (line 4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/Pacer.Windows.csproj"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7fd5e5452e6ce4e66702162cdcf2b9fcfd17ad711898f991ee7157bb584178"}},{"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":"86027dc27407f3a3f24358dfdca7f5269b097815d456fbd9f725d8123b0c2093"},"properties":{"commitSha":"0ddd74b64c3d09f041980af3862ebfeb78b60a51"}},{"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":"fbb3d02150917d36cec84ef09a50e3269b3a90027a113ff6a819862a9fecae20"},"properties":{"commitSha":"bfbf0d30b906983441b050cd71993cc399954c20"}},{"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":"7304bf8369a93ac6facbd7d6e29a12e8b3f2165a6ab057a7c1c93b9fd5404143"},"properties":{"commitSha":"0ddd74b64c3d09f041980af3862ebfeb78b60a51"}},{"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":"6a3343033bf8a2487c3e93121f32883a6f846be0f74e551b48ec1355f891c00c"},"properties":{"commitSha":"bfbf0d30b906983441b050cd71993cc399954c20"}},{"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":"0f5ff3f4391a21d94f5bbc4313e64b048e8331377f7a9c4df875c05ca043fb92"},"taxa":[{"id":"CWE-73","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b437485756074e2170b160f89554c184a97de729bda1e1b7dab43b44067ba5"},"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":"4a64cd261625d1ee27e9a61d9d339d41efc4a40b0d339b80b84fd64e570225ff"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"264b1011371c9955e36a1589bc00e60b1cf38de827107b2456b87b3cd28ff145"},"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":"D35","level":"warning","message":{"text":"Change coupling: Activity.swift \u2194 SessionLogProbe.swift: \u0060native/Sources/PacerCore/Activity.swift\u0060 and \u0060native/Sources/PacerCore/SessionLogProbe.swift\u0060 change together 90% of the time (9 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006020b2bc0b\u0060 Keep task model metadata tied to its turn; \u006033d0c63a\u0060 Show model and reasoning effort on task rows; \u006004646202\u0060 Stabilize first-output timing and use age-based throughput colors \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae760586b9686de5fb72c7216435c86f1e0456d0b44123e096efa8e07c2859b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: SettingsView.swift \u2192 CompactLayoutEditor.swift, IslandView.swift, PanelController.swift, WhatsNewView.swift: \u0060native/Sources/PacerIsland/SettingsView.swift\u0060 changes together with 4 other files \u2014 \u0060native/Sources/PacerIsland/CompactLayoutEditor.swift\u0060, \u0060native/Sources/PacerIsland/IslandView.swift\u0060, \u0060native/Sources/PacerIsland/PanelController.swift\u0060, \u0060native/Sources/PacerIsland/WhatsNewView.swift\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a854a9606b948096487f26f22bdfe3fc97463465c976298a8a13787c6e7b518"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Activity.swift \u2194 DesktopWireProjection.swift: \u0060native/Sources/PacerCore/Activity.swift\u0060 and \u0060native/Sources/PacerCore/DesktopWireProjection.swift\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006020b2bc0b\u0060 Keep task model metadata tied to its turn; \u006033d0c63a\u0060 Show model and reasoning effort on task rows; \u006086543957\u0060 Keep ended child tasks ended across Desktop replays \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Activity.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fb5ca2b6b648b37c8720becdfe3f7a4b2d5abba0b570d26d6264a8696243fc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: IslandModel.swift \u2194 TaskRowView.swift: \u0060native/Sources/PacerIsland/IslandModel.swift\u0060 and \u0060native/Sources/PacerIsland/TaskRowView.swift\u0060 change together 62% of the time (13 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u006014021a91\u0060 Build the expanded panel\u0027s blocks and its settings page on the Mac; \u006075b74e73\u0060 Show Claude\u0027s self-reported progress ring on the Mac; \u00603a90afd6\u0060 refactor: share activity state and task presentation \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dabc303fc67c13710ffb3e0e0e4b635a09fc8c5fbaee3b7b2e9a279174e6ec"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: RealtimeProbe.swift \u2192 DesktopWireProjection.swift, WhatsNew.swift, WhatsNewView.swift: \u0060native/Sources/PacerCore/RealtimeProbe.swift\u0060 changes together with 3 other files \u2014 \u0060native/Sources/PacerCore/DesktopWireProjection.swift\u0060, \u0060native/Sources/PacerCore/WhatsNew.swift\u0060, \u0060native/Sources/PacerIsland/WhatsNewView.swift\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":"native/Sources/PacerCore/RealtimeProbe.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82942b840e478645563840a37283ffe18e591709a9a138af00179f2c4097aca"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: GuideContent.cs \u2194 SettingsOverview.cs: \u0060windows/Desktop/GuideContent.cs\u0060 and \u0060windows/Desktop/SettingsOverview.cs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060d338bb34\u0060 Show where to get Pacer when an update check or download fails; \u00609ba5f5f3\u0060 Guide the WorkBuddy progress ring through its one manual step on Windows; \u00606866deeb\u0060 Port the Mac\u0027s live Collapsed Bar preview and remaining page details \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideContent.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c7d214925f8a5ce8f367a8051b1af492cfa725b8073d4aea7e052182919d37"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SessionLogProbe.swift \u2194 PacerMain.swift: \u0060native/Sources/PacerCore/SessionLogProbe.swift\u0060 and \u0060native/Sources/PacerIsland/PacerMain.swift\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060fd999bb2\u0060 Fix subagent task grouping and retain displayed throughput; \u0060e35d3d91\u0060 feat: update local and SSH tasks through persistent subscriptions (at that commit the file was still \u0060native/Sources/PacerCore/RemoteProbe.swift\u0060); \u006007ff3813\u0060 feat: add opt-in runtime event subscription experiment (at that commit the file was still \u0060native/Sources/PacerCore/RemoteProbe.swift\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/SessionLogProbe.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dd264a6f21880041163a076786d73a1ac02eaaee26d8250fcb22de81d546c3"}},{"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":"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":"AX2","level":"warning","message":{"text":"Stateful shared instance: HarnessGuideFloat: \u0060HarnessGuideFloat\u0060 keeps one instance of itself in the static \u0060current\u0060, so that one instance serves the whole process and is shared by every thread that reaches it \u2014 and it mutates instance state outside any lock (key, Presented; e.g. \u0060key\u0060 at line 160)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/HarnessGuideFloat.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c62589ec35f7a205b6f90f578b4f2b06c244602d1e5aebf73352edbdd0e2f5b"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful shared instance: NativeCompactBar: \u0060NativeCompactBar\u0060 keeps one instance of itself in the static \u0060SharedValue\u0060, so that one instance serves the whole process and is shared by every thread that reaches it \u2014 and it mutates instance state outside any lock (previous, lastCached, previousClient, LastPending; e.g. \u0060previous\u0060 at line 69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/NativeCompactBar.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc796fcdcee5c5ad0631f65056090300db1574da29749ad0848b786790766a2"}},{"ruleId":"AX2","level":"warning","message":{"text":"Process-global static state: PacerPalette: \u0060PacerPalette\u0060 keeps mutable \u0060static\u0060 state \u2014 one slot for the whole process, shared by every thread that reaches the type however its instances are created \u2014 and mutates it outside any lock (modules, Accent, Light, Primary, Secondary, Tertiary; e.g. \u0060modules\u0060 at line 92). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PacerPalette.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"497de6aa5c0aa87773c8d187d24419eb7cb4225334ab494382151e0349022804"}},{"ruleId":"AX2","level":"warning","message":{"text":"Process-global static state: ProviderIcon: \u0060ProviderIcon\u0060 keeps mutable \u0060static\u0060 state \u2014 one slot for the whole process, shared by every thread that reaches the type however its instances are created \u2014 and mutates it outside any lock (Sources; e.g. \u0060Sources\u0060 at line 30). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ProviderIcon.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e064ee056a0a32afbcea35fef8ae2f8d9023baba95ec144564140be9c7faa5d0"}},{"ruleId":"AX2","level":"warning","message":{"text":"Process-global static state: SettingsWindow: \u0060SettingsWindow\u0060 keeps mutable \u0060static\u0060 state \u2014 one slot for the whole process, shared by every thread that reaches the type however its instances are created \u2014 and mutates it outside any lock (openedHarnessConnectors, restartingHarnessApps, checkingHarnessApps, rememberedAboutTab; e.g. \u0060openedHarnessConnectors\u0060 at line 367). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsAppearance.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"395d972093a8a86013537989ea76696303b1fe22b431d8001407ff4dc3cc47e6"}},{"ruleId":"AX2","level":"warning","message":{"text":"Process-global static state: TaskProgressRing: \u0060TaskProgressRing\u0060 keeps mutable \u0060static\u0060 state \u2014 one slot for the whole process, shared by every thread that reaches the type however its instances are created \u2014 and mutates it outside any lock (Memories; e.g. \u0060Memories\u0060 at line 142). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskProgressRing.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"196bfdb968586b4c373fcf2ebb2d3f4b3dd96bbc7c06dc0124518ee071c07fee"}},{"ruleId":"AX2","level":"warning","message":{"text":"Process-global static state: TaskStatusIcon: \u0060TaskStatusIcon\u0060 keeps mutable \u0060static\u0060 state \u2014 one slot for the whole process, shared by every thread that reaches the type however its instances are created \u2014 and mutates it outside any lock (Faces; e.g. \u0060Faces\u0060 at line 90). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/TaskStatusIcon.cs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3804671c62daa94d6589f5a28f7accb28eeae432ee45d2f95cae7d1b0acde3d8"}},{"ruleId":"AX5","level":"warning","message":{"text":"Appears unstructured (no recognised architecture): ~25.5k production LoC (1927 types) across 2 project(s) / 20 namespace(s) with no recognised architectural style or layering \u2014 at this size, deliberate module boundaries would help. No DDD/clean/vertical-slice/CQRS/transaction-script organisation was detected \u2014 code is likely organised ad hoc, which makes change and onboarding harder as it grows."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf38333cec692da9187608fc8d12d547460b1d3964d6b4da78c9c51e859dd969"}},{"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":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s Swift pack (Swift/Xcode) (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 3 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/platforms.yml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060windows/Desktop/Pacer.Windows.csproj\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":"windows/Desktop/Pacer.Windows.csproj"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d92de4fbd0fb1109c5da606d2dbcd9a855def842d6fb8b2f5393f67f940b29"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060new HttpClient(transport ?? handler) { Timeout = Timeout.InfiniteTimeSpan }\u0060 builds an outbound HTTP client, and what is applied to it does not bound it. Its \u0060Timeout\u0060 is set to \u0060Timeout.InfiniteTimeSpan\u0060, which removes HttpClient\u0027s own bound rather than setting one. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller \u2014 a build step, a CLI run, a UI thread \u2014 with no way out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateFeedClient.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ea49c00d8298c92bbde94bfb5ae6e979268d07ef9202fea4db2727088e7fa0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060getOrStartRouter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/diagnostics/reproduce-codex-ipc-split.cjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0285cb9d33e7ff30b7d8ccf041205d701d5309ae383a761732061bcb6048284"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 6 plain JS \u2014 the untyped files are native/Sources/PacerCore/Resources/deepseek-progress.mjs, native/Sources/PacerCore/Resources/deepseek-session-fingerprint.js, native/Sources/PacerCore/Resources/deepseek-summary.js, native/Sources/PacerCore/Resources/workbuddy-account-credits.js, scripts/diagnostics/reproduce-codex-ipc-split.cjs, scripts/windows/check-deepseek-web-identity.mjs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/diagnostics/reproduce-codex-ipc-split.cjs:80 \u00B7 scripts/diagnostics/reproduce-codex-ipc-split.cjs:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"scripts/diagnostics/reproduce-codex-ipc-split.cjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61a3c894a383ad0ed74618766b9509b6742e28e21c4291b238b3831739cb2ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readGroups (cyclomatic 24, cognitive 33): readGroups has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/workbuddy-account-credits.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"110767d09c3f0646e11b4d99d81510a793a6fbe48534d50352c5680eec0be0c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respond (cyclomatic 19, cognitive 15): respond 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":"native/Sources/PacerCore/Resources/deepseek-progress.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"147f7c8355bb6f8cfda203e8764e491192bdafb1050a9bf884ef4e9c99df609a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~71 LoC): no import path from any entry point (4 application, 1 tooling, 0 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":"native/Sources/PacerCore/Resources/deepseek-progress.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1621c4a12337441bbeef72ec7f7a733fb34dd453d89c5b79e761c43937affa3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!busy \u0026\u0026 !session.RequiresRestart \u0026\u0026 connected \u0026\u0026 snapshot != null\u0060 appears character-identically in 2 files \u2014 windows/Desktop/SettingsClaude.cs, windows/Desktop/SettingsDeepSeek.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsClaude.cs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ec1ffa9ee1fa546df0588a3e21915fb0cf6a513d10b01ebad71b9833632f14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!char.IsAsciiLetterOrDigit(c) \u0026\u0026 c is not (\u0027\u002B\u0027 or \u0027/\u0027 or \u0027=\u0027)\u0060 appears character-identically in 2 files \u2014 windows/Desktop/WindowsSshTerminal.cs, windows/Desktop/WindowsWslTerminal.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSshTerminal.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a61d1b418b8f850439d4ebbf00ec0bb8092f66c16109f5b18f68e4574497d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!closed \u0026\u0026 !busy \u0026\u0026 !session.RequiresRestart\u0060 appears character-identically in 2 files \u2014 windows/Desktop/SettingsHarness.cs, windows/Desktop/SettingsOverview.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13652fbf24e2865d2783a3dbbc3bd5bc26039fd747aaf1192da5438793857af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!providerConnectionClosed \u0026\u0026 !engine.IsConnectionClosed\u0060 appears character-identically in 2 files \u2014 windows/Desktop/SettingsClaude.cs, windows/Desktop/SettingsDeepSeek.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsClaude.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1421542ed00882ee9fdd1a8cb402e77aefb9d8660d294f7823bd237f26335f4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060DeepSeekLoginWindow.Recoverable(error) || error is EngineCommandException\u0060 appears character-identically in 5 files \u2014 windows/Desktop/App.xaml.cs, windows/Desktop/SettingsClaude.cs, windows/Desktop/SettingsCodex.cs, windows/Desktop/SettingsDeepSeek.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/App.xaml.cs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ea3eb661f4eb06dec83222194b66f6ebf010f36355c16d89e9a9d3af0d39bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Encoding.UTF8.GetByteCount(value) \u003E 32768 || value.Any(char.IsControl)\u0060 appears character-identically in 2 files \u2014 windows/Desktop/SettingsCodex.cs, windows/Desktop/SettingsProviderHome.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCodex.cs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d724d30e990544d61207d3c351e2def79d8ab53359f9ce6e63e11046cb2d033"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060JsonNode.Parse(json) is JsonObject values \u0026\u0026 values.Count \u003E= 0\u0060 appears character-identically in 2 files \u2014 windows/Desktop/CompactChoices.cs, windows/Desktop/PanelChoices.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/CompactChoices.cs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b9fab49ff02de93109e5ad35d12c96c52a3652eb3c1b377a258e8824b2bd3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ProviderLoginWindow.Recoverable(error) || error is EngineCommandException\u0060 appears character-identically in 6 files \u2014 windows/Desktop/ClaudeConnectionCoordinator.cs, windows/Desktop/DeepSeekConnectionCoordinator.cs, windows/Desktop/SettingsClaudeConnection.cs, windows/Desktop/SettingsConnections.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f544d2b2edf25baaa6434499d31d4700d85e1fbc5bc2a2d7f38423c66564247f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060action.Kind == \u0022settings\u0022 \u0026\u0026 settings != null\u0060 appears character-identically in 2 files \u2014 windows/Desktop/DeepSeekBalanceStatusView.cs, windows/Desktop/QuotaConnectionView.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DeepSeekBalanceStatusView.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd320fbc40cfecb6f475ac1409f2373ad6b4e7ebeffc2f04dcaeae0bd144eb47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.Key == Key.Escape \u0026\u0026 Keyboard.Modifiers == ModifierKeys.None\u0060 appears character-identically in 2 files \u2014 windows/Desktop/GuideWindow.cs, windows/Desktop/UpdateWindow.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuideWindow.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4670e10610ecd792510eaf63d9df06df82f16d1ecf03d5efd5aacf1fa5a92129"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cancelled.Remove(request.RequestID) || reads.ContainsKey(request.RequestID)\u0060 appears character-identically in 2 files \u2014 windows/Desktop/ClaudeConnectionCoordinator.cs, windows/Desktop/DeepSeekConnectionCoordinator.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6712c5db49731b67d72441a0b76f7384157974730d9b1248400acab35cf2dc0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060connecting.TryGetValue(context, out var current) \u0026\u0026 ReferenceEquals(current, task)\u0060 appears character-identically in 2 files \u2014 windows/Desktop/ClaudeConnectionCoordinator.cs, windows/Desktop/DeepSeekConnectionCoordinator.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e831c961b5e7c1475a3f52ef1f31985f81f3000fd9c180d736cf8d6f4cbab4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060downloading \u0026\u0026 inlineFraction is { } fraction\u0060 appears character-identically in 2 files \u2014 windows/Desktop/SettingsOverview.cs, windows/Desktop/SettingsUpdates.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b753f4e3f3646adafd11ab8976679bc3b5f42988335d82c6799ef5422dff73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof token !== \u0027string\u0027 || token.length \u003C 8\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/Resources/deepseek-session-fingerprint.js, native/Sources/PacerCore/Resources/deepseek-summary.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/deepseek-session-fingerprint.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b9cca75cfabb37a5c0b08172fe21e3e492e6509c57aff226483a65568ed99e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060layout.Attached || layout.Dock == IslandEdge.Top\u0060 appears character-identically in 2 files \u2014 windows/Desktop/IslandSurface.cs, windows/Desktop/IslandWindow.xaml.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandSurface.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc430699cedb7358d13eca6d59f8fe6f1d00bcb10f05b87508dc714cbd9a947b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060providerConnectionClosed || engine?.IsConnectionClosed != false\u0060 appears character-identically in 3 files \u2014 windows/Desktop/SettingsCardKit.cs, windows/Desktop/SettingsHarness.cs, windows/Desktop/SettingsOverview.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsCardKit.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"007b68ccf1caef75297e553afcd7d1010d4e8a252fa94c90d2537601c2f1500a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.notes is None or args.notes_zh is None\u0060 appears character-identically in 2 files \u2014 scripts/release/prepare-update.py, scripts/release/prepare-windows-update.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/prepare-update.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2122910bf33bd72a80910e0ec1a672937f811e21365854b6c373d70c2eb0ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attrs.st_uid != os.getuid() or not expected\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/Resources/claude_remote_setup.py, native/Sources/PacerCore/Resources/codex_remote_progress_setup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea191fe0e3e938d16e9e66a84af95b63dff2a6b436f36e2e2dc82e9ed0c1c2ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attrs.st_uid != os.getuid() or not stat.S_ISREG(attrs.st_mode)\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/Resources/claude_remote_setup.py, native/Sources/PacerCore/Resources/codex_remote_progress_setup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"14da06d630b6c3013080acb4aea6169610b75513a03b3035f0d3a897cea551b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(raw) \u003E LIMIT or not isinstance(payload, dict)\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/Resources/claude_remote_setup.py, native/Sources/PacerCore/Resources/codex_remote_progress_setup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"db891bc02c67a17bd8a4fad3cf2151ca4319e073e836f74c8062f860de526236"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(sys.argv) != 2 or len(sys.argv[1]) \u003E 3 * LIMIT\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/Resources/claude_remote_setup.py, native/Sources/PacerCore/Resources/codex_remote_progress_setup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_setup.py"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b274c1db9ccd5287fdb44b3456d5b05704ab1b7bb5bb578417aee6691494f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not b\u00220\u0022 \u003C= byte \u003C= b\u00229\u0022 or len(digits) \u003E= 7\u0060 appears character-identically in 2 files \u2014 windows/EngineSupport/Resources/WSL/bootstrap.py, windows/EngineSupport/Resources/WSL/setup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/Resources/WSL/bootstrap.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd3ae33899044b4051743b5696d7e2a52a9d8caacd428116085b502b8f58b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reads.TryGetValue(request.RequestID, out var current) \u0026\u0026 ReferenceEquals(current, cancellation)\u0060 appears character-identically in 2 files \u2014 windows/Desktop/ClaudeConnectionCoordinator.cs, windows/Desktop/DeepSeekConnectionCoordinator.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ClaudeConnectionCoordinator.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"753d85c8796300a6689f66746b48336f16194253d4712539f972d87dd8041b63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.Provider == provider \u0026\u0026 source.Transport == \u0022app-server\u0022\u0060 appears character-identically in 2 files \u2014 windows/Desktop/IslandPanelSections.cs, windows/Desktop/SettingsOverview.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandPanelSections.cs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0443f91b40f06d9d558ae7c26be20a4a791845f08db8fbf03144db82fdd0287"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$0.isInternalReview \u0026\u0026 !$0.isIgnoredCodexSession\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/ActivitySourceMerger.swift, native/Sources/PacerCore/LocalActivityReader.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivitySourceMerger.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0145c19b6985c63698003c8d92a60d9ad67f17e562289c31a5202d13616262c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!model.claudeConnectionNeeded \u0026\u0026 model.claudeQuotaSource != nil\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerIsland/SettingsView.swift, native/Sources/PacerIsland/WelcomeView.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/SettingsView.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aeeb3d8d5c4313b11eeca6c846012f1859fe5bde3e78e4621aac943d1cd545"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$0.hasQuotaDisplay \u0026\u0026 enabled.contains($0.id)\u0060 appears character-identically in 2 files \u2014 windows/EngineSupport/EngineQuotaDashboard.swift, windows/EngineSupport/PacerEngine.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/EngineQuotaDashboard.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44b19f27400721e34606e8093a6038fe652e87a6a9ba9998fd4d9ec1f38c798"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$0.key == $0.value.threadID \u002B \u0022:\u0022 \u002B $0.value.turnID \u0026\u0026 $0.value.isRecent(at: now)\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerMacSupport/MacDurableProgressMailbox.swift, windows/EngineSupport/WindowsDurableProgress.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacDurableProgressMailbox.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0694ae2869aadd65d0fa61df3ffb5de9929ce2a58507f26754aba408c52b6d95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$0.kind == .deepseekSpend || $0.kind == .deepseekWeek\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/ExpandedPanelPresentation.swift, native/Sources/PacerIsland/IslandView.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ExpandedPanelPresentation.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"349eb3fc67b611c35ff404c79b037a55a64da7dbdf0d37d3399265727c2dfa36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$0.occlusionState.contains(.visible) || !$0.isVisible\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerIsland/ActivityBadge.swift, native/Sources/PacerIsland/CompactQuotaViews.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/ActivityBadge.swift"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a924d67e30185f235b32e4f46c8b9b526c79d2e52fd842c4244fe6b9f611fcbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$0.provider == .claude \u0026\u0026 $0.claudeCloud == nil\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/ClaudeCloudCoordinator.swift, windows/EngineSupport/PacerEngine.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudCoordinator.swift"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e467f9d4162f122958058d7849a089a453ac445b17b7c002ad92697f0d9cbaab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activity.hasLiveEvidence \u0026\u0026 activity.liveTurnStarted\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/Attention.swift, native/Sources/PacerCore/CompletionInbox.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Attention.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbd12acfa6c400cdb5218c5af3c7089fa6c75aed0af08b1c3f795662ca0c349"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activity.provider == .claude || activity.launchedByEmbeddingApp\u0060 appears character-identically in 3 files \u2014 native/Sources/PacerCore/ActivityNavigationTarget.swift, native/Sources/PacerCore/HostApplicationTrackingState.swift, native/Sources/PacerIsland/TaskRowView.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ActivityNavigationTarget.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dfe84fa249a2f7239d896bf3800a142eea87123a3b97b78c6f089536304004"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060files.metadata(file) != nil || FileManager.default.fileExists(atPath: file.path)\u0060 appears character-identically in 3 files \u2014 native/Sources/PacerCore/QuotaCycle.swift, windows/EngineSupport/DeepSeekBalanceHistoryStore.swift, windows/EngineSupport/WindowsClaudeRemoteDigestStore.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/QuotaCycle.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a73efbd961404f29f72dc591f54b0120cc694f851b64dcaca10e94d7ac5586b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host == \u0022chatgpt.com\u0022 || host.hasSuffix(\u0022.chatgpt.com\u0022)\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/RemoteControlCatalogAuthorization.swift, windows/EngineSupport/WindowsRemoteControlHTTP.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlCatalogAuthorization.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb0ea65827757e771db3d43c7a7f484f7f6babcf49acb7e9945a543960d109"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index == 0 || argument == \u0022-S\u0022 || ((argument == \u0022hook\u0022 || argument == \u0022statusline\u0022) \u0026\u0026 index == arguments.count - 2)\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerMacSupport/MacClaudeHookInstaller.swift, windows/InstallerSupport/WindowsClaudeHookCleanup.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerMacSupport/MacClaudeHookInstaller.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc28192b913e11db69e1aaffba1f4f094639c28a94953522fe5acb53a6913b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.count == 1 || (path.count \u003C= 3 \u0026\u0026 keys.count == path.count \u0026\u0026 [\u0022total\u0022, \u0022last\u0022].contains(keys[1]) \u0026\u0026 (path.count == 2 || [\u0022outputTokens\u2026\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/DesktopFrameDecoder.swift, native/Sources/PacerCore/DesktopWireProjection.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45a1d058051b1a82b3b3ee39d14caf2f8a3111f85d51ea96d0f629c04bae077"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.count == 1 || keys == [root, \u0022type\u0022] || keys == [root, \u0022activeFlags\u0022]\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerCore/DesktopFrameDecoder.swift, native/Sources/PacerCore/DesktopWireProjection.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopFrameDecoder.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"31074679144d9d607c25c7a0b3e9bb0df87c3ab2f2a4c89fb3bc3185207efb23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paths.owns($0, home: home) || $0.isNative(named: \u0022PacerEngine.exe\u0022, home: home)\u0060 appears character-identically in 2 files \u2014 windows/EngineSupport/PacerEngine.swift, windows/InstallerSupport/WindowsCodexProgressRuntime.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/EngineSupport/PacerEngine.swift"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"14291b02219afdb8510caba19a2095f3442a59d1389ad6ff0a0339f0b6babd6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result == .current || result == .installed\u0060 appears character-identically in 2 files \u2014 native/Sources/PacerIsland/IslandModel.swift, windows/InstallerSupport/WindowsClaudeHookRuntime.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerIsland/IslandModel.swift"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6661a2a6cf4c5f13f2fade0b43e077574e5e64d46562c2fe01453e04cf12a3a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.Provider == provider \u0026\u0026 value.Enabled\u0060 appears character-identically in 2 files \u2014 windows/Desktop/SettingsOverview.cs, windows/Desktop/SettingsProviderHome.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsOverview.cs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0932828baccf7c5bd19764c773b1b37425906fc07da9b054046a282d648efa2d"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions override nullable warnings: ~0.7 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 212 suppression(s) across the 289390 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ae9a4afaefbfeb512a0b9a87d1bd44cd285ab1e804e4b89c8cf80f255687dfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060HasReceipts\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/DurableUsageEvidence.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8218fbf40a9676d5f9d924c17e6829527f81d4238b1ec7d7fbdb7bfbf86bda"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060SwiftStop\u0060 falls back to \u0060\u0022\u0022\u0060 when \u0060match.Groups[1].Success\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/EngineCrashLog.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff01ad3d73487b95d472fc97412e2f0375cb208d9d513a2aa5a95ccce6ad58ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Open\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/GuidePages.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2796a7890794f0ea2697ea19179d77fe29163dd5188823939254ec5c29183e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060FinishMoveAsync\u0060 swallows \u0060Exception\u0060 and sets \u0060result = PreferencesApplyResult.EngineFailed;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/IslandMove.cs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd586da1816bce49f275c9bd6d85f1ff4a11e642a4a5fa1ea660cf5f13f24181"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060HandleReferenceAsync\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/NotificationActions.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f290f8b6050acb7ee1013e806c050dc1d9686902b6316c4f8e1935390a57d8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060HandleAsync\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/NotificationActions.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d290964ba5c0ad43f7baccec5581ec87a35dce344f81776ef27cc46c569999f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ChangeAsync\u0060 swallows \u0060Exception\u0060 into \u0060return PreferencesApplyResult.EngineFailed;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesSession.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb9196be9dc9d2305185eba50e8fb7831f77d94602765437d4419a4151f0e3e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Load\u0060 swallows \u0060AbandonedMutexException\u0060 and sets \u0060acquired = true;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1975e511063db8f2e7499df72f5242b453c83c0a7530f6830f801b0b891084ef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Save\u0060 swallows \u0060AbandonedMutexException\u0060 and sets \u0060acquired = true;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feffaef233e3b3fa90cd60d9e39071a6186e3404f808c9485a48f40df8f5d9c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Future\u0060 swallows \u0060JsonException\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/PreferencesStore.cs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0c2743e1fd6db5854a7e7811e690b451f75a3d4a209e329a73eb01f55d0789"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060HasProfile\u0060 swallows \u0060Exception\u0060 into \u0060return true;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ProviderWebSession.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5558826c886eeec2f403e54299286101601695bc4b85a9238addb19440a6f7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Available\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/ProviderWebSession.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed5a1a1f00f7799573c9985060179dffbcdf0b2dde6f03e811351f363aa05f7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on unknown code: \u0060WalletInk\u0060 maps every unrecognised code to \u0060PacerPalette.Primary\u0060, one of the real values, with no log or throw \u2014 a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/QuotaDial.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d6dd21d3ad9bea30be2cae668a16fcf135b670591eb7d064965dfac4b286f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060RetryHarnessProgressAsync\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsHarness.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9b008cfd3d6d91bfcdca0fa6df733dfd7ff9b3087714ee62e42ca67a90fb7c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Open\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsPagePolicy.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f70ac343c69e0bf60c65e1f7dcefe092be3100eaf76dc360ae983beaa22d28"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060IsSystemDark\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SettingsWindow.cs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"623d03f18381dba0625ae7d2585092a25fb688a0dbafbb4b5da667f30b1fc61a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Show\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/SupportShareSheet.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a9d51bac865cd385ac957541ba61525c3b3368c56d50665f0ccb41e5bf2f78"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060DefaultOpen\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/UpdateRecoveryView.cs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3afbf0f385a85cb506a22d9a01d71b9ebe4da0a26ce184bc84b0917c31b540"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060OpenProviderAsync\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"081342a82af974730214c7b9e41169a54efa2006626c6a98c21f47b6dbd060bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060RestartForGuideAsync\u0060 swallows \u0060Exception\u0060 into \u0060return RestartResult.Failed;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c7057ccb13d9e22a766c286acd58948741a57bbefd3819f1e5c2382e443b5b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060OpenAsync\u0060 returns \u0060false\u0060 when \u0060Guid.TryParse(plan.Context, out _)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsConversationApplication.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3d65ac1c55406a02321064527fecfaccb206ceef6ebf755b2b898d7ffbcc9a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060UninstallAsync\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsNotificationCleanup.cs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1f4251bc909c9da1a8388d3b40e34b473fa7be6848b3b2f357127eb07b2479"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060NotificationsSupported\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsPlatformPolicy.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e12faaf1484c98fe4743c3cb74df60f1054dfe3fd7b9c0acc55009d8273995"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ActivateExecutable\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSettingsServices.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"526f056ea65851b72c7a51a845501657c28821fac319d77ec88a3461877d4e1f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Activate\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSettingsServices.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"971bf1155b780e83082e96874c64885fe535c28ab7ff40814fd6722ff3b3a67e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Launch\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSshTerminal.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33c532876dcd2a039790a001533eb5bf55513e9595073ee41026de52f8cfe8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060MigrateFrom\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsStartupRegistration.cs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace133b9d49465375271f33c08e59e5438c8c58bcf2fca86588cb74108b8a34b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060RemoveOwned\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsStartupRegistration.cs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b221d71f77be0d450fb68bda504159b971341a29fa4927fd15f5baf02f12ff27"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060LaunchSettings\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsStartupRegistration.cs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d65853cf315eb1ca0fb4d53d69e3538bb1ecd46503608f121a9ab215953315"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060CurrentAvailability\u0060 swallows \u0060Exception\u0060 into \u0060return NotificationAvailability.Failed;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSystemNotifications.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2821e2a68654dc07c6db8bd883b53219a1c100b85ee07b1da7f0ce8322573c9d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Deliver\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsSystemNotifications.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa821eaee01eca2805d57939c0c74013a349b8c146a35b53abd6e4fe5a101733"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060PatchApplies\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsUpdateService.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98795b46004e0befd63c8bee359d6277ce7ed886e0f18920859236f89fd1c72"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Launch\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/Desktop/WindowsWslTerminal.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5bcdbeb257959a9859aafdb837c41c67e04ffb277707f0bd4d83c9d3a4dd97"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Verify\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateCatalog.cs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d14231350d469abd238bd31b1e73e88b861d0a58cdbc59c6b063b9615ecbb6f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Run\u0060 swallows \u0060Exception\u0060 and sets \u0060success = false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"windows/UpdateSupport/UpdateHandoff.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91f639ac1f4d1ebedc901b28d961b66a69aab59f98d07af7ac91badcf1b7ab6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060transcript\u0060 returns \u0060[]\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb88dc88fcf22cdd926f55b091d96e7ffe442779d98ff0c683b2c729581f5aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060sanitized\u0060 returns \u0060[]\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_activity.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9975c4d2f8cd5a84874432165830ccb8b6b0dcbbc4178809d29ce753347f8a0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_object\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_hook.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"468757b09a72887dec6feadebd14f571be897b3b66ee3a0d8e9c81a36119101f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060executable\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_resume.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e55d5b4ab16cb3d58fbf32487505e5d41c68758fd95d8e9e9ad8c4a99f5409f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060versioned_executables\u0060 returns \u0060[]\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/claude_remote_resume.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29936ce00dc3492cff0179673f2201ff72c0ce9a93fb4cad41d31f1bba8994d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060script\u0060 turns every thrown error into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityMonitor.swift"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"08de1387abc9f98ececf72662a3afc9f293c6fa177a31f9bed514c7483ed75dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060entries\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeActivityReader.swift"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"33557b1ded66abb0a0d3b323989784dc54548c08535f61d44f94a02e9ab13090"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060pollOnce\u0060 turns every thrown error into \u00601\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/ClaudeCloudProjectMonitor.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a912b7fd09fc144933330baa9b5ff093e5dabb1b230d23eeb817a31e81e82f63"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060changed\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/DesktopRouteHints.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb7e743dfbaf3446c5e5a1c2c2b48721c0beab1bc78c41497d64dc91ddd3d95"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060configured\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/RemoteControlActivityTarget.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ab0c02243f57f84370ed5e5c1057c5ad2c95b9e3815eab58e4c77899a36c63"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060packageAccounts\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"native/Sources/PacerCore/Resources/workbuddy-account-credits.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f1509247e71fbca844b28e3fa707be48e91d9a1bdedfa7136094813f2006ea"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.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-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-73","guid":"43703bfd-8c43-f15f-9cba-58e5f73ea7e9","name":"External Control of File Name or Path","shortDescription":{"text":"External Control of File Name or Path"},"helpUri":"https://cwe.mitre.org/data/definitions/73.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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-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":13,"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."]}]}