{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"admin.apply (cyclomatic 65): admin.apply has cyclomatic complexity 65 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ed16f7ffb4894fc3a86781fa5bc8088c9ca2663b87c5d34c0e3627d1824172"}},{"ruleId":"D1","level":"warning","message":{"text":"request_policy.resolve_messages_options (cyclomatic 63): request_policy.resolve_messages_options has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/request_policy.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"55785f9a9f130b2238610afa4fcb1520887979f427127d1890ade95c8c4b4174"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeMessagesStreamState.accept (cyclomatic 60): NativeMessagesStreamState.accept has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/native_stream.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fc83c7c34df8286a45e67a914299c7db5b5ea1f5c5faf6340e75255f2d496a"}},{"ruleId":"D1","level":"warning","message":{"text":"request._build (cyclomatic 60): request._build has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/request.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"230426ff3c6f7d034bc6750cc52bf6c7084ac28b7c0ed527f282514ffbe3e304"}},{"ruleId":"D1","level":"warning","message":{"text":"discord_markdown.render_markdown_to_discord (cyclomatic 56): discord_markdown.render_markdown_to_discord has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d497bd8217ff971c67a9b14e24159418ab13aa42c6b87f4a2136db9a57667d"}},{"ruleId":"D1","level":"warning","message":{"text":"telegram_markdown.render_markdown_to_mdv2 (cyclomatic 56): telegram_markdown.render_markdown_to_mdv2 has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/telegram_markdown.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c940aac830e863976730ad98bcef7f8778be56c6e11639d8b639a540db270"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiStream.feed (cyclomatic 53): GeminiStream.feed has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/stream.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd454a08bda48c441a26e88192f01ef0663ce7e767f249e46d2c466b18b13a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatRequest.validate_messages (cyclomatic 52): ChatRequest.validate_messages has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7fc54c8706ea5c949005ea8a7ed77fafc535fedfba39e80d5d1e132eec136e"}},{"ruleId":"D1","level":"warning","message":{"text":"code_sessions.renderControls (cyclomatic 51): code_sessions.renderControls has cyclomatic complexity 51 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a88c9453e1b685d757f98c988c239485d8e57bac99405b8467be086dd177e3"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicMessagesTransport._run (cyclomatic 50): AnthropicMessagesTransport._run has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3e65336198cc556a23cdb359844ea0c70da6978f56118ab4f080cf59907ca9"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceRecoveryState.observe (cyclomatic 50): SourceRecoveryState.observe has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/continuation.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1356f02d7a8c4441c135509b886dd932ae5a4a8bf2dff8e1ae82bca69a1d9c5"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIResponsesTransport._run_execution (cyclomatic 49): OpenAIResponsesTransport._run_execution has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_responses/transport.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90161bbebd0859026c029062f5e87be8b835260bd202d15d39a9bcb292b437c"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicResponseStream._publish (cyclomatic 48): PublicResponseStream._publish has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/stream_delivery.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbae579a1e1a865f075dc9fa4d76baca063689526ba66c4e306b8252f3e61c5"}},{"ruleId":"D1","level":"warning","message":{"text":"model_listing.extract_openai_model_infos (cyclomatic 48): model_listing.extract_openai_model_infos has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/model_listing.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6482280935fb382bf45aaa17be8e8fb229ff6e5613986dda4c92070a203bbcee"}},{"ruleId":"D1","level":"warning","message":{"text":"event_parser.parse_cli_event (cyclomatic 46): event_parser.parse_cli_event 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":"src/free_claude_code/messaging/event_parser.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b345e27c2dfbc22d5668a2058e72cf75543d22d22b7ca6f505f1711a165439e"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay.history_retry_body (cyclomatic 46): history_replay.history_retry_body 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":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"facac8259bcf58fd48e2d276e4e95b8af2370f5db073fb372a686644cd595ccb"}},{"ruleId":"D1","level":"warning","message":{"text":"code_sessions.buildPrompt (cyclomatic 46): code_sessions.buildPrompt has cyclomatic complexity 46 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 21 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a0bbe46fee2ea83b2984da4bb772cbc5cb86e8c2d539ed40aa184ddd7c8d84"}},{"ruleId":"D1","level":"warning","message":{"text":"DeliveredResponse._responses (cyclomatic 45): DeliveredResponse._responses has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"adab77e0b0d9e27b75fd9780d96d95eed420afb2d57dc95e4e4fb19582a0d07f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatResponseAccumulator.feed (cyclomatic 43): ChatResponseAccumulator.feed has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/response.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3547c95ad5891875967868ee12eff9009a751c82751dd69d25167259f16e8509"}},{"ruleId":"D1","level":"warning","message":{"text":"native_request.messages_to_gemini (cyclomatic 43): native_request.messages_to_gemini has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bfb3286354b3a3c8cb37726230b22d6b0248f74ec43619d74999b19751d1b7"}},{"ruleId":"D1","level":"warning","message":{"text":"passthrough.stream_native_messages (cyclomatic 43): passthrough.stream_native_messages has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/passthrough.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7fc6b300a71f3070c1b38bcb6c0f8e7060246674560a5e57c8a55d76eb6641"}},{"ruleId":"D1","level":"warning","message":{"text":"native_request.responses_to_gemini (cyclomatic 41): native_request.responses_to_gemini has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"25faf28b6e2db0a23d1b0c98ffd8ed4b16253c17ff392711674be8e715353226"}},{"ruleId":"D1","level":"warning","message":{"text":"_OpenAIChatStreamRunner._run_execution (cyclomatic 38): _OpenAIChatStreamRunner._run_execution has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/transport.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"332216f46c27ae238f3f27fa281f5ee16ff1f5528d835c58afd4896ab21ab1ba"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexProtocol.notification (cyclomatic 37): CodexProtocol.notification has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aab7bf5f6a1205600aecb6267426c833f1ab4d1e36b94bda14098bfc0516f17"}},{"ruleId":"D1","level":"warning","message":{"text":"native_request.chat_to_gemini (cyclomatic 36): native_request.chat_to_gemini has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce863394ad29fe5795a2fa9daab6ea786a810e10b8f25e83dec76bf0ef09af2"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolCallBuffer.feed (cyclomatic 36): ResponsesToolCallBuffer.feed has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_calls.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"81749c4ec3df9d90ddf7b226cc1ddfe81711bb27e1854390dfb744f562138a61"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiTransport._run (cyclomatic 36): GeminiTransport._run has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/transport.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a4893737e591f4feaa2fc677db4fffd279e154029cd7bd3781e0162e04bad9"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationOverlap._texts (cyclomatic 35): ContinuationOverlap._texts has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f101241694773b06a072f6853e4a8e50634d643c941a212625b8ba0ef035d689"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiResponsesStream.feed (cyclomatic 35): GeminiResponsesStream.feed has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/responses_stream.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5d054e9e992980de7831ff6bb877865ded14a0dcf51ff5366a43120cf34751"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._restore_gemini_parts (cyclomatic 35): history_replay._restore_gemini_parts has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"48885d140991b2cd730b71d9297a165430805122dcc6e5b2cb884896e434e209"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationRequest.history (cyclomatic 34): ContinuationRequest.history has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_request.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"70054b050a25dd8bd2e9554e0e11006533c36c290bf058d7de7c8ee01b2243a1"}},{"ruleId":"D1","level":"warning","message":{"text":"failure_policy._classify_provider_failure (cyclomatic 33): failure_policy._classify_provider_failure has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/failure_policy.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f48ae0b436f1de5c087ed066e16de823508a4c0fef34093d0af9a07c3ff85"}},{"ruleId":"D1","level":"warning","message":{"text":"code_sessions.render (cyclomatic 33): code_sessions.render has cyclomatic complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47879ae9e4216968d8fbd8cadd98dc24e9dd50a098b3d18a489864b31b54afe"}},{"ruleId":"D1","level":"warning","message":{"text":"tokens.get_token_count (cyclomatic 32): tokens.get_token_count has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/tokens.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ef7302787610a6a3bde2d2ddd8f9374bd4f4d799da33f6d24e15d74c17819"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._validate_record (cyclomatic 32): history_replay._validate_record has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99477c6d4a695b7f27a0579a11e87ffa7994ddd95c7a99eb368e4c838a879e9"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._prepare_chat_content (cyclomatic 32): history_replay._prepare_chat_content has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a87c18b60d74c5d8e1cea3d7c6e4cb3fa75e63f76158ec53c7dc25c257dac83"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexAppServer._packet (cyclomatic 32): CodexAppServer._packet has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_app_server.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dd5338e2463093029972261300fb331cc7b02601485700831233c811ed77db"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolEventAdapter.feed (cyclomatic 31): ResponsesToolEventAdapter.feed has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44f29e3db0510bf671bc3b38fa3779a1e873637522f92a556573e17e8334474"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagingNodeRunner._process_node_impl (cyclomatic 31): MessagingNodeRunner._process_node_impl has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/node_runner.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"349688ed46a405769f4eeca1e63f21570d3a1da6620e4005071c1de5b29a7be0"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolAdapter.restore_tools (cyclomatic 30): ResponsesToolAdapter.restore_tools 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":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cbe20c3b6af4036f2a1c429b48bd0397a2f669625e3de71b44497c311f344b"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolCallBuffer._finish_item (cyclomatic 30): ResponsesToolCallBuffer._finish_item 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":"src/free_claude_code/core/openai_responses/tool_calls.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7be5c1cd93664cd473346626a8c8f01d1a0f08dedc7b223a8e3206bf41a54ea"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagingRateLimiter._worker (cyclomatic 30): MessagingRateLimiter._worker 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":"src/free_claude_code/messaging/limiter.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e60a0b81824e84b4208c72f0778b4409c89c2cef3cb8d0eb927f39c5efd0901"}},{"ruleId":"D1","level":"warning","message":{"text":"StructuredReasoningStream.events (cyclomatic 30): StructuredReasoningStream.events 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":"src/free_claude_code/providers/openai_chat/reasoning_details.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"515e7681db3ee3b989ef7ab9feaba176f8a809171979e3687583a2f394b6cdb6"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIChatTransport._create_stream (cyclomatic 30): OpenAIChatTransport._create_stream 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":"src/free_claude_code/providers/openai_chat/transport.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8aa40d2442f8bfffceab37d508028b31bbe32ed3d411a3ed2c5f2326d99fae"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.refreshStartup (cyclomatic 30): admin.refreshStartup has cyclomatic complexity 30 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8983e20076f4cce3a503e844222dc402b532655f7d5090447b0d0aeaae998c5"}},{"ruleId":"D1","level":"warning","message":{"text":"NativePrompt.answer (cyclomatic 29): NativePrompt.answer has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1153fbff9439340faf248a0778ca8b2fd15f7a3d7b64eb3e818e17eb19baf50c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_protocol._validate_field (cyclomatic 29): codex_protocol._validate_field has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a07813bc4b1dba0fbcc3320c49bc1183df651898484e83ae21b8021e0dbd9b"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiMessagesStream.feed (cyclomatic 28): GeminiMessagesStream.feed has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/messages_stream.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"290895ff334cfcdfd9ea180ea4c96736bc26626e5b38135f38a5291a478d49fc"}},{"ruleId":"D1","level":"warning","message":{"text":"replay.decode_bundle (cyclomatic 28): replay.decode_bundle has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/replay.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa31d15279f0f9180a9c7ecc082cebc1771238c9848e67cf5ca6394e899172d"}},{"ruleId":"D1","level":"warning","message":{"text":"merge (cyclomatic 28): merge has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04b8e7c036f123ffeb45d55d1981bc77bb5f12936f6d9a9076c6973217119a5"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionState.stage_item (cyclomatic 27): SessionState.stage_item 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":"src/free_claude_code/application/code_sessions/state.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1259777f09b46c08e643a2a4fc2cd019572deb078cba7039d3b66e8c372f62"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedClaudeSession.start_task (cyclomatic 27): ManagedClaudeSession.start_task has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/cli/managed/session.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d01e847f97d9bf1c4a9519479f9780e722cb3675e4f7323e06efdd196cd31cb"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageTreeGraph.from_snapshot (cyclomatic 27): MessageTreeGraph.from_snapshot has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/graph.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e55502b1217c03d997a75b91164ac2d79b1965ccca96fb841a8763a5493a86"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatResponsesStream.feed (cyclomatic 26): ChatResponsesStream.feed has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdd09cfe84d0a0cdafb1f9d545bcf121396b15b5b689ee4d47a5ae7ee13714e"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay.readable_reasoning (cyclomatic 26): history_replay.readable_reasoning has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49c0fd2244edfddd0eb36bdcf5f285898fc82ef3f2fe288237fe9d15a646f42"}},{"ruleId":"D1","level":"warning","message":{"text":"request_policy.non_messages_reasoning (cyclomatic 26): request_policy.non_messages_reasoning 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":"src/free_claude_code/providers/github_copilot/request_policy.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b17255bc0471d5899ca7977353ba0c7b99ac4e34298f077af3702d3daba503"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexProtocol._project (cyclomatic 26): CodexProtocol._project has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc35309c1ae0861e29314641cfc87134c77cd55d89da64193755ba921d809f7"}},{"ruleId":"D1","level":"warning","message":{"text":"NativePrompt._form (cyclomatic 26): NativePrompt._form has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"626bc4a95beef2993b81ae3b2743e53e59c75d0a3eafb3a105b186347a85c8bb"}},{"ruleId":"D1","level":"warning","message":{"text":"credentials.resolve_credential_edit (cyclomatic 25): credentials.resolve_credential_edit has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/credentials.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e760d9b35a1153d5eeb1f222f24483a55724e28bd411d6fcf6595f784860e141"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicToOpenAIConverter._convert_assistant_message (cyclomatic 25): AnthropicToOpenAIConverter._convert_assistant_message has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"86df1c6142b8c376264fd9fab2c16ddec3cccb5cd82109c95d132ccd2b8d3a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"native.build_native_messages_request (cyclomatic 25): native.build_native_messages_request has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/native.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"080a8e3b8e61d022af7105db53cb13d8a0b4bfd452c96507e7920b18d1e76000"}},{"ruleId":"D1","level":"warning","message":{"text":"_ResponsesChatInputBuilder._apply_pending_reasoning (cyclomatic 25): _ResponsesChatInputBuilder._apply_pending_reasoning has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd10dec79c10d48d900bcb16f291f33c6a50587b7586355ed2a3453056a88e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolAdapter.__init__ (cyclomatic 25): ResponsesToolAdapter.__init__ has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e722f660715f07c192cd80244b85770e1c044bdd2ede218d69aea86ba93c51b6"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolAdapter._tool (cyclomatic 25): ResponsesToolAdapter._tool has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdab6134f381c873dd7c58705a15a2a91341293bbaa8953901973e67a38f7d5"}},{"ruleId":"D1","level":"warning","message":{"text":"sdk._endpoint (cyclomatic 25): sdk._endpoint has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/sdk.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbab97bcb6da6549c53dd5cdc85c82ce4bb6af624e6088cd6dc28bb44171ae22"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.updateProviderCard (cyclomatic 25): admin.updateProviderCard has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2343b4ca04858381c8da296f363281dee7ddb722a679baaffdcadc446d834c1a"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatMessagesStream.feed (cyclomatic 24): ChatMessagesStream.feed 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":"src/free_claude_code/core/chat_completions/messages_stream.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a667f45be8a13bba8eea1c2581c1b670ceeec049d6602f499ff202cf949538f2"}},{"ruleId":"D1","level":"warning","message":{"text":"request._reasoning_items (cyclomatic 24): request._reasoning_items 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":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bad0bf6fa2f5ef446f05cf121700ca0ba3b05f7e59df02484e117d8b869128c"}},{"ruleId":"D1","level":"warning","message":{"text":"request.chat_messages_body (cyclomatic 24): request.chat_messages_body 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":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbb4831d8fc17d1d2a9ebac16c42e3828509dc3308b71313584836b5323efe3"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationOverlap._feed (cyclomatic 24): ContinuationOverlap._feed 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":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaec4e980df1645f11a6f5ff70c3c288fa8ac56c86e3de0cf5c168ec968ece5"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationStream._map (cyclomatic 24): ContinuationStream._map 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":"src/free_claude_code/core/continuation_stream.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d46b8ac6b5b9b0eecb0a9da1acc2140e342404d5416392d91eeefb8a3db07f"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_search.resolve_client_search_history (cyclomatic 24): tool_search.resolve_client_search_history 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":"src/free_claude_code/core/openai_responses/tool_search.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88dbd3d01b1ba2298c11f9fb0bd8bc1f2f4cdcfb9b09c65db6bd6ee646590a3"}},{"ruleId":"D1","level":"warning","message":{"text":"response_collection._validate (cyclomatic 23): response_collection._validate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/response_collection.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7113e08a103bba4c9e4c25c9230a46fd01a01fc14dfd8b840ffc9799f1ecd7"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatToolCallBuffer.feed (cyclomatic 23): ChatToolCallBuffer.feed has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c033023e9f4f374c7baf3ae4e93cd3646f1787f1b078cd74d1d81ee8887700"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.json_schema (cyclomatic 23): schema.json_schema has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/schema.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df9c23984260d40d3b136afde0216515d893a2506781989a38626ebf3b40e2"}},{"ruleId":"D1","level":"warning","message":{"text":"provider_input._assistant_items (cyclomatic 23): provider_input._assistant_items has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_input.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7e7d3a12e5eeca30bcb81b19d10a1f79cb17ddc0b3c9aadbeacb2a319ee236"}},{"ruleId":"D1","level":"warning","message":{"text":"persistence.prepare_admin_update (cyclomatic 22): persistence.prepare_admin_update 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":"src/free_claude_code/config/admin/persistence.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ae81849280c01a1e6a122b5db3ec8031b63050271defcea1cbcea0a146c15b"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolCallIdentityResolver.resolve (cyclomatic 22): ToolCallIdentityResolver.resolve has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"acce2419af4d91373eae69ec2c8321ad09228622ee512fa198b86faff3a2785c"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationStream.finalize (cyclomatic 22): ContinuationStream.finalize 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":"src/free_claude_code/core/continuation_stream.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae6b009e9aac01d8a8a0303d90421b913a6827066e37fe7ea7a0700a830566c"}},{"ruleId":"D1","level":"warning","message":{"text":"history.normalized_history (cyclomatic 22): history.normalized_history 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":"src/free_claude_code/core/gemini/history.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7756b35c67a1c0de9d7016d7cac328848b78e8eda3b935fa69724e9feb1d2b"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._prepare_gemini_history (cyclomatic 22): history_replay._prepare_gemini_history 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":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f6560b25a44fc345541880db69029cdbf6b2251b11ff13745001ed8738aae6"}},{"ruleId":"D1","level":"warning","message":{"text":"VoiceNoteFlow.handle (cyclomatic 22): VoiceNoteFlow.handle 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":"src/free_claude_code/messaging/platforms/voice_flow.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"925c97c83a59a8b042e993124ece31fd8be34c983fb389dad365d51e1a24129b"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.renderField (cyclomatic 22): admin.renderField has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e608e3505affa2ff5c56f56ab3301f03bf7063759a825ab398aef04a38d4c3"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatToolCallBuffer._complete_native_group (cyclomatic 21): ChatToolCallBuffer._complete_native_group 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":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4399ccf2d32ee8978f5993c99b13761fc2cbf345db2f0b8f5704a1493907df83"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay.prepare_history (cyclomatic 21): history_replay.prepare_history 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":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e427a2d4e38f4cbdc26bed7787569c273203aa7a64ef358b91964e483f4f43"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._prepare_response_history (cyclomatic 21): history_replay._prepare_response_history 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":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"09be0cdde943e06935501c63fd327b46665771add1b85335b8c42a2eddafd451"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolAdapter.restore_item (cyclomatic 21): ResponsesToolAdapter.restore_item 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":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9befcc7a283d9dfcde8f7da27f2ba0c4c390b55d51c4cb6ed14d12979917eff0"}},{"ruleId":"D1","level":"warning","message":{"text":"renderItem (cyclomatic 21): renderItem 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":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3307bc63c6bc785aa9d54f54f114065004723027ccc14d1d1470a150b5c590fa"}},{"ruleId":"D1","level":"warning","message":{"text":"env_migrations.consolidate_managed_config (cyclomatic 20): env_migrations.consolidate_managed_config 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":"src/free_claude_code/config/env_migrations.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6595f4748672c968df68e9e9e26d2cd9465ba07edcb02f45d88ab4c2c754c94"}},{"ruleId":"D1","level":"warning","message":{"text":"DeliveredResponse.observe (cyclomatic 20): DeliveredResponse.observe 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":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bea2067603268f1c4bb510a6f7cb03c75d71de4f93f837ed3c58f81e428878"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay.resolve_messages_replay (cyclomatic 20): history_replay.resolve_messages_replay 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":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1687b235b5a815e3a0880ec7bcd19ad64495b4d07bad7d5abbe40537b7b37cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesProviderStream._item_done (cyclomatic 20): ResponsesProviderStream._item_done 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":"src/free_claude_code/core/openai_responses/provider_stream.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"69085ea43063fb4da34b3fc636b86408a0c2256f79b765dd84b13b419992bbf6"}},{"ruleId":"D1","level":"warning","message":{"text":"ReasoningCorrection.retry_body (cyclomatic 20): ReasoningCorrection.retry_body has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/reasoning_compatibility.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0120b729ca581befe19acaaef9113983f298b7622b4c858cccc35421bf55c9"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.inputForField (cyclomatic 20): admin.inputForField 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":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"241e0f03b6c2d236af5fb0009b41f7f97fa65634441e351476b60dfe7c3daaa7"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionState.match_history (cyclomatic 19): SessionState.match_history 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":"src/free_claude_code/application/code_sessions/state.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd367dbc196d3bd6372ee2252c1415ab0051745bf318a9fa3b90b5835279387"}},{"ruleId":"D1","level":"warning","message":{"text":"request.chat_responses_body (cyclomatic 19): request.chat_responses_body 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":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b498e3c49a24bd6e8564fd5ef222a313595a88f4cae3220b8c0b919d69857783"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatResponsesStream._item (cyclomatic 19): ChatResponsesStream._item has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"62489316ecb52e01990b7292a3934cece061b471387d8c9ecb50db0caa2bec32"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_calls._native_parts (cyclomatic 19): tool_calls._native_parts 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":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed41bbfa72b693f437efb4b37587a181e3f0e5a92aec19eab32d32ad9c7fa159"}},{"ruleId":"D1","level":"warning","message":{"text":"DeliveredResponse._chat (cyclomatic 19): DeliveredResponse._chat 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":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25b1800205c6a4f18040224b39289fc47fad847b66370cb0a0c86f41a7310a8"}},{"ruleId":"D1","level":"warning","message":{"text":"request._controls (cyclomatic 19): request._controls 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":"src/free_claude_code/core/gemini/request.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99fd54de11e4a1b56d246060c3508ed6efa716af2401173175608c1902ec440"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_request.build_responses_chat_request (cyclomatic 19): chat_request.build_responses_chat_request has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d35b42a86745f50e4898027510afaf026df89b61a2ced167370f8f60bf1888"}},{"ruleId":"D1","level":"warning","message":{"text":"messages_request.build_responses_messages_request (cyclomatic 19): messages_request.build_responses_messages_request has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd0b386374569336f3fff0a36648c01e1617743c05572e2f81c9e275b537a04"}},{"ruleId":"D1","level":"warning","message":{"text":"openai_tool_names.encode_openai_chat_tool_names (cyclomatic 19): openai_tool_names.encode_openai_chat_tool_names 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":"src/free_claude_code/core/openai_tool_names.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00ecf9f3e0637c379a7e29b3afee8b9e7d331134280752359d7ef8d0dc37378"}},{"ruleId":"D1","level":"warning","message":{"text":"CopilotResponsesEvents.__call__ (cyclomatic 19): CopilotResponsesEvents.__call__ 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":"src/free_claude_code/providers/github_copilot/responses_events.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"267f5e04e19cb41e3d716623f1cf3fd3067f9aad4d02bf9d4d6a7c1ed6f765ab"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_cli_matrix.classify_probe (cyclomatic 18): claude_cli_matrix.classify_probe has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/claude_cli_matrix.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9082225d4b87e3425736db87e0eb69306f16d6f94aef5404080f9b3595211ad5"}},{"ruleId":"D1","level":"warning","message":{"text":"request._normalized_search_history (cyclomatic 18): request._normalized_search_history has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/request.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb18a66eb9e76b3aab5a1258fb17d2d2a638f9de09d19da75aec3b72d946353"}},{"ruleId":"D1","level":"warning","message":{"text":"WebToolService._stream_automatic_search (cyclomatic 18): WebToolService._stream_automatic_search has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/service.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"29366f7007d6da6ab4e12154f328bbeea58b968ac07d47a923447022d1a2309f"}},{"ruleId":"D1","level":"warning","message":{"text":"custom_providers.merge_custom_provider (cyclomatic 18): custom_providers.merge_custom_provider has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/custom_providers.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5ed6c785ac51df7a99c50aee64b5fdcd7ab213d5857d1b2a862e468cf820fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatToolCallBuffer._feed_native (cyclomatic 18): ChatToolCallBuffer._feed_native has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1546c124408162fe22a34441e980cb714002f8be7c095965be08a155c69addf"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationOverlap._render (cyclomatic 18): ContinuationOverlap._render has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c5f4d055c0dd82fbecc58a0aa7b595dd33cfe8a1ac39eaebfc4b3951fe92a4"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._continuation_replay (cyclomatic 18): history_replay._continuation_replay has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c688efe901fc0910235c1dcb11bc2ecc3c1acdae63d5bb73b7c7bf434d62058b"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._prepare_messages_content (cyclomatic 18): history_replay._prepare_messages_content has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77fcf0d5ad65d504c1f37c60a164e883b8506f7976b52e41e1ac34869f762ea"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolAdapter._identity (cyclomatic 18): ResponsesToolAdapter._identity has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52440357d95514d74d7e54dcc11643765391bd4d4c0b5ac83d156f315a197b8"}},{"ruleId":"D1","level":"warning","message":{"text":"replay_finalization._carrier_fields (cyclomatic 18): replay_finalization._carrier_fields has cyclomatic complexity 18 (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":"src/free_claude_code/core/replay_finalization.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b5774d512b94e5c9d8723085e4e1203736365084b00f208c4f6d2e08f62bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationSeed.readable_text (cyclomatic 18): ContinuationSeed.readable_text has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/stream_recovery.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb3c48bf5fe64cb2753beb1e3258518e4b5db3a8631319875f76d1a997fcb7e"}},{"ruleId":"D1","level":"warning","message":{"text":"claude_desktop_integration._load (cyclomatic 18): claude_desktop_integration._load has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/harnesses/claude_desktop_integration.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd98fb8bee76ed13ca84c90a9706fbce76074bae60c53c7ca677ebee4fd5c0a6"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagingRateLimiter.shutdown (cyclomatic 18): MessagingRateLimiter.shutdown 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":"src/free_claude_code/messaging/limiter.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ea5f5a4d166468808730d64d66d2cf39288b1114973fd3ea8eba5b04c27da0"}},{"ruleId":"D1","level":"warning","message":{"text":"AlibabaCloudProvider._list_models_payload (cyclomatic 18): AlibabaCloudProvider._list_models_payload has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/alibaba_cloud/client.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30b413166fdb4c422bfa3dc1bc1880f03fd7ee67df59eb83394f279458fd95c"}},{"ruleId":"D1","level":"warning","message":{"text":"compat._strip_document_blocks (cyclomatic 18): compat._strip_document_blocks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/deepseek/compat.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92e3d5369525789d78572647738f98a16479e60ecc59874c356a0cc95f4c184"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_schema._sanitize_nim_schema_node (cyclomatic 18): tool_schema._sanitize_nim_schema_node has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/nvidia_nim/tool_schema.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87a9460b95e80ca48d49928adf90bc327991cc6f8c82f57a9429349938100ce"}},{"ruleId":"D1","level":"warning","message":{"text":"StructuredReasoningStream.finish (cyclomatic 18): StructuredReasoningStream.finish has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/reasoning_details.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"79652d1941884b0f82ae33e4be7373c44e40da297a8a817a06e215b02163bce2"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.openCustomProviderDialog (cyclomatic 18): admin.openCustomProviderDialog has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5777e83b67b515f690eff5f0112860aec12eb51431e51da3f2d4c50b1ac58723"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.renderCodexIntegration (cyclomatic 18): admin.renderCodexIntegration 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":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0d3864703e0e009d0e0a7f4b4c3cc44d61d3fe86dee1fa61f2062ef3220c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"code_sessions.shell (cyclomatic 18): code_sessions.shell has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 5 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb882d9216ccefcdf7938b30d0311dd564386d3d7f0ed94fb22be451205e1d4"}},{"ruleId":"D1","level":"warning","message":{"text":"request.plan_automatic_web_search (cyclomatic 17): request.plan_automatic_web_search has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/request.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68397e45ac28f03b399049b837c46acf718c1336c61164bd38893cec2393d87"}},{"ruleId":"D1","level":"warning","message":{"text":"DeliveredResponse._messages (cyclomatic 17): DeliveredResponse._messages has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745a985c93079d8ed05621841bf1caec41465bdf4e7b302cc377748d4c468dc"}},{"ruleId":"D1","level":"warning","message":{"text":"DeliveredResponse.snapshot (cyclomatic 17): DeliveredResponse.snapshot has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a9a1a67390fddb1d3fb0df7a7bf64552dca82bec06c76cdaf23a84ccbcb088"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiResponsesStream._item (cyclomatic 17): GeminiResponsesStream._item has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/responses_stream.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe34228d6e3b7a594c76fdff12437ae80f3551ef4dc87ce84d267005d24270e5"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_request._body_tool_names (cyclomatic 17): chat_request._body_tool_names has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"3627409076e433b08eb020333ac80b64f04a48c5414ba401df6b68222865ca6c"}},{"ruleId":"D1","level":"warning","message":{"text":"_MessagesInput.add (cyclomatic 17): _MessagesInput.add has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0127e7d0d44cebd17227abf1ece2bb9dd39930e364971833006ae3e41b890f9c"}},{"ruleId":"D1","level":"warning","message":{"text":"messages_request._output_format (cyclomatic 17): messages_request._output_format has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1691ce12a1314105759dc0d5b9f5a51440b04a6adf7d1a19ada3f477c62b6bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicToResponsesStream.feed (cyclomatic 17): AnthropicToResponsesStream.feed has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_stream.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c46d45b86b1abf3ede16837a33474e0eef9df1e51a50064ba1cffeedd7fdfb"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesToolAdapter._input (cyclomatic 17): ResponsesToolAdapter._input has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4469e0e05eb7c5489ffcbd3bd09f4292de8724901d287c504cb8ee7e8a44067"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_search._merge_tool_groups (cyclomatic 17): tool_search._merge_tool_groups has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_search.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"237c4ffe7eeb86ea213fa45a9bc09b23c768c0873d1ee4a2bba11eb46e4eccec"}},{"ruleId":"D1","level":"warning","message":{"text":"TranscriptBuffer.apply (cyclomatic 17): TranscriptBuffer.apply has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/buffer.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f926824577af491d9627bf219d906cf4208d00af7f757d5967caaa57e59ade"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageTree.remove_message_subtree (cyclomatic 17): MessageTree.remove_message_subtree has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/runtime.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"80502f1239aacd4df8ed2633762cc7c2de84ffc47aa701efe55764240a3b86dc"}},{"ruleId":"D1","level":"warning","message":{"text":"headers.native_request (cyclomatic 17): headers.native_request has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/headers.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74c2ad08049795f02e24eb092fdab84ab6881479e207081c83ee00ce2f30d93"}},{"ruleId":"D1","level":"warning","message":{"text":"models.model_record (cyclomatic 17): models.model_record has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/models.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b11abeaa5ce622f3690b2305667ef4583a08cdfcc11631217632796df6dd97"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiStream.finish (cyclomatic 17): GeminiStream.finish has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/stream.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be546d0f19cb03042d769cd4d6f3b8494a31420ba38a1eaf507bd147245ebc4"}},{"ruleId":"D1","level":"warning","message":{"text":"SdkRuntime._close_client (cyclomatic 17): SdkRuntime._close_client has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/sdk.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd076ca1f49e1199f13f0bbc0ab10620ce53c26b2d78b87fd7485da6f34e5dd"}},{"ruleId":"D1","level":"warning","message":{"text":"discovery._provider_query_failure_reason (cyclomatic 17): discovery._provider_query_failure_reason has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/runtime/discovery.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e950055325ce1ea7c7cb794c8371b1f2103e9b6d67511e6b6b4c2c33ac273c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"IntegrationService._dsh_desktop (cyclomatic 17): IntegrationService._dsh_desktop has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"086215deff15f707e9faf6f055c222cebd410ed3146b8b470d148fe417c19955"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.renderClaudeDesktopIntegration (cyclomatic 17): admin.renderClaudeDesktopIntegration has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82e31c5ff319b2cd829f169b717d1a019d266c6bfa33ded1aa626b667e95f82"}},{"ruleId":"D1","level":"warning","message":{"text":"code_sessions.detail (cyclomatic 17): code_sessions.detail has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e502a1a6a492a7b07249add56f21a4083c80a5fc8d837c40f17541d11b47c1b8"}},{"ruleId":"D1","level":"warning","message":{"text":"code_sessions.readBootstrap (cyclomatic 17): code_sessions.readBootstrap has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"04350223a81bd49985a19205183dc0a584654db1ee5bd19ed2c0504e84577d23"}},{"ruleId":"D1","level":"warning","message":{"text":"code_sessions.synchronize (cyclomatic 17): code_sessions.synchronize has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7be6d2f1a353d1a239938c3f9824c3965c7b4ef268720c2808d98f7b451e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"FccModelCombobox.handleKeydown (cyclomatic 17): FccModelCombobox.handleKeydown has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/model_combobox.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed341dce1a13d46bb64f6e4090dfde054e77c31c4ad74dca8a215096a85604db"}},{"ruleId":"D1","level":"warning","message":{"text":"model_catalog._build_direct_models_response (cyclomatic 16): model_catalog._build_direct_models_response 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":"src/free_claude_code/api/model_catalog.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2815c09331581e3d81e4d66eacb11e7a48827658b9be9c3f381016673d877677"}},{"ruleId":"D1","level":"warning","message":{"text":"env_migrations._normalize_credential_lists (cyclomatic 16): env_migrations._normalize_credential_lists 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":"src/free_claude_code/config/env_migrations.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd6c1a75b0c724fa5229d8b5c1ca910f7937a3d36284419e5763c56a7aa3cee"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicToOpenAIConverter._convert_message_to_segments (cyclomatic 16): AnthropicToOpenAIConverter._convert_message_to_segments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e3093c0ef1b7cb7f8f000ec312928efe883cff8509a9562d8b22910475f9c"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagesToolCallBuffer.feed (cyclomatic 16): MessagesToolCallBuffer.feed 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":"src/free_claude_code/core/anthropic/tool_calls.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5858c8655c414fc1602610ed295e2a5afd9ab4787a1145899bea15223dfef045"}},{"ruleId":"D1","level":"warning","message":{"text":"_PendingCall.add (cyclomatic 16): _PendingCall.add has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aed9a9c0e578eb7a723f07af6f457ae467575e008695cf27fcc1f35e9ec986c"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuationOverlap._check_terminal_order (cyclomatic 16): ContinuationOverlap._check_terminal_order 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":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4115aab5f988321c1cdc66a18ef0e1aaae2394d3d7bcddf8f2ecc2e18be61f03"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicToResponsesStream._start_block (cyclomatic 16): AnthropicToResponsesStream._start_block 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":"src/free_claude_code/core/openai_responses/messages_stream.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f592273e97aaa8f87b11a49d8714707ac6dd1e5bd520e42525ef23bcae8b1522"}},{"ruleId":"D1","level":"warning","message":{"text":"stream_output.call_references (cyclomatic 16): stream_output.call_references 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":"src/free_claude_code/core/stream_output.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc89b49a4f76327009fedd77d1ed46216913996b2d5e206501b762e4537a5fb"}},{"ruleId":"D1","level":"warning","message":{"text":"stream_recovery.assess_recovery (cyclomatic 16): stream_recovery.assess_recovery has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/stream_recovery.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf6679f32d9e5b866fd0b7d0ac3ac5f56d92beafd6ed2c79a3b81464440cad6"}},{"ruleId":"D1","level":"warning","message":{"text":"renderer.render_segments (cyclomatic 16): renderer.render_segments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/renderer.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49cffc4bdbc4d5f5abadeb2b7ca8a62b1872f87ab9472102a1eefd3f0d2ff01"}},{"ruleId":"D1","level":"warning","message":{"text":"PendingVoiceRegistry.handoff (cyclomatic 16): PendingVoiceRegistry.handoff 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":"src/free_claude_code/messaging/voice.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2654afc737194cf53501011ebc4ea364668ab9bfb585d9977ec5c6703dbb9d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"provider._apply_native_reasoning (cyclomatic 16): provider._apply_native_reasoning has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/provider.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eb091c0f16b98ab09156ffb1683009c8dcc00fff2349254865a71cfe24572c"}},{"ruleId":"D1","level":"warning","message":{"text":"failure_policy.retryable_transient_status (cyclomatic 16): failure_policy.retryable_transient_status has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/failure_policy.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e687e839fccdf85bc16bde46f506450eadd42c06340cfa7c30df2dc67eff749"}},{"ruleId":"D1","level":"warning","message":{"text":"sdk._model (cyclomatic 16): sdk._model has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/sdk.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"16270bfb863084afb795ef0a0306281d16f7082bb54622ede7b0573a512c3da0"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._reasoning_records (cyclomatic 16): history_replay._reasoning_records 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":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f24771afc11169e28d35e000663822e954a87f100e12b6e17fc8499c37b000"}},{"ruleId":"D1","level":"warning","message":{"text":"history_replay._rejected_record (cyclomatic 16): history_replay._rejected_record has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6097e1cdaf565e6c835301388e77b6121a8210fa633bec65b02ffd8675f2b8"}},{"ruleId":"D1","level":"warning","message":{"text":"admin.refreshLocalStatus (cyclomatic 16): admin.refreshLocalStatus has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1672, 1666). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b6aabdeac0c8b9a334a4db69c2d819267906939c73c71e9714e05c5f9a0fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicMessagesTransport._run (cognitive 139): AnthropicMessagesTransport._run has cognitive complexity 139 (threshold 15). Drivers by points: if/else 26 (75 pts), ternaries 7 (27 pts), loops 7 (25 pts), boolean chains 8, error handling 2 (4 pts) (nesting depth added 89). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf4373e621a057ba73de16a759b1684e6e21b657b662411fa8474fd7b31a31f"}},{"ruleId":"D2","level":"warning","message":{"text":"request._build (cognitive 137): request._build has cognitive complexity 137 (threshold 15). Drivers by points: if/else 31 (85 pts), ternaries 13 (32 pts), boolean chains 10, loops 5 (10 pts) (nesting depth added 78). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/request.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dcf9ff5494f1a21ec5084ca7b3943f76216032c76962358d9ca16c7cb86b71"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIResponsesTransport._run_execution (cognitive 129): OpenAIResponsesTransport._run_execution has cognitive complexity 129 (threshold 15). Drivers by points: if/else 26 (83 pts), loops 5 (16 pts), ternaries 5 (13 pts), boolean chains 9, error handling 3 (8 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_responses/transport.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b19bf87661530ceb1668ee4c18d1f04e437d800a9921c8997edfd8c5ad93119"}},{"ruleId":"D2","level":"warning","message":{"text":"buildPrompt (cognitive 128): buildPrompt has cognitive complexity 128 (threshold 15). Drivers by points: if/else 26 (66 pts), ternaries 10 (39 pts), loops 4 (12 pts), boolean chains 7, error handling 2 (4 pts) (nesting depth added 79). Of this number, 75 points are the body\u0027s own statements and 53 belong to 21 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d27ac55dc7445eb8bf3eff74e133c680d6b1c92dec45496ade51e35a96415c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatResponseAccumulator.feed (cognitive 119): ChatResponseAccumulator.feed has cognitive complexity 119 (threshold 15). Drivers by points: if/else 21 (70 pts), loops 9 (35 pts), boolean chains 9, ternaries 1 (5 pts) (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/response.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a141fb0e2f37045bc498c887b1b1efad4d9f8cd2198b74a167dc8e67588d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"discord_markdown.render_markdown_to_discord (cognitive 111): discord_markdown.render_markdown_to_discord has cognitive complexity 111 (threshold 15). Drivers by points: if/else 20 (67 pts), loops 7 (25 pts), error handling 2 (13 pts), boolean chains 6 (nesting depth added 76). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"04300069cc4a3b96908e91dee744b42e9903ff08c0dcbfecdac0f160dcf86cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"telegram_markdown.render_markdown_to_mdv2 (cognitive 111): telegram_markdown.render_markdown_to_mdv2 has cognitive complexity 111 (threshold 15). Drivers by points: if/else 20 (67 pts), loops 7 (25 pts), error handling 2 (13 pts), boolean chains 6 (nesting depth added 76). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/telegram_markdown.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbdddffc4f57739e9722f599e59e5456c43870d1583c2b881489e51219a49f1"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiStream.feed (cognitive 110): GeminiStream.feed has cognitive complexity 110 (threshold 15). Drivers by points: if/else 31 (79 pts), boolean chains 13, loops 4 (10 pts), error handling 2 (8 pts) (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/stream.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca02672ef223cdd860474b9e544459ecf0b510e857887b8e63363a20ad41c83"}},{"ruleId":"D2","level":"warning","message":{"text":"passthrough.stream_native_messages (cognitive 104): passthrough.stream_native_messages has cognitive complexity 104 (threshold 15). Drivers by points: if/else 26 (72 pts), loops 5 (13 pts), error handling 5 (9 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/passthrough.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4bdf56b2a794638eb057e3326e1e5af965e29546a7b5b8e9cca217976cd038"}},{"ruleId":"D2","level":"warning","message":{"text":"model_listing.extract_openai_model_infos (cognitive 103): model_listing.extract_openai_model_infos has cognitive complexity 103 (threshold 15). Drivers by points: if/else 28 (78 pts), boolean chains 11, loops 5 (10 pts), ternaries 2 (4 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/model_listing.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"61baa2b360f21c9d051d5b24b6080167269fedfb70c1d6d3dd87801884d11d35"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeMessagesStreamState.accept (cognitive 98): NativeMessagesStreamState.accept has cognitive complexity 98 (threshold 15). Drivers by points: if/else 42 (79 pts), boolean chains 15, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/native_stream.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d29b6052951e9768bcdf9c37359935be66c821aba07fad57f687b16032d6632"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolAdapter.restore_tools (cognitive 96): ResponsesToolAdapter.restore_tools has cognitive complexity 96 (threshold 15). Drivers by points: if/else 20 (75 pts), ternaries 2 (8 pts), boolean chains 7, loops 2 (6 pts) (nesting depth added 65). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e42c9da6ced8976c2b5c27cae811574fd1e5e98690228a59f5b6dac01d5d58"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay.history_retry_body (cognitive 95): history_replay.history_retry_body has cognitive complexity 95 (threshold 15). Drivers by points: if/else 24 (63 pts), boolean chains 14, loops 4 (9 pts), ternaries 3 (8 pts), error handling 1 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd1ef016a5fa80c41cceaf2bb1f8fed70b2b48ae8924337cfd7dd7b77e36a60"}},{"ruleId":"D2","level":"warning","message":{"text":"native_request.messages_to_gemini (cognitive 86): native_request.messages_to_gemini has cognitive complexity 86 (threshold 15). Drivers by points: if/else 26 (56 pts), ternaries 6 (20 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6d5ef1ae531b93eb5d65819b6933b9a93f965ed166d83a1b97c8d968c5d752"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiTransport._run (cognitive 83): GeminiTransport._run has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (59 pts), ternaries 3 (10 pts), error handling 3 (6 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/transport.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b984e3e18cfaada4ad4f077172096128084de88479a173f77ab8f2e9e455dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceRecoveryState.observe (cognitive 81): SourceRecoveryState.observe has cognitive complexity 81 (threshold 15). Drivers by points: if/else 23 (51 pts), boolean chains 20, loops 4 (10 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/continuation.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0324f1ea2e994c2f454429adfecc96c8b7233ef72f5dacc3a8763b4a4b6583"}},{"ruleId":"D2","level":"warning","message":{"text":"_OpenAIChatStreamRunner._run_execution (cognitive 81): _OpenAIChatStreamRunner._run_execution has cognitive complexity 81 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 12 (28 pts), boolean chains 5, error handling 2 (4 pts), ternaries 3 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/transport.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f77fa68b38df95076c151f5fe5f06108ce03877724c90d915fcf1f2499b5d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"event_parser.parse_cli_event (cognitive 80): event_parser.parse_cli_event has cognitive complexity 80 (threshold 15). Drivers by points: if/else 30 (60 pts), ternaries 4 (10 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/event_parser.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99e9ad8c78e9676149ebc9e1d9585c5d6bb20fbb876384da220a357d9141d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatRequest.validate_messages (cognitive 79): ChatRequest.validate_messages has cognitive complexity 79 (threshold 15). Drivers by points: if/else 21 (45 pts), boolean chains 23, loops 5 (8 pts), ternaries 1 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c148fe0cba973310161483bdbae8ffcd792dc35403a704218f50e0ca000fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"tokens.get_token_count (cognitive 78): tokens.get_token_count has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (47 pts), error handling 2 (10 pts), loops 4 (9 pts), ternaries 2 (8 pts), boolean chains 4 (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/tokens.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a81378ba52db397de15014496528385d6bc2ec68b5685c242f8467e4fc4271"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._prepare_chat_content (cognitive 77): history_replay._prepare_chat_content has cognitive complexity 77 (threshold 15). Drivers by points: if/else 18 (50 pts), loops 4 (15 pts), boolean chains 9, ternaries 1 (3 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"8544b6f2702b5f0d5e77b1685fb89ae148159f498c46107aae5a2ac922a92184"}},{"ruleId":"D2","level":"warning","message":{"text":"request_policy.resolve_messages_options (cognitive 77): request_policy.resolve_messages_options has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (44 pts), boolean chains 24, ternaries 6 (9 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/request_policy.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cea7a6fb970ca79640c94e1d2a470c08c0b03e461e6407bbfd47d331399f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagingRateLimiter._worker (cognitive 76): MessagingRateLimiter._worker has cognitive complexity 76 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 6 (14 pts), error handling 5 (12 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/limiter.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16c395e84032446f43fa1daa796cff7587f15927abeff878233cd145bdb7c56"}},{"ruleId":"D2","level":"warning","message":{"text":"apply (cognitive 73): apply has cognitive complexity 73 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 22, ternaries 13 (18 pts), loops 1 (2 pts), error handling 1 (nesting depth added 14). Of this number, 72 points are the body\u0027s own statements and 1 belongs to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c029b0c4d5b9bab0ff5ebef1abab26f30c2b140df9125f91c257d536df0f4abf"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveredResponse._responses (cognitive 68): DeliveredResponse._responses has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (30 pts), ternaries 10 (23 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a21da432080504614adcb53c68a63f800b4a166f9aec319376b46157987123"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicResponseStream._publish (cognitive 67): PublicResponseStream._publish has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 17, ternaries 3 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/stream_delivery.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e08d6b809d26cebe6dada0388f942756531bbd2f2f543455b0dff705bcf9b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationRequest.history (cognitive 66): ContinuationRequest.history has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (55 pts), boolean chains 5, loops 2 (5 pts), ternaries 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_request.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d88bfbf494ac74983e695ac739ffe347916aa709c205f524984d82ab108be92"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolEventAdapter.feed (cognitive 64): ResponsesToolEventAdapter.feed has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (43 pts), boolean chains 8, ternaries 2 (6 pts), error handling 1 (4 pts), loops 1 (3 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f130ccdd9912a557c06d9d6a2703dcb04a191adcf0fdd9fe77900c61be25b"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolCallBuffer.feed (cognitive 63): ResponsesToolCallBuffer.feed has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (46 pts), boolean chains 13, loops 1 (3 pts), ternaries 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_calls.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"74de7dd12fc04aaf34f581bfece82f4b012bdc9480be82358fa6ecb8b180d829"}},{"ruleId":"D2","level":"warning","message":{"text":"native_request.responses_to_gemini (cognitive 62): native_request.responses_to_gemini has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (43 pts), ternaries 5 (9 pts), boolean chains 7, loops 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dd753918ee56cdc4db1230c6d128326ff261812d11edefdb6f84236f8b931d"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._restore_gemini_parts (cognitive 62): history_replay._restore_gemini_parts has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 9, loops 3 (5 pts), error handling 1 (4 pts), ternaries 3 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f8562ca3a5f8400d6faddf4b1cdf6b833299ef1b9f6d12d4621ad25f25e46c"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationOverlap._texts (cognitive 59): ContinuationOverlap._texts has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 14 (24 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1a10ad49ff5a6a2b396cb35e453e3d6f7e157c242f83d80900c5abee09cfbe"}},{"ruleId":"D2","level":"warning","message":{"text":"native_request.chat_to_gemini (cognitive 59): native_request.chat_to_gemini has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (40 pts), loops 5 (8 pts), ternaries 3 (6 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd452048d2fc4dbc9b045cbd39f726f42a9326e5120d67c2cd5c39820192c2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiResponsesStream.feed (cognitive 58): GeminiResponsesStream.feed has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (31 pts), ternaries 11 (23 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/responses_stream.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"728c37fbbef32523a222561ec977d4a7ed6b426151654de3096aa5b5d60a7300"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIChatTransport._create_stream (cognitive 58): OpenAIChatTransport._create_stream has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (41 pts), ternaries 3 (7 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/transport.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"24056c156285c58309befa15f45aabd66648f82bc7351e091027a719fe2dba9a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexAppServer._packet (cognitive 57): CodexAppServer._packet has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 9, loops 1 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_app_server.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"370cba7c44af4b72b033a6e371227b6753ea40be5a77a7d45640c40dd3a1600a"}},{"ruleId":"D2","level":"warning","message":{"text":"history.normalized_history (cognitive 54): history.normalized_history has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (37 pts), ternaries 2 (8 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/history.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0023c3516bc7f6b1977cab7815886f6346748dfb21fb1802ec841ac697832d34"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveredResponse.closing_events (cognitive 53): DeliveredResponse.closing_events has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 4 (23 pts), if/else 7 (21 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc3567772904f9269390c9a2b398a5e311986b4bd484fef89f10425b8405536"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedClaudeSession.start_task (cognitive 51): ManagedClaudeSession.start_task has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 4 (12 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/cli/managed/session.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"062e8b82972fd169dbd4af640c5d9f6180684200de164559541701394612572e"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatToolCallBuffer._complete_native_group (cognitive 49): ChatToolCallBuffer._complete_native_group has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d6d9e6a75ed64e2649ee9f1431fd1e5084ddb2fa645b06bfc8dd2aef75a483"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolCallBuffer._finish_item (cognitive 49): ResponsesToolCallBuffer._finish_item has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 4 (9 pts), boolean chains 6, ternaries 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_calls.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee904cde6e6c67d147a9707685dec2853e7bf4381c9ccb38e793e779f08fffb"}},{"ruleId":"D2","level":"warning","message":{"text":"compat._strip_document_blocks (cognitive 49): compat._strip_document_blocks has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 3 (9 pts), boolean chains 3 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/deepseek/compat.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba91e233a2fa5f7d721008cdd7b970bf16d202c9eeb099f58b12fdd6c398ce50"}},{"ruleId":"D2","level":"warning","message":{"text":"request._reasoning_items (cognitive 48): request._reasoning_items has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 4 (6 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"551a7612b1a581dea2e4d88be80e45bbd66dfd5f04508290488e04bb9cb39be8"}},{"ruleId":"D2","level":"warning","message":{"text":"NativePrompt._form (cognitive 48): NativePrompt._form has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 5 (11 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"300574d6cde4b953b10810ad6e2d8cfbc59e68f4eeccf9559b14aa8420e338a5"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 48): render has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 6 (13 pts), boolean chains 9, loops 4 (7 pts) (nesting depth added 18). Of this number, 47 points are the body\u0027s own statements and 1 belongs to 10 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cbaf395cd7549b89e7307b70b87cb86fb1e1f469cc5d58eb6f2491e3b009ba"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_search._merge_tool_groups (cognitive 47): tool_search._merge_tool_groups has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 4 (7 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_search.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e841a3dc25cbb9c972b3a59ee74ccd06e999a798f3267f2e22fa676ad6eef5a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationStream._map (cognitive 46): ContinuationStream._map has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 5 (12 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_stream.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7374e46cd0ae4db4ce2be94287fc03dd23506e7a35dec904c40b0a416f5f95"}},{"ruleId":"D2","level":"warning","message":{"text":"StructuredReasoningStream.events (cognitive 46): StructuredReasoningStream.events has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 11, loops 3 (6 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/reasoning_details.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1bc8d6ce26a4997218580f7bee4ab9341d4e316ea99d198581d1201a3937ed"}},{"ruleId":"D2","level":"warning","message":{"text":"response_collection._validate (cognitive 45): response_collection._validate has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (11 pts), boolean chains 7 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/response_collection.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6481170e5d261e3fc79395914e25fb07c3936ff352f3f1c4418e221f642f128"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatResponsesStream.feed (cognitive 45): ChatResponsesStream.feed has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (28 pts), ternaries 6 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8a03496254534fdc2f1364640e6922a6efe59c8064ebc5562172d2e6a36448"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._prepare_response_history (cognitive 45): history_replay._prepare_response_history has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 4 (8 pts), boolean chains 4, ternaries 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"363c5537a332c7c72ccea6fc34bd9e3af6baac3a541413d7f1098dc62933a743"}},{"ruleId":"D2","level":"warning","message":{"text":"failure_policy._classify_provider_failure (cognitive 45): failure_policy._classify_provider_failure has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28 (42 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/failure_policy.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d5d633d19ee65bff5f7b84b5269fb0df740803a94f4cddebe8533af9d6d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"NativePrompt.answer (cognitive 45): NativePrompt.answer has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"292080725ec233745d2892ce7190cda0dbbf6840633c921bd86da5e1d84c3fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay.readable_reasoning (cognitive 43): history_replay.readable_reasoning has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 6, loops 4 (5 pts), ternaries 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30cf2fc46f89ce49067688b6cbec610ab7bb3084aa4bc42d136c4d397ee3bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexProtocol.notification (cognitive 43): CodexProtocol.notification has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 9, ternaries 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b924154e45354b91980d66cc1dd991a44846ec024894006476844d6c8bbaafa2"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagingNodeRunner._process_node_impl (cognitive 42): MessagingNodeRunner._process_node_impl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 7, ternaries 3 (7 pts), error handling 5, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/node_runner.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2698d18a5eec32d58eb23a4b05b0dfe2a5d329df3c13334f05342c427ba2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_schema._sanitize_nim_schema_node (cognitive 42): tool_schema._sanitize_nim_schema_node has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (12 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/nvidia_nim/tool_schema.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baf3d079893b55915171f34f0ab189a11fb9c76bfc2496bab71a183c34e5e59"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiMessagesStream.feed (cognitive 41): GeminiMessagesStream.feed has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/messages_stream.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f2939e190c4fe57ebd05f278d319fb9be6b56b2cf6b48369219eb16ac42d22"}},{"ruleId":"D2","level":"warning","message":{"text":"_ResponsesChatInputBuilder._apply_pending_reasoning (cognitive 41): _ResponsesChatInputBuilder._apply_pending_reasoning has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (9 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b014d12d575408bc8bdc765d286d7ae3331631cd7ea5835b427b217f17842"}},{"ruleId":"D2","level":"warning","message":{"text":"openai_tool_names.encode_openai_chat_tool_names (cognitive 41): openai_tool_names.encode_openai_chat_tool_names has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 3 (7 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_tool_names.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f81e34a297ab3468c21bfe78142d03a65da0571adc9b105469060f14898848"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageTreeGraph.from_snapshot (cognitive 41): MessageTreeGraph.from_snapshot has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/graph.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c60ddbedf4106fafa1c39c59595e1c26358952b2404cea501b5207672f8c7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolAdapter._tool (cognitive 39): ResponsesToolAdapter._tool has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c17b55a3f12dbd3d863f33ceab057bce98e2f63b4db6fd20cf226a6ee673985"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramMessenger._with_retry (cognitive 39): TelegramMessenger._with_retry has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (28 pts), error handling 3 (6 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/platforms/telegram_io.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a122f13ec33c24cf236b169c0a65fe9f672728fa405a8667944c9c5bbe3034"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._validate_record (cognitive 38): history_replay._validate_record has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 13, error handling 1 (2 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd35572a928fa5953bdecf51e2b05d1464796fd4a6f1ebac61d9b5719485001"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._prepare_gemini_history (cognitive 38): history_replay._prepare_gemini_history has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (9 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"741bf2a20e5ecf8783d425811850bce797a6825db3f342dbdc8256cd1ad2f242"}},{"ruleId":"D2","level":"warning","message":{"text":"provider_input._assistant_items (cognitive 38): provider_input._assistant_items has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 4 (8 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_input.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a9eacd72501a0229b7d19f6b618b313a9651545ce6e62e1ba750ea34e1b778"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicToOpenAIConverter._convert_assistant_message (cognitive 37): AnthropicToOpenAIConverter._convert_assistant_message has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4724aedf30cea64ba5eb3ea78175341dfb4894b7df4752afd46a772a5ba81c4"}},{"ruleId":"D2","level":"warning","message":{"text":"native.build_native_messages_request (cognitive 37): native.build_native_messages_request has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/native.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e86c68e85bad9c09576411048b17d0db17da9ebf4d23547c492dcd5028e0a30"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationOverlap._render (cognitive 37): ContinuationOverlap._render has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (7 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3253818d9e8f234d619d23858f1651002938394ce86884d8f377f02985c6b52"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay.prepare_history (cognitive 37): history_replay.prepare_history has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 6, ternaries 2, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fee426740a315dfde6bc34d635e8618218dcba01a7810d299cae759f5bfda6b"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay.normalize_messages_history (cognitive 37): history_replay.normalize_messages_history has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"928b5fe538623f40167d40653d56cb11f3b6fa5de2ffe773c0830cb9201a6965"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatMessagesStream.feed (cognitive 36): ChatMessagesStream.feed has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/messages_stream.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f3dd34cea9fc3a2160e516b7eb1ee1d2dfd0bc46383a742d48bb0d6ad54f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_search.resolve_client_search_history (cognitive 36): tool_search.resolve_client_search_history has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 8, ternaries 1 (3 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_search.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc23557980851348fe06aa7356a5953956e0d1391a473837379d55bf1db6edbb"}},{"ruleId":"D2","level":"warning","message":{"text":"stream_output.call_references (cognitive 36): stream_output.call_references has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/stream_output.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cc70b1f904571db73a2c3f30889e1c0fb69bda6a7f116a341ae3c57978a17e"}},{"ruleId":"D2","level":"warning","message":{"text":"replay.decode_bundle (cognitive 35): replay.decode_bundle has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 9, ternaries 3, loops 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/replay.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"746f25a9f9439bd660dbd13a185f66b1212336b72fb0112faa02325b21348c92"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_request._body_tool_names (cognitive 35): chat_request._body_tool_names has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c630f2af5451350f9224ba82f4c604a283310ac6214cc79391d2ce1b9988069"}},{"ruleId":"D2","level":"warning","message":{"text":"credentials.resolve_credential_edit (cognitive 34): credentials.resolve_credential_edit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/credentials.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"448affd8239427494df0668dc2070e67c5ff2eed086545358c6f3eb8c9c62412"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_providers.merge_custom_provider (cognitive 34): custom_providers.merge_custom_provider has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 1 (4 pts), loops 1 (3 pts), boolean chains 2, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/custom_providers.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"948e3ab30aa1ffe6d55df19ffcf51a34c6828fedcb1391ecf0a92332f7a3183d"}},{"ruleId":"D2","level":"warning","message":{"text":"request.chat_messages_body (cognitive 34): request.chat_messages_body has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 4 (8 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6899a6aecf55695e1da5b802dffe197d9fd2f963f575fd61aa6a6b06593fd357"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatToolCallBuffer._feed_native (cognitive 34): ChatToolCallBuffer._feed_native has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6398df4c7c073dbb7c36a9744d36e5740fc4731b0447484316e251d3c0af4310"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationSeed.readable_text (cognitive 34): ContinuationSeed.readable_text has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (21 pts), ternaries 2 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/stream_recovery.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c6b37ddd009d7e6b72671f82cc0517b865cc5662f6187091aee51d94817457"}},{"ruleId":"D2","level":"warning","message":{"text":"sdk._endpoint (cognitive 34): sdk._endpoint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, error handling 4 (7 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/sdk.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41b3fe7a32373c6895d01b3752b5a77e3b282afa729c7fad7d89fe020695763"}},{"ruleId":"D2","level":"warning","message":{"text":"merge (cognitive 34): merge has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, loops 2 (3 pts), other 3, ternaries 3 (nesting depth added 7). Of this number, 31 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a8f28783559b2b36c156d599ef7ce94ab9f95a079858a52d5ef4b71b76e657"}},{"ruleId":"D2","level":"warning","message":{"text":"persistence.prepare_admin_update (cognitive 33): persistence.prepare_admin_update has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 5 (10 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/persistence.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b588c9e8d772fa46de66680c3a59db6c5ee0656dc5946f7d6270b38b0140aa"}},{"ruleId":"D2","level":"warning","message":{"text":"env_migrations._normalize_credential_lists (cognitive 33): env_migrations._normalize_credential_lists has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), error handling 2 (4 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/env_migrations.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88bff3bd4d86a812617e979032d1ef957c5d675ff415dc3d3eb0ad2e57a2b74"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationOverlap._feed (cognitive 33): ContinuationOverlap._feed has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4a04591b567bd9a63f82a06967a2988e514e85f9c6e5c14b21e7cbe7789610"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.json_schema (cognitive 33): schema.json_schema has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, error handling 1 (3 pts), loops 3, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/schema.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bba5386ff459c524510011b007e93f9d94bd797a4232b395061e6fe091d0bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._prepare_messages_content (cognitive 33): history_replay._prepare_messages_content has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0a461cd0dab4b3c47c721eaaf2795c138983466720f005f0edb3eab0134e03"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexProtocol._project (cognitive 33): CodexProtocol._project has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 4 (8 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0233818c00142a22735791b934cf9f326805afd4c6939281188236f46917f20e"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_protocol._validate_field (cognitive 33): codex_protocol._validate_field has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (15 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e06317ea56d209b2ee892e47db95c8f469e6999c74c9dbcd846b9119a537c2"}},{"ruleId":"D2","level":"warning","message":{"text":"renderControls (cognitive 33): renderControls has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 21, if/else 4, loops 3 (4 pts), ternaries 4 (nesting depth added 1). Of this number, 32 points are the body\u0027s own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b02ecd06ee732ad5163cfbd1d1799c11cad5714b5c6b568536b4770c74bf2da"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatToolCallBuffer.feed (cognitive 32): ChatToolCallBuffer.feed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80310bdbcff1f8146c6d21894f12b9c6fc464286843b85238e744532e0dfde5"}},{"ruleId":"D2","level":"warning","message":{"text":"AlibabaCloudProvider._list_models_payload (cognitive 32): AlibabaCloudProvider._list_models_payload has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 6, ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/alibaba_cloud/client.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8235357442df09594b3505d8bdfca3b8a26e60fc9b8ed4c1154cc06e6e7e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"tokens._input_costs (cognitive 32): tokens._input_costs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 7 (13 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/lmstudio/tokens.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6c652b2cb1ab863dd0a072d8e2109d1b9008826854a8dfebc9b17c3b7a67a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningCorrection.retry_body (cognitive 32): ReasoningCorrection.retry_body has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (9 pts), ternaries 4 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/reasoning_compatibility.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1841cb6d8731aba898c309ff7bb62b2fa0742ac278d8a9a3a6a52318eea1b6d6"}},{"ruleId":"D2","level":"warning","message":{"text":"_ToolScope.__init__ (cognitive 30): _ToolScope.__init__ has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (6 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdebc91865bf1244240effd7fba10c59aedb32626b9788083aa72a27f78606e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesProviderStream._item_done (cognitive 30): ResponsesProviderStream._item_done has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_stream.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"981a7890a4ef6f4b5e7848fbff59803bd6440aee2b5ae14cb11d5a6784717123"}},{"ruleId":"D2","level":"warning","message":{"text":"history_negotiation._normalize_chat_override (cognitive 30): history_negotiation._normalize_chat_override has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_negotiation.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a950c7c887cd6c497f5fd6828a7095e46440f083efc6866bf2e90664e102882"}},{"ruleId":"D2","level":"warning","message":{"text":"StructuredReasoningStream.finish (cognitive 30): StructuredReasoningStream.finish has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 7, ternaries 2 (5 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/reasoning_details.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6098f6a83d9e305dd1b2ba4e70285f34aa19c6049c46d6be643ef4f3eb646a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState.stage_item (cognitive 29): SessionState.stage_item has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 12, ternaries 8 (10 pts), if/else 6 (7 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":"src/free_claude_code/application/code_sessions/state.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a04d50aca6e14bf16161b56c1bd93f90d6cc1fb51f8e8134556b6ac80486cd"}},{"ruleId":"D2","level":"warning","message":{"text":"request._normalized_search_history (cognitive 29): request._normalized_search_history has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/request.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0216b370814bb34d3ee67911bd874340bade0cec99de124c3588972474f7138d"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings.validate_provider_references (cognitive 29): Settings.validate_provider_references has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 3 (7 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/settings.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbd0beaea1be492d2e5553382a5441963d4f856e56fa9bce794d6e958111488"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay.resolve_messages_replay (cognitive 29): history_replay.resolve_messages_replay has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ee35f3fa9aec64501b4857c7243e6b2275353574eb399b7b31c1c0da8a9505"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolAdapter.__init__ (cognitive 29): ResponsesToolAdapter.__init__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 8, loops 1 (3 pts), ternaries 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"069c20caa54aceb5dd28c66f7da3fc0ddddbaa46b3fc95524f7858c6d65f41e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolAdapter._input (cognitive 29): ResponsesToolAdapter._input has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb0eacda3d57cdc77691e04f85237296b7b67164342e8bc628fa2175f809c62"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolAdapter.restore_item (cognitive 29): ResponsesToolAdapter.restore_item has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"07341d72435bb8b7b53586c127b82a7339cc6390ad7931fa6675f63e58df7fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"VoiceNoteFlow.handle (cognitive 29): VoiceNoteFlow.handle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), error handling 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/platforms/voice_flow.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be4d8522e5986287917bfbf6deb9bf3c9be61cc38ba5a70a6e6424b3de961f0"}},{"ruleId":"D2","level":"warning","message":{"text":"request_policy.non_messages_reasoning (cognitive 29): request_policy.non_messages_reasoning has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, ternaries 5, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/request_policy.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"71693741b92a988527d407cf57729a5b67cb964b7788955c2202cade9155d742"}},{"ruleId":"D2","level":"warning","message":{"text":"CopilotResponsesEvents.__call__ (cognitive 29): CopilotResponsesEvents.__call__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/responses_events.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2061f8ce9c325a4c62b9334a7873746b568a9c5f54587ec34f7aafdc3db79b8"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAICodexProvider._list_models_payload (cognitive 29): OpenAICodexProvider._list_models_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (24 pts), error handling 2 (4 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_codex/provider.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3569178c850355642bb9870c60dad98a58802e5e51ace85cc67bc563836aee"}},{"ruleId":"D2","level":"warning","message":{"text":"renderItem (cognitive 29): renderItem has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 6 (12 pts), boolean chains 4, other 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":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ade95c7c49e31c8f7c1e05f13efacc62fa4aec2deaae8b77a76cc6f1958fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"request.chat_responses_body (cognitive 28): request.chat_responses_body has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c39fcfdef371236137cbaf3449bbc9a8e1672e4a51636501a1da5a6a1e032b"}},{"ruleId":"D2","level":"warning","message":{"text":"tokens._bounded_json_text (cognitive 28): tokens._bounded_json_text has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tokens.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b9d55e3b4a4eb0a8a61b039d9ecb421f8acd55d7e643f922af1e402f5503d4"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery._provider_query_failure_reason (cognitive 28): discovery._provider_query_failure_reason has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/runtime/discovery.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"152510a0cb0fd99f3d7db505b03a9f17d1871e2a2fc8eecc874e41c5e3c5255c"}},{"ruleId":"D2","level":"warning","message":{"text":"admin.updateProviderCard (cognitive 28): admin.updateProviderCard has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 10 (14 pts), boolean chains 8, if/else 6 (nesting depth added 4). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2054acb1fb64ca6763dd2909141770491ade3c0f6966a6038df3e46c1fd8f002"}},{"ruleId":"D2","level":"warning","message":{"text":"status.provider_config_status (cognitive 27): status.provider_config_status has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 5 (11 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/status.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8120610e898a818d54fffd6a99dd19fd091b1610ba0a94930fffb8684cfc8b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagesToolCallBuffer.feed (cognitive 27): MessagesToolCallBuffer.feed has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/tool_calls.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3f8a283868d4b80d4b44569857aa7663c0e18d38e0f6082e801f987accfeb8"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveredResponse._chat (cognitive 27): DeliveredResponse._chat has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2a0587066866a634aa9b50fd96d08779d276f049d6d9c3c18e180a579b23b7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveredResponse._messages (cognitive 27): DeliveredResponse._messages has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba1c0c7b6651df4cac9452f9963e40ab0e1db478d369b1d7e90abc3b39a0d91"}},{"ruleId":"D2","level":"warning","message":{"text":"openai_tool_names._request_tool_names (cognitive 27): openai_tool_names._request_tool_names has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_tool_names.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db6dfaaba7503b39513d93a8345c0845057b8263d16fd73e333d294cf0f9a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_desktop_integration._load (cognitive 27): claude_desktop_integration._load has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/harnesses/claude_desktop_integration.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6bf89fd13e686c43ed3699e3a666968a497d1d6c86cff8f84c57cf7d5178d1"}},{"ruleId":"D2","level":"warning","message":{"text":"config.redacted (cognitive 26): config.redacted has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), error handling 1 (4 pts), boolean chains 1, ternaries 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":"smoke/lib/config.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"54612883f018ebf019d158715e67dbdc0bdc45a18a173c083aa3711f0859eba8"}},{"ruleId":"D2","level":"warning","message":{"text":"env_migrations.consolidate_managed_config (cognitive 26): env_migrations.consolidate_managed_config has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 4, boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/env_migrations.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"534523679e5c5bd5225946b06fee77049a966c56654d78c9aa22ed7ed5b38549"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_calls._native_parts (cognitive 26): tool_calls._native_parts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (8 pts), boolean chains 7, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"253cb1906c0679a9d52990512579ede31d14b8b4f18ea277abb5f5279b9f671e"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationStream.finalize (cognitive 26): ContinuationStream.finalize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_stream.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e724795b3a5605196b000d4d2ed7f7e8315f034967a851abb9e48c72fad52d79"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay.normalize_history_source (cognitive 26): history_replay.normalize_history_source has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), ternaries 1 (5 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"d369ccaa45119d6158e57e9f5b52012b6b337241697919899e10a826540e0ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._reasoning_records (cognitive 26): history_replay._reasoning_records has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f7b84db5c9f8ad9425a2b893aef79b9662e0f1012f20a600d14f15d910dbf9"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState.match_history (cognitive 25): SessionState.match_history has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, 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":"src/free_claude_code/application/code_sessions/state.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cb49bd41ef4ca278e5d732a45eddae7eb6d3735b4b7427eb217e6c53229271"}},{"ruleId":"D2","level":"warning","message":{"text":"WebToolService._stream_automatic_search (cognitive 25): WebToolService._stream_automatic_search has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 7 (10 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/service.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"863463d80fc818b8709a58c9e6695c4202ee80f06571131c28712a41226ba2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"model_refs.normalize_retired_model_settings (cognitive 25): model_refs.normalize_retired_model_settings has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (4 pts), loops 2 (3 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/model_refs.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6bdb1c279f8c97b7c9a10b57dd6ba53f2180cf8ad3ce72b40c68ae13bc353a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicToOpenAIConverter._convert_message_to_segments (cognitive 25): AnthropicToOpenAIConverter._convert_message_to_segments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"05133bde7189481b9c7a7a6d339fe1f753991cbf181426e09d4d3f5a386ac8f0"}},{"ruleId":"D2","level":"warning","message":{"text":"native_request._text_parts (cognitive 25): native_request._text_parts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 4 (12 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc5074ea9ef88acfb24664501a09968ba473a652c1378ccc689f6de9d4d5da3"}},{"ruleId":"D2","level":"warning","message":{"text":"admin.refreshStartup (cognitive 25): admin.refreshStartup has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 11, error handling 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"324b7b566914321b736b622d59eb78043616c56d9e41c48fafa3a014e8bf20c5"}},{"ruleId":"D2","level":"warning","message":{"text":"shell (cognitive 25): shell has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (8 pts), error handling 2 (4 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to 16 function literals inside it that branch (lines 974, 1053, 1069, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5831c94f2b0779577022e6ac98e655b9c5a5f213078f58a5bf476146465a27"}},{"ruleId":"D2","level":"warning","message":{"text":"passthrough.restore_native_history (cognitive 24): passthrough.restore_native_history has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/passthrough.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68d13f6db9c2e18eb554ceb3473a5a0f7f900e4225d14982b146a4af2ddf620"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolCallIdentityResolver.resolve (cognitive 24): ToolCallIdentityResolver.resolve has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 10, ternaries 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":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9efb5d7515432b564ec90a5cabd0b29ecff05a31f0a5e2adf50f821532a506"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationOverlap._check_terminal_order (cognitive 24): ContinuationOverlap._check_terminal_order has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, ternaries 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea381bca159e870f6b5c9f215049f7d40f28550dc866e877c97109988024c25"}},{"ruleId":"D2","level":"warning","message":{"text":"request._controls (cognitive 24): request._controls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/request.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8adca646ce384b8b3e74829a18695ef2003f75ffa4e10152bf171f5034feb1a"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagingRateLimiter.shutdown (cognitive 24): MessagingRateLimiter.shutdown has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (6 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/limiter.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2369330252bea21dab5fe8cbe5afa8c5c70c19c8f1982581f4cf93ca9b7642"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.render_segments (cognitive 24): renderer.render_segments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/renderer.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b995395737f1508e1436cc52f77996cfd752c033af12635cf250ab50d3b37cc"}},{"ruleId":"D2","level":"warning","message":{"text":"tokens._content_costs (cognitive 24): tokens._content_costs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/lmstudio/tokens.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77d9fb5ed905da8b8113136e9793b34628efe2b703b7e06a58a9d8b35b41de4"}},{"ruleId":"D2","level":"warning","message":{"text":"FccModelCombobox.handleKeydown (cognitive 24): FccModelCombobox.handleKeydown has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, ternaries 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/model_combobox.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e07fb95e2cd61613a8998eab857360cf5025b0a206d2c1f1648285ddd84a157"}},{"ruleId":"D2","level":"warning","message":{"text":"model_catalog._build_direct_models_response (cognitive 23): model_catalog._build_direct_models_response has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (17 pts), boolean chains 3, if/else 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/model_catalog.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9773cd00ccc3fa108220b25b0458d8de23a778612afc7498dc8867e63ff8764c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatResponsesStream._item (cognitive 23): ChatResponsesStream._item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aa30cf4e1a5fc0f9d3e21bdda0211dbccc7cfa9b98fd392eb6766dab262ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics._category_hint_from_body (cognitive 23): diagnostics._category_hint_from_body has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/diagnostics.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb13ca4407c91bef4193bff58ab612a22b99b59c9b36b92ff0fd8163288130c1"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._gemini_replay_turns (cognitive 23): history_replay._gemini_replay_turns has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"862329b843390a16c885da42c6b8f7d20174b7c9fe1ed9778a5463c996118b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"_ToolScope.choice (cognitive 23): _ToolScope.choice has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3774171e9380313c79fc3730e9edfd624b72a84843ab630da26cb27bf809a5"}},{"ruleId":"D2","level":"warning","message":{"text":"headers.native_request (cognitive 23): headers.native_request has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/headers.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad879eb070e38dc7197e428b76609fc3a8f6740fc9c69fdf48ab2c58aa92481"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_schema._alias_nim_schema_property_names (cognitive 23): tool_schema._alias_nim_schema_property_names has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/nvidia_nim/tool_schema.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5beb4dc35df517ddf7bc226b20cb8749280d272f43eafce114eb0b69867364"}},{"ruleId":"D2","level":"warning","message":{"text":"IntegrationService._dsh_desktop (cognitive 23): IntegrationService._dsh_desktop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 3, loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a9af44f4e3b8d60cdb4de6b0662d54e687c503083e0c1a8638f3b99a2a6d14"}},{"ruleId":"D2","level":"warning","message":{"text":"renderField (cognitive 23): renderField has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 6 (8 pts), boolean chains 3 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbc423fd613e4923f97226e9a27dc62faeb2a4c5537a8b6e82f464fbed473ea"}},{"ruleId":"D2","level":"warning","message":{"text":"validation_log.summarize_request_validation_body (cognitive 22): validation_log.summarize_request_validation_body has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/validation_log.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf6f9c14fe50ea65eb9e904fea8704ed2c264ad4394ade62f4d24a19589caa0"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveredResponse.observe (cognitive 22): DeliveredResponse.observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7, ternaries 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":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5589f25011593a2a2a9171ccdfd35d2c0b5961b06e154879dc43c69d19bdf2b6"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveredResponse.snapshot (cognitive 22): DeliveredResponse.snapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 2 (7 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"125f661d150c90ee84b40713aa2df5aa82f0ca2bd32e7a969187ad3881b34e15"}},{"ruleId":"D2","level":"warning","message":{"text":"_MessagesInput.add (cognitive 22): _MessagesInput.add has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"767e14d6b4fc0783595418f45f62538462a3d687f62b21e135faedd6bb81facd"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicToResponsesStream.feed (cognitive 22): AnthropicToResponsesStream.feed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_stream.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3a7f595d3b1b8bc42a77fa2fdbdd9c8d84dc2f9b235578a5b6488845e42ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"native.build_native_responses_request (cognitive 22): native.build_native_responses_request has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/native.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a201832e5e3e3f6f458454a46ac99ab764fcb1a16a1ddd9edb659bdafd778"}},{"ruleId":"D2","level":"warning","message":{"text":"provider_input._user_items (cognitive 22): provider_input._user_items has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), error handling 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_input.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"271fb3302009a8f0f147f86b224b90d2eaaee14e9af3f284d16f984543ca9b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"replay_finalization._carrier_fields (cognitive 22): replay_finalization._carrier_fields has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 5 (7 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/replay_finalization.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0548d7402bdc69d741e8bc9821d6488edab61d712d5cca276a4f2e9cce9fb173"}},{"ruleId":"D2","level":"warning","message":{"text":"replay_finalization.finalize_replay (cognitive 22): replay_finalization.finalize_replay has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/replay_finalization.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b49aab15154d17de3e8c41fc5b5e915d3aa8536fa135af8dded11d8c56e4da6"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingVoiceRegistry.handoff (cognitive 22): PendingVoiceRegistry.handoff has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/voice.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bb917f92a49ea6b6d935083cf6364b6fa930aea0198904292588bd9a2a0095"}},{"ruleId":"D2","level":"warning","message":{"text":"thought_signatures._apply_cached_tool_call_signatures (cognitive 22): thought_signatures._apply_cached_tool_call_signatures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/google_openai/thought_signatures.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb276bbb4fa8590fa752aaf89764ae504b843db7fdc2aa1fc3e4151b61646c2"}},{"ruleId":"D2","level":"warning","message":{"text":"inputForField (cognitive 22): inputForField has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 4 (7 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5ce198ba2670530b7f0b7361aa4554ac41dab2f32b4147257e01d1191aaab0"}},{"ruleId":"D2","level":"warning","message":{"text":"routes._create_messages_response (cognitive 21): routes._create_messages_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 4 (7 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/routes.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8d0480e0cb4f29e895bb572e384305fc37d31b648e7d9bf8b44f290ea2048e"}},{"ruleId":"D2","level":"warning","message":{"text":"ThinkTagParser._parse_outside_think (cognitive 21): ThinkTagParser._parse_outside_think has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/thinking.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5412520233a16c8657f1394edb98569aacc843cf84f43fd0e5553d9ea00c09"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiResponsesStream._item (cognitive 21): GeminiResponsesStream._item has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/responses_stream.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5399cfaab08179a748f1bac9af444879d69687144da549920d0f19fa69ffade"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._continuation_replay (cognitive 21): history_replay._continuation_replay has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 8, loops 1 (2 pts), error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e4c9b8848225265f82883dc22f3d14aa99a3ff6e47c39e84485f785df2245b"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_request.build_responses_chat_request (cognitive 21): chat_request.build_responses_chat_request has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 2, ternaries 1 (2 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":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b3074ff9d578033107771c38b3adee39bc3deceff7ccbedbfa38ddff12fdcf"}},{"ruleId":"D2","level":"warning","message":{"text":"messages_request.build_responses_messages_request (cognitive 21): messages_request.build_responses_messages_request has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c115cf38fdfa34cd46a94b1efda8515e8588d5b8c4a091ef49365a1719ebdf"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicToResponsesStream._finish_block (cognitive 21): AnthropicToResponsesStream._finish_block has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_stream.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ef2107892205e7c3ba9e65f343b9244d5aa67638a3d8f168cceba40ca2a113"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiProvider.list_model_infos (cognitive 21): GeminiProvider.list_model_infos has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/client.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a95ffada51a0df77c115105d389294fe0071621ce56bdc18078a8d95fc29fc"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiStream.finish (cognitive 21): GeminiStream.finish has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 6 (8 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/stream.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ee4e6c4d39301666d22d178aacc6f8ff8393a871861c21b012329dfae217f3"}},{"ruleId":"D2","level":"warning","message":{"text":"SdkRuntime._close_client (cognitive 21): SdkRuntime._close_client has cognitive complexity 21 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 6 (7 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/sdk.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adcd2d48c01ec87794aab2a9c1ab849b508a259800a6bb54a22b8aab33ec69b"}},{"ruleId":"D2","level":"warning","message":{"text":"output_cap._structured_error_texts (cognitive 21): output_cap._structured_error_texts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/output_cap.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bf4b0a05ee6852a35ccf6388ce9e9ac39d70f7437e14176820754ebff4aa36"}},{"ruleId":"D2","level":"warning","message":{"text":"openCustomProviderDialog (cognitive 21): openCustomProviderDialog has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 7, if/else 4 (5 pts), loops 1 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 1 belongs to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5579d5ec2da07ebae2bcf79155fcf748b314bc7351caf91037d5b7b70510f55"}},{"ruleId":"D2","level":"warning","message":{"text":"activate (cognitive 21): activate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce3557a747eca1ffa4b7b39e4599d7494338d7955b85123c7f767ae63bc7e75"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagesHandler._to_public_response (cognitive 20): MessagesHandler._to_public_response has cognitive complexity 20 (threshold 15). Drivers by points: error handling 6 (12 pts), if/else 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/handlers/messages.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea990459d21efd52832b44b49ee9b45cfdc5461aacf72d4cabcc0b9887a1988c"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelRouter._direct_provider_model (cognitive 20): ModelRouter._direct_provider_model has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (5 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/routing.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d217cfb12a9922e89967ca6000658d1b0a006cf22ff5c672013e82b3edad2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"api_keys.normalize_api_keys (cognitive 20): api_keys.normalize_api_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 1 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/api_keys.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f12c4622308deed339dd53fd871c476e9f8798f257ccb91fe1995871a4d8e69"}},{"ruleId":"D2","level":"warning","message":{"text":"_ToolScope._definition (cognitive 20): _ToolScope._definition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3208bb5d60362afd8232e7cea1492d64c66b1bf33d4be00106dd843bcc75dbe1"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicToResponsesStream._start_block (cognitive 20): AnthropicToResponsesStream._start_block has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_stream.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3683cdae46d9f0d16bfe242fa26e899cddcdf9102b37efabf21924ae2a937d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_database.initialize_database (cognitive 20): sqlite_database.initialize_database has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/sqlite_database.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"03014836e8f33cff92073fb57a7d296a284194f083161db8c6ac141e2ae59a78"}},{"ruleId":"D2","level":"warning","message":{"text":"code_sessions.synchronize (cognitive 20): code_sessions.synchronize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4, boolean chains 2, error handling 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"361e6d8c13f6eab845176d6fb84b8263655714983a911faaa207f31439a3f861"}},{"ruleId":"D2","level":"warning","message":{"text":"support.launched (cognitive 19): support.launched has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/desktop/support.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"82362c3780f41985f7aa1f466831b783f0e7d5259193ef669676cdf53ca51200"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicResponseStream._iterate (cognitive 19): PublicResponseStream._iterate has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/stream_delivery.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"343e7b6e23a8481790612e87db9df7afba78884cd9319a312c1b7db0d917c6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"image_sources.portable_anthropic_image_url (cognitive 19): image_sources.portable_anthropic_image_url has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, 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":"src/free_claude_code/core/anthropic/image_sources.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f46dd3afba157aa029df1e50ace1376c91949c6d011e05994cb96cd2fdf8962"}},{"ruleId":"D2","level":"warning","message":{"text":"stream_contracts.assert_anthropic_stream_contract (cognitive 19): stream_contracts.assert_anthropic_stream_contract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/stream_contracts.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b968e9bbaa38a0b2045d4b3053a39c0c404af61de1b5dddd21617e5af79bcfc"}},{"ruleId":"D2","level":"warning","message":{"text":"replay.apply_call_replay (cognitive 19): replay.apply_call_replay has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/replay.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"db003f263b37bd3471e81e6983eedc9d004acf15b3ec148edea627704beb2cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiResponseAccumulator.feed (cognitive 19): GeminiResponseAccumulator.feed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/response.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca182bffdd5035247b816f9001a54480d25acb226b15fdb4811ecd2b42b8befd"}},{"ruleId":"D2","level":"warning","message":{"text":"thought_signatures.apply_native_message_signatures (cognitive 19): thought_signatures.apply_native_message_signatures has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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":"src/free_claude_code/providers/google_openai/thought_signatures.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"19eda26048b5afac30bd0ff389caa0b56dc018c35ac97f1304c38857c9d03629"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeASGIApp._lifespan (cognitive 19): RuntimeASGIApp._lifespan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (7 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/asgi.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18320bb67455990434d4a1712ea819bb5e7fc92c366c2ab9dba58c5110d5ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagingService.close_delivery (cognitive 19): MessagingService.close_delivery has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/messaging_service.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"145af4fa2d0eb785a6b21259d7f3395f9460104e68c1b5caef55621fd5c7ac6a"}},{"ruleId":"D2","level":"warning","message":{"text":"native_folder_dialog.decode_result (cognitive 19): native_folder_dialog.decode_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6 (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":"src/free_claude_code/runtime/native_folder_dialog.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1e157cdf413c39c4f335b05f7095a0a43f6d5d081a60328115f94ca7fe5080"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicResponseStream._publish_packet (cognitive 18): PublicResponseStream._publish_packet has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 1, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/stream_delivery.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1233c8dda8778ba7d137af907f7fdbe1c9731e3fb8644bc1e5171150c7339759"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicResponseStream._finalize_frame (cognitive 18): PublicResponseStream._finalize_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/stream_delivery.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7930148ccd779e7413152ff93eee2b201bf4eb9c245608482ec46e5e96c905"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSockets.reserve (cognitive 18): ServerSockets.reserve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/cli/server_socket.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"064cb99afdfe2d81e29576fb2d40ae36d60faff612fd1e4fcb34d598836bf2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"persistence.target_values_with_updates (cognitive 18): persistence.target_values_with_updates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/persistence.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"972b026efb514af2f41ef13eda9d9257f9b1554baee1aab9aef6f943d2d62af7"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_request._message_content (cognitive 18): chat_request._message_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7357b8156fd38c73fe409cf3d794e1e9929a8413b826fc6353d8e50b7138a3"}},{"ruleId":"D2","level":"warning","message":{"text":"messages_request._content (cognitive 18): messages_request._content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9202b6cb73f0f84a5be081c741430826b916581382b606047012690d3452c9"}},{"ruleId":"D2","level":"warning","message":{"text":"messages_request._output_format (cognitive 18): messages_request._output_format has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"416748b75390da416d84926c835eb4c23253f9384b59873c026227ab07d56008"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolAdapter._choice (cognitive 18): ResponsesToolAdapter._choice has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5 (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":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f3b08aa974467f8dbfffb8461fea66f89a0a36dd0c5bfb262fc0846a83f658"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesToolAdapter._identity (cognitive 18): ResponsesToolAdapter._identity has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), ternaries 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d27bffe7815f2cee471d5556ad1092a487415c7e54a35fe5863583339361fc4"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_desktop_integration.check_unmanaged (cognitive 18): claude_desktop_integration.check_unmanaged has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (7 pts), if/else 3 (5 pts), loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/harnesses/claude_desktop_integration.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"665295d25eb6cc2eedfdee4836aafb9cfbcdf01492ac12edb635ea5e1d47fc56"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramMessenger.delete_messages (cognitive 18): TelegramMessenger.delete_messages has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), error handling 2 (5 pts), if/else 4, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/platforms/telegram_io.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aab17014b10f1201e198fe9eec917d2ce02d45c5d4eff0fa7ea8066e27e4479"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageTree.remove_message_subtree (cognitive 18): MessageTree.remove_message_subtree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/runtime.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b1d2276104f8e0d1dadbc08392d611a1a75c82a04565b0ffe33813deaa4256"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageTree.fail_claim (cognitive 18): MessageTree.fail_claim has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 1 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/runtime.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a89089d904720b686e0230be6a75f711f67fac639b9c0fa72b2acd44b3bcda1"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHubCopilotProvider._dispatch (cognitive 18): GitHubCopilotProvider._dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/provider.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f410cd93b013567a8e1ac6fd63ec992aaf9b7b880f1907ab57bbcf214172d3"}},{"ruleId":"D2","level":"warning","message":{"text":"reasoning._contains_reasoning_rejection (cognitive 18): reasoning._contains_reasoning_rejection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/reasoning.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8314ea0dc6271246f0358334592db3ec5a57adbd2c668d395067dc8a3a4a22"}},{"ruleId":"D2","level":"warning","message":{"text":"application._await_owned_task (cognitive 18): application._await_owned_task has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), error handling 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/application.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72beaf96927cb36db81ef16b5c0f6d9455dee4e0c767f4147398106126a305f"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_cli_matrix.classify_probe (cognitive 17): claude_cli_matrix.classify_probe has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, 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":"smoke/lib/claude_cli_matrix.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6ca81965d7c74f2aca3c1552ee7998c8073cc89b2e98c904f7ee385596caeb"}},{"ruleId":"D2","level":"warning","message":{"text":"_PendingCall.add (cognitive 17): _PendingCall.add has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/tool_calls.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec1a3ae408d379d8c46371c89a10cb484989ebc4030160f8623b8ff87824e72"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveredResponse._gemini (cognitive 17): DeliveredResponse._gemini has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37a1530f4c06525d7cd0fd8190deb984cc94b1a725724c362dfb93e6cdcbcb"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay.responses_reasoning_blocks (cognitive 17): history_replay.responses_reasoning_blocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5de850057dedf17708259cd3f60f1953d94c82cc75a09651abafef3fcb2e2de"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeUsage.update (cognitive 17): _NativeUsage.update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_stream.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f00dcc9d951423634781ca0d7c757d192e4184f211a734de64f8c7da5c81b2"}},{"ruleId":"D2","level":"warning","message":{"text":"provider_input.build_responses_provider_request (cognitive 17): provider_input.build_responses_provider_request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_input.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35f3dc4b5f80609c7b0a67ec1e0a50e35f0b82e0d54e99d1afbf807e2ce8203"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_search._explicit_arguments (cognitive 17): tool_search._explicit_arguments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_search.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae87a3a762252661a633655c9d8e441e916fb1df7807b156638acc4a8f5288fc"}},{"ruleId":"D2","level":"warning","message":{"text":"stream_recovery.assess_recovery (cognitive 17): stream_recovery.assess_recovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/stream_recovery.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f41fa3954250b9fe820792ee839b42b7cb5fd166e3e6894be40c64b63e001f"}},{"ruleId":"D2","level":"warning","message":{"text":"TranscriptBuffer.apply (cognitive 17): TranscriptBuffer.apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/buffer.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"699ed31535d7e8e55e3f803cb51e19c823c5a669ae867098435184b6efaceb61"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagingTurnIntake.handle_message (cognitive 17): MessagingTurnIntake.handle_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/turn_intake.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeffb4b6a8b5e2f719fb9ea6b4b886f47091b851bea1097de160304bae86059f"}},{"ruleId":"D2","level":"warning","message":{"text":"provider._apply_native_reasoning (cognitive 17): provider._apply_native_reasoning has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 2, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/provider.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"077d94ecaa5f96a1dc12d31a438db7e67927b9b43d6a63bf097d5107ada16d97"}},{"ruleId":"D2","level":"warning","message":{"text":"failure_policy.retryable_transient_status (cognitive 17): failure_policy.retryable_transient_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/failure_policy.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70baf6d7ff9c6d2a238e7220dde916f76ed78a8e442297f3ce8440c97300ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"history_replay._rejected_record (cognitive 17): history_replay._rejected_record has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0693c48010b86cf27846572b921c41eba864655e2d83f780029df7ba9341c0"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_schema._collect_nim_tool_property_names (cognitive 17): tool_schema._collect_nim_tool_property_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/nvidia_nim/tool_schema.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f102994ad2b23fcd7b0c1d3ad4775a5c5c62ef7db1b6602e717bcbd55aa81f"}},{"ruleId":"D2","level":"warning","message":{"text":"_ChatStreamPresenter._feed_frame (cognitive 17): _ChatStreamPresenter._feed_frame has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/transport.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0da0e4a487b2bb76f9fbf75bf2faf182f7358a6802e9fedee50a9a293d0046f"}},{"ruleId":"D2","level":"warning","message":{"text":"catalog.parse_open_code_catalog (cognitive 17): catalog.parse_open_code_catalog has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/opencode/catalog.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c9335c155c94e5fcb59883cff07ae0d460e45cde0f4cec79a78d8c174630ec"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexProtocol.history (cognitive 17): CodexProtocol.history has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0182ea58ceecb4864aa00ca42b9f37f6aa70b86095c031ce6f73ba35690fb897"}},{"ruleId":"D2","level":"warning","message":{"text":"IntegrationService._vscode_chat (cognitive 17): IntegrationService._vscode_chat has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (4 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0d8450010c681e2494cb4b7a45f4e4e4b338f3a4da660edd28b36669b14442"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagingService._start_messaging_if_configured (cognitive 17): MessagingService._start_messaging_if_configured has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/messaging_service.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5197b8e688ef497f6d7bdaf5b61435708be9f94566216cd4710f84fc31fe73b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_database._schema_version (cognitive 17): sqlite_database._schema_version has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/sqlite_database.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fada154b388755df4a9dd102b1b738025f4f603679adde8c99f00947dcd88f"}},{"ruleId":"D2","level":"warning","message":{"text":"egress.get_validated_stream_addrinfos_for_egress (cognitive 17): egress.get_validated_stream_addrinfos_for_egress has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/web_tools/egress.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c393895197259151b20b5ffae131950a13aebe15d00dd77e9da89f5ace670cc"}},{"ruleId":"D2","level":"warning","message":{"text":"admin.refreshLocalStatus (cognitive 17): admin.refreshLocalStatus has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, ternaries 3 (4 pts), error handling 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1672, 1666). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1b7a20b91171233e08947fb3cc3e13c09052b5b2e1e0ed93ab7ccf33869ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"detail (cognitive 17): detail has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 1 (2 pts), error handling 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee824535d91e615c4a8dfe95fd3a208910cb9c06dc9e05d6daa71fc303b1690"}},{"ruleId":"D2","level":"warning","message":{"text":"model_catalog._build_claude_models_response (cognitive 16): model_catalog._build_claude_models_response has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 2 (4 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":"src/free_claude_code/api/model_catalog.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0870009bafdea403f311d2d7e24230f23f24efacb6da1f333feb0e1ed4fd4526"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestOutcomeMiddleware.__call__ (cognitive 16): RequestOutcomeMiddleware.__call__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, error handling 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/request_outcomes.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"800e3a16465dc0ce3fbf4a5ee926e88606d05c9007bafee9f4b4dbe41cc09d98"}},{"ruleId":"D2","level":"warning","message":{"text":"request.plan_automatic_web_search (cognitive 16): request.plan_automatic_web_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/request.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b83ab784657386b15b57805ab682fee986f918b407a285605dba9394b3ceb2a"}},{"ruleId":"D2","level":"warning","message":{"text":"macos_app.install (cognitive 16): macos_app.install has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/cli/macos_app.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a911d5bd18b1de8a4fbb18b87f69f8d4758cd60f81a62a1d3fcfa82fae5e6448"}},{"ruleId":"D2","level":"warning","message":{"text":"errors.anthropic_error_type_for_failure (cognitive 16): errors.anthropic_error_type_for_failure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/errors.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"77de70649d2ad0c7bd813aabad794c0124b3f99901dfbec9480193283c6850b5"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuationStream.prepare (cognitive 16): ContinuationStream.prepare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_stream.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f26e4691d38e183ec6bcdfaa4db4f1f3733c40b2fc3c98a64b3c637b82b92d1"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway_model_ids.decode_gateway_model_id (cognitive 16): gateway_model_ids.decode_gateway_model_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gateway_model_ids.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb3efcfa47c676975a6b717349867d2bd6fc3f58999dfc346c1af21416de23"}},{"ruleId":"D2","level":"warning","message":{"text":"errors.openai_error_type_for_failure (cognitive 16): errors.openai_error_type_for_failure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/errors.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bbce1fe7b462f108e18e3f9f45633d0d3fb4297c82c315113b0ba350757249"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesProviderStream._finish (cognitive 16): ResponsesProviderStream._finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 5, boolean chains 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_stream.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c7f13ae03a8ce85586b8ba2002e96b1d1aa51fa2fd92754ea196890da5cd97"}},{"ruleId":"D2","level":"warning","message":{"text":"dsh_files.regular_path (cognitive 16): dsh_files.regular_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 2, error handling 1 (2 pts), 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":"src/free_claude_code/harnesses/dsh_files.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c53d2ca32efd3e39077fd2875f6d1b648466b4e17360112312dfcae767ace8b"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeQueueProcessor._finish_and_continue (cognitive 16): TreeQueueProcessor._finish_and_continue has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 4 (6 pts), error handling 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/processor.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e61dfabce508ccd3dbe9c1164459b9bfc5ca7787d035b92d401c6103f06d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageTree.cancel_all (cognitive 16): MessageTree.cancel_all has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/runtime.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"467dbeec04f5208186725c0cdc5902f085a1e85643799eed0fb0e88245158b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"models.model_record (cognitive 16): models.model_record has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 3, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/models.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f86944bf652893d68cedef8aef66b30110bec45318c16be280a529af24a670"}},{"ruleId":"D2","level":"warning","message":{"text":"client._parse_reasoning_vocabulary (cognitive 16): client._parse_reasoning_vocabulary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/groq/client.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b88c3e401f6fba2d92e398e32fc2423d999349afb337037411d161e75689988"}},{"ruleId":"D2","level":"warning","message":{"text":"client._body_error_candidates (cognitive 16): client._body_error_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/groq/client.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef24925234c25430e62faf45a57e77244e66e9972a51c8d900b804fb8dbb866"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_schema.sanitize_nim_tool_schemas (cognitive 16): tool_schema.sanitize_nim_tool_schemas has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"src/free_claude_code/providers/nvidia_nim/tool_schema.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cdac510b3b9a51b3914c66364e678154cd90261c139f109afeadd11ff0afef"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderRuntimeManager.wait_for_model_catalog (cognitive 16): ProviderRuntimeManager.wait_for_model_catalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/provider_manager.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e40cae1f075bcef53218a78717b7308c05f0a82d19c791cbbca3f115913e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderRuntimeManager.wait_for_catalog_file (cognitive 16): ProviderRuntimeManager.wait_for_catalog_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/provider_manager.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad025f827160fefd5892708551d2208b5a63e6f21d9fd3dce01ae7cd574dcdc"}},{"ruleId":"D2","level":"warning","message":{"text":"admin.byId(\u0022confirmDshDesktopIntegration\u0022).addEventListener(\u0022click\u0022) (cognitive 16): admin.byId(\u0022confirmDshDesktopIntegration\u0022).addEventListener(\u0022click\u0022) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (3 pts), ternaries 2, boolean chains 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"695c98b4fc1b8729e0374fc52393d1bda72a5beaead600131e51febe39ab8696"}},{"ruleId":"D2","level":"warning","message":{"text":"renderCodexIntegration (cognitive 16): renderCodexIntegration has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, boolean chains 6, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec5dc47e00d940dd931f6ed176e1b578634c49f32ab19fdf0711c177ebbfc4e"}},{"ruleId":"D2","level":"warning","message":{"text":"renderClaudeDesktopIntegration (cognitive 16): renderClaudeDesktopIntegration has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 9, boolean chains 6, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9a7155bc762fec5d2b415edef16db0aa08a81ecc3d85a893771749c8641f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (3 pts), ternaries 2, boolean chains 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bae7267d4af80892e3848dc188bd468d825fb8df33788a411457bfc48e9cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"readBootstrap (cognitive 16): readBootstrap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb10dcf5debab5f351c679e749c70edac395ead75b3fe2f9aa426e1c336fc817"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: admin_static/admin.js: FileTooLong \u2014 2194 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1694 over it, 4.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cab15672f5c86391d6fea3f05fb382f6069ce06efb1d8861a5455ed4e6645b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: admin_static/code_sessions.js: FileTooLong \u2014 1439 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 939 over it, 2.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76180d390466c27bab00d09047580602a02cbf37fab44e33fc2e91952163c3db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_chat/transport.py: FileTooLong \u2014 1308 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 808 over it, 2.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/transport.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c6ae9906cde457ec9058dcca8bfeaf6d8d8f01bdca49086a74ee4b0e3528d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/history_replay.py: FileTooLong \u2014 1084 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 584 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7faf915df48fac699a1a6480fc501f7886f7320d38fd9afa47893ccfd82c43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: code_sessions.shell: FunctionTooLong \u2014 shell runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dbba62b841ddc66cc4831783bcd991a1e25634d9cbc50d7759dc7cab012e72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: code_sessions.buildPrompt: FunctionTooLong \u2014 buildPrompt runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb95ec21201e1cdd13a5aa3152c315854d22129ea23c5f376bf4597af3f92af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ApplicationRuntime: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/application.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedf7e40000cee95816b4757daf3fe8d2405d61030dc33bd3643441da3c6e003"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntegrationService: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bde1e31dae42e0c437e28c1ee605696384b9cc29e10bbcccd78dae585332e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/provider_manager.py: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/provider_manager.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"135d808313dda93fdb3db3b22bbf48f7507ab630361a7f8777248f2429f8bffb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionState: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/code_sessions/state.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1011dc02bd64bcbc6ce4ac41e4cd5a99ca01633e72a2a484fe97648bb1ced96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/provider_catalog.py: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/provider_catalog.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"423ecd732a82457061a30fab80f87a26f2f9aa8453bcdc87dd7bc92c31c4dbf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/integration_service.py: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 197 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"627b2c4b77df66939a95c4a276aa7266ee75311690d00f44ade9e3cd09d9e135"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_responses/transport.py: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 188 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_responses/transport.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7bd98864d2751125f409aa4559c126b1e2e2f793e268743a853cb921991180"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/code_sessions_sqlite.py: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 184 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/code_sessions_sqlite.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57072fae3d6e53ac1c7ef0a854a75f0e2ef0f0b7f78228ae1a24c33fc9fe4184"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_chat/profiles.py: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/profiles.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c0c08f6e1cd8fe23b582b8e8bba21b97bbf0def9460a80713279a452dde707"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProviderRuntimeManager: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/provider_manager.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79997eaad394033b2f2d3e5a17704fcb5b1254bdc6cfffed6acdf6aeedc7ed2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: anthropic/conversion.py: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb78130651c717df78d31a13aa7bd96393bd44bbb3c1743bd3b18b463dc89d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/codex_app_server.py: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_app_server.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d821482d94431e15ce181523f4d6faa2ad05367172d2d1432937ad9fd2c7c5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_responses/tool_adaptation.py: FileTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 144 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8a6a972e9f9591f52c207ff295396664e78dee1e47096c4c137ec42c739663"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChatStreamOutput: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/stream_output.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"393fd0fdaf3845ce27256d06e8f55516928a8a373211cac2b505e6d60bc87710"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/claude_cli_matrix.py: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/claude_cli_matrix.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6b24e44ab30ac911683d7ed12a45919a46ef29a658b13da2ee1f3e4d0a4804"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_responses/chat_request.py: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19eb2a0f3aa3512ccf5670755c08b1702691a5b0e5b11410f4ec0ef7331d983"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: trees/manager.py: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/manager.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13a277a9f1f45ba509da5ccf897a869ef246c775e8c0ccad880fa2bf9fcc9af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/codex_protocol.py: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2408f6060190a913cd3754d17e028f5f2547da1466f7f01093d6c055e48d74fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnthropicStreamLedger: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/streaming/ledger.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ff0fb0c562551b4007e770512771ab46ae3e24e44f962d040db7c288054d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MessagingWorkflow: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/workflow.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f96d1a868a2078c295cf29591389e741a318c371a6bc9dc3731496bf89d1b3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_chat/stream_output.py: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/stream_output.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7411d31a2d8cfedb0fa1c71fa35b2c5a2a8f52a991dacad4743097c3f2c7e94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: messaging/workflow.py: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/workflow.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebf40db281967e7573c096239be4260ab3ec5078c17a16e8f6e50d04f24dda6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeQueueManager: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 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":"src/free_claude_code/messaging/trees/manager.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c469b1d7abd500c1b8d85a1618adbfb19acf4e74e1319b4f7b2efb1cf30536b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_sessions/state.py: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/code_sessions/state.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d8a2cf37702881378ed0f40f0ba5a630fe8f8c5f1a7fb93a9c6781d8626c81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/execution.py: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 48 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/execution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaea1c13ea5bca86c5f4f799b15169393ca5f94770b4a6afd5abf9512ab85d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/delivered_response.py: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e17c9ad23a45a789425c9dee7b4e50c0527a97467945392de3912f64118ac8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: anthropic_messages/transport.py: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c835db3018a607db80b984c8825437d8c5f01ff020d39d311b65810a229b1e78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_responses/messages_request.py: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3db30a3aa99c6266278d8e0d0a323c3271806a5aaa2c28298ae390f583aa8cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai_codex/auth.py: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_codex/auth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74c5b50758e6a87f4c77685ed081afba641bcc71c2ed61c7519f21f370eff27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: smoke/features.py: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/features.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41c047cdc79a222cd624a18573f3799be99b3b2f16423ad96e0acaf5a840ce8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/settings.py: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/settings.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4909971435343c9bee7e8dc50205a21fba85fbb043fda4dc83f2a4e06b5a1f92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gemini/native_request.py: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7ab88b971d882ce9cb7058fb04445ff7c0a46491879ac58ae9f21746f9808b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/application.py: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/application.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b1f845344ffe2cb47a2b36ee94b88c0d4b80cfd3177b7446937455177e5ee9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/admin_routes.py: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_routes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"076c7b74217ee407cf12a5da7a229e87b6ff5db7d507ac568345e8f12e3d15ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (228 shared lines): src/free_claude_code/messaging/rendering/discord_markdown.py:56-307 | src/free_claude_code/messaging/rendering/telegram_markdown.py:53-320 \u2014 These two members are variants of one another: 228 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2923ec81862085f61f1fd259226e5aa5b308cfc4538706fb42a2213715105033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/free_claude_code/core/openai_responses/chat_request.py:681-711 | src/free_claude_code/core/openai_tool_names.py:68-116 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a097edf73d2394023c41e0d2a3eb1e5e29351b702b7ab9ac6150d384119ebc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 52\u002B corresponding lines): src/free_claude_code/application/execution.py:220-276 | src/free_claude_code/application/execution.py:285-347 | src/free_claude_code/application/execution.py:356-408 | src/free_claude_code/application/execution.py:417-468 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 52 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/execution.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d3c05e9f72a1258b9793bfd0b66f1ded75eba4174d69a76dc82c7b777326ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): src/free_claude_code/runtime/integration_service.py:210-237 | src/free_claude_code/runtime/integration_service.py:240-263 | src/free_claude_code/runtime/integration_service.py:579-599 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5fd5f27b86dbc37acc73211d94a44a6b013dcecb080c04c4dd75ce4c9eb5be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/free_claude_code/api/handlers/chat.py:58-85 | src/free_claude_code/api/handlers/gemini.py:56-80 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/handlers/chat.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ebd019dd4988b1901de75ba9e06a66c2a8cdaef80aef3b38a219869e54cfdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/free_claude_code/api/response_streams.py:409-435 | src/free_claude_code/api/response_streams.py:444-474 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/response_streams.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fcab48b87524d54c29583060606a106ab66e8a1baa7485c047084659ea1765"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/free_claude_code/providers/cloudflare/client.py:121-150 | src/free_claude_code/providers/vertex/client.py:113-143 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/cloudflare/client.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d2c9068b24750064eb208a65bdbba1ed96c53f0801cbb859907c8b448796cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/free_claude_code/providers/custom.py:233-271 | src/free_claude_code/providers/custom.py:285-306 | src/free_claude_code/providers/custom.py:320-341 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/custom.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d8da3d43cc8017d93d3f667c7408de7f0dc3343117a6b5e628425d36ab5111"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/free_claude_code/providers/anthropic_messages/transport.py:350-374 | src/free_claude_code/providers/gemini/transport.py:108-133 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5967fc2b0b2b94bd6f8b93c66a139adbf2a0f7c47a285aa8d12a7179ed8f3dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): smoke/lib/e2e.py:126-144 | smoke/lib/http.py:66-81 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/e2e.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54affa6a7b90dbc90c4d5501ed857024710ffd6a5bb380042c3b43ac2c07194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/free_claude_code/runtime/integration_service.py:626-649 | src/free_claude_code/runtime/integration_service.py:666-708 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20253dd45cd28f31cfb093294f765f453b9074cd165fb77b174fd6dffafdec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/free_claude_code/api/handlers/chat.py:88-116 | src/free_claude_code/api/handlers/responses.py:122-151 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/handlers/chat.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea03a6dac763a06544261d77e289adc255dd7c2d6d6c91dc947946ac6a63dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/free_claude_code/core/chat_completions/responses_stream.py:30-39 | src/free_claude_code/core/gemini/responses_stream.py:28-39 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba054ab5c507c0b9cbeabe694926da0c861a932a4473a287739bc01f83da6c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/free_claude_code/providers/anthropic/provider.py:115-134 | src/free_claude_code/providers/gemini/client.py:63-83 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/provider.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9797fb893768400eef2acead9077b776abfccfc1f4ff151dd34ae9bcaeb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/free_claude_code/providers/failure_policy.py:256-285 | src/free_claude_code/providers/failure_policy.py:289-312 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/failure_policy.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0517be2585fa4d4f634ebdd8cb605821ee924169f0e5cc9e74ba305f35afc211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/free_claude_code/messaging/trees/runtime.py:390-402 | src/free_claude_code/messaging/trees/runtime.py:407-422 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/runtime.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd26d92075a1e69654e5acd6e955d887c4ac92827152fd33127669d49399b3f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/free_claude_code/providers/openai_chat/usage.py:62-73 | src/free_claude_code/providers/openai_chat/usage.py:77-92 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/usage.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4124a2a380b940689f97a889160e24a3b3baf480133c998dea8b03e846002ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/free_claude_code/messaging/transcript/buffer.py:139-156 | src/free_claude_code/messaging/transcript/buffer.py:159-171 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/buffer.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"934fb28b671d6ec3ab0fe5c1a3c497c0443d2b2d5f57c73cc1020c9f238ebd13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/free_claude_code/core/anthropic/conversion.py:188-208 | src/free_claude_code/core/openai_responses/provider_input.py:376-385 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"307b70da0998c83f2fe1bd60341ca836491480fa72360b04916d386c566bc559"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/free_claude_code/providers/gemini/client.py:209-226 | src/free_claude_code/providers/gemini/client.py:240-258 | src/free_claude_code/providers/gemini/client.py:272-287 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/client.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b59da9e719771ced8346ffb1fdf4fdbbb52eedef100cd0c0000210caf4ead0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/free_claude_code/api/code_sessions_routes.py:359-372 | src/free_claude_code/api/code_sessions_routes.py:376-386 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/code_sessions_routes.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07d1e63be58bb85de105978aadf6896afd57e71e4fb6906ed986e9cea35b6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/free_claude_code/config/admin/provider_manifest.py:407-423 | src/free_claude_code/config/admin/provider_manifest.py:469-488 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/provider_manifest.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"7534fc4ba181bd44c165b2d72f56431d93584986437659a713bcc664554dab25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): smoke/lib/config.py:279-291 | smoke/lib/config.py:294-306 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/config.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee5b27579cfbf6ef807e810deef66875d6c70c8eac57b5d4f2bd753e416b43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/free_claude_code/core/chat_completions/responses_stream.py:196-206 | src/free_claude_code/core/gemini/responses_stream.py:210-226 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b37550bafd6b0927ff482f3041c757339a2c29960702b0106ab5cdcb5f11a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): smoke/lib/claude_cli_matrix.py:372-386 | smoke/lib/report.py:50-61 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/claude_cli_matrix.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa57addaa4a37d55ce96bca90d6e56c4f1804edd737199b6d82aaed2a21970d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/free_claude_code/providers/failure_policy.py:243-252 | src/free_claude_code/providers/openai_chat/usage.py:108-117 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/failure_policy.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"164f6c1cf4dee8782ec21a5062a85e3593e4efadb31aed3f7fb4612b7bfaffde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): src/free_claude_code/providers/anthropic/provider.py:276-290 | src/free_claude_code/providers/anthropic/provider.py:304-318 | src/free_claude_code/providers/anthropic/provider.py:332-346 | src/free_claude_code/providers/anthropic/provider.py:360-374 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic/provider.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"db05a71f697b1f1bf14ca137248d89e4ef1fcb4dc4da06233b2bb81f6dce828f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/free_claude_code/core/chat_completions/request.py:255-263 | src/free_claude_code/core/chat_completions/request.py:470-490 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8d98c40c739bda7794707447c07d2fc3bfaecb4e57d55dfbfa39ecbd2c46da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/free_claude_code/api/response_streams.py:138-157 | src/free_claude_code/core/async_tasks.py:15-30 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/response_streams.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6871fc890b1112cb171e8bde28ab85de4060ec00830ac4b0064a4c047835593b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/free_claude_code/messaging/trees/manager.py:278-287 | src/free_claude_code/messaging/trees/manager.py:294-303 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/trees/manager.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f292c684d1b2608e0b26682950e5c727a2be4dcf69a51b85ff33caf1ff2196"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/free_claude_code/api/admin_security.py:22-37 | src/free_claude_code/api/admin_security.py:41-55 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_security.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a187556a5336f6ac315714ca7c7b143cb5464782e91d557f25b606e4da985c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/free_claude_code/providers/runtime/factory.py:176-191 | src/free_claude_code/providers/runtime/factory.py:209-225 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/runtime/factory.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d6f1eda4e759b1d53b64148c40859083e7918a77f80e4b4659845997b9573b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/free_claude_code/core/trace.py:121-132 | src/free_claude_code/providers/mistral/caching.py:35-45 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/trace.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b663fe49cfe7bbcd672468eb6f3c27299720332a6433d70e04cd4ff1feb78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/free_claude_code/providers/groq/tpm.py:97-102 | src/free_claude_code/core/diagnostics.py:204-209 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/groq/tpm.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7531ae3e7aa58c3d1fc8a181c5baf168e655f9a6a3e6e96acc5b1af0a36d6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/free_claude_code/api/handlers/messages.py:252-263 | src/free_claude_code/api/handlers/responses.py:159-170 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/handlers/messages.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956470fc9b2b3b4b785f48f7b9044019eb94db390c6d19ec3250cb6597bc061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/free_claude_code/providers/groq/client.py:125-131 | src/free_claude_code/providers/openai_chat/transport.py:860-868 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/groq/client.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b577f691c7dae9877fe0a4d08604d25d2566e6bc0ef3d1e5d5bdbfda1fff28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/free_claude_code/core/anthropic/conversion.py:212-218 | src/free_claude_code/core/openai_responses/provider_input.py:368-372 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"13145eec4aaa899511f8000d5755ab971e1c2701b66326da41a254eaf529cfee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/free_claude_code/providers/github_copilot/broker.py:226-231 | src/free_claude_code/providers/github_copilot/sdk.py:223-226 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/broker.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1269142942f313a53dfcb552a70dec5a8fea3917d58a14b9924ec27e966a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/free_claude_code/providers/mistral/client.py:130-146 | src/free_claude_code/providers/openai_chat/provider.py:228-237 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/client.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0ddbb71e0562d055e4747566934525217416fc9d932cb8318ed840992e922e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/free_claude_code/providers/openai_api/provider.py:133-141 | src/free_claude_code/providers/opencode/provider.py:191-200 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_api/provider.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39c7bff42b893ac956ee8fecfaec75e86c5fbb2263b0bfa76c48719bc1fabce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): scripts/ci_timings.py:25-30 | src/free_claude_code/api/routes.py:60-65 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci_timings.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5f658cacc6a1b738d57bb1ff35c932e30055e6125e770ebe57b31d7ccaf4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/free_claude_code/providers/mistral/client.py:161-171 | src/free_claude_code/providers/openai_chat/provider.py:252-260 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/client.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7801316eed16b8b9f9157a793e05c36eaa4168092a2f6d6c2fbb5aa9b9ffd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/free_claude_code/providers/mistral/client.py:186-196 | src/free_claude_code/providers/openai_chat/provider.py:275-283 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/client.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d985876b76bbcdbe60249ba3bc5dbee1c2351cdaefa58e49101c26489794c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/free_claude_code/providers/mistral/client.py:211-221 | src/free_claude_code/providers/openai_chat/provider.py:298-306 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/client.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"361e93bdf4f9be1ee2f22e5f941329904bc3d31dd800c4d3231e85dc77a9c54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/free_claude_code/providers/google_openai/reasoning.py:99-102 | src/free_claude_code/providers/openai_chat/reasoning.py:161-164 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/google_openai/reasoning.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf77967e0da69e9db2cb387bc5d5daff33e98a37fbe64478a5fc91aeae47e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): smoke/lib/config.py:336-338 | src/free_claude_code/cli/managed/diagnostics.py:44-47 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/config.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89184ee9af83d70e78bb01e2a36ad67752e706c3be4ca82a65b00cac1e1c2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/free_claude_code/config/custom_providers.py:129-133 | src/free_claude_code/config/model_refs.py:88-92 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/custom_providers.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48713e55ec94fca3b925b514d57f0daccada68c1c3aa5e6a45ed93fe0b968d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/free_claude_code/core/openai_responses/messages_stream.py:388-392 | src/free_claude_code/providers/openai_chat/stream_output.py:674-680 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_stream.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffda214a604be5c8d745ea0ba042e3bb0e29427e4f4cfc383d87f188cd7b1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (90 lines \u00D7 2): src/free_claude_code/messaging/rendering/discord_markdown.py:194-283 | src/free_claude_code/messaging/rendering/telegram_markdown.py:207-296 \u2014 before extracting anything, compare \u0060src/free_claude_code/messaging/rendering/discord_markdown.py\u0060 and \u0060src/free_claude_code/messaging/rendering/telegram_markdown.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/messaging/rendering/discord_markdown.py:194\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb3e4667b8ad446f5c2e7484723413b416fb58612976b24cd3f9624eda31960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): src/free_claude_code/messaging/rendering/discord_markdown.py:129-193 | src/free_claude_code/messaging/rendering/telegram_markdown.py:141-205 \u2014 before extracting anything, compare \u0060src/free_claude_code/messaging/rendering/discord_markdown.py\u0060 and \u0060src/free_claude_code/messaging/rendering/telegram_markdown.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee6b419f5936640c65f99d0056acb4ba9fff4ba6e39571d030aa1bc9c8f8d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201331 lines \u00D7 2): src/free_claude_code/core/delivered_response.py:365-384 | src/free_claude_code/core/delivered_response.py:411-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/core/delivered_response.py:365\u0060 it begins part-way through the construct above it, so those exact 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":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae59c930873865dc29ea4c22f93eb72bebced7bd54c42db1875eb2ed3a9c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/free_claude_code/providers/anthropic_messages/transport.py:354-374 | src/free_claude_code/providers/gemini/transport.py:114-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/providers/anthropic_messages/transport.py:354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae67ced79196cdabbfeef000426520820534ea2548bb7d49fe3c47d7b94d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): src/free_claude_code/application/execution.py:228-247 | src/free_claude_code/application/execution.py:291-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/application/execution.py:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/execution.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdf32f0712c995b74b0d75e472b0b107619e2819229f49c33bf8eeb2ff4c0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/free_claude_code/messaging/rendering/discord_markdown.py:56-75 | src/free_claude_code/messaging/rendering/telegram_markdown.py:53-72 \u2014 before extracting anything, compare \u0060src/free_claude_code/messaging/rendering/discord_markdown.py\u0060 and \u0060src/free_claude_code/messaging/rendering/telegram_markdown.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed47a831b477d1a565e747e7547136c90c6c842d305d0198def4286e09e202f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/free_claude_code/messaging/rendering/discord_markdown.py:92-110 | src/free_claude_code/messaging/rendering/telegram_markdown.py:98-117 \u2014 before extracting anything, compare \u0060src/free_claude_code/messaging/rendering/discord_markdown.py\u0060 and \u0060src/free_claude_code/messaging/rendering/telegram_markdown.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/messaging/rendering/discord_markdown.py:92\u0060 it begins part-way through the construct above it, so those exact 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":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dde5ca860ff0d9765c11eac0202117fb0fd81716059c60b51e12c71ddd473da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): src/free_claude_code/messaging/rendering/discord_markdown.py:112-123 | src/free_claude_code/messaging/rendering/telegram_markdown.py:119-135 \u2014 before extracting anything, compare \u0060src/free_claude_code/messaging/rendering/discord_markdown.py\u0060 and \u0060src/free_claude_code/messaging/rendering/telegram_markdown.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/messaging/rendering/discord_markdown.py:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"809b63e37708f7e2d29ad19b1b8589ce9e7a7a839069e5d947a87ed3d629b0d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/free_claude_code/api/routes.py:226-240 | src/free_claude_code/api/routes.py:260-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/api/routes.py:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/free_claude_code/api/routes.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c353d716e8073f4e34e63adbc5068720f7e244e24cec692c8827e2998edb39a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/free_claude_code/application/execution.py:310-324 | src/free_claude_code/application/execution.py:378-392 | src/free_claude_code/application/execution.py:438-452 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/application/execution.py:310\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/execution.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f22b284a1249edb2f4b2f19873b492c24b6484f70217fd667ae884f6ed29c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/free_claude_code/core/anthropic/errors.py:37-51 | src/free_claude_code/core/openai_responses/errors.py:28-42 \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":"src/free_claude_code/core/anthropic/errors.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b2ae9614c05d7c615a4348cb8553c4df98c99c771ec7960f34df1134fb8ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/free_claude_code/core/chat_completions/responses_stream.py:118-131 | src/free_claude_code/core/gemini/responses_stream.py:144-156 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/core/chat_completions/responses_stream.py:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/free_claude_code/core/gemini/responses_stream.py:157\u0060 calls \u0060order_records\u0060, \u0060sorted\u0060 and \u0060src/free_claude_code/core/chat_completions/responses_stream.py:132\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e69c233bafcb0e623be667ba4d897f0f4fde98d0526805694288136e310e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/free_claude_code/core/gemini/native_request.py:275-288 | src/free_claude_code/core/gemini/native_request.py:568-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/core/gemini/native_request.py:275\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d88f8bf29e372bade9bbc5450ba73618dfd47b7506fc4ede842542d45bc38b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/free_claude_code/core/gemini/native_request.py:257-269 | src/free_claude_code/core/gemini/native_request.py:399-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc91466fb0619ee3d79a8c9316fb50c4b7e41e7563fdfd7d4872a9f067ae004c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/free_claude_code/core/gemini/native_request.py:400-412 | src/free_claude_code/core/gemini/native_request.py:554-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/native_request.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46cec8c77c0de7a66ce6c20ff141ba1dcac9d5c63d7d170e739ff0526dd1f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/free_claude_code/messaging/rendering/discord_markdown.py:291-303 | src/free_claude_code/messaging/rendering/telegram_markdown.py:304-316 \u2014 before extracting anything, compare \u0060src/free_claude_code/messaging/rendering/discord_markdown.py\u0060 and \u0060src/free_claude_code/messaging/rendering/telegram_markdown.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6266b03da3a03d86013cb6ba62fb8daa36b56e6d3ea1a458746de1bc4bd8978c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/free_claude_code/providers/anthropic_messages/transport.py:572-584 | src/free_claude_code/providers/openai_responses/transport.py:649-662 \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":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c37fae5460ee0508dc151e6a8f7edf1762c81edc203c2dd73a0de22f83dead2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/free_claude_code/application/execution.py:359-370 | src/free_claude_code/application/execution.py:421-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/application/execution.py:359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/execution.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"124efd5545ea5047e10750b36995d3fb42ee464f2beeaaf6690c849bf4b7a50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/free_claude_code/messaging/transcript/buffer.py:143-154 | src/free_claude_code/messaging/transcript/buffer.py:159-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/buffer.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c114fb44f3ee1970ad25c47840256fc2f45eb229df6e0f3243be6a751f6b889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/free_claude_code/providers/cloudflare/client.py:98-109 | src/free_claude_code/providers/vertex/client.py:63-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/providers/cloudflare/client.py:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/free_claude_code/providers/cloudflare/client.py:110\u0060 calls \u0060CloudflareChatBehavior\u0060 and \u0060src/free_claude_code/providers/vertex/client.py:75\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/cloudflare/client.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a57c2731eb1faa6e8dc8fc8640a6f253d9d7c56e7eb358f0883c533ef36ca84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/free_claude_code/core/openai_tool_names.py:74-84 | src/free_claude_code/core/openai_tool_names.py:92-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/free_claude_code/core/openai_tool_names.py:85\u0060 calls \u0060isinstance\u0060 and \u0060src/free_claude_code/core/openai_tool_names.py:103\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_tool_names.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f65f31471552100c18994b9b615248d9f868e68c6e8c019a4fd0106156f01fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/free_claude_code/messaging/platforms/discord.py:191-201 | src/free_claude_code/messaging/platforms/telegram.py:257-267 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/messaging/platforms/discord.py:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/platforms/discord.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65c6fb209d041cb9533e66631c644ef07192a2b44f882bb6ef0748d46e28718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/free_claude_code/providers/openai_chat/usage.py:62-72 | src/free_claude_code/providers/openai_chat/usage.py:77-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/usage.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6050bc691fc43c021d3213496af542d75c23cf731aceb5e553b5a1385d81b66c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/free_claude_code/harnesses/claude_desktop_integration.py:39-48 | src/free_claude_code/harnesses/claude_integration.py:20-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/harnesses/claude_desktop_integration.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a4349b632a2e7926718745610b20ca76a78b15c8d53f49f905a7f903e81955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/free_claude_code/messaging/rendering/discord_markdown.py:82-90 | src/free_claude_code/messaging/rendering/telegram_markdown.py:88-96 \u2014 before extracting anything, compare \u0060src/free_claude_code/messaging/rendering/discord_markdown.py\u0060 and \u0060src/free_claude_code/messaging/rendering/telegram_markdown.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/messaging/rendering/discord_markdown.py:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2b15d552715d44bb3df96596d3f3a5971bdc99f1377f60ea0ec235892466b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/free_claude_code/messaging/trees/runtime.py:390-398 | src/free_claude_code/messaging/trees/runtime.py:407-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/free_claude_code/messaging/trees/runtime.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"084fd8d559a36212fb67a2538cbe9e46269f1c44bb078a771908a35111428340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/free_claude_code/runtime/integration_service.py:224-231 | src/free_claude_code/runtime/integration_service.py:251-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/runtime/integration_service.py:224\u0060 it does not close everything it opens, so those exact 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":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"53576510ab9badaf41a30aab1eac0c636cbde357e4d705e71bfa0433e7f7b318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/free_claude_code/core/gemini/request.py:98-102 | src/free_claude_code/core/gemini/request.py:203-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/free_claude_code/core/gemini/request.py:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/free_claude_code/core/gemini/request.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f086e5e1466a98bf81618e057ea727d64beadc263d29f6a58a089ca09d14c23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/free_claude_code/core/openai_responses/chat_request.py:684-690 | src/free_claude_code/core/openai_responses/chat_request.py:698-706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b47c4eabcd72e85afdd27532b77a6e94913fbde1b5ffb606ae38686425e2c3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/free_claude_code/api/handlers/chat.py:47-55 | src/free_claude_code/api/handlers/gemini.py:43-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/handlers/chat.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"809b1734de45bcf2671823abe1aee3ad7d2e19f4181e35599abb9635d1c184d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/free_claude_code/harnesses/antigravity_integration.py:35-40 | src/free_claude_code/harnesses/config_file.py:16-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/harnesses/antigravity_integration.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"88660d693a653e948483742f4278cd9df829079740353c3618b3724d751854d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/free_claude_code/harnesses/claude_integration.py:33-40 | src/free_claude_code/harnesses/claude_onboarding.py:18-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/harnesses/claude_integration.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44126472d813dd87e8e0f6048649129de9321cdcbe6b6cbe61301ce3dd22204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/free_claude_code/messaging/transcription.py:43-54 | src/free_claude_code/providers/nvidia_nim/voice.py:37-48 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"src/free_claude_code/messaging/transcription.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f88dac1d024c3703b445cf5bf7ee5b3bbdfa8c3dc2ae53062d72dbdf0d4ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/free_claude_code/messaging/transcription.py:115-122 | src/free_claude_code/providers/nvidia_nim/voice.py:100-107 \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":"src/free_claude_code/messaging/transcription.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8256e4a37ed22fd0537c76bd35dbda38356798ab404d0ef29491ae52432223b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/free_claude_code/providers/anthropic_messages/wire.py:52-57 | src/free_claude_code/providers/gemini/transport.py:74-79 \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":"src/free_claude_code/providers/anthropic_messages/wire.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c697d2aaed26ba3bf0c2afad87b5ba829c733d6165bef4c0b9bbe77ece1c70"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FakePlatform (LCOM4 4): FakePlatform\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":"smoke/lib/e2e.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"94433c0b38ad7e09bcace23d0cfadeb8fffc399751e7f751c127926f3f5df395"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ResponsesOutputLedger (LCOM4 4): ResponsesOutputLedger\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":"src/free_claude_code/core/openai_responses/streaming/ledger.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5085d55b2a86083d337fc1862c8dae96b79028229277a3ec746ac406e39974e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/api/admin_static/admin.js: src/free_claude_code/api/admin_static/admin.js changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in admin.apply at line 1570. 2 of those changes were fix/bug commits, and the other 48 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/api/admin_static/admin.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"813f85adf9aaa93062cfe112af0e31ee54ae790425667d6e180dba0082ea2286"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/openai_responses/transport.py: src/free_claude_code/providers/openai_responses/transport.py changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in OpenAIResponsesTransport._run_execution at line 415. 5 of those changes were fix/bug commits, and the other 26 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/openai_responses/transport.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_responses/transport.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a127c62650bbbaa017d22b2269254c7045fd37ea3c15d0763c69f80cccd910df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/anthropic_messages/transport.py: src/free_claude_code/providers/anthropic_messages/transport.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in AnthropicMessagesTransport._run at line 376. 1 of those changes was a fix/bug commit, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/anthropic_messages/transport.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b32c03ffc2582c4c131ebbe7ba78e5f687883c90c2c2d6a2c7b0fd6ba3668c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/openai_chat/transport.py: src/free_claude_code/providers/openai_chat/transport.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in _OpenAIChatStreamRunner._run_execution at line 1171. 1 of those changes was a fix/bug commit, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/openai_chat/transport.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/transport.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a92359e92cb260983086f0fe89121b08e852315f44ef8478258ef820b69687"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/api/admin_static/code_sessions.js: src/free_claude_code/api/admin_static/code_sessions.js changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in code_sessions.renderControls at line 1256. 1 of those changes was a fix/bug commit, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/api/admin_static/code_sessions.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"876dd42daf36ee7b946cfd8740eeb4ff7bbcadc343d0af42827a8775370593bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/continuation.py: src/free_claude_code/providers/continuation.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in SourceRecoveryState.observe at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/continuation.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/continuation.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd92538f42f04e7eb6b32534468fd2b3a25c58adf02322c08905e07ebe41042"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/api/stream_delivery.py: src/free_claude_code/api/stream_delivery.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in PublicResponseStream._publish at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/api/stream_delivery.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/stream_delivery.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"010deb4c3fa02bd734393ecb64bedc91c1dde41ac949c73299c8379cf849677f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/anthropic_messages/passthrough.py: src/free_claude_code/providers/anthropic_messages/passthrough.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in passthrough.stream_native_messages at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/anthropic_messages/passthrough.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/passthrough.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc89d899db53b839aa6fe13c5c6b17b2f9389ce325637a596c409209202f1e74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/failure_policy.py: src/free_claude_code/providers/failure_policy.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in failure_policy._classify_provider_failure at line 362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/failure_policy.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/failure_policy.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8921b69be30b0f8f815e929cddc592f05b8e4e2644ee55dd714496a4449f6f77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/openai_chat/reasoning_details.py: src/free_claude_code/providers/openai_chat/reasoning_details.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in StructuredReasoningStream.events at line 57. 1 of those changes was a fix/bug commit, 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/openai_chat/reasoning_details.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/reasoning_details.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2682de819243a9275b2fad14cd678f7776b146b4f878a00d565d0fa02d8bb757"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/delivered_response.py: src/free_claude_code/core/delivered_response.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in DeliveredResponse._responses at line 322. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/delivered_response.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/delivered_response.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"520972bc562576c625a789fb5bb5fdf736f7fb78a700552a0769094998b54ab9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/history_replay.py: src/free_claude_code/core/history_replay.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in history_replay._restore_gemini_parts at line 1139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/history_replay.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d20eb55de4316c61b7d55f1dea27d511952c7dadde4884b4f562f6703319188"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/anthropic/native_stream.py: src/free_claude_code/core/anthropic/native_stream.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in NativeMessagesStreamState.accept at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/anthropic/native_stream.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/native_stream.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8bf0a72a21b3adb9fb5b334d9b6ed2da47e86964db9fce313db60359cba287"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/openai_responses/chat_request.py: src/free_claude_code/core/openai_responses/chat_request.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _ResponsesChatInputBuilder._apply_pending_reasoning at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/openai_responses/chat_request.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ae5a907801e7d91b1489774ec2bb475f784cc7d462e638e5f73a851cb69c1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/history_replay.py: src/free_claude_code/providers/history_replay.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in history_replay.history_retry_body at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/history_replay.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_replay.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e2e6753b900db3ed429dcdffbd79da8f49df141f88c487d722a0a0b39776d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/anthropic/conversion.py: src/free_claude_code/core/anthropic/conversion.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AnthropicToOpenAIConverter._convert_assistant_message at line 625. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/anthropic/conversion.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"98843c5db6b349685aac317d94f1cd4f3b5211b35e9a2f9a393bb0b85566e34b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/api/model_catalog.py: src/free_claude_code/api/model_catalog.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in model_catalog._build_direct_models_response at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/api/model_catalog.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/model_catalog.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4c1283518f9228a022039a1568c5a408d6468fa88b9714f50cef6cc2674f36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/config/admin/persistence.py: src/free_claude_code/config/admin/persistence.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in persistence.prepare_admin_update at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/config/admin/persistence.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/persistence.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c186c8b3827d63c1793152c51e393f2337cc0a8fa8241171b0fd0583879155d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/openai_responses/provider_input.py: src/free_claude_code/core/openai_responses/provider_input.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in provider_input._assistant_items at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/openai_responses/provider_input.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_input.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"452116c2679ad5c15ea9cf067df2927deaff3ddb1251062f90899cece553de3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/openai_responses/provider_stream.py: src/free_claude_code/core/openai_responses/provider_stream.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ResponsesProviderStream._item_done at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/openai_responses/provider_stream.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/provider_stream.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"719fe6c144df2c06d2cf5f641ba6fd65e0a42d64085195b8920196f9c7cab8d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/model_listing.py: src/free_claude_code/providers/model_listing.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in model_listing.extract_openai_model_infos at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/model_listing.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/model_listing.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce03159ca1c14902373ca80de1bfbda936c3a084ae81b326341f5b45e2cea5d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/openai_responses/tool_adaptation.py: src/free_claude_code/core/openai_responses/tool_adaptation.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ResponsesToolEventAdapter.feed at line 625. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/openai_responses/tool_adaptation.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"4969500f9d7e2542532dc0ced4a41598b32d648cc1c794334ae35a0665b5a882"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/gemini/request.py: src/free_claude_code/core/gemini/request.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in request._build at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/gemini/request.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/request.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32998025f029f342348dc721224791045d9b18e499d4b8bbd7f249df4cd017e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/continuation_overlap.py: src/free_claude_code/core/continuation_overlap.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ContinuationOverlap._texts at line 170. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/continuation_overlap.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_overlap.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff50b9c32f47c807c33c2fdcb19a4bbfe62167d86c408176d555eca102f1fe5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/anthropic/tokens.py: src/free_claude_code/core/anthropic/tokens.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in tokens.get_token_count at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/anthropic/tokens.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/tokens.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ac9a90b4bc9d779ecea990939a4b7ec5b0b8d8be548c6bfc25d30f596b1a30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/runtime/codex_protocol.py: src/free_claude_code/runtime/codex_protocol.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in CodexProtocol.notification at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/runtime/codex_protocol.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/codex_protocol.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4ddcb299d0d34413f3782c44b2df5db0c14ed14027385607b4397e26b20b92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/continuation_stream.py: src/free_claude_code/core/continuation_stream.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ContinuationStream._map at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/continuation_stream.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_stream.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"710a7271943e61930013e594ae5ba0e52934d3344611bac751d0769e45e41db4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/gemini/transport.py: src/free_claude_code/providers/gemini/transport.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in GeminiTransport._run at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/gemini/transport.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/transport.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b217b5cef479a83997092301f7b671bf57845fd2c8da3b59f833edb0a4f48635"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/config/env_migrations.py: src/free_claude_code/config/env_migrations.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in env_migrations.consolidate_managed_config at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/config/env_migrations.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/env_migrations.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1499606544c4d361ab05091b178aad8c488ee39410c82935fab5c8bcb853ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/continuation_request.py: src/free_claude_code/core/continuation_request.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ContinuationRequest.history at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/continuation_request.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_request.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f094a9ef9fdf269dfc73db8af83dda1b5aeb96db4b0db8574542d8c2713626"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/stream_recovery.py: src/free_claude_code/core/stream_recovery.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ContinuationSeed.readable_text at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/stream_recovery.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/stream_recovery.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"24728e687efbf0bbd10004de417164168056de3453f5fad60822061e8e2f2c30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/deepseek/compat.py: src/free_claude_code/providers/deepseek/compat.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in compat._strip_document_blocks at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/deepseek/compat.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/deepseek/compat.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c8a01cdd2d4ae0b5f027a2bdd6c6bc0192aa57175d7207d214b3c4cb808a05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/gemini/stream.py: src/free_claude_code/providers/gemini/stream.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in GeminiStream.feed at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/gemini/stream.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/gemini/stream.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ab0974704dab08c826e47466d6735ebe62a2dfbfc1cf5b5ca50fbdedc4ac86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/runtime/integration_service.py: src/free_claude_code/runtime/integration_service.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in IntegrationService._dsh_desktop at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/runtime/integration_service.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/runtime/integration_service.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b290c0882dd311179ba6f19418c33eddf6e0d5843660babca39807b928a52755"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/providers/github_copilot/request_policy.py: src/free_claude_code/providers/github_copilot/request_policy.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in request_policy.non_messages_reasoning at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/providers/github_copilot/request_policy.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/request_policy.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baaa4bbd81a4e0b9eb59a6724b251af118e81307133a661f9eec1f3c18a0110"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/application/web_tools/service.py: src/free_claude_code/application/web_tools/service.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WebToolService._stream_automatic_search at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/application/web_tools/service.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/service.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e04ac4a74ecaaa2ad57616a1abf0f63ed757bf9b2e4d36de23193a77f4f323"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/openai_responses/messages_request.py: src/free_claude_code/core/openai_responses/messages_request.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in messages_request.build_responses_messages_request at line 578. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/openai_responses/messages_request.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/messages_request.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b60931562e2e7d1cdeb2c3946ff2df6eb5d9c915fa0d538e84464c96f648dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/application/web_tools/request.py: src/free_claude_code/application/web_tools/request.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in request._normalized_search_history at line 207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/application/web_tools/request.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/request.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fa73c7dd37ef1cb2e803d05b60663566f80a23e5db6a8efce5078b4d20329e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/core/openai_responses/tool_search.py: src/free_claude_code/core/openai_responses/tool_search.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in tool_search.resolve_client_search_history at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/core/openai_responses/tool_search.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_search.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"427dcea800e13a57cfb40eeaf65371c30bdbdd367698a2d698d744ffdf47654a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/validate_release.py: scripts/validate_release.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in validate_release.validate at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- scripts/validate_release.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate_release.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"50708921550bac4560fc1ca5d0293bd49f734e66d433680912d6754b34aba598"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/free_claude_code/config/admin/custom_providers.py: src/free_claude_code/config/admin/custom_providers.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in custom_providers.merge_custom_provider at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 02:03:14 -08:00\u0027 --until=\u00272026-11-12 02:03:14 -08:00\u0027 --full-history --no-merges -- src/free_claude_code/config/admin/custom_providers.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/custom_providers.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f574837c78b47e507d4f1ba70ffb9dcbc6e5b2301d30dc12689bf6d83434b7"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyproject.toml\u0060 makes this repository a deployable product (line 46)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"165cccc4db785a58e616733516528a169dca2b6f61c23dce9f2e601f9f8f08ad"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f20e9de36a4e7e8ebf3ea5d27206d50aecd8505c931dda747ec5d6f0b1212fa2"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9c13f30ba5199dd5982f2d05eba4591847c0cd3940edba444cc47f10b6fa73b"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3600ccbed71349111ffb2d4077f845ef6c34eae5e0162e5a63984d6d68c6d4ec"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07434512ae041be8070675a2a3c3f2f6026b030440bd11176588f0b68ab8558b"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cde7db32b41ec58ad3e37e4e8c332e3c0d9896924a0a882a3b9c3bd438ff8d00"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2559fcec2aec82cc84f30ac675b2a0c29308210bfb9daf34232cc7fb33424732"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8054b2f3148bc71fb636cbb4d1d2913e40e759d918bd885440f6df89c9efd40"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5eb66af02e9670d8ddb0390f0db5fc892df2dadcef6191d033f0609ce70a17df"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef8815532a52150889a0976b718aad7bcc5923f4790ddff8fb23e258738904af"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75256ef5297e5dcb1b9ef3342583b39520cc1d1fa61d049c556879e46f7bdb8f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3f9d1fee4523bd133c61d2b9b5b6800d4b12b10814af3b7952b489caf9eb9fd"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c39221e7a57c94c8668f293a52beb2217070a9b1a940bee5edd4b6b0b226af4b"},"properties":{"dependency":{"package":"certifi","version":"2026.1.4","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"006bc09fe1c8f368204de0316eff374aa31b7c81c27de1cd301ae024f2a90b4d"},"properties":{"dependency":{"package":"cryptography","version":"49.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3552"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d55eb5e10fbe2eebac3cecc6f1c6c6c29fa6ca98a738924e23ab582305d2b6f"},"properties":{"dependency":{"package":"dnspython","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1cd5edb55bbbb627ab2f3a485a1a65f2b7d9e94a298b940d9d0c04d4a4bc987f"},"properties":{"dependency":{"package":"filelock","version":"3.24.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10e04b22e35243729294f2c63d26777ab5e2f09392f1c7f89a239026644367c0"},"properties":{"dependency":{"package":"fsspec","version":"2026.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4217"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad4a622d4c80364e7f8e6dae074bf8f6eb842484394dd312c7e2c864fb2136e6"},"properties":{"dependency":{"package":"msgpack","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3625"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5102fe556f3399b622dcd81c118f7d1308c1374fbd00ede44c01babfc78c0a23"},"properties":{"dependency":{"package":"pyasn1","version":"0.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9cf3c583f310ea7e342dd7f8ef456f46b5cc58884162a6bd1d9c793e5b6ce74"},"properties":{"dependency":{"package":"python-multipart","version":"0.0.22","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3036","PYSEC-2026-3037","PYSEC-2026-3038","PYSEC-2026-3039","PYSEC-2026-3040","PYSEC-2026-3041"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55dafb5dd1a9bfa0286572041c83230db1fdbb3e170dceaf78ee18fc0f94ae0f"},"properties":{"dependency":{"package":"starlette","version":"0.52.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-161","PYSEC-2026-2280","PYSEC-2026-2281","PYSEC-2026-248","PYSEC-2026-249","X41-2026-002"],"reachability":{"kind":"production","file":"src/free_claude_code/api/admin_cache.py","line":4}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f268873f65bdaa9fa0eb6931555627e85a8ff8143ca35ae482b4a7d5ea5ae3e9"},"properties":{"dependency":{"package":"urllib3","version":"2.6.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-141","PYSEC-2026-142","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2f69292b7500f63f60d9273f140d50be816fe0dca2dfb24841c4450b5194153"},"properties":{"dependency":{"package":"multidict","version":"6.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"854da5cef13784fde7cfff8a79eb2a7417bef798a376f1ff9e501c0d2a107a1d"},"properties":{"dependency":{"package":"pygments","version":"2.19.2","advisory":"PYSEC-2026-2987","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13586fc0c39afd311c8f68b33f2e89fbb1618f43b2d8bc54d4d00cd4d7925790"},"properties":{"dependency":{"package":"setuptools","version":"78.1.1","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 295 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 295 of the 470 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/free_claude_code/messaging/rendering/discord_markdown.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b6c8dd50343b79fb9b5ceb3cb8d444b0e8015eda0209d7b0fba8cc2cc3c67"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: config.py \u2194 model_listing.py: \u0060smoke/lib/config.py\u0060 (context smoke) and \u0060src/free_claude_code/providers/model_listing.py\u0060 (context free_claude_code) sit in DIFFERENT parts of the tree yet change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006010fb1d02\u0060 patch: Add OrcaRouter as an AI provider (#1754); \u006079f35480\u0060 Add Featherless AI provider (#1405); \u00605823d253\u0060 Add Chutes provider (#1402) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbab7d52658ca2b086b2fdab349ffe3a43a689249fa7eb9400fb0a12968cf3fe"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: capabilities.py \u2194 features.py: \u0060smoke/capabilities.py\u0060 and \u0060smoke/features.py\u0060 change together 91% of the time (29 of the 32 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 29 shared commits counted here, the most recent 3 are \u0060cb7ae5b1\u0060 patch: Remove five Claude request optimizations (#2112); \u00608296b09e\u0060 patch: Remove obsolete Task foreground interception (#1925); \u0060a78d2831\u0060 Support OpenCode 2 and migrate native v1 installations (#1840) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/capabilities.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4459c002307b05c95d578c2468ca746140ff372d64b7ee290eac6260dc626e73"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: settings.py \u2194 profiles.py: \u0060src/free_claude_code/config/settings.py\u0060 and \u0060src/free_claude_code/providers/openai_chat/profiles.py\u0060 change together 85% of the time (33 of the 39 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 33 shared commits counted here, the most recent 3 are \u0060b920b8db\u0060 minor: Add Atlas Cloud provider (#2035); \u0060f29cc304\u0060 minor: Add Opper provider (#1860); \u0060f88793c7\u0060 minor: Add xKiro provider (#1960) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/settings.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da95e6dfc636e4a14a5fe65449a93ffdd53c79198d33aa4b9258af0c7310412"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: discord.py \u2194 telegram.py: \u0060src/free_claude_code/messaging/platforms/discord.py\u0060 and \u0060src/free_claude_code/messaging/platforms/telegram.py\u0060 change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006078377253\u0060 Keep voice ownership continuous through admission (#1063); \u0060795a83a8\u0060 Make pending voice cancellation atomic (#1054); \u006092488456\u0060 Refactor messaging platform bridge (#858) (at that commit the files were still \u0060messaging/platforms/discord.py\u0060 and \u0060messaging/platforms/telegram.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/platforms/discord.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49015d26443625700c439a42f96fb04592c6aeeba6826dc6e178cabd78fef7bc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: settings.py \u2194 model_listing.py: \u0060src/free_claude_code/config/settings.py\u0060 and \u0060src/free_claude_code/providers/model_listing.py\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006010fb1d02\u0060 patch: Add OrcaRouter as an AI provider (#1754); \u006079f35480\u0060 Add Featherless AI provider (#1405); \u00605823d253\u0060 Add Chutes provider (#1402) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/settings.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5d421900f0945bf2ef457a1519cab171e7d69d639d8faccd439204ed792763"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: provider_manifest.py \u2192 model_listing.py, profiles.py, factory.py: \u0060src/free_claude_code/config/admin/provider_manifest.py\u0060 changes together with 3 other files \u2014 \u0060src/free_claude_code/providers/model_listing.py\u0060, \u0060src/free_claude_code/providers/openai_chat/profiles.py\u0060, \u0060src/free_claude_code/providers/runtime/factory.py\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/provider_manifest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96904b4c9484bb451a30970085cfaf10cce099652b7d893ad579e05bedeffd2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: code_sessions.js \u2194 service.py: \u0060src/free_claude_code/api/admin_static/code_sessions.js\u0060 and \u0060src/free_claude_code/application/code_sessions/service.py\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060bf59598c\u0060 Show context usage in native Code Sessions (#1785); \u006012761363\u0060 Show Thinking in transcript during 500 ms output gaps (#1777); \u0060defc7425\u0060 Show Codex sub-agent Auto-review results in Code sessions (#1728) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60df1f91126b1e3194594e66c9f6108b96fe1c7d571389b67f7b53828d228ee5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: provider.py \u2194 provider.py: \u0060src/free_claude_code/providers/openai_chat/provider.py\u0060 and \u0060src/free_claude_code/providers/openai_codex/provider.py\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006012262135\u0060 patch: isolate provider recovery by model (#2176); \u0060f64e2b31\u0060 Fix OpenCode MissingSessionID errors through FCC (#1700); \u0060e6f2633b\u0060 Recover context-window exhaustion across providers and Chat (#1661) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/openai_chat/provider.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e266efe2f3674c53708fa912debc8a5cf242c1e2274dbd4168e7c898f5a825"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch3\u003E heading: An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it\u0027s decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/index.html"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b771053cbdfb79712e0c975d2637890d41c4f5c4132da1ea91d52391305c2597"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.session-composer textarea\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/session_layout.css"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dedd2e6a16424eede723f5118e57010789c411358ceceec510c8ee26a5aed6"}},{"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":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/tests.yml"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"warning","message":{"text":"No deployment automation: No release automation was found in CI \u2014 neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a7f38718309412c2d2c2c0663260a3d160de9a5a60f3915755be16386d3f1e8"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060requests.Session(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/vertex/auth.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8eb8f04f3eb15f873e3a126904d874138e9d913941b6b2d6a0875e08e71e10"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 1 typed \u00B7 7 plain JS \u2014 the untyped files are smoke/lib/dsh_desktop.cjs, src/free_claude_code/api/admin_static/admin.js, src/free_claude_code/api/admin_static/api_key_editor.js, src/free_claude_code/api/admin_static/code_sessions.js, src/free_claude_code/api/admin_static/form_controls.js, src/free_claude_code/api/admin_static/model_combobox.js (\u002B1 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4 locations): src/free_claude_code/api/admin_static/admin.js:2073 \u00B7 src/free_claude_code/api/admin_static/admin.js:2279 \u00B7 src/free_claude_code/api/admin_static/admin.js:2380 \u00B7 src/free_claude_code/api/admin_static/admin.js:2477 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ef9818dad007eff1b5385da79eb70fdb67e42934280b15065a14d3aa83b5e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6 locations): src/free_claude_code/api/admin_static/admin.js:2095 \u00B7 src/free_claude_code/api/admin_static/admin.js:2201 \u00B7 src/free_claude_code/api/admin_static/admin.js:2300 \u00B7 src/free_claude_code/api/admin_static/admin.js:2402 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c38ee4225f248e08aa0a7b4f5675f9414ad4a7b3a811b882a2a9fd4801a254"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/free_claude_code/api/admin_static/admin.js:2528 \u00B7 src/free_claude_code/api/admin_static/admin.js:2648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"103dba4ba8153ee4a7e220fa8ff3aa119e9a9a35b65fdc2a9c11f8bbd410a44e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/free_claude_code/api/admin_static/admin.js:2232 \u00B7 src/free_claude_code/api/admin_static/admin.js:2334 \u00B7 src/free_claude_code/api/admin_static/admin.js:2431 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea4ae5262a3696cf786832b734430fabaf12e0f8733ca75094190a586561ecb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): src/free_claude_code/api/admin_static/admin.js:1948 \u00B7 src/free_claude_code/api/admin_static/admin.js:2099 \u00B7 src/free_claude_code/api/admin_static/admin.js:2205 \u00B7 src/free_claude_code/api/admin_static/admin.js:2304 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"106fb69e8298dc504133c9de93454b3e8de7f04a3e2be1f43bf22b6a2e350c95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/free_claude_code/api/admin_static/admin.js:2179 \u00B7 src/free_claude_code/api/admin_static/admin.js:2700 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb92918ebd26035a7bfbcae35d70033481e0735fce01479c7c51aa920020286"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/free_claude_code/api/admin_static/admin.js:2386 \u00B7 src/free_claude_code/api/admin_static/admin.js:2584 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17895b44256111c093805d4c7b9cd919303e22f308ed6f4fd270322a5cf5868"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): smoke/lib/dsh_desktop.cjs:80 \u00B7 smoke/lib/dsh_desktop.cjs:85 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/dsh_desktop.cjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cad4a43ca885469a9afba571e0dd192410a7c2bcefc55bd934ce24cb16d093f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/free_claude_code/api/admin_static/admin.js:2112 \u00B7 src/free_claude_code/api/admin_static/admin.js:2221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"08120ff2e49d62626ee8fdf25e2003f0078afc3fbb089c1bf0117efc53282ad7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 64, cognitive 72): apply has cyclomatic complexity 64 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eac5d131129ab5aea92d6fbbb4de5ba392502b7a7e97598b31c75888266c6c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderControls (cyclomatic 50, cognitive 32): renderControls has cyclomatic complexity 50 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60a5fb4e9452b8079a1e47c25b463680a4615cf9176b4e84a67cfd22aeb315d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 32, cognitive 47): render has cyclomatic complexity 32 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4cce6ff55e53d5f38be868bc3027ecaf46a6ae6613aea65859e846933c49e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshStartup (cyclomatic 30, cognitive 24): refreshStartup has cyclomatic complexity 30 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"acacd00b24b3d55202bcd26b510addf1e660289f5891eb73dd29210e3c917f75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPrompt (cyclomatic 25, cognitive 75): buildPrompt has cyclomatic complexity 25 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e82409088140ac5f7fbee0494ef15c7a42ca5f96e91c5ea7803bd116e79e30c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function merge (cyclomatic 25, cognitive 31): merge has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f1db511b93fccf53a7a8bc87ab044bc81f15490f7e9f14734e450b5f33a86f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateProviderCard (cyclomatic 24, cognitive 24): updateProviderCard has cyclomatic complexity 24 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1ce51fecb9fc0d60b0d568555d37d756e07dfe1f261da98221d1599e3319b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderItem (cyclomatic 21, cognitive 29): renderItem has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6270c632462af3dd69dab931667df9d84dafc516100a647d58ed14ac555df2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inputForField (cyclomatic 20, cognitive 22): inputForField has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d72ce1ae7219eadf0caf53da3245c99525c32dd8683f2a7070aa53e69969b19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCodexIntegration (cyclomatic 18, cognitive 16): renderCodexIntegration has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ef1beac8bd56f53c2cadb915894291de606801ddd4fa27b2801935df2de71d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeydown (cyclomatic 17, cognitive 24): handleKeydown has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/model_combobox.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b746cabb06ced2aa76a217ddbfd6279505e141623ae065555fd46c7c839ec4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openCustomProviderDialog (cyclomatic 17, cognitive 20): openCustomProviderDialog has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b76cebc5fc45c4b0f2502a568bba13074cbce20d0e0a51b76b027b2eb1cb1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function synchronize (cyclomatic 17, cognitive 20): synchronize has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae81ad35be2295447e1b198b9a5b47c4544e6faa6ebf1fba4ac1692c80db4663"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detail (cyclomatic 17, cognitive 17): detail has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfad5cfcf75294939ddd68c2d99a4c856ad9dd9caf5932d70efcf6d2e0cac0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderClaudeDesktopIntegration (cyclomatic 17, cognitive 16): renderClaudeDesktopIntegration has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62db1cd1a61213c3686599806e1b2746ad62ed2655bc1fd8089cacf068394aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBootstrap (cyclomatic 17, cognitive 16): readBootstrap has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c228a83599d9d75a64451fd55a0f48e57fc7863deb063759b82c7e7ca77b26f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderField (cyclomatic 17, cognitive 15): renderField has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ef12f2ebbcad512aef37a7fc3889d66a1415491fb305717a3c00f8ca8e0138"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderAntigravityIntegration (cyclomatic 15, cognitive 14): renderAntigravityIntegration has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f67098a8975e5ff7da274fae94f4d109f18b14575315b0299aabd9a4c1ed6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function list (cyclomatic 15, cognitive 13): list has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"061d92300b9aaefbbc34c3b34e847ffbb6e285f966acd915c038df8ed2f9b5b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beb60c02887a94ed8bd23c89207685f924af256ea7e534c4d24f9fb78ec3e70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDshDesktopIntegration (cyclomatic 14, cognitive 13): renderDshDesktopIntegration has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa680c66eb95140ae812cd74f6181c401cbec3a5138d77dfb11a940a99dfd36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activate (cyclomatic 13, cognitive 17): activate has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca14dadf2c2eb8c57ed9db4502b554627c5d30550340a256820432e404394f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startConnectedAccountLogin (cyclomatic 13, cognitive 14): startConnectedAccountLogin has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e9a61f0184cf1ebb8fe8ce919edfb61bef767e58945f0a2b8c63e4f06f1663"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderClaudeIntegration (cyclomatic 13, cognitive 13): renderClaudeIntegration has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc163d5bfd2caff8a76c505d3fc7a9e06d9d4c6b8964cf3547137cd9f7651f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectFccModels (cyclomatic 13, cognitive 13): projectFccModels has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/cli/launchers/pi_extension.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"de76221007dc3783a2933088aa6ec7aecc1b8213b160cd27a1f2a7daefd47bae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderVSCodeChatIntegration (cyclomatic 13, cognitive 12): renderVSCodeChatIntegration has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ce456e995a8f568c15683b271cad0762d4db0a99c8f57db6c246a979cbfd7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894f91f306433deeb2dc8cbe9caef412f41bb10b17581992f9de5fce8b2484b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshIntegrationUpdates (cyclomatic 12, cognitive 14): refreshIntegrationUpdates has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fc7143db177dbf8cbe0fc24a924d68d3af3b43940ac099f5029dc707dbc32e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFieldValue (cyclomatic 12, cognitive 13): readFieldValue has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48fb0a48528a30ebfa3682252560452e1a308026da9024588e198f6c51890ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderJetBrainsIntegration (cyclomatic 12, cognitive 11): renderJetBrainsIntegration has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa08ea8a613f06212c3310b3e1a52b8e93922b8479628404972034839149c46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliver (cyclomatic 11, cognitive 15): deliver has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"538f4c527b9176a986d27591d4a985029c264af4b3aaade2d659069d5ac54fea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSettings (cyclomatic 11, cognitive 13): updateSettings has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bb7fd87dc3c8b50169b34966af2760ad7a4633a6399029d87fc2e273fd6784"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populateConnectedAccountActions (cyclomatic 11, cognitive 12): populateConnectedAccountActions has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"018836c707f75d071e023c5cad7efaacc59cc4c6d9601cc3b4681c169e44461c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/free_claude_code/api/admin_static/admin.js: 2591 lines of code: src/free_claude_code/api/admin_static/admin.js has 2591 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47248a6175640dd4f8d9dd4f2fea0dbb9825e7b9e4e9657829451c97331180de"}},{"ruleId":"R3","level":"warning","message":{"text":"src/free_claude_code/api/admin_static/code_sessions.js: 1721 lines of code: src/free_claude_code/api/admin_static/code_sessions.js has 1721 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b7715b0f591066f69b6d8ff510c635503c9039bf4afeee21ac9e05bc5a2ef0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c16e13e2659dd80fc67fe0c3653f695f5ea5e6ef1113e4f5bf83e87d607cce"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/api_key_editor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10757e86ab369835fc7091f9a84535ac5f506cde871e279f252f66d742cb565c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/session_ui.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cec46cedf20a9731ff7ae95fda6f9f257c775e0c753b33fa03e1eb510babef5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/cli/launchers/pi_extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceff19470fde2203a1ba0962f9fdfeeda22b8ebeaa9825f859dbd8de53c10a47"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/form_controls.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fc1507647c6cbd9bb7680acb9c4940032fe6f54af64d067d44824489c23c35"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~96 LoC): no import path from any entry point (7 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/dsh_desktop.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b85efc9b99854670bb5b898a39e95f4a99509063b0543b5fba60d44be08e8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060combobox.isOpen \u0026\u0026 !combobox.element.contains(event.target)\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/api/admin_static/admin.js, src/free_claude_code/api/admin_static/code_sessions.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d047f3f462ced27bd76f07ff6d447d5587433fe51aec610fe0ad6915df03b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attempt_failure is not None and attempt_failure.retry_allowed\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/providers/anthropic_messages/transport.py, src/free_claude_code/providers/gemini/transport.py, src/free_claude_code/providers/openai_responses/transport.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df3697ecc6d4b8c3c3aef519ea16de8fe95b1a8587ad9341226c61344cb21ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body.get(\u0022max_completion_tokens\u0022) or body.get(\u0022max_tokens\u0022)\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/chat_completions/request.py, src/free_claude_code/core/gemini/native_request.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/request.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"130a230fb8ea217579fbc12998e52765825cfb4cef271a349b8f1dc9b1f3058c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.type == \u0022text\u0022 or child.type == \u0022code_inline\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/messaging/rendering/discord_markdown.py, src/free_claude_code/messaging/rendering/telegram_markdown.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1c554be62fa74f5e9d1d416351149ea1f660bd0429fe1eab24b2dfbf15e9c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current.__cause__ or current.__context__\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/diagnostics.py, src/free_claude_code/providers/runtime/discovery.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/diagnostics.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f93e281e3591305388bd2ea29a81644f299538761ba25dd32b724f3df831b3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060detail.body_text or detail.exception_text or \u0022\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/providers/mistral/client.py, src/free_claude_code/providers/reasoning_compatibility.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/client.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a77805dbc49f35f25c7060792fe6af1eb42efa6272cd33e4f6d4a82022b1dd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.event == \u0022ping\u0022 or event.data.get(\u0022type\u0022) == \u0022ping\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/providers/anthropic_messages/wire.py, src/free_claude_code/providers/gemini/transport.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/wire.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bdc89c3c2ea013c4d0cec54e7bcda284640c138e3d19429c80191641bc2671"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.kind == \u0022notice\u0022 and event.message\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/application/code_sessions/service.py, src/free_claude_code/runtime/codex_app_server.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/code_sessions/service.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"df190ecd522fd1d03701b5221ddb5a91be653726c7915f7e7aaee9f74cf001e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060failure.kind == FailureKind.PERMISSION and failure.status_code == 402\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/anthropic/errors.py, src/free_claude_code/core/openai_responses/errors.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/errors.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae5bf19c7ccca5319cd93e66410bb31dc69f5ee2675747bb75d1177209ba664"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060failure.kind == FailureKind.TIMEOUT and failure.status_code == 504\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/anthropic/errors.py, src/free_claude_code/core/openai_responses/errors.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/errors.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e3218bad3b2495259dd5b25f034e17be7a39b6b68d358de59f816c05123134"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C len(children) and children[i].type != \u0022link_close\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/messaging/rendering/discord_markdown.py, src/free_claude_code/messaging/rendering/telegram_markdown.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aee8b78ae6c619f10ae6301208a3c66b69adef7564b5c75009db9efe0215a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060incoming.is_reply() and incoming.reply_to_message_id\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/messaging/commands.py, src/free_claude_code/messaging/turn_intake.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/commands.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c710fc78d85b40cc02d60b2a902e1506c77a1e1ec0364a9505d0e32fb6c09d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022tool_use\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/anthropic/stream_contracts.py, src/free_claude_code/providers/anthropic_messages/passthrough.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/stream_contracts.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fd4d365fe2c453d681d29d85313334a2cba89b5b4b1edb2492ead41bcc3b4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(carrier, str) and is_replay(carrier)\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/providers/history_negotiation.py, src/free_claude_code/providers/history_replay.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/history_negotiation.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d6223491223b85cacc3e595815a8cb0a58675222df3ae8964c551d6cee6e1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(count, int) and not isinstance(count, bool) and count \u003E= 0\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/core/gemini/messages_stream.py, src/free_claude_code/core/gemini/responses_stream.py, src/free_claude_code/core/openai_responses/messages_stream.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/messages_stream.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c2cac15b4593306ba4e45b26fab6c1f66a05e46e4665db885d378a1ce82ce8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(extra_content, dict) and extra_content\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/anthropic/conversion.py, src/free_claude_code/core/anthropic/streaming/ledger.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a9bb753e3483c6326d19b3b8a33e5d5b334519833a6c2a586ecfb8d5e0d5f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and isinstance(item.get(\u0022id\u0022), str)\u0060 appears character-identically in 2 files \u2014 smoke/lib/local_providers.py, src/free_claude_code/core/continuation_stream.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/lib/local_providers.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28bd8ef35f7cf137dff8168b1acbc36a4ee2fd66f3b4813ef2d4ca2cc802813"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0022type\u0022) == \u0022reasoning\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/history_replay.py, src/free_claude_code/core/replay_finalization.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ebecd8782d8bfe64b86b1cfc019fe9f3b70ae9f899dabd8af4e9720c21b186"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(part, dict) and isinstance(part.get(\u0022text\u0022), str)\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/history_replay.py, src/free_claude_code/core/openai_responses/provider_stream.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bf8c55511683fb061ddf4c82216dbedad985551a0f3c73f135b02681202fff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(part, dict) and part.get(\u0022type\u0022) == \u0022reasoning_text\u0022 and part.get(\u0022text\u0022) == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/openai_responses/chat_request.py, src/free_claude_code/core/openai_responses/provider_stream.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/chat_request.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b2c100dc0f5ed6dd2185370bf3a195b91e7a9232cfc77b7b7a12279fbeb6fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(raw_error, ExecutionFailure) and raw_error.stream_context and raw_error.stream_context.source.unsafe_reason\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/providers/anthropic_messages/passthrough.py, src/free_claude_code/providers/anthropic_messages/transport.py, src/free_claude_code/providers/openai_responses/transport.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/passthrough.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1ccfbf5756844efeae4c1905bd092f1154c3595abe8a101f67f4ff8fa449ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(raw_message, str) and raw_message.strip()\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/api/handlers/messages.py, src/free_claude_code/application/web_tools/service.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/handlers/messages.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d5888104e1762efbd662dee466c6a9177be957208ad9f4e5c79fff78e3e2ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(signature, str) and signature\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/core/anthropic/conversion.py, src/free_claude_code/core/openai_responses/provider_input.py, src/free_claude_code/providers/google_openai/thought_signatures.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/conversion.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9b40bd8f7846b007a5c0b8f018bfd0785be9d6e99393a1f2f818ab0cb874ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, int) and not isinstance(value, bool)\u0060 appears character-identically in 4 files \u2014 src/free_claude_code/application/web_tools/service.py, src/free_claude_code/core/anthropic/server_tool_sse.py, src/free_claude_code/core/openai_responses/provider_stream.py, src/free_claude_code/providers/openai_chat/usage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/web_tools/service.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95d27158dc76450bb71c5db8bd6ee14d76bd9d7bd948444e92c3ccbbd5df2e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and is_replay(value)\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/history_replay.py, src/free_claude_code/providers/history_replay.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d938f6da8ccf2fde30d2b948abd01c2a074f8329e80448286b5c69b9f2a368c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and value.strip()\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/diagnostics.py, src/free_claude_code/providers/kilo/models.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/diagnostics.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01b64c8a1074b0c126f87d88b498fa8756685fec44124fffe73518b317ad2cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.get(\u0022id\u0022) and known.get(\u0022id\u0022) == item[\u0022id\u0022]\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/chat_completions/responses_stream.py, src/free_claude_code/core/gemini/responses_stream.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ceee9011e32bf4040c4c5766eb96c211c58f24a3be4fdbd0801647d0fc0a99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key in known and key != FCC_CONFIG_SCHEMA_ENV and not values[key].strip()\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/config/admin/persistence.py, src/free_claude_code/config/env_migrations.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/config/admin/persistence.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9363320dfbab0ab4dffb805f124bbfa61c7cb0ea668e51d9bbe47269ff6d30f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normal_stop_seen and execution.delivery is not None and not execution.delivery.content_released\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/providers/anthropic_messages/passthrough.py, src/free_claude_code/providers/anthropic_messages/transport.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/passthrough.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c4f73d56ec32b860f421ab4ac6e3eb65a805c05e159c2c18142a430094fcd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(arguments, str) or not arguments.startswith( self._arguments.get(index, \u0022\u0022) )\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/chat_completions/responses_stream.py, src/free_claude_code/core/gemini/responses_stream.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4790e033da083d2f9d564019b2cfbd2980dca837d9b91ffaa17622fd70025d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(call_id, str) or not call_id or call_id in self._reserved\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/chat_completions/responses_stream.py, src/free_claude_code/core/gemini/responses_stream.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/chat_completions/responses_stream.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd29f11a87cc850edec218eac41e43dd4f4612797cb16bd8efab6d2d953dad8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(index, int) or isinstance(index, bool) or index \u003C 0\u0060 appears character-identically in 4 files \u2014 src/free_claude_code/core/anthropic/native_stream.py, src/free_claude_code/core/chat_completions/tool_calls.py, src/free_claude_code/core/openai_responses/tool_calls.py, src/free_claude_code/runtime/codex_protocol.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/native_stream.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf497eec1e837576aed9934f8de56707740eed9d664f675383a93665b21c3e77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(message, dict) or message.get(\u0022role\u0022) != \u0022assistant\u0022\u0060 appears character-identically in 5 files \u2014 src/free_claude_code/core/gemini/replay.py, src/free_claude_code/core/history_replay.py, src/free_claude_code/providers/google_openai/thought_signatures.py, src/free_claude_code/providers/history_negotiation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/gemini/replay.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30eabc3a0eeeac53d21b5451d8b2c57ca994484086fc4452fc9016977aa2737"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(model_id, str) or not model_id.strip()\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/providers/alibaba_cloud/client.py, src/free_claude_code/providers/model_listing.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/alibaba_cloud/client.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ab646bff531a8a846ffc4361a3d960d0c505f6eafc209bb3ddda27fa232b19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not is_replay(value)\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/anthropic/passthrough.py, src/free_claude_code/core/history_replay.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/anthropic/passthrough.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2017dc16e05833cc60f0256f9c7514150d405e69475039ebb120d7868470308"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value.strip()\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/providers/admission.py, src/free_claude_code/providers/model_listing.py, src/free_claude_code/runtime/codex_protocol.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/admission.py"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2022dfdfca9d32dcff5b320a0a2916fc697c1ccc357169d273042c8c59cd707"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not separator or not provider_id or not model_id\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/cli/launchers/catalog_http.py, src/free_claude_code/config/model_refs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/cli/launchers/catalog_http.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"129fac55e7113d0a5af1564dd32bbb4d9b48393b4eeddd8aa765f9e591e16fc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(\u0022XDG_CONFIG_HOME\u0022) or home / \u0022.config\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/harnesses/claude_desktop_integration.py, src/free_claude_code/harnesses/claude_integration.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/harnesses/claude_desktop_integration.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cf6079cf7274f406e5974ffc2ad64a53b35907bb04b9200fde8472b054eac0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part.get(\u0022text\u0022) or part.get(\u0022functionCall\u0022)\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/continuation_stream.py, src/free_claude_code/core/delivered_response.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/continuation_stream.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b99b15bb05d6ac349372d5194e57504928bb9be4e2cd4293b683d25219e308"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prompt.status != \u0022pending\u0022 or prompt.generation != generation\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/application/code_sessions/state.py, src/free_claude_code/runtime/code_sessions_sqlite.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/code_sessions/state.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a1b78b2fe5e972ff912f83901c1760cd99dce92cf7e71e0ed7b95a892bb750"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reasoning.control is ReasoningControl.PREFER_OFF and wire_reasoning.control is ReasoningControl.OFF\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/providers/anthropic_messages/transport.py, src/free_claude_code/providers/gemini/client.py, src/free_claude_code/providers/openai_responses/transport.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f48ea3835e97b1804886facfad56f227e96bdf03c5b30793746d9cab7b8c03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scope is not None and not scope.attempt.accepted\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/providers/anthropic_messages/transport.py, src/free_claude_code/providers/openai_chat/transport.py, src/free_claude_code/providers/openai_responses/transport.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/anthropic_messages/transport.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"641ac7415e3ac81bb903936fbbcc1a98ad6c413664442bc9f8fb6326d6e6c55d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._cleanup_task is None or self._cleanup_task.done()\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/providers/github_copilot/auth.py, src/free_claude_code/providers/github_copilot/provider.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/auth.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8174a712a4d2de857c13c07abe1d565aa899ae837ced70d363508815ce4801f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._close_task is None or self._close_task.done()\u0060 appears character-identically in 3 files \u2014 src/free_claude_code/providers/github_copilot/auth.py, src/free_claude_code/providers/github_copilot/broker.py, src/free_claude_code/providers/github_copilot/sdk.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/auth.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9253bb0eaced4da298a686eed2644c0e4f5a10eff44c1b1abeddeaa79a7ba207"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._login_task is not None and not self._login_task.done()\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/providers/github_copilot/auth.py, src/free_claude_code/providers/openai_codex/auth.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/auth.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af99c10641dde8572f6b10ec65c19a4b2fdde0db3ec83bec3408bd589790aa1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060summary is None or summary == is_summary\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/core/history_replay.py, src/free_claude_code/providers/openai_chat/reasoning_details.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/history_replay.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3e1355eb0ef8567978fbab1ac8249b1cdb9c41e7b45132b285f20acfceb740"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t == \u0022strong_open\u0022 or t == \u0022strong_close\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/messaging/rendering/discord_markdown.py, src/free_claude_code/messaging/rendering/telegram_markdown.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcad569798ee4ea35669042cc358cac2e7bbfa77909fc18419f5bb283ce64da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tok.type == \u0022text\u0022 or tok.type == \u0022code_inline\u0022\u0060 appears character-identically in 2 files \u2014 src/free_claude_code/messaging/rendering/discord_markdown.py, src/free_claude_code/messaging/rendering/telegram_markdown.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/rendering/discord_markdown.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0023e76d4d13880413baeeacf21c2857f7a13f98fbbce2b9d3eb1e4c1beb87cf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reasoning_control_rejected\u0060 is public, takes a document from its caller (line 145) and hands it to \u0060_error_records\u0060, which calls itself at line 160 (\u0060_error_records\u0060) with a piece of \u0060payload\u0060 (and at line 163) \u2014 and nowhere in \u0060_error_records\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_error_records\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/reasoning_compatibility.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1967ed972883d8eadb7d29cf9c7cbab1cfae688d02e9861e060896ad8ee7ffde"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sanitize_nim_tool_schemas\u0060 is public, takes a document from its caller (line 29) and hands it to \u0060_sanitize_nim_schema_node\u0060, which calls itself at line 104 (\u0060_sanitize_nim_schema_node\u0060) with a piece of \u0060value\u0060 (and at line 110, line 118, line 128) \u2014 and nowhere in \u0060_sanitize_nim_schema_node\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_sanitize_nim_schema_node\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/nvidia_nim/tool_schema.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c8b29a3717ed95435f534b2118b961ddd263569dcd20eeeb78b7e1b5c9351e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply_mistral_history_shape\u0060 is public, takes a document from its caller (line 38) and hands it to \u0060_chunk_text\u0060, which calls itself at line 326 (\u0060_chunk_text\u0060) with a piece of \u0060chunk\u0060 \u2014 and nowhere in \u0060_chunk_text\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_chunk_text\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/reasoning.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3becf0f9b785ec8e065d7961b2bf909155314f08da5ded5648577110b3fe2f43"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060estimate_prepared_input_tokens\u0060 is public, takes a document from its caller (line 90) and hands it to \u0060_json_costs\u0060, which calls itself at line 32 (\u0060_json_costs\u0060) with a piece of \u0060value\u0060 (and at line 34, line 39) \u2014 and nowhere in \u0060_json_costs\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_json_costs\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/lmstudio/tokens.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"345e1f505d1dc97a1ded3ccc2b6bae028316a53de03ba5f20d80af8c7d0d2a43"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060translate_tool_schema_patterns\u0060 is public and takes \u0060schema: Any\u0060 from its caller, and it calls itself at line 44 (\u0060translate_tool_schema_patterns\u0060) with a piece of \u0060schema\u0060 (and at line 60, line 66) \u2014 and nowhere in \u0060translate_tool_schema_patterns\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060translate_tool_schema_patterns\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/tool_schema_patterns.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d01283dd31bd1d410e432c1696f43541dd8d0ffbc8049b0ad03b10f01ba67d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sanitize_trace_value\u0060 is public and takes \u0060obj: Any\u0060 from its caller, and it calls itself at line 65 (\u0060sanitize_trace_value\u0060) with a piece of \u0060obj\u0060 (and at line 68) \u2014 and nowhere in \u0060sanitize_trace_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060sanitize_trace_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/trace.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"197fd2ba5d1ec69357f691993671ed563e827c9afeffe370269c9a71575e5d76"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060restore_tools\u0060 is public and takes \u0060tools: JsonValue\u0060 from its caller, and it calls itself at line 498 (\u0060self.restore_tools\u0060) with a piece of \u0060tools\u0060 \u2014 and nowhere in \u0060restore_tools\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060restore_tools\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5738b75ac7b3eb2d252c56e0e1aff3d89dff3da2541cddf4cf74f92fc4fcd757"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060restore_choice\u0060 is public and takes \u0060value: JsonValue\u0060 from its caller, and it calls itself at line 602 (\u0060self.restore_choice\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060restore_choice\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060restore_choice\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_adaptation.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9bc8bc0614ee15d55a5c43a8425e54574233a81b9e9a132b2fd8c0387cebee"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060normalize_tool_search\u0060 is public, takes a document from its caller (line 165) and hands it to \u0060_explicit_arguments\u0060, which calls itself at line 183 (\u0060_explicit_arguments\u0060) with a piece of \u0060schema\u0060 (and at line 187, line 191) \u2014 and nowhere in \u0060_explicit_arguments\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_explicit_arguments\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/openai_responses/tool_search.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3969f744b0bed028947ff0c9cf6d8a131f2598f5cead05e355e9128be12d0e8"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060section.label\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67928d396ff551d9860934e1dd742e398d24294e055f51e480ebe959cb95b77"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060item.html\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5db6514786d6d9a724eeadd9c6171efeca7df43e1e1e4d35ec2a167276559db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/mistral/reasoning.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fa0cee3a68f496eae9ea7301548fd7c9745b2ddf713042a8e8ee8440cd5b7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/groq/client.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c8d6fff657ef1dde7458cbaa3b100a73a528ad88ec493d56039b6bbd85bb0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/groq/client.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7091b8087c799f2d08af4179e4141cddbf89f84a7e3a637425fba0a2a25da4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/auth.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"751b4e51ae3ad6ac9c4323bfb086bb532a60819474b5c5b712a4013df9c9cc4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/auth.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb05129887c828c9c0026deaefd9c1bc5b5ba08bd94bba20230cb50bd1bac6ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/login.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4072b1f9e5e856ebeb7d146ef421bd6062dc72bab95dd782dfe35780538fe03"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/providers/github_copilot/sdk.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bb86bbede1b0ead6ec336cad7aa9c5449b61e14d202c83d6adb8d28f278ae8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/commands.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b314e87603da6ca44a8deb10200c850cbc590cc4cb52f444192a72cbe6734f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/limiter.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ffa492219ed901e36c37a21c04047b7c144abbd8246bb55ccded53ce87a0fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/workflow.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac1c25cd1a5d466c073892c5a928207b6be6dd65294fc65901e3ad7c4d71e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/renderer.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cdffb88e97a78911ef7749757a2b6326e6bd8d649919699d4d0fdec27b4f7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/transcript/segments.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd05f9c92fc29f324961e20c027e02b4db7b8f660d69f1acf619bc0c35c2becc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/messaging/platforms/telegram_io.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"67269a1fc050422988e06e8075976f06a2a1e6c0f33e83859dc347b2cc07af00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/diagnostics.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d4107939983a3cdc0a73174984aa1393d62d39f4ed30670b772906c3bef2a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/core/diagnostics.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e264b693624b65e9e51596f9c156b7b02f063014804fb55750b6145a50ef1f34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/application/code_sessions/service.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ab45c11a721cb6449f0f7c7d804e8a088fd8be0d042bdb7c274ebb6695d562"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b661577ad2cb1834cbfe04e947654efa667901deff3cc0b60247a82b1c3b90"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c2d460bba5e62400b863c5117bc9669f40429df462d7feb73da63f8d009f5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f336b33cb28f9bde2efb77135db488efa5c95f59b663e54851074300a299605e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"85723a9b5990b6b7d66c7d578a7eefe322ab6821ebcbb02e3d04fc828d17ea48"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6424670a36e84700c94e41712c7e2778b7038a104c0307d7971848457e08004"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/admin.js"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"b268ea9368b6ce7e0ebd2260510f45bc6239e0779c6d8f71ef281adbcb65541d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5937281697c49783cf3b630691f1b46e391a49a1a04ffae844dcdb2b3207a5db"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: This repository commits no tsconfig, so whatever type-checks it uses tsc\u0027s own defaults, in which \u0060strict\u0060 and \u0060strictNullChecks\u0060 are OFF: \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060, and a value that is null is compiled through to the property access that throws. If the build passes \u0060--strict\u0060 on a command line instead, put it in a committed tsconfig \u2014 this check reads configuration, and configuration is all it can read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060saved\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/free_claude_code/api/admin_static/code_sessions.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ac544404c6e969aaca5ea1edf74305867f35625c757041a698d5a4fcedd57d"}}],"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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":30,"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."]}]}