{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-1059"]}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"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":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF2","name":"Allocation hygiene","shortDescription":{"text":"Allocation hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF2"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"SVGPath.parse (cyclomatic 54): SVGPath.parse has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Support/ProviderIconShape.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5443b541649b7527147400457de4fb624f03f7bf137446bff28062d8fa977f"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexLogFileParser.parse (cyclomatic 46): CodexLogFileParser.parse has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Codex/CodexLogFileParser.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"931438327bcda1159609fd567375d215a8bd8f7c1debf419087918cfa5de7e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderAccountAssembly.make (cyclomatic 42): ProviderAccountAssembly.make 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":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba8af54dc0a1e258ec14ce3bd43a61938eed96f863157a36340743e7d639865"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeProvider.refresh (cyclomatic 33): ClaudeProvider.refresh has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"68811b240cc7e0668ec3a645452a369b21230bb9d9293c9950f87b4a0b4ef78b"}},{"ruleId":"D1","level":"warning","message":{"text":"UsageHistoryDocument.validate (cyclomatic 30): UsageHistoryDocument.validate 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":"Sources/OpenUsage/Models/UsageHistoryDocument.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a8982bb6d7c227e113af3b361ce5d446202705b849a6efab04eb7d1487107"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderAccountAssembly.makeCodexCards (cyclomatic 27): ProviderAccountAssembly.makeCodexCards has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0d0c26d14d0f05d2656d4806da367029ddab0b7d9e088853d968fa8285a589"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeLogUsageScanner.ownedUsageFiles (cyclomatic 27): ClaudeLogUsageScanner.ownedUsageFiles 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":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fadd45ab872e196619a45d5d50bf1203a940ec3c4dab0516d8d972bc8e1f87"}},{"ruleId":"D1","level":"warning","message":{"text":"DashboardView.body (cyclomatic 26): DashboardView.body 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":"Sources/OpenUsage/Views/DashboardView.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41d6c99373f67d9fa1bb34dcd4e0c3dee26bafd6e84c393a58d929e916b5fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenSSHEd25519Key.parse (cyclomatic 25): OpenSSHEd25519Key.parse 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":"Sources/OpenUsage/Providers/Ollama/OpenSSHEd25519Key.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"289799ecf2a7565e1281134e0de9815f5906217473e536c3a1959d19d2e0915a"}},{"ruleId":"D1","level":"warning","message":{"text":"JSONLStreamingReader.read (cyclomatic 24): JSONLStreamingReader.read 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":"Sources/OpenUsage/Providers/JSONLStreamingReader.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dff4533354b5e764a1dbcf26b6d818f9c28f6ac30800ee01a9fc361dc47642"}},{"ruleId":"D1","level":"warning","message":{"text":"MonitorView.viewDidMoveToWindow (cyclomatic 24): MonitorView.viewDidMoveToWindow 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":"Sources/OpenUsage/Support/PopoverDismissReader.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d2a97e781aff86bb2e3f539d5ade3dfc187d375ccdbdfa038d5296ac66d797"}},{"ruleId":"D1","level":"warning","message":{"text":"PaceNotificationLogic.transitions (cyclomatic 22): PaceNotificationLogic.transitions 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":"Sources/OpenUsage/Support/PaceNotificationLogic.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e712e92f1d8bbf3883f93c9f97a852443bad6bc7afddad3b4d656332b660224b"}},{"ruleId":"D1","level":"warning","message":{"text":"AntigravityProvider.probeCloudCode (cyclomatic 22): AntigravityProvider.probeCloudCode has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"85daada1074fe4d138bff4788b398e0298582983c6de82c0583ab7b688397b8a"}},{"ruleId":"D1","level":"warning","message":{"text":"CursorCSVParser.forEachRow (cyclomatic 22): CursorCSVParser.forEachRow 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":"Sources/OpenUsage/Providers/Cursor/CursorCSVParser.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebe606602941ab036f881831faf3d169874618886010cc0f26411f64581ecc2"}},{"ruleId":"D1","level":"warning","message":{"text":"IncrementalJSONLScanner.items (cyclomatic 21): IncrementalJSONLScanner.items 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":"Sources/OpenUsage/Providers/IncrementalJSONLScanner.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2524f02b01c41b6757203e5fe001912213c8855c956d73432546f9f567e005"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetDataStore.refresh (cyclomatic 21): WidgetDataStore.refresh 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":"Sources/OpenUsage/Stores/WidgetDataStore.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6692d61f80f7d46f6b34b3a90b9b9d7b998d853a4dac9cb994c269ef2e923706"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetDataStore.localHistoryDocument (cyclomatic 21): WidgetDataStore.localHistoryDocument 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":"Sources/OpenUsage/Stores/WidgetDataStore.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d507cf7d9e301ee1b70904798a0eda1c9209396f8ab5b80c7b04116c1dd36604"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderAccountAssembly.discoverDesktopOrganizations (cyclomatic 20): ProviderAccountAssembly.discoverDesktopOrganizations 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":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb120d6964bae4dc44c372a74f9578a6e9910d8842d030f07a8b4c838aac69a"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeAuthStore.loadCredentialSet (cyclomatic 20): ClaudeAuthStore.loadCredentialSet 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":"Sources/OpenUsage/Providers/Claude/ClaudeAuthStore.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c3380c1e4169b220023a3d507906c35493923641861834e9c01e9725b36781"}},{"ruleId":"D1","level":"warning","message":{"text":"AntigravityProvider.probeLS (cyclomatic 19): AntigravityProvider.probeLS 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":"Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"049457632de9328e9ce3fea3727abb2cb0d2d6740dc942e4cdd23ced78bf7da4"}},{"ruleId":"D1","level":"warning","message":{"text":"AntigravityProvider.fetchCloudCode (cyclomatic 18): AntigravityProvider.fetchCloudCode has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1934284e49c67617defa7d9568149fae2783d3b51dc85b12d9ef05ed6eefa6dd"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeProvider.fetchLiveUsage (cyclomatic 18): ClaudeProvider.fetchLiveUsage 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":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"544c37dad21ba4384461e9fec257de5d016452a5ec01e5cedf3f4c94fde40764"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeSessionIdentity.parse (cyclomatic 17): ClaudeSessionIdentity.parse 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":"Sources/OpenUsage/Providers/Claude/ClaudeSessionIdentity.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b6b54fb136c72e29307d5f3874fd4e3ac0ce784523e6e3de39e7bf18ce663c"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenCodeCodexUsageScanner.scan (cyclomatic 17): OpenCodeCodexUsageScanner.scan 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":"Sources/OpenUsage/Providers/OpenCode/OpenCodeCodexUsageScanner.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f674d996e0175db0b2848462f70e9cb347483b016dbf60aa9bc4250daed3e99"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenUsageISO8601.normalizeFractionalISO (cyclomatic 16): OpenUsageISO8601.normalizeFractionalISO 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":"Sources/OpenUsage/Support/OpenUsageISO8601.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4e629a2d535445ac11f5711966bc9d23fb34b145b16de7aed5fc6f6672947a"}},{"ruleId":"D1","level":"warning","message":{"text":"AntigravityProtoDecoder.field (cyclomatic 16): AntigravityProtoDecoder.field has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityProtoDecoder.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e19415dd13ba3c049b2bd2ee4950fff298178cbaa8fec3d46b1714bba815dd8"}},{"ruleId":"D1","level":"warning","message":{"text":"AntigravityProtoDecoder.generationEvent (cyclomatic 16): AntigravityProtoDecoder.generationEvent 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":"Sources/OpenUsage/Providers/Antigravity/AntigravityProtoDecoder.swift"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e50a1fcb408151371672395c2897f4b76c9af461ff33690ffb58b956af0968f"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeLogUsageScanner.parseEntries (cyclomatic 16): ClaudeLogUsageScanner.parseEntries 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":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba7c3a55e14b9ad19d75b1531b86c381de367c1518dd3dfc2c4d43f9befb015"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeSwapAccount.discover (cyclomatic 16): ClaudeSwapAccount.discover 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":"Sources/OpenUsage/Providers/Claude/ClaudeSwapAccount.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5137ab382f6b07becd479d281557428d2af5d8ee589b13cda1f440bf2efaa07"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexLogUsageScanner.aggregate (cyclomatic 16): CodexLogUsageScanner.aggregate 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":"Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e25c804af9069d89da25fa22460e3473929b5e6600941f51d35f1adecb33301"}},{"ruleId":"D1","level":"warning","message":{"text":"GrokCreditsConfigDecoder.decode (cyclomatic 16): GrokCreditsConfigDecoder.decode 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":"Sources/OpenUsage/Providers/Grok/GrokCreditsConfigDecoder.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddbea2f4a8be0dfbaa594e81c38b7380ac083bf037480883e164a6403772638"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenCodeProvider.refresh (cyclomatic 16): OpenCodeProvider.refresh 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":"Sources/OpenUsage/Providers/OpenCode/OpenCodeProvider.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f3048960e73aa3d56b193be070e2c2d7a5ec748125f0dff75a7a4b87d31a57"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGPath.parse (cognitive 95): SVGPath.parse has cognitive complexity 95 (threshold 15). Drivers by points: if/else 31 (54 pts), ternaries 6 (21 pts), boolean chains 15, loops 3, match/switch 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Support/ProviderIconShape.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfe9b7aa8892ab9f4cdafb93c2e4341ff5898c770136cd32e186ec638d6b3e9"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexLogFileParser.parse (cognitive 75): CodexLogFileParser.parse has cognitive complexity 75 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 22, ternaries 2 (4 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Codex/CodexLogFileParser.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0741e7633c2b2c9fc6d9d4127cce215acbaacdf5377a157ed62d6b04b8d38361"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeLogUsageScanner.ownedUsageFiles (cognitive 53): ClaudeLogUsageScanner.ownedUsageFiles has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (44 pts), boolean chains 7, loops 1, ternaries 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":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e9c54555b0a1e7e92298ee34e9899b50e596b838032bc604110a685c17cd6a"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageHistoryDocument.validate (cognitive 52): UsageHistoryDocument.validate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 6 (11 pts), boolean chains 9, ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Models/UsageHistoryDocument.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fcf52cdf2b5f815593bffc8509c53ea78cbd8ff357b560a41081ea297b5ca5"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderAccountAssembly.make (cognitive 49): ProviderAccountAssembly.make has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 18, loops 6, match/switch 1 (2 pts), ternaries 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":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"104e2f9d4c87525f9604760944083b381631ce7cf6c7168a218b658e8ae8863b"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONLStreamingReader.read (cognitive 40): JSONLStreamingReader.read has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/JSONLStreamingReader.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f577628d2cf47e77e1821632af29542294a6fb18225c9b950f39a0ab5e2bde5d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexProvider.refreshAccount (cognitive 37): CodexProvider.refreshAccount has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (29 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Codex/CodexProvider.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc28f19bc1f302911d1999e955ac2704077184def9acdbdd85560e7bd0af51af"}},{"ruleId":"D2","level":"warning","message":{"text":"AntigravityProvider.probeLS (cognitive 35): AntigravityProvider.probeLS has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 4, loops 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91f274fc14418fc6f49767ec7e3ecbbdea049dedf481e07fe158cc0b0e99a54"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeProvider.refresh (cognitive 35): ClaudeProvider.refresh has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9, error handling 3 (6 pts), match/switch 3 (6 pts), 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":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3623ff768f3693981497de171da2a23475a872aaadb37b30b04d59a338345652"}},{"ruleId":"D2","level":"warning","message":{"text":"PaceNotificationLogic.transitions (cognitive 33): PaceNotificationLogic.transitions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 6 (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":"Sources/OpenUsage/Support/PaceNotificationLogic.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa7863de29527eb952860c157489815612ba6eb90425ab33ea98c790c0d0045"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetDataStore.localHistoryDocument (cognitive 31): WidgetDataStore.localHistoryDocument has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 9, ternaries 2, 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":"Sources/OpenUsage/Stores/WidgetDataStore.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d79f2303d5766d4ea8e5f731a4183b85a174a60abae58f6b032e953aef5165"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorCSVParser.forEachRow (cognitive 31): CursorCSVParser.forEachRow has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (11 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Cursor/CursorCSVParser.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"938fd6a5143ae2c702f2a0dfaab88a480397c51faae66fc1014f42ed04859ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderAccountAssembly.makeCodexCards (cognitive 30): ProviderAccountAssembly.makeCodexCards has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 11, ternaries 3 (4 pts), loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"575686ae9b35a937228078b580a70025f385070795f53d8c5b38efcb5b601dba"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeSessionIdentity.parse (cognitive 29): ClaudeSessionIdentity.parse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeSessionIdentity.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d78811f94ddb0a027880049d3feda2d5decc9f0df1b8306577c246057196473"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenCodeCodexUsageScanner.scan (cognitive 29): OpenCodeCodexUsageScanner.scan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 2 (3 pts), loops 3, 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":"Sources/OpenUsage/Providers/OpenCode/OpenCodeCodexUsageScanner.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb7045b053764b221643e23175185a966b084797449da32fdd27b689ce340d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DashboardView.body (cognitive 28): DashboardView.body has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21 (23 pts), ternaries 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Views/DashboardView.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0eb7ebf93b54599d0c5b2ea7d31353526032c3e32c3768f5fc7d08dc2b9aad"}},{"ruleId":"D2","level":"warning","message":{"text":"AntigravityProtoDecoder.field (cognitive 28): AntigravityProtoDecoder.field has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, ternaries 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityProtoDecoder.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"188d21200f14aca6a150247a0a3958cd117294ba9c740f14529c6092e7e6ac49"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeAuthStore.loadCredentialSet (cognitive 28): ClaudeAuthStore.loadCredentialSet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 9, ternaries 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeAuthStore.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"632534cc4210df71c2b782297f2f6d19d6cb704fd7fc6e2e70397d718b383a02"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalJSONLScanner.items (cognitive 25): IncrementalJSONLScanner.items has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, loops 4, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"Sources/OpenUsage/Providers/IncrementalJSONLScanner.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e72ea3075f3affa64cbb7b40b99b8e523cdf2c56fd7ae2804419a5167a7acfc"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeDesktopAuthStore.loadActiveOrganization (cognitive 25): ClaudeDesktopAuthStore.loadActiveOrganization has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"111e8605a74cbfdcae03ab7fb0f23ce5ed184006e37c29e4532ca586dd4a07b5"}},{"ruleId":"D2","level":"warning","message":{"text":"AntigravityDbUsageScanner.readDatabase (cognitive 24): AntigravityDbUsageScanner.readDatabase has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityDbUsageScanner.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdb694724ca8f75df804ca116547b55152a523b743f17d9fa67682827b8697b"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenSSHEd25519Key.parse (cognitive 24): OpenSSHEd25519Key.parse has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 18, if/else 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":"Sources/OpenUsage/Providers/Ollama/OpenSSHEd25519Key.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d952d4c698d3593dfac52248aacd09b2f0ea74cf213b6c1c356d33619673beb"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotaNotificationEvaluator.evaluate (cognitive 23): QuotaNotificationEvaluator.evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Stores/QuotaNotificationEvaluator.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87e2b8ab058d137cfb602b3fb60320ecb9ec61769938e92203064162d8623b9"}},{"ruleId":"D2","level":"warning","message":{"text":"MonitorView.viewDidMoveToWindow (cognitive 23): MonitorView.viewDidMoveToWindow has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 9, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Support/PopoverDismissReader.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dd7a3409f9d62d952cfd3a8f1f9ae7bd10dc31816814b1e2fac8102fb48a37"}},{"ruleId":"D2","level":"warning","message":{"text":"AntigravityDbUsageScanner.scan (cognitive 23): AntigravityDbUsageScanner.scan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts), error handling 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityDbUsageScanner.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"767e382ad394f26f432d384fde0cb6c29e2fcca3250cc61fdb926ce7fc72ac73"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenCodeUsageScanner.scan (cognitive 22): OpenCodeUsageScanner.scan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (3 pts), loops 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/OpenCode/OpenCodeUsageScanner.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa7f7a1c92cda583aab5f5e39681d74d7839651b2427b72515bca85ffae0a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetDataStore.refresh (cognitive 21): WidgetDataStore.refresh has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 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":"Sources/OpenUsage/Stores/WidgetDataStore.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13c6cf4685f8888b365ef03bec9ac8920597496b3930fc5598e69b9140a5e06"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexLogUsageScanner.aggregate (cognitive 21): CodexLogUsageScanner.aggregate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, 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":"Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a01302d7b0775258d00f114118a51cd6d87f61a1d25c814a90cd7e4e3d9c58b"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetData.meterState (cognitive 20): WidgetData.meterState has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Models/WidgetData.swift"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02d19e133b107b04ce929f6fb926e135632fe697a8456a6a4d7e12a57b9ca45"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeProvider.fetchLiveUsage (cognitive 20): ClaudeProvider.fetchLiveUsage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d696ac902998c30240058617cf7107c2d753c1cfcac2f43b6e9d3e51eaef4a97"}},{"ruleId":"D2","level":"warning","message":{"text":"GrokCreditsConfigDecoder.decode (cognitive 20): GrokCreditsConfigDecoder.decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9 (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":"Sources/OpenUsage/Providers/Grok/GrokCreditsConfigDecoder.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b821c7c2d22f02d1395250084ce8d8d1bcabd1fee12513c5bcd0d73419110841"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderAccountAssembly.discoverDesktopOrganizations (cognitive 19): ProviderAccountAssembly.discoverDesktopOrganizations has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"319defc9ccfa2ea4e0a4d89bd29d82f754d017065d7ccdaca0392f1a128c14ee"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageHistoryAggregator.merge (cognitive 19): UsageHistoryAggregator.merge has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 2 (6 pts), ternaries 3 (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":"Sources/OpenUsage/Services/UsageHistoryAggregator.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd658ee34b5c4f749196fd1c5dd229d2492695a8ba2fc1042a0951da5c52df4c"}},{"ruleId":"D2","level":"warning","message":{"text":"MenuBarStripRenderer.visibleBounds (cognitive 19): MenuBarStripRenderer.visibleBounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Support/MenuBarStripRenderer.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae85bb69432102267a36f3e16d1eecdb85680f65b497d8510e71daa973b30b1"}},{"ruleId":"D2","level":"warning","message":{"text":"AntigravityProvider.probeCloudCode (cognitive 19): AntigravityProvider.probeCloudCode has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 6, 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":"Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ded26fe5c4f0591723247a8883843f6da38ffcf66adee7f64e66296c6d5cb66"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenCodeProvider.refresh (cognitive 19): OpenCodeProvider.refresh has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/OpenCode/OpenCodeProvider.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c2455d8f32cb0d0d95908b80fbe38db13db0dc0c12cc05dbcd0a5815f70222"}},{"ruleId":"D2","level":"warning","message":{"text":"DailyUsageAccumulator.merged (cognitive 18): DailyUsageAccumulator.merged has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (5 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/DailyUsageAccumulator.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d33c81970678edea3aa307a50f656724cf6d25ceb6944dd1b342de3fe40a94"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageReader.read (cognitive 18): UsageReader.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 1 (3 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"Sources/OpenUsage/Services/UsageReader.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"02de8161da03b21e6aed2c2b9f65797ce326500706a46c5718c06c02733779d2"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenUsageISO8601.normalizeFractionalISO (cognitive 18): OpenUsageISO8601.normalizeFractionalISO has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), loops 1 (2 pts), ternaries 1 (2 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":"Sources/OpenUsage/Support/OpenUsageISO8601.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"44455f24cdbe6ca204f110981c89453f94b73cda8c58044b5206fda1d1a3a058"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeSwapAccount.discover (cognitive 18): ClaudeSwapAccount.discover has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (6 pts), error handling 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":"Sources/OpenUsage/Providers/Claude/ClaudeSwapAccount.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d6d4f5408160835a82cd556f03efd5b2c8c0cd874ff6511766c8b0577c7e09"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexLogUsageScanner.sessionFiles (cognitive 18): CodexLogUsageScanner.sessionFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd873de0f07ef25100b42270de99a2a1c3d7ba82a80f958dea54a0a2d048fa76"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexSwapAccount.discover (cognitive 18): CodexSwapAccount.discover has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Codex/CodexSwapAccount.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adaf95be212e0480468ffc79677c22a7cc0a950e32929724f31919b336e7535"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONLScanCacheWriter.pruneStaleIdentities (cognitive 17): JSONLScanCacheWriter.pruneStaleIdentities has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), error handling 2 (4 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":"Sources/OpenUsage/Providers/JSONLScanCacheStore.swift"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26e04ad2b63ff83e3326acdbb3dea5bbfaf6278cdfa24ee20134aaf7046185e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderAccountsStore.reconcile (cognitive 17): ProviderAccountsStore.reconcile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Stores/ProviderAccountsStore.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a86c6f1992c312ae79dc6dfb93723e6b6024e24ef8ee174ec1cd8ea417c138"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeLogUsageScanner.coworkClaudeDirs (cognitive 17): ClaudeLogUsageScanner.coworkClaudeDirs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f96bd1451b3b8f0b7d3c0b4f9223fc72c934c077b977d3f3a21feb3a93589cb"}},{"ruleId":"D2","level":"warning","message":{"text":"GrokLogUsageScanner.parseCompletedTurn (cognitive 17): GrokLogUsageScanner.parseCompletedTurn has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, ternaries 3 (6 pts), if/else 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Grok/GrokLogUsageScanner.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16656d0256c3fe95f184b5c1f70a9ed3ddee3ea2cc653da238496518cd55698"}},{"ruleId":"D2","level":"warning","message":{"text":"ZAIUsageMapper.mapQuota (cognitive 17): ZAIUsageMapper.mapQuota has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/ZAI/ZAIUsageMapper.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e72f0f408f8730df8a5ef3bbdf968e82bff1edde4817c0c61b5dbb4edd4fcf3"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutStore.applyMetricDividerOrderImpl (cognitive 16): LayoutStore.applyMetricDividerOrderImpl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, 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":"Sources/OpenUsage/Stores/LayoutStore.swift"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a6e5420b7bd5fe82af2a95b4bc24675bbf5b4c2e369e142311cd76acf26484"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeAuthStore.loadSwapVaultCredential (cognitive 16): ClaudeAuthStore.loadSwapVaultCredential has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, error handling 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":"Sources/OpenUsage/Providers/Claude/ClaudeAuthStore.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f699ab201e5abd09cedb3bf7d86a9bcd014e383861d8fb9d1032b59493a808"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeDesktopAuthStore.normalizedCache (cognitive 16): ClaudeDesktopAuthStore.normalizedCache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6615dd9d06f71e20d032317c7cf8d9fb229b9815853e87c7b8a1f779bc5f2baf"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeLogUsageScanner.parseEntries (cognitive 16): ClaudeLogUsageScanner.parseEntries has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 3 (4 pts), loops 1, ternaries 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":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a03282ca5c53abe42a324fda6b4137344a4fcde4f43a840f13ff1b4c5e9b59"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorProvider.probe (cognitive 16): CursorProvider.probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 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":"Sources/OpenUsage/Providers/Cursor/CursorProvider.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec7d6f1b9379b450510bddd13bd80ad628be9bae199ee6c8a29e292484fdd39"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorUsageMapper.mapUsage (cognitive 16): CursorUsageMapper.mapUsage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), 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":"Sources/OpenUsage/Providers/Cursor/CursorUsageMapper.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6810ccfccbe4f64c1cef1b685e73c3be5eded3595a9f3215eb936efe7b280573"}},{"ruleId":"D2","level":"warning","message":{"text":"ReorderGeometry.swift.reorderTarget (cognitive 16): ReorderGeometry.swift.reorderTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Views/ReorderGeometry.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4c5bd6ff9178ebe4e260d24b2529b4f386cc1f9cfc2ee160f4c1cd8de3af63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeLogUsageScanner.owningSessionFile: MethodTooLong \u2014 owningSessionFile runs 414 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 314 over it, 4.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbf33b4c9fd8c94c2cc57a9eae2cd9309e27d53a443d9553bb682520aaab296"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutStore.provider: MethodTooLong \u2014 provider runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Stores/LayoutStore.swift"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9913c2e56381d0d783481bd964f201d4a5d620c19433a17978906d20fd75e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutStore.descriptor: MethodTooLong \u2014 descriptor runs 262 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Stores/LayoutStore.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60478780e5b78d968a7096c0ef694c5d13a2c3c3f152295fc046633d257d505"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutStore.providerID: MethodTooLong \u2014 providerID runs 260 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 160 over it, 2.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Stores/LayoutStore.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bb29e30f3d25f895c486618910b33f9c3795dae64152fe4246d13ac766d961"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeDesktopAuthStore.candidates: MethodTooLong \u2014 candidates runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ee1d160fef62d62129c6c7ffc55b0efd59305658b31053ee4ae4535d47fb02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayoutStore: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Stores/LayoutStore.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dd90c4fb883b2dc384c7f1ebd1828d354be99c1c7c3359a0807a7382571176"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodexLogUsageScanner.aggregate: MethodTooLong \u2014 aggregate runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6dcec09dd20244046b3df933df5d7e45379f7be84fb87d62af336ff745cb07"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClaudeProvider: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 39 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc6dacc9fe25d5cb874a8b177c2020997ed91fa4c7fb793a8698945362af08d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SVGPath.parse: MethodTooLong \u2014 parse runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Support/ProviderIconShape.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad5afb53f95b0ef65893658230f12155bdcf1ef92fa096f8bfcf339951ade6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeProvider.refresh: MethodTooLong \u2014 refresh 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":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"704b1aaa4e549052a60cee46ed23025940b1988846e64fa46b0ac99866533d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift:128-141 | Sources/OpenUsage/Providers/Pi/PiUsageScanner.swift:72-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Providers/Pi/PiUsageScanner.swift:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe57eb3b286531f5a116c3b4bb6a672924ca343e9904b8e4c2d9dca268102ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/OpenUsage/Providers/Cursor/CursorCSVParser.swift:105-115 | Sources/OpenUsage/Providers/Cursor/CursorCSVParser.swift:120-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Providers/Cursor/CursorCSVParser.swift:105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Cursor/CursorCSVParser.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d428a1437a8e96f847009391d07b1265b7daec1542d312ef9cd2bc758f3899f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/OpenUsage/Providers/Ollama/OllamaProvider.swift:127-137 | Sources/OpenUsage/Providers/ZAI/ZAIProvider.swift:84-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Ollama/OllamaProvider.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"66da6a4fdaf0b41f258007a281507fc21a3ab5f03dcba05df2f7d7fdff4c7ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): Sources/OpenUsage/Services/LocalUsageAPI.swift:54-62 | Sources/OpenUsage/Services/LocalUsageAPI.swift:73-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Services/LocalUsageAPI.swift:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"Sources/OpenUsage/Services/LocalUsageAPI.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9702ce6908b4a18c8edb95922a12da348c9b060b47e7071d0a4aec399bacb47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OpenUsage/Views/PopoverTopBar.swift:96-104 | Sources/OpenUsage/Views/PopoverTopBar.swift:112-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 \u0060Sources/OpenUsage/Views/PopoverTopBar.swift:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Views/PopoverTopBar.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f83614d1589715c90f99fc859b4e095e5ef1a10fd8ed676851a638535b7249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift:88-96 | Sources/OpenUsage/Providers/Codex/CodexProvider.swift:63-71 \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 \u0060Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"774998205aaa0257394ae961bd356dc7a84944ae298c517e47eed06db7894e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OpenUsage/Providers/Codex/CodexResetClaimService.swift:238-246 | Sources/OpenUsage/Providers/Codex/CodexUsageMapper.swift:295-303 \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":"Sources/OpenUsage/Providers/Codex/CodexResetClaimService.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e5190c8932fe5d5f7310c84e4253c1cea3ee1ef684d6d6046144a5c5ef846a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OpenUsage/Providers/Grok/GrokLogUsageScanner.swift:32-40 | Sources/OpenUsage/Providers/Pi/PiUsageScanner.swift:37-45 \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":"Sources/OpenUsage/Providers/Grok/GrokLogUsageScanner.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aebec5b21b906cbf6824396bf9f43a7e93232eee4a22386ae03a5983d556eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift:33-40 | Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift:61-68 | Sources/OpenUsage/Providers/Grok/GrokProvider.swift:24-31 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift:33\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":"Sources/OpenUsage/Providers/Antigravity/AntigravityProvider.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd407521520d82467c2ff8c5564b931a844ff0525f38038671eea903ca8bd44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): Sources/OpenUsage/Services/ProviderAccountAssembly.swift:136-141 | Sources/OpenUsage/Services/ProviderAccountAssembly.swift:165-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Services/ProviderAccountAssembly.swift:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cbe895c1a40977b980d891fca96064b66bd2bafba8a90340c9cacb18328e8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OpenUsage/Support/ProviderIconShape.swift:225-231 | Sources/OpenUsage/Support/ProviderIconShape.swift:233-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Support/ProviderIconShape.swift:225\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":"Sources/OpenUsage/Support/ProviderIconShape.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbb659b7f4daca0fd02fc5e210217f7fe22f36d96cfa6866d6b125f86e7eee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OpenUsage/Providers/Antigravity/AntigravityDbUsageScanner.swift:286-292 | Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.swift:371-377 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityDbUsageScanner.swift"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb58d7212c06b358314664d5d6d8183436ba3d45e2ff2bac59209f494d0f5ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): Sources/OpenUsage/Providers/Copilot/CopilotOrgBillingClient.swift:44-49 | Sources/OpenUsage/Providers/Cursor/CursorUsageClient.swift:116-122 \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 \u0060Sources/OpenUsage/Providers/Copilot/CopilotOrgBillingClient.swift:44\u0060 it does not close everything it opens, so those exact 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":"Sources/OpenUsage/Providers/Copilot/CopilotOrgBillingClient.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"311c3dec8b578fe75e11c154e8aebd3f47899d2b20581ae90fcd874cb643d1cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OpenUsage/Providers/SpendTileMapper.swift:285-290 | Sources/OpenUsage/Providers/SpendTileMapper.swift:330-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"Sources/OpenUsage/Providers/SpendTileMapper.swift"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4f2760955842ec3285899f5ed20398384a9c72600a9fef29ea17eb85f1752c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 3): Sources/OpenUsage/Support/ProviderIconShape.swift:204-209 | Sources/OpenUsage/Support/ProviderIconShape.swift:211-216 | Sources/OpenUsage/Support/ProviderIconShape.swift:218-222 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Support/ProviderIconShape.swift:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"Sources/OpenUsage/Support/ProviderIconShape.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ce7c0b2cd88578f05c8aa9e153f10f3e122afe0f73a88d38ca703ea2165b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OpenUsage/Support/LogRedaction.swift:187-191 | Sources/OpenUsage/Support/LogRedaction.swift:203-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Support/LogRedaction.swift:187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/OpenUsage/Support/LogRedaction.swift:208\u0060 calls \u0060Range\u0060 and \u0060Sources/OpenUsage/Support/LogRedaction.swift:192\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":"Sources/OpenUsage/Support/LogRedaction.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5447f417822ed4c290c72447f8adfd80893275a2de7a952d359feb10421fbfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift:7-16 | Sources/OpenUsage/Providers/Codex/CodexProvider.swift:6-10 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060displayName\u0060 to \u0060String = \u0022Claude\u0022\u0060 in one and \u0060String = \u0022Codex\u0022\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":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15c5506791741187358d696b97914d8287a1716ec79b47e94e390e327ce7c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OpenUsage/Stores/LogLevelSetting.swift:27-34 | Sources/OpenUsage/Support/AppLog.swift:53-60 \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":"Sources/OpenUsage/Stores/LogLevelSetting.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e1ff8eb44a6d068d0f42858c9d7e9daafd59ad71b94f2a725124198c9dc4d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/OpenUsage/Providers/Grok/GrokUsageClient.swift:22-31 | Sources/OpenUsage/Providers/OpenRouter/OpenRouterUsageClient.swift:46-55 \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":"Sources/OpenUsage/Providers/Grok/GrokUsageClient.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df09c00e4449d4e9acabb4af40f9e4f582b1e3f2d1dd265f4260ddcf6385017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift:13-19 | Sources/OpenUsage/Providers/ZAI/ZAIAuthStore.swift:13-19 \u2014 before extracting anything, compare \u0060Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift\u0060 and \u0060Sources/OpenUsage/Providers/ZAI/ZAIAuthStore.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcba8417f6f0ecf9dcbd518ebb613164f0d82e931a93269c09d93fff08f5fd96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift:21-32 | Sources/OpenUsage/Providers/ZAI/ZAIAuthStore.swift:21-32 \u2014 before extracting anything, compare \u0060Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift\u0060 and \u0060Sources/OpenUsage/Providers/ZAI/ZAIAuthStore.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bb50488ba0cc382b0a288a679d39a50e77e62715fed2a0290f9203bcde6278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OpenUsage/Providers/Codex/CodexAuthStore.swift:209-214 | Sources/OpenUsage/Providers/Grok/GrokAuthStore.swift:149-154 \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":"Sources/OpenUsage/Providers/Codex/CodexAuthStore.swift"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"217b531a8cc11752a8ecc75617eefa6c7b149a6598bcd42a7da2aeb61c1c6d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): Sources/OpenUsage/Providers/Devin/DevinProvider.swift:18-26 | Sources/OpenUsage/Providers/Ollama/OllamaProvider.swift:23-31 | Sources/OpenUsage/Providers/OpenRouter/OpenRouterProvider.swift:19-27 | Sources/OpenUsage/Providers/ZAI/ZAIProvider.swift:19-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060authStore\u0060 to \u0060DevinAuthStore = DevinAuthStore()\u0060 in one and \u0060OllamaAuthStore = OllamaAuthStore()\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":"Sources/OpenUsage/Providers/Devin/DevinProvider.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5753d05105c73cb200e6090888ee4d69c1931b16f6591657e2ce00b5c6730cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift:53-64 | Sources/OpenUsage/Providers/ZAI/ZAIAuthStore.swift:57-68 \u2014 before extracting anything, compare \u0060Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift\u0060 and \u0060Sources/OpenUsage/Providers/ZAI/ZAIAuthStore.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/OpenRouter/OpenRouterAuthStore.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f986d6484e89db8f84795652dd4dbeee7c249e047122655087d3818b409f65f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OpenUsage/Providers/Cursor/CursorProvider.swift:38-42 | Sources/OpenUsage/Providers/OpenCode/OpenCodeProvider.swift:87-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OpenUsage/Providers/Cursor/CursorProvider.swift:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Cursor/CursorProvider.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5833e80c87f986be10e6c0e8bbc0cf8f2a2e70acc4985b0c88e52681dd396a68"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: OpenUsage: OpenUsage: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f4f507515449bbf222be3f410264a2bf61a20bc0016b3910aa5712e51b478708"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UpdaterUserDriverDelegate (LCOM4 4): UpdaterUserDriverDelegate\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/App/UpdaterController.swift"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"923b7c49a6098a8577a8eb04963dfa78a9c995b31206e9ffded4f5a4257af0c2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AppNotifications (LCOM4 4): AppNotifications\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Support/AppNotifications.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"925f11cda056b0096f5bbb15989d044ca0713f904d2085327c1d509142f53576"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 Swift suite: Coverage NOT MEASURED: the Swift half could not be measured \u2014 the Swift suite in . produced no coverage export. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testParityAgainstRealLocalLogs: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OpenUsageTests/ClaudeLogUsageScannerTests.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36612a2187f3e71d7fea96fd484e903a37207c07f8fb447fbfd6419b35c6833"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testLiveClaudeUsageReportsResetFields: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OpenUsageTests/ClaudeProviderTests.swift"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f526fb7feb49401a6a50773290d588b9390a843329ff51d4fdde27186a4abeba"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testParityAgainstRealLocalLogs: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OpenUsageTests/CodexLogUsageScannerTests.swift"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"2034abc5341d05529a3d7998c598d5dc532a0afda3a508881544a8b1d9adbd38"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testScopedKeysRequireTheMatchingValidAccount: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ClaudeDesktopTokenCacheTests.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9d7efbf85c63f0f834fec188fd010391117dbdccff455385fcc28acd27c2f3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMalformedPrefixesAndKeysAreRejected: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ClaudeDesktopTokenCacheTests.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"791d3252a587c4ddac62c813af9005168f9eb61c8b7190ad8b99f90744c53060"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testWrongOrganizationHostAndMissingProfileScopeAreRejected: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ClaudeDesktopTokenCacheTests.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f431aaab7de812a9cd06b2ed3b41f3d18e785219e6525174089d241a5f69781"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testScopedDeletionMarkerSuppressesLegacyAliasInEitherVersion: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ClaudeDesktopTokenCacheTests.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d51d13be2b2a3eecd9155ccd2e2d8becac4da2701f6f96d23384075f00ad16c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testV2DeletionMarkersSuppressV1AcrossBothKeyFormats: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ClaudeDesktopTokenCacheTests.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5dc53380748f712c4850507bc7fc961486a514d12f74038214fade06ebcaea"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBackgroundReloadShowsSyncActivity: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ICloudUsageSyncStoreTests.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c75851371e7192df675faa74c70f602026b071b87667dd03d391d7034078c05"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidateDropsQueuedHeight: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/PanelHeightBridgeTests.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8df2085a06d233acb55242e52b543ef5e93fe6196f08bcc5e25a1a0cb10218f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTraySurfaceIsFullyOpaqueInBothAppearances: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/PopoverSurfaceOpacityTests.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b454fbf2d64f9c11f2ada31e8c9ead67c6eb12ee38e2673f9082378cc0ca517"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSuccessStatusesDoNotThrow: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ProviderAuthRetryTests.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc7ac8f004ef15bdec3085d4dd7f7583feb434491d14a04839d81e85d068cdf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRealChangePostsDidChangeNotification: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ProviderEnablementStoreTests.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16b260b646c9f714d93fbcb33aa57f7bce0194867bb5b9693315f87a653b505"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoOpToggleDoesNotPostDidChangeNotification: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ProviderEnablementStoreTests.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d5fd88fedd368ccd1b5d1d459b3e74a2a748a278a93e32f36626d292dc9bc2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoOpReseedDoesNotNotify: 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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":"Tests/OpenUsageTests/ProviderEnablementStoreTests.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7999e48a74e1b65fe3da1b65fd6ac7954b0705bcd66123e68d9a6028be4a465"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cf561832e7a7a35edf32b525acde8e654163e20c6f66da0439256771ec50eb7"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c67af386d6bb05e299e0db6c8e9a7b2c2d3ad76cfccda114dfe47dd6d69b5ab3"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e4c09bd541e067a11d455ac990912118e40e39b40244eab0674563b383b9fa9"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35004b0d8a86945362cb75b2a3b83d933c7a4d1e2dcbb23d6941c406bc20573d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift: Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ClaudeProvider.refresh at line 120. 12 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Claude/ClaudeProvider.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":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7244d84a4a14b8c05d3e4e58616f3029fc301b762f025cabe5d44ef21717c9f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Stores/WidgetDataStore.swift: Sources/OpenUsage/Stores/WidgetDataStore.swift changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in WidgetDataStore.refresh at line 278. 5 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Stores/WidgetDataStore.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":"Sources/OpenUsage/Stores/WidgetDataStore.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"91117b5dcd90e9f699e3df79e65d6a3e1eca3d42130470d859406db4e66126c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Views/DashboardView.swift: Sources/OpenUsage/Views/DashboardView.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in DashboardView.body at line 68. 2 of those changes were fix/bug commits, and the other 18 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Views/DashboardView.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":"Sources/OpenUsage/Views/DashboardView.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e541ca4293c3c29422066583fed6d984ca2db93e61960f00d2faf4326c97e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift: Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ClaudeLogUsageScanner.ownedUsageFiles at line 284. 8 of those changes were fix/bug commits, and the other 8 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.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":"Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad231f98511a965afadbd44c67de11ce2b45dd1341f62c33b961d1de0e4d85b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.swift: Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CodexLogUsageScanner.aggregate at line 20. 10 of those changes were fix/bug commits, and the other 10 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.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":"Sources/OpenUsage/Providers/Codex/CodexLogUsageScanner.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea32901cc548b55aad37f80c690e59db096591a76b6ce53e74dd4bba022d344"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Services/ProviderAccountAssembly.swift: Sources/OpenUsage/Services/ProviderAccountAssembly.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ProviderAccountAssembly.make at line 73. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Services/ProviderAccountAssembly.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":"Sources/OpenUsage/Services/ProviderAccountAssembly.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1877e55a9c5164323e6731444f92e3b4f67e12aa38d07b6370fdc7472d018c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/Claude/ClaudeAuthStore.swift: Sources/OpenUsage/Providers/Claude/ClaudeAuthStore.swift changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ClaudeAuthStore.loadCredentialSet at line 110. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Claude/ClaudeAuthStore.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":"Sources/OpenUsage/Providers/Claude/ClaudeAuthStore.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b56e2a26ae294bb0b9d5a4b5b00f4f463a0886629829187eb748a7a773dfbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/Codex/CodexProvider.swift: Sources/OpenUsage/Providers/Codex/CodexProvider.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in CodexProvider.refreshAccount at line 5. 1 of those changes was a fix/bug commit, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Codex/CodexProvider.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":"Sources/OpenUsage/Providers/Codex/CodexProvider.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8e25180ce0b89bd34f78b9ccca6362327fb92476b810a59af7a6825c6cf3c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Models/WidgetData.swift: Sources/OpenUsage/Models/WidgetData.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in WidgetData.meterState at line 497. 2 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Models/WidgetData.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":"Sources/OpenUsage/Models/WidgetData.swift"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ded9d85c047ba9a2091ccba8b3664c0a2755669a980f27670af948fc03fa4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/IncrementalJSONLScanner.swift: Sources/OpenUsage/Providers/IncrementalJSONLScanner.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in IncrementalJSONLScanner.items at line 127. 2 of those changes were fix/bug commits, and the other 6 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/IncrementalJSONLScanner.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":"Sources/OpenUsage/Providers/IncrementalJSONLScanner.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ebc5249df3ca64b2596be8818be0ac7f4d1a48f3fa85aafd55f9b734188fb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Models/UsageHistoryDocument.swift: Sources/OpenUsage/Models/UsageHistoryDocument.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in UsageHistoryDocument.validate at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Models/UsageHistoryDocument.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":"Sources/OpenUsage/Models/UsageHistoryDocument.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1026ab2f9df7bbb572523268b3549d1fd1e5fe87c5761f1cbb792a47861c5c4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/Codex/CodexLogFileParser.swift: Sources/OpenUsage/Providers/Codex/CodexLogFileParser.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in CodexLogFileParser.parse at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Codex/CodexLogFileParser.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":"Sources/OpenUsage/Providers/Codex/CodexLogFileParser.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebd52e436991e66345e038666e9ee2c7e73694a645ace1343effe45e825a438"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/OpenCode/OpenCodeProvider.swift: Sources/OpenUsage/Providers/OpenCode/OpenCodeProvider.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OpenCodeProvider.refresh at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/OpenCode/OpenCodeProvider.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":"Sources/OpenUsage/Providers/OpenCode/OpenCodeProvider.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c201e301d4bdfeb398626a8bf26a034268b63306d4565db284d37f43384eefc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/OpenCode/OpenCodeUsageScanner.swift: Sources/OpenUsage/Providers/OpenCode/OpenCodeUsageScanner.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in OpenCodeUsageScanner.scan 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/OpenCode/OpenCodeUsageScanner.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":"Sources/OpenUsage/Providers/OpenCode/OpenCodeUsageScanner.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"db57cf34d824358ea8b3bf9017d2366c6a0824d96cc8f25822e5d0718f4f9d10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OpenUsage/Providers/Cursor/CursorUsageCSV.swift: Sources/OpenUsage/Providers/Cursor/CursorUsageCSV.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in CursorUsageCSV.parse 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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Cursor/CursorUsageCSV.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":"Sources/OpenUsage/Providers/Cursor/CursorUsageCSV.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4560b89476b9a9dc2f3e26bf1a79e8968462298225b7b15884e1d8468f53fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: Sources/OpenUsage/Providers/Claude/ClaudeUsageMapper.swift: Sources/OpenUsage/Providers/Claude/ClaudeUsageMapper.swift changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ClaudeUsageMapper.appendScopedWeeklyLimit at line 153), 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(claude): keep verified launch-cached limits on the first 429 after relaunch (#1325)\u201D; \u201Cfix(claude): read the plan badge from Anthropic\u0027s live profile (#1262)\u201D; \u201Cfix(claude): surface rate-limited state as a header warning instead of a silent blank (#849)\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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Claude/ClaudeUsageMapper.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":"Sources/OpenUsage/Providers/Claude/ClaudeUsageMapper.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"22283aeedcdde3878e24bd17b9c6dd7b95d264b57468a16e4635e08e177f6c44"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: Sources/OpenUsage/Providers/Ollama/OllamaProvider.swift: Sources/OpenUsage/Providers/Ollama/OllamaProvider.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 11 (its worst body is OllamaProvider.refresh at line 70), 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(ollama): warn when the plan response can\u0027t be read (#1300)\u201D; \u201Cfix(ollama): display monthly cloud usage limit (#1270)\u201D; \u201CAddress review: surface plan failures, tighten key check, fix spend copy\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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Ollama/OllamaProvider.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":"Sources/OpenUsage/Providers/Ollama/OllamaProvider.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0307f65a4a80828baff8f631c97eb97fba884e643b3fa1c969beb39cd8c168c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: Sources/OpenUsage/Pricing/ModelPricing.swift: Sources/OpenUsage/Pricing/ModelPricing.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 ModelPricing.fallbackRates at line 39), 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(antigravity): restore local spend from all conversation stores and price every logged model (#1206)\u201D; \u201Cfix(pricing): price GPT-5.6 fast variants\u201D; \u201CFix request-wide long-context pricing\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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Pricing/ModelPricing.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":"Sources/OpenUsage/Pricing/ModelPricing.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35234636f8e07cef16df5efa7a61155372f8a18c6f2dc5b0867ff808e35adf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.swift: Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.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 13 (its worst body is ClaudeDesktopAuthStore.load at line 139), 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(claude): read account-prefixed Desktop token caches (#1212)\u201D; \u201Cfix(claude): try Desktop before environment fallback\u201D; \u201Cfix(claude): pick Desktop token by client/scope rank, not max expiry\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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.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":"Sources/OpenUsage/Providers/Claude/ClaudeDesktopAuthStore.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"994060c385dbd7b653951c7e01715e1dcb5383c9531bb2f0e04cb01113881f2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: Sources/OpenUsage/Views/HoverTooltip.swift: Sources/OpenUsage/Views/HoverTooltip.swift changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is TooltipPresenter.refresh at line 271), 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(share): disable hover tooltips in share-card renders\u201D; \u201Cfix(tooltip): pick the cursor\u0027s screen for the zero-size anchor fallback\u201D; \u201Cfix(tooltip): anchor bubble to the hovered item and balance wrapped lines\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-07-02..2026-09-30, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-02 13:20:57 \u002B04:00\u0027 --until=\u00272026-09-30 13:20:57 \u002B04:00\u0027 --full-history --no-merges -- Sources/OpenUsage/Views/HoverTooltip.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":"Sources/OpenUsage/Views/HoverTooltip.swift"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c5253d2f32bf79985653ee67756434526c9f5854e3b34d599b8e1b0f6301b3"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"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":"eb3166f362d5b2bba710260eb81cac937ec3d095f07101cc31756e6ef255e76f"},"properties":{"commitSha":"dc2a80dcd4bc22a12d2319d69d4b99e0cf4a2967"}},{"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":"9344238bcdf625253f2a628b28d5051a384ef4181713b8ad0e19fe1c33a9e35c"},"properties":{"commitSha":"1e65178b60a120d36e0b0304e140831890a8bd73"}},{"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":"8d1b1a69f524b22642c394b0fc221744e47e3162390161ab81756aed3a770471"},"properties":{"commitSha":"d067b1fc633330c1dfbb93b80880b4c95168c577"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dbb915274563a1a1c7710b67a8c19d2a107f22fcaf0daddfce999f66be50e9d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f270647e3a5b47fe38a956ce3cfb1062a21192ef81288219897f493a18488a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"958b02d3591729b101fd90a1d8a339fb44dace2ae07ff27613c5489d7bdfef30"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f078f69c7161556d9aeb73856a476343922867db61291e894707cc6b05ba3a22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d8137e2843a4d9ace312984d4d1b8b07998cf19f7a31e2c7e904de2ca9c84a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d2070f338c8186ecd5f3cb981ffa48b8ac45cc1a06e32777fbdad389fb73a31"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f29b0747e2ee3564566b732e400f5d2f863a7f381c50ab92761c2ca36a61593d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2081616d1f0379d0e3eec875a9ca1fc99619c5e48a69405e38f5289b23ed1e1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"101bc8df58a3dd3027363b1417c33b03c4113e1c855a9a5755280f9dad24cc4c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b03900d6057ff735d09307b11d6e6e151805ce3ff2bb836098d92c5d7434e348"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"783b36f4d9748c525656ab4cdbe01cbb4e16a8440c83e486d927a78be9aaaade"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60f347aa4c8e832d9c97a23241a938fabae77f815b43ccc5d1da32c5619c1b08"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b4e467d6ffecaec3536cd676fe32aed7ce146a607439dd01ad0769873f7369d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d390f5eed84f07ce918bdecadb27e67a8ac4fc15dbde853816a64c8a1908dda2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9b7b5aea7a859b29ce1d9a6e49f1442cf7ce948f3f38efd7812d4f48b024f32"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23b2965b78530cfc8fff0d45a64bcb3b28c39fa3e8130ddc14d93ea27237d8c4"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"289de59c49dbade2773b8487e6686f753ae914e7189cff9063e647eaa3e0afb3"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed3c4ef10e0940c1d862ef27b3d4e7b64d54f5fcb10a829b7922c52aa9686eb6"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6216938ec6898edd3ff4b7a8ad99172b9f58c1dd0bfa631db85cbf6cca460a5"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b80217db741963bc111847bf4978fe69005a1e6143c8e6e807558538dfb1b687"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad29b8b7cf9f261083da4a99572767db32c21b4643ce352d7648aaf03b1ec91a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc7902e1f56d674c5b3bf262e67d87e7c10b11de4ebb298e4004671bda29b32c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d19b175705306814b5764652d07e9d21e25e69c598f4409ed5c5c02a0f93e216"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6c6caae798cf61efd764303da503f7e9c6f5e88116aa29fa84ae48484161ebe"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bef425293a36bbe7c4edbf952d5ec247c3c4261145151b042987d182b661b3c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b2a4c399da73bdfa798d42810cd6cee348dcd7af36c538c1f08f8171d6b14ab"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63bcd62c263553112735200bc067de7b36e8c1138daadcef0834efa9fc5f6124"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e475326e9a1f37a9ed45705bfe7c1de83fa9d741a16bb59b9d56ebc4e099d6c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44cc43d7308a41044a085bbc74b8260ce57e93700a02f748fde9451bc9ec5d7c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: LiquidGlassFallbacks.swift, DashboardView.swift, HeaderView.swift: 3 files \u2014 \u0060Sources/OpenUsage/Support/LiquidGlassFallbacks.swift\u0060, \u0060Sources/OpenUsage/Views/DashboardView.swift\u0060, \u0060Sources/OpenUsage/Views/HeaderView.swift\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Support/LiquidGlassFallbacks.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01f0790c1e4983673b4c42733ad378092cc9fe15f503a4150abea6f69723ebd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: GrokProvider.swift \u2192 ClaudeProvider.swift, CodexProvider.swift, CursorProvider.swift: \u0060Sources/OpenUsage/Providers/Grok/GrokProvider.swift\u0060 changes together with 3 other files \u2014 \u0060Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift\u0060, \u0060Sources/OpenUsage/Providers/Codex/CodexProvider.swift\u0060, \u0060Sources/OpenUsage/Providers/Cursor/CursorProvider.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":"Sources/OpenUsage/Providers/Grok/GrokProvider.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dfad778908b64df59e1639bf74367fefa63f42efca8a9aa372a50022ed5dde"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: CursorUsageMapper.swift \u2194 GrokLogUsageScanner.swift: \u0060Sources/OpenUsage/Providers/Cursor/CursorUsageMapper.swift\u0060 and \u0060Sources/OpenUsage/Providers/Grok/GrokLogUsageScanner.swift\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). 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 6 shared commits counted here, the most recent 3 are \u00607cc1f25e\u0060 Address review findings: pill shadow drift, test pins, Cursor facts a\u2026; \u006053115a82\u0060 Revert \u0022feat(dashboard): stacked-bars variant of the Total Spend card\u0022; \u0060684ccdc9\u0060 feat(dashboard): stacked-bars variant of the Total Spend card \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Cursor/CursorUsageMapper.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9595e68fd8a97ea57f928862789f6d1c2086a4297d349f4ac872db4bf9338c0d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ClaudeProvider.swift \u2194 CodexProvider.swift: \u0060Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift\u0060 and \u0060Sources/OpenUsage/Providers/Codex/CodexProvider.swift\u0060 change together 52% of the time (13 of the 25 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 13 shared commits counted here, the most recent 3 are \u00606a2d74d2\u0060 Cache parsed local usage logs across launches (#1017); \u0060de0fec90\u0060 feat(providers): fold pi coding agent usage into Claude and Codex (#975); \u0060fa6ac114\u0060 Add machine-readable limits CLI \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Claude/ClaudeProvider.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a416fca07f362df15542adfa30061a011b73b3266a39da84e173691c965187"}},{"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"}},{"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"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): AntigravityDbUsageScanner.scan: \u0060AntigravityDbUsageScanner.scan\u0060 performs two independent DURABLE writes \u2014 \u0060readFailureReporter\u0060 (a persistence store) via \u0060update\u0060 and \u0060oversizedBlobReporter\u0060 (a persistence store) via \u0060update\u0060 \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OpenUsage/Providers/Antigravity/AntigravityDbUsageScanner.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4a2731f5f4ee0396062e1137b57fe2cb325eb6009974da58fc25930e5e2ae0"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README advertises Docker containerisation, but no Dockerfile/compose file exists \u2014 searched for: \u0060dockerfile\u0060, \u0060docker-compose\u0060, \u0060compose.yaml\u0060, \u0060compose.yml\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"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 27893 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":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self \u003E= UInt8(ascii: \u00220\u0022) \u0026\u0026 self \u003C= UInt8(ascii: \u00229\u0022)\u0060 appears character-identically in 2 files \u2014 Sources/OpenUsage/Pricing/PricingCatalog.swift, Sources/OpenUsage/Providers/Claude/ClaudeLogUsageScanner.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":"Sources/OpenUsage/Pricing/PricingCatalog.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7362f3fad210fe0bdba8da11bf5c33ba54bf1773861c145c1943e6184ae1f6"}}],"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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":45,"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."]}]}